snake_generic.hh 4.67 KB
Newer Older
1
2
// Copyright (C) 2007, 2008, 2009, 2010, 2011 EPITA Research and
// Development Laboratory (LRDE)
3
//
4
// This file is part of Olena.
5
//
6
7
8
9
10
// Olena is free software: you can redistribute it and/or modify it under
// the terms of the GNU General Public License as published by the Free
// Software Foundation, version 2 of the License.
//
// Olena is distributed in the hope that it will be useful,
11
12
13
14
15
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License
16
// along with Olena.  If not, see <http://www.gnu.org/licenses/>.
17
18
//
// As a special exception, you may use this file as part of a free
19
// software project without restriction.  Specifically, if other files
20
// instantiate templates or use macros or inline functions from this
21
22
23
24
25
// file, or you compile this file and link it with other files to produce
// an executable, this file does not by itself cause the resulting
// executable to be covered by the GNU General Public License.  This
// exception does not however invalidate any other reasons why the
// executable file might be covered by the GNU General Public License.
26
27
28
29

#ifndef MLN_CANVAS_BROWSING_SNAKE_GENERIC_HH
# define MLN_CANVAS_BROWSING_SNAKE_GENERIC_HH

30
/// \file
31
32
///
/// Browsing in a snake-way, forward.
33

Guillaume Lazzara's avatar
Guillaume Lazzara committed
34
# include <vector>
35
36
# include <mln/core/concept/browsing.hh>

37

38
39
40
41
42
43
44
45
46
namespace mln
{

  namespace canvas
  {

    namespace browsing
    {

47
      /// Multidimentional Browsing in a given-way.
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
      /*!
       * F shall feature: \n
       * { \n
       *   --- as attributes: \n
       *   input; \n
       *   p; \n
       *   --- as methods: \n
       *   void init(); \n
       *   void *() moves[]; \n
       *   dpsite dps[]; \n
       * } \n
       *
       * init is called before browsing
       *
       * The snake follow dimension using the delta point site of dps.
       *     dps[0] = delta psite following the global dimension (forward)
       *     dps[1] = delta psite following the 2nd dimension to follow (forward).
       *     dps[2] = delta psite following the 2nd dimension to follow (backward).
       *     dps[3] = delta psite following the 3nd dimension to follow (forward).
       *     dps[3] = delta psite following the 3nd dimension to follow (backward).
       *
       * moves contains pointer to f's members. These merbers will be call in each time
       * the snake progress in the correct dimension :
       *
       *      moves[i] is called at each move following the delta psite dps[i]
       *
       */

      struct snake_generic_t : public Browsing< snake_generic_t >
      {

79
80
81
82
        // This default constructor is needed for compilation with gcc
	// 4.6.0, gcc 4.6.1 and Clang.
	snake_generic_t();

83
84
85
	template <typename F>
	void operator()(F& f) const;

86
      };
87

88
      extern const snake_generic_t snake_generic;
89
90
91

# ifndef MLN_INCLUDE_ONLY

92
93
#  ifndef MLN_WO_GLOBAL_VARS

94
95
      const snake_generic_t snake_generic;

96
97
#  endif // ! MLN_WO_GLOBAL_VARS

98
99
100
      snake_generic_t::snake_generic_t()
      {
      }
101

102
103
104
105
106
107
      template <typename F>
      inline
      void
      snake_generic_t::operator()(F& f) const
      {
	trace::entering("canvas::browsing::snake_generic");
108
	mln_precondition(f.input.is_valid());
109
110

	// p init
111
	f.p = f.input.bbox().pmin();// - f.dps[0];
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135

	std::vector< int > directions(f.moves.size(), 0);
	unsigned deph = 0;
	unsigned total_deph = f.moves.size() / 2 + 1;

	// initialization
	f.init();

	bool first = true;
	directions[deph] = 1;
	deph = total_deph - 1;

	// Call the move function (for the first point)
	(f.*(f.moves[(deph - 1) * 2 - 1 + directions[deph - 1]])) ();
	while (deph > 0) // If direction is empty, break
	{
	  mln_assertion(deph <= total_deph);
	  mln_assertion(deph > 0);
	  // If f.p is near the border (we ended a direction) -> next child
	  if (!f.input.domain().has(f.p +
				    f.dps[(deph - 1) * 2 - 1 + directions[deph - 1]]))
	  {
	    // Go up the tree
	    deph--;
136
	    if (deph >= 1)
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
	      // Change directions
	      directions[deph] = directions[deph] == 1 ? 0 : 1;
	    continue;
	  }

	  if (!first)
	  {
	    // Move f.p
	    f.p += f.dps[(deph - 1) * 2 - 1 + directions[deph - 1]];
	    // Call the move function
	    (f.*(f.moves[(deph - 1) * 2 - 1 + directions[deph - 1]])) ();
	  }
	  else
	    first = false;

	  if (deph != total_deph)
	  {
	    // Go down the tree
	    deph++;
	    first = true;
	  }
	}

	trace::exiting("canvas::browsing::snake_generic");
      }

# endif // ! MLN_INCLUDE_ONLY

    } // end of namespace mln::canvas::browsing

  } // end of namespace mln::canvas

} // end of namespace mln


#endif // ! MLN_CANVAS_BROWSING_SNAKE_GENERIC_HH