Repository navigation
Expand file tree
/
Copy pathBoxIterator.hpp
More file actions
143 lines (125 loc) · 3.45 KB
/
Copy pathBoxIterator.hpp
File metadata and controls
143 lines (125 loc) · 3.45 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
#ifndef _BoxTraverser_hpp_
#define _BoxTraverser_hpp_
//@HEADER
// ************************************************************************
//
// miniFE: simple finite-element assembly and linear-solve
// Copyright (2006) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ************************************************************************
//@HEADER
namespace miniFE {
/** Class for traversing a 3-dimensional 'box' of indices.
//One way to traverse a 'box[3][2]' is to use a triply-nested for-loop:
for(int z=box[2][0]; z<box[2][1]; ++z) {
for(int y=box[1][0]; y<box[1][1]; ++y) {
for(int x=box[0][0]; x<box[0][1]; ++x) {
...
}
}
}
//Another way is to use this BoxIterator class, like so:
//BoxIterator iter = BoxIterator::begin(box);
//BoxIterator end = BoxIterator::end(box);
for(; iter != end; ++iter) {
int x = iter.x;
int y = iter.y;
int z = iter.z;
...
}
*/
class BoxIterator {
public:
~BoxIterator(){}
static BoxIterator begin(const Box& box)
{
return BoxIterator(box);
}
static BoxIterator end(const Box& box)
{
return BoxIterator(box, true/*at_end==true*/);
}
BoxIterator& operator=(const BoxIterator& src)
{
box_[0][0] = src.box_[0][0]; box_[0][1] = src.box_[0][1];
box_[1][0] = src.box_[1][0]; box_[1][1] = src.box_[1][1];
box_[2][0] = src.box_[2][0]; box_[2][1] = src.box_[2][1];
x = src.x;
y = src.y;
z = src.z;
return *this;
}
BoxIterator& operator++()
{
++x;
if (x >= box_[0][1]) {
x = box_[0][0];
++y;
if (y >= box_[1][1]) {
y = box_[1][0];
++z;
if (z >= box_[2][1]) {
z = box_[2][1];
y = box_[1][1];
x = box_[0][1];
}
}
}
return *this;
}
BoxIterator operator++(int)
{
BoxIterator temp = *this;
++(*this);
return temp;
}
bool operator==(const BoxIterator& rhs) const
{
return x == rhs.x && y == rhs.y && z == rhs.z;
}
bool operator!=(const BoxIterator& rhs) const
{
return !(this->operator==(rhs));
}
int x;
int y;
int z;
private:
BoxIterator(const Box& box, bool at_end = false)
: x(box[0][0]),
y(box[1][0]),
z(box[2][0]),
box_()
{
box_[0][0] = box[0][0]; box_[0][1] = box[0][1];
box_[1][0] = box[1][0]; box_[1][1] = box[1][1];
box_[2][0] = box[2][0]; box_[2][1] = box[2][1];
if (at_end) {
x = box[0][1];
y = box[1][1];
z = box[2][1];
}
}
Box box_;
};//class BoxTraverser
}//namespace miniFE
#endif