Home
last modified time | relevance | path

Searched refs:neighborsList (Results 1 – 8 of 8) sorted by relevance

/dports/science/cdk/cdk-cdk-2.3/legacy/src/main/java/org/openscience/cdk/smsd/algorithm/vflib/builder/
H A DNodeBuilder.java45 private List<INode> neighborsList; field in NodeBuilder
55 neighborsList = new ArrayList<INode>(); in NodeBuilder()
62 return neighborsList.size(); in countNeighbors()
68 return Collections.unmodifiableList(neighborsList); in neighbors()
92 neighborsList.add(node); in addNeighbor()
/dports/math/pdal/PDAL-2.3.0/filters/private/csf/
H A DRasterization.cpp61 int neiborsize = p->neighborsList.size(); in findHeightValByNeighbor()
65 nqueue.push(p->neighborsList[i]); in findHeightValByNeighbor()
86 int nsize = pneighbor->neighborsList.size(); in findHeightValByNeighbor()
89 Particle *ptmp = pneighbor->neighborsList[i]; in findHeightValByNeighbor()
H A DParticle.cpp35 for (std::size_t i = 0; i < neighborsList.size(); i++) { in satisfyConstraintSelf()
36 Particle *p2 = neighborsList[i]; in satisfyConstraintSelf()
H A DCloth.h102 p1->neighborsList.push_back(p2); in makeConstraint()
103 p2->neighborsList.push_back(p1); in makeConstraint()
H A DParticle.h57 vector<Particle *> neighborsList; variable
/dports/science/avogadrolibs/avogadrolibs-1.94.0/avogadro/core/
H A Dgraph.cpp129 std::vector<size_t>& neighborsList = m_adjacencyList[nbrs[i]]; in removeEdges() local
132 neighborsList.erase( in removeEdges()
133 std::find(neighborsList.begin(), neighborsList.end(), index)); in removeEdges()
/dports/science/py-avogadrolibs/avogadrolibs-1.94.0/avogadro/core/
H A Dgraph.cpp129 std::vector<size_t>& neighborsList = m_adjacencyList[nbrs[i]]; in removeEdges() local
132 neighborsList.erase( in removeEdges()
133 std::find(neighborsList.begin(), neighborsList.end(), index)); in removeEdges()
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Segmentation/DeformableMesh/include/
H A DitkDeformableSimplexMesh3DFilter.hxx211 InputNeighbors * neighborsList = inputMesh->GetNeighbors(pointItr.Index(), m_Rigidity); in Initialize() local
212 auto neighborIt = neighborsList->begin(); in Initialize()
215 while ( neighborIt != neighborsList->end() ) in Initialize()
220 delete neighborsList; in Initialize()