Home
last modified time | relevance | path

Searched refs:neighborCount (Results 1 – 13 of 13) sorted by relevance

/dports/x11/xscreensaver/xscreensaver-5.44/hacks/glx/
H A Dglschool_alg.c264 int neighborCount = 0; in glschool_computeGroupVectors() local
283 neighborCount++; in glschool_computeGroupVectors()
290 if (neighborCount > 0) { in glschool_computeGroupVectors()
291 scaleVector(avgVel, 1.0/neighborCount); in glschool_computeGroupVectors()
292 scaleVector(centroid, 1.0/neighborCount); in glschool_computeGroupVectors()
294 return neighborCount; in glschool_computeGroupVectors()
303 int neighborCount; in glschool_computeAccelerations() local
329 neighborCount = glschool_computeGroupVectors(s, ref, avoidance, centroid, avgVel); in glschool_computeAccelerations()
336 if (neighborCount > 0 && accMag < accLimit) { in glschool_computeAccelerations()
/dports/science/jmol/jmol-14.32.7/src/org/jmol/geodesic/
H A DEnvelopeCalculation.java491 if (neighborCount == 0) in calcConvexBits()
508 for (int j = 0; j < neighborCount; j++) { in calcConvexBits()
538 for (int j = 0; j < neighborCount; j++) { in calcConvexBits()
566 private int neighborCount; field in EnvelopeCalculation
573 neighborCount = 0; in getNeighbors()
583 if (neighborCount == neighborIndices.length) { in getNeighbors()
589 neighborCenters[neighborCount] = atomData.xyz[indexN]; in getNeighbors()
590 neighborIndices[neighborCount] = indexN; in getNeighbors()
592 neighborPlusProbeRadii2[neighborCount] = r * r; in getNeighbors()
593 neighborRadii2[neighborCount] = neighborRadius * neighborRadius; in getNeighbors()
[all …]
/dports/science/cdk/cdk-cdk-2.3/base/core/src/main/java/org/openscience/cdk/config/atomtypes/
H A DOWLAtomTypeHandler.java49 private int neighborCount; field in OWLAtomTypeHandler
96 currentAtomType.setFormalNeighbourCount(neighborCount); in endAtomTypeElement()
105 neighborCount = Integer.parseInt(currentChars); in endAtomTypeElement()
130 neighborCount = 0; in startAtomTypeElement()
137 neighborCount++; in startAtomTypeElement()
/dports/science/jmol/jmol-14.32.7/src/org/jmol/util/
H A DGeodesic.java360 int neighborCount = 0; in quadruple() local
363 ++neighborCount; in quadruple()
364 if ((i < 12 && neighborCount != 5) || in quadruple()
365 (i >= 12 && neighborCount != 6)) in quadruple()
/dports/math/dune-grid/dune-grid-de36e4b4e99da4cd7a120a39779345e701821115/dune/grid/uggrid/
H A Duggridintersections.cc18 const int neighborCount, in computeOuterNormal() argument
29 if (UG_NS<dim>::Corners_Of_Side(center, neighborCount) == 3) { in computeOuterNormal()
32 …* aPos = UG_NS<dim>::Corner(center,UG_NS<dim>::Corner_Of_Side(center, neighborCount, 0))->myvertex… in computeOuterNormal()
33 …* bPos = UG_NS<dim>::Corner(center,UG_NS<dim>::Corner_Of_Side(center, neighborCount, 1))->myvertex… in computeOuterNormal()
34 …* cPos = UG_NS<dim>::Corner(center,UG_NS<dim>::Corner_Of_Side(center, neighborCount, 2))->myvertex… in computeOuterNormal()
55 …e* aPos = UG_NS<dim>::Corner(center,UG_NS<dim>::Corner_Of_Side(center,neighborCount,i))->myvertex-… in computeOuterNormal()
56 …e* bPos = UG_NS<dim>::Corner(center,UG_NS<dim>::Corner_Of_Side(center,neighborCount,(i+1)%4))->myv… in computeOuterNormal()
57 …e* cPos = UG_NS<dim>::Corner(center,UG_NS<dim>::Corner_Of_Side(center,neighborCount,(i+3)%4))->myv… in computeOuterNormal()
87 …const ctype* aPos = UG_NS<dim>::Corner(center,UG_NS<dim>::Corner_Of_Side(center, neighborCount, 0)… in computeOuterNormal()
88 …const ctype* bPos = UG_NS<dim>::Corner(center,UG_NS<dim>::Corner_Of_Side(center, neighborCount, 1)… in computeOuterNormal()
/dports/graphics/vigra/vigra-8acd73a/test/gridgraph/
H A Dtest.cxx106 static const unsigned int neighborCount = 2*N; in testDirectNeighborhood() local
107 shouldEqual(neighborOffsets.size(), neighborCount); in testDirectNeighborhood()
109 shouldEqual(gridGraphMaxDegree(N, DirectNeighborhood), neighborCount); in testDirectNeighborhood()
112 for(unsigned k=0; k<neighborCount; ++k) in testDirectNeighborhood()
116 if(k < neighborCount/2) in testDirectNeighborhood()
155 for(unsigned k=0; k<neighborCount; ++k) in testDirectNeighborhood()
174 static const unsigned int neighborCount = MetaPow<3, N>::value - 1; in testIndirectNeighborhood() local
175 shouldEqual(neighborOffsets.size(), neighborCount); in testIndirectNeighborhood()
179 for(unsigned k=0; k<neighborCount; ++k) in testIndirectNeighborhood()
183 if(k < neighborCount/2) in testIndirectNeighborhood()
[all …]
/dports/science/afni/afni-AFNI_21.3.16/src/
H A D3dedge.c79 float neighborCount(unsigned char *mask, int location, int nxx, int nyy, int nvox) in neighborCount() function
257 if (neighborCount(mask, i, nxx, nyy, nvox) < neighbors) newMask[i]=0; in edgeDetect()
263 if (neighborCount(mask, i, nxx, nyy, nvox) > neighbors) newMask[i]=1; in edgeDetect()
/dports/net/norm/norm-1.5r6/protolib/examples/
H A DgraphRider.cpp540 int neighborCount = 0; in CalculateDensity() local
549 neighborCount++; in CalculateDensity()
551 return ((double)neighborCount)/((double)nodeCount); in CalculateDensity()
H A DgraphExample.cpp725 int neighborCount = 0; in CalculateDensity() local
734 neighborCount++; in CalculateDensity()
736 return ((double)neighborCount)/((double)nodeCount); in CalculateDensity()
H A DgraphXMLExample.cpp805 int neighborCount = 0; in CalculateDensity() local
823 neighborCount+=iface->GetAdjacencyCount(); in CalculateDensity()
831 return ((double)neighborCount)/((double)nodeCount); in CalculateDensity()
/dports/emulators/sameboy/SameBoy-0.14.7/HexFiend/
H A DHFBTree.m572 ChildIndex_t neighborCount = count_node_values(neighbor);
573 ChildIndex_t totalChildren = (childCount + neighborCount);
578 HFASSERT(finalNeighborCount < neighborCount);
586 remove_values_from_array(neighbor->children, amountToTransfer, neighborCount);
591 …add_values_to_array(neighbor->children + neighborCount - amountToTransfer, amountToTransfer, node-…
593 …remove_values_from_array(neighbor->children + neighborCount - amountToTransfer, amountToTransfer, …
/dports/science/cdk/cdk-cdk-2.3/base/core/src/main/java/org/openscience/cdk/atomtype/
H A DCDKAtomTypeMatcher.java771 int neighborCount = connectedBonds.size(); in perceiveNitrogens() local
772 if (neighborCount > 1) { in perceiveNitrogens()
788 int neighborCount = connectedBonds.size(); in perceiveNitrogens() local
789 … if (neighborCount == 4 && IBond.Order.DOUBLE == getMaximumBondOrder(connectedBonds)) { in perceiveNitrogens()
792 … } else if (neighborCount > 1 && bothNeighborsAreSp2(atom, atomContainer, connectedBonds)) { in perceiveNitrogens()
794 if (neighborCount == 3) { in perceiveNitrogens()
803 } else if (neighborCount == 2) { in perceiveNitrogens()
966 int neighborCount = connectedBonds.size(); in perceiveNitrogens() local
967 if (neighborCount > 1) { in perceiveNitrogens()
/dports/math/frobby/frobby-0.9.1/src/
H A DLatticeAlgs.cpp514 const size_t neighborCount = lat.getNeighborCount(); in computePlanes() local
515 for (size_t gen1 = 0; gen1 < neighborCount; ++gen1) { in computePlanes()
516 for (size_t gen2 = gen1 + 1; gen2 < neighborCount; ++gen2) { in computePlanes()