63 |
} |
} |
64 |
|
|
65 |
|
|
66 |
MeshOfHexahedra::iterator MeshOfHexahedra::find(const double& x, |
MeshOfHexahedra::const_iterator MeshOfHexahedra::find(const double& x, |
67 |
const double& y, |
const double& y, |
68 |
const double& z) |
const double& z) const |
69 |
{ |
{ |
70 |
TinyVector<3,real_t> X(x,y,z); |
TinyVector<3,real_t> X(x,y,z); |
71 |
Octree<size_t>::iterator i = (*__octree).fuzzySearch(X); |
Octree<size_t>::iterator i = (*__octree).fuzzySearch(X); |
75 |
|
|
76 |
bool found=false; |
bool found=false; |
77 |
|
|
78 |
std::set<MeshOfHexahedra::iterator> visited; |
std::set<MeshOfHexahedra::const_iterator> visited; |
79 |
std::set<MeshOfHexahedra::iterator> toVisitSet; |
std::set<MeshOfHexahedra::const_iterator> toVisitSet; |
80 |
std::stack<MeshOfHexahedra::iterator> toVisitStack; |
std::stack<MeshOfHexahedra::const_iterator> toVisitStack; |
81 |
|
|
82 |
toVisitSet.insert(h0); |
toVisitSet.insert(h0); |
83 |
toVisitStack.push(h0); |
toVisitStack.push(h0); |
84 |
Hexahedron* h; |
const Hexahedron* h; |
85 |
size_t numberOfCell = 1; |
size_t numberOfCell = 1; |
86 |
do { |
do { |
87 |
fferr(0) << "Visiting cell n°" << numberOfCell++ << '\n'; |
fferr(0) << "Visiting cell n°" << numberOfCell++ << '\n'; |