| /dports/lang/intel-compute-runtime/compute-runtime-21.52.22081/shared/test/unit_test/utilities/ |
| H A D | containers_tests_helpers.h | 23 int verifySequence(const NodeObjectType *base, int nodeNum, const NodeObjectType *last) { in verifySequence()
32 int verifySequence(const NodeObjectType *base, int nodeNum, const NodeObjectType *current, const Re… in verifySequence()
|
| /dports/games/dhewm3/dhewm3-1.5.1/neo/tools/compilers/aas/ |
| H A D | AASFile_sample.cpp | 202 int nodeNum; in PointAreaNum() local
290 int idAASFileLocal::BoundsReachableAreaNum_r( int nodeNum, const idBounds &bounds, const int areaFl… in BoundsReachableAreaNum_r()
370 int nodeNum; member
374 int side, nodeNum, tmpPlaneNum; in Trace() local
576 void idAASFileLocal::MaxTreeDepth_r( int nodeNum, int &depth, int &maxDepth ) const { in MaxTreeDepth_r()
|
| /dports/math/ogdf/OGDF/include/ogdf/energybased/davidson_harel/ |
| H A D | NodePairEnergy.h | 61 int nodeNum(node v) const { return (*m_nodeNums)[v]; } in nodeNum() function
|
| /dports/net/ns3/ns-allinone-3.35/ns-3.35/src/mobility/examples/ |
| H A D | ns2-mobility-trace.cc | 79 int nodeNum; in main() local
|
| /dports/games/gtkradiant/GPL/GtkRadiant/tools/quake3/q3map2/ |
| H A D | light_trace.c | 365 int i, nodeNum, bspLeafNum; in SetupTraceNodes_r() local
531 static int FilterPointToTraceNodes_r( vec3_t pt, int nodeNum ) in FilterPointToTraceNodes_r()
564 static void FilterTraceWindingIntoNodes_r( traceWinding_t *tw, int nodeNum ) in FilterTraceWindingIntoNodes_r()
642 static void SubdivideTraceNode_r( int nodeNum, int depth ) in SubdivideTraceNode_r()
821 static int TriangulateTraceNode_r( int nodeNum ) in TriangulateTraceNode_r()
915 int i, j, x, y, pw[ 5 ], r, nodeNum; in PopulateWithBSPModel() local
1586 static qboolean TraceLine_r( int nodeNum, vec3_t origin, vec3_t end, trace_t *trace ) in TraceLine_r()
|
| /dports/textproc/sigil/Sigil-1.8.0/src/Query/ |
| H A D | CSelection.cpp | 93 size_t CSelection::nodeNum() in nodeNum() function in CSelection
|
| /dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/3d-viewer/3d_rendering/raytracing/accelerators/ |
| H A D | bvh_packet_traversal.cpp | 101 int todoOffset = 0, nodeNum = 0; in Intersect() local
213 int todoOffset = 0, nodeNum = 0; in Intersect() local
|
| /dports/games/netradiant/netradiant-20150621-src/tools/quake3/q3map2/ |
| H A D | light_trace.c | 363 int i, nodeNum, bspLeafNum, newNode; in SetupTraceNodes_r() local
550 static void FilterTraceWindingIntoNodes_r( traceWinding_t *tw, int nodeNum ){ in FilterTraceWindingIntoNodes_r()
628 static void SubdivideTraceNode_r( int nodeNum, int depth ){ in SubdivideTraceNode_r()
805 static int TriangulateTraceNode_r( int nodeNum ){ in TriangulateTraceNode_r()
898 int i, j, x, y, pw[ 5 ], r, nodeNum; in PopulateWithBSPModel() local
1623 static qboolean TraceLine_r( int nodeNum, vec3_t origin, vec3_t end, trace_t *trace ){ in TraceLine_r()
|
| /dports/biology/iqtree/IQ-TREE-2.0.6/tree/ |
| H A D | mtree.h | 828 int nodeNum; variable
|
| /dports/java/berkeley-db/je-6.2.31/test/com/sleepycat/je/rep/elections/ |
| H A D | ElectionsTest.java | 149 final short nodeNum, in newRepNode()
|
| /dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/finiteElements/ |
| H A D | RefDof.cpp | 37 …, DofLocalization w, number_t supNum, number_t ind, dimen_t e_dim, dimen_t s_dim, number_t nodeNum, in RefDof()
|
| /dports/math/alps/CHiPPS-ALPS-releases-2.0.1/Alps/src/ |
| H A D | AlpsSubTree.cpp | 386 const int nodeNum = nodePool_->getNumKnowledges(); in calculateQuality() local
978 int i = -1, nodeNum = 0; in encode() local
1028 int nodeNum = 0; in decode() local
|
| /dports/cad/openroad/OpenROAD-2.0/src/rcx/src/ |
| H A D | hierSpef.cpp | 290 uint nodeNum, uint* capNodeMap, in createParentCapNode()
369 uint nodeNum = maxCap++; in createCapNodes() local
510 uint nodeNum = maxCap++; in createCCsegs() local
|
| /dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/ |
| H A D | full_graph.h | 60 int nodeNum() const { return _node_num; } in nodeNum() function
230 int nodeNum() const { return Parent::nodeNum(); } in nodeNum() function
320 int nodeNum() const { return _node_num; } in nodeNum() function
616 int nodeNum() const { return Parent::nodeNum(); } in nodeNum() function
729 int nodeNum() const { return _node_num; } in nodeNum() function
1067 int nodeNum() const { return Parent::nodeNum(); } in nodeNum() function
|
| H A D | static_graph.h | 106 int nodeNum() const { return node_num; } in nodeNum() function
337 int nodeNum() const { return node_num; } in nodeNum() function
|
| H A D | hypercube_graph.h | 62 int nodeNum() const { return _node_num; } in nodeNum() function
373 int nodeNum() const { return Parent::nodeNum(); } in nodeNum() function
|
| H A D | dimacs.h | 53 int nodeNum; member
|
| /dports/math/lemon/lemon-1.3.1/lemon/ |
| H A D | full_graph.h | 60 int nodeNum() const { return _node_num; } in nodeNum() function
230 int nodeNum() const { return Parent::nodeNum(); } in nodeNum() function
320 int nodeNum() const { return _node_num; } in nodeNum() function
616 int nodeNum() const { return Parent::nodeNum(); } in nodeNum() function
729 int nodeNum() const { return _node_num; } in nodeNum() function
1067 int nodeNum() const { return Parent::nodeNum(); } in nodeNum() function
|
| H A D | static_graph.h | 106 int nodeNum() const { return node_num; } in nodeNum() function
337 int nodeNum() const { return node_num; } in nodeNum() function
|
| H A D | hypercube_graph.h | 62 int nodeNum() const { return _node_num; } in nodeNum() function
373 int nodeNum() const { return Parent::nodeNum(); } in nodeNum() function
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/ |
| H A D | full_graph.h | 60 int nodeNum() const { return _node_num; } in nodeNum() function
230 int nodeNum() const { return Parent::nodeNum(); } in nodeNum() function
320 int nodeNum() const { return _node_num; } in nodeNum() function
616 int nodeNum() const { return Parent::nodeNum(); } in nodeNum() function
729 int nodeNum() const { return _node_num; } in nodeNum() function
1067 int nodeNum() const { return Parent::nodeNum(); } in nodeNum() function
|
| H A D | static_graph.h | 106 int nodeNum() const { return node_num; } in nodeNum() function
337 int nodeNum() const { return node_num; } in nodeNum() function
|
| H A D | hypercube_graph.h | 62 int nodeNum() const { return _node_num; } in nodeNum() function
373 int nodeNum() const { return Parent::nodeNum(); } in nodeNum() function
|
| /dports/math/ogdf/OGDF/src/ogdf/clique/ |
| H A D | CliqueFinderModule.cpp | 101 int nodeNum = m_pGraph->numberOfNodes(); in handleTrivialCases() local
|
| /dports/net/ns3/ns-allinone-3.35/ns-3.35/src/brite/helper/ |
| H A D | brite-topology-helper.cc | 277 BriteTopologyHelper::GetNodeForAs (uint32_t asNum, uint32_t nodeNum) in GetNodeForAs()
|