| /dports/math/eigen3/eigen-3.3.9/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|
| /dports/math/stanmath/math-4.2.0/lib/eigen_3.3.9/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|
| /dports/math/R-cran-RcppEigen/RcppEigen/inst/include/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|
| /dports/devel/upp/upp/uppsrc/plugin/Eigen/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|
| /dports/math/libmesh/libmesh-1.6.2/contrib/eigen/3.2.9/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|
| /dports/math/libsemigroups/libsemigroups-1.3.7/extern/eigen-3.3.7/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|
| /dports/science/pcmsolver/pcmsolver-1.3.0/external/eigen3/include/eigen3/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|
| /dports/graphics/wdune/wdune-1.926/vcglib/eigenlib/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|
| /dports/misc/opennn/opennn-5.0.5/eigen/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/eigen/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|
| /dports/devel/taskflow/taskflow-3.2.0/3rd-party/eigen-3.3.7/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/eigen_3.3.3/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/eigen3/include/eigen3/unsupported/Eigen/src/BVH/ |
| H A D | BVAlgorithms.h | 107 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVIntersect() local
123 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
124 Helper1 helper(*oCur2, intersector); in BVIntersect()
137 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVIntersect()
138 if(intersector.intersectObjectObject(*oBegin1, *oCur2)) in BVIntersect()
251 ObjIter2 oBegin2 = ObjIter2(), oEnd2 = ObjIter2(), oCur2 = ObjIter2(); in BVMinimize() local
263 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
264 minimum = (std::min)(minimum, minimizer.minimumOnObjectObject(*oBegin1, *oCur2)); in BVMinimize()
276 for(oCur2 = oBegin2; oCur2 != oEnd2; ++oCur2) {//go through child objects of second tree in BVMinimize()
277 Helper1 helper(*oCur2, minimizer); in BVMinimize()
|