| /dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/lib/hotint/HotInt_V1/ElementsLib/modal_reduction/ |
| H A D | referenceframe3D.h | 101 …ReferenceFrame3D(MBS* mbsi):RIGID(mbsi), nodes(), searchtree(), FFRFelements(), isACRS(0), resortc… in ReferenceFrame3D()
105 …ReferenceFrame3D(const ReferenceFrame3D& e):RIGID(e.mbs), nodes(), searchtree(), isACRS(0), resort… in ReferenceFrame3D()
109 const Vector3D& sizei, const Vector3D& coli):RIGID(mbsi), nodes(), FFRFelements(), searchtree() in ReferenceFrame3D()
155 searchtree = ce.searchtree; in CopyFrom()
177 …searchtree = SearchTree(ix, iy, iz, Box3D(size1, size2)); //define number of cubes and maximum siz… in InitializeSearchtree()
261 SearchTree searchtree; //for optimized node fill variable
|
| H A D | referenceframe2D.h | 33 ReferenceFrame2D(MBS* mbsi):Body2D(mbsi), nodes(), searchtree(), isACRS(0), resortconstraint(0) in ReferenceFrame2D()
36 …ReferenceFrame2D(const ReferenceFrame2D& e):Body2D(e.mbs), nodes(), searchtree(), isACRS(0), resor… in ReferenceFrame2D()
40 const Vector3D& sizei, const Vector3D& coli):Body2D(mbsi), nodes(), FFRFelements(), searchtree() in ReferenceFrame2D()
77 searchtree = ce.searchtree; in CopyFrom()
103 …searchtree = SearchTree(ix, iy, iz, Box3D(size1, size2)); //define number of cubes and maximum siz… in InitializeSearchtree()
372 SearchTree searchtree; //for optimized node fill variable
|
| H A D | referenceframe2D.cpp | 104 searchtree.GetItemsInBox(box,items); in AddNode()
114 searchtree.AddItem(Box3D(n->Pos(),n->Pos()), index); in AddNode()
137 searchtree.GetItemsInBox(box,items); in GetNode()
|
| H A D | referenceframe3D.cpp | 175 searchtree.GetItemsInBox(box,items); in AddNode()
183 searchtree.AddItem(Box3D(n->Pos(),n->Pos()), index); in AddNode()
209 searchtree.GetItemsInBox(box,items); in GetNode()
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/Netgen/libsrc/geom2d/ |
| H A D | genmesh2d.cpp | 18 Mesh & mesh, Point3dTree & searchtree, int segnr) in Partition() argument
68 searchtree.GetIntersecting (oldmark3 - v, oldmark3 + v, locsearch); in Partition()
75 searchtree.GetIntersecting (mark3 - v, mark3 + v, locsearch); in Partition()
97 searchtree.Insert (oldmark3, pi1); in Partition()
102 searchtree.Insert (mark3, pi2); in Partition()
149 Point3dTree searchtree (pmin, pmax); in PartitionBoundary() local
169 Partition(GetSpline(i), minimum, elto0, mesh2d, searchtree, i+1); in PartitionBoundary()
172 Partition(GetSpline(i), maximum, elto0, mesh2d, searchtree, i+1); in PartitionBoundary()
175 Partition(GetSpline(i), h, elto0, mesh2d, searchtree, i+1); in PartitionBoundary()
179 CopyEdgeMesh (GetSpline(i).copyfrom, i+1, mesh2d, searchtree); in PartitionBoundary()
[all …]
|
| /dports/cad/netgen/netgen-6.2.2105/libsrc/stlgeom/ |
| H A D | stltool.cpp | 630 searchtree = NULL; in STLChart()
635 delete searchtree; in ~STLChart()
666 searchtree->Insert (box, i); in AddChartTrig()
689 {searchtree->Insert (pmin, pmax, i);} in AddOuterTrig()
703 if (searchtree) in GetTrianglesInBox()
780 searchtree->Insert (pmin, pmax, i); in DelChartTrigs()
1104 if(!searchtree) in AddTriangle()
1116 if (searchtree) in AddTriangle()
1122 if (searchtree) in AddTriangle()
1336 searchtree = nullptr; in DeleteSearchTree()
[all …]
|
| /dports/astro/astrometry/astrometry.net-0.85/include/astrometry/ |
| H A D | dualtree.h | 29 typedef anbool (*decision_function)(void* extra, kdtree_t* searchtree, int searchnode,
32 typedef void (*result_function)(void* extra, kdtree_t* searchtree, int searchnode,
|
| /dports/astro/stellarsolver/stellarsolver-1.8/stellarsolver/astrometry/include/astrometry/ |
| H A D | dualtree.h | 29 typedef anbool (*decision_function)(void* extra, kdtree_t* searchtree, int searchnode,
32 typedef void (*result_function)(void* extra, kdtree_t* searchtree, int searchnode,
|
| /dports/cad/netgen/netgen-6.2.2105/libsrc/geom2d/ |
| H A D | genmesh2d.cpp | 111 Mesh & mesh, Point3dTree & searchtree, int segnr) in Partition() argument
149 searchtree.GetIntersecting (oldmark3 - v, oldmark3 + v, locsearch); in Partition()
155 searchtree.GetIntersecting (mark3 - v, mark3 + v, locsearch); in Partition()
163 searchtree.Insert (oldmark3, pi1); in Partition()
168 searchtree.Insert (mark3, pi2); in Partition()
215 Point3dTree searchtree (pmin, pmax); in PartitionBoundary() local
283 searchtree.Insert (newp, npi); in PartitionBoundary()
304 searchtree.Insert (newp, npi); in PartitionBoundary()
325 Partition(GetSpline(i), mp, useh, elto0, mesh2d, searchtree, i+1); in PartitionBoundary()
329 CopyEdgeMesh (GetSpline(i).copyfrom, i+1, mesh2d, searchtree); in PartitionBoundary()
[all …]
|
| /dports/science/elmerfem/elmerfem-release-9.0/ElmerGUI/netgen/libsrc/geom2d/ |
| H A D | splinegeometry2.cpp | 238 Point3dTree searchtree (pmin, pmax); in PartitionBoundary() local
242 splines[i]->Partition(h, elto0, mesh2d, searchtree, i+1); in PartitionBoundary()
244 CopyEdgeMesh (splines[i]->copyfrom, i+1, mesh2d, searchtree); in PartitionBoundary()
248 void SplineGeometry2d :: CopyEdgeMesh (int from, int to, Mesh & mesh, Point3dTree & searchtree) in CopyEdgeMesh() argument
294 searchtree.Insert (newp3, npi); in CopyEdgeMesh()
|
| H A D | spline2d.cpp | 48 Mesh & mesh, Point3dTree & searchtree, int segnr) const in Partition() argument
94 searchtree.GetIntersecting (oldmark3 - v, oldmark3 + v, locsearch); in Partition()
97 searchtree.GetIntersecting (mark3 - v, mark3 + v, locsearch); in Partition()
115 searchtree.Insert (oldmark3, pi1); in Partition()
120 searchtree.Insert (mark3, pi2); in Partition()
|
| H A D | splinegeometry.cpp | 991 Point3dTree searchtree (pmin, pmax); in PartitionBoundary() local
1003 splines[i]->Partition(minimum, elto0, mesh2d, searchtree, i+1); in PartitionBoundary()
1005 splines[i]->Partition(maximum, elto0, mesh2d, searchtree, i+1); in PartitionBoundary()
1007 splines[i]->Partition(h, elto0, mesh2d, searchtree, i+1); in PartitionBoundary()
1011 CopyEdgeMesh (splines[i]->copyfrom, i+1, mesh2d, searchtree); in PartitionBoundary()
1017 void SplineGeometry<D> :: CopyEdgeMesh (int from, int to, Mesh & mesh, Point3dTree & searchtree) in CopyEdgeMesh() argument
1068 searchtree.Insert (newp3, npi); in CopyEdgeMesh()
|
| H A D | spline.hpp | 73 Mesh & mesh, Point3dTree & searchtree, int segnr) const;
298 Mesh & mesh, Point3dTree & searchtree, int segnr) const in Partition() argument
344 searchtree.GetIntersecting (oldmark3 - v, oldmark3 + v, locsearch); in Partition()
347 searchtree.GetIntersecting (mark3 - v, mark3 + v, locsearch); in Partition()
365 searchtree.Insert (oldmark3, pi1); in Partition()
370 searchtree.Insert (mark3, pi2); in Partition()
|
| /dports/devel/codeblocks/codeblocks-20.03/src/plugins/codecompletion/ |
| H A D | Makefile.am | 47 parser/searchtree.cpp \
74 parser/searchtree.h \
|
| H A D | Makefile.in | 152 parser/tokentree.lo parser/searchtree.lo parser/expression.lo
193 parser/$(DEPDIR)/searchtree.Plo parser/$(DEPDIR)/token.Plo \
576 parser/searchtree.cpp \
603 parser/searchtree.h \
705 parser/searchtree.lo: parser/$(am__dirstamp) \
743 @AMDEP_TRUE@@am__include@ @am__quote@parser/$(DEPDIR)/searchtree.Plo@am__quote@ # am--include-marker
1010 -rm -f parser/$(DEPDIR)/searchtree.Plo
1081 -rm -f parser/$(DEPDIR)/searchtree.Plo
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/Netgen/libsrc/stlgeom/ |
| H A D | stltool.cpp | 647 searchtree = new Box3dTree (geometry->GetBoundingBox().PMin() - Vec3d(1,1,1), in STLChart()
650 searchtree = NULL; in STLChart()
669 {searchtree->Insert (pmin, pmax, i);} in AddChartTrig()
688 {searchtree->Insert (pmin, pmax, i);} in AddOuterTrig()
711 if (searchtree) in GetTrianglesInBox()
712 searchtree -> GetIntersecting (pmin, pmax, trias); in GetTrianglesInBox()
784 searchtree = new Box3dTree (geometry->GetBoundingBox().PMin() - Vec3d(1,1,1), in DelChartTrigs()
800 searchtree->Insert (pmin, pmax, i); in DelChartTrigs()
|
| /dports/science/elmerfem/elmerfem-release-9.0/ElmerGUI/netgen/libsrc/stlgeom/ |
| H A D | stltool.cpp | 649 searchtree = new Box3dTree (geometry->GetBoundingBox().PMin() - Vec3d(1,1,1), in STLChart()
652 searchtree = NULL; in STLChart()
671 {searchtree->Insert (pmin, pmax, i);} in AddChartTrig()
690 {searchtree->Insert (pmin, pmax, i);} in AddOuterTrig()
713 if (searchtree) in GetTrianglesInBox()
714 searchtree -> GetIntersecting (pmin, pmax, trias); in GetTrianglesInBox()
786 searchtree = new Box3dTree (geometry->GetBoundingBox().PMin() - Vec3d(1,1,1), in DelChartTrigs()
802 searchtree->Insert (pmin, pmax, i); in DelChartTrigs()
|
| /dports/astro/astrometry/astrometry.net-0.85/libkd/ |
| H A D | dualtree_nearestneighbour.c | 31 static anbool rs_within_range(void* params, kdtree_t* searchtree, int searchnode,
33 static void rs_handle_result(void* extra, kdtree_t* searchtree, int searchnode,
|
| H A D | dualtree_rangesearch.c | 43 static anbool rs_within_range(void* params, kdtree_t* searchtree, int searchnode,
45 static void rs_handle_result(void* extra, kdtree_t* searchtree, int searchnode,
|
| /dports/astro/stellarsolver/stellarsolver-1.8/stellarsolver/astrometry/libkd/ |
| H A D | dualtree_nearestneighbour.c | 31 static anbool rs_within_range(void* params, kdtree_t* searchtree, int searchnode,
33 static void rs_handle_result(void* extra, kdtree_t* searchtree, int searchnode,
|
| H A D | dualtree_rangesearch.c | 43 static anbool rs_within_range(void* params, kdtree_t* searchtree, int searchnode,
45 static void rs_handle_result(void* extra, kdtree_t* searchtree, int searchnode,
|
| /dports/print/texlive-base/texlive-20150521-source/utils/asymptote/doc/ |
| H A D | binarytreetest.asy | 8 binarytree st=searchtree(10,5,2,1,3,4,7,6,8,9,15,13,12,11,14,17,16,18,19);
|
| /dports/math/asymptote/asymptote-2.67/doc/ |
| H A D | binarytreetest.asy | 8 binarytree st=searchtree(10,5,2,1,3,4,7,6,8,9,15,13,12,11,14,17,16,18,19);
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/Netgen/libsrc/csg/ |
| H A D | edgeflw.hpp | 40 Point3dTree * searchtree; member in netgen::EdgeCalculation
|
| /dports/science/elmerfem/elmerfem-release-9.0/ElmerGUI/netgen/libsrc/csg/ |
| H A D | edgeflw.hpp | 35 Point3dTree * searchtree; member in EdgeCalculation
|