/dports/games/bzflag-server/bzflag-2.4.22/src/obstacle/ |
H A D | TeleporterSceneNodeGenerator.cxx | 65 GLfloat tEdge[3]; in getNextNode() local 103 tEdge[2] = b; in getNextNode() 125 tEdge[2] = b; in getNextNode() 136 tEdge[2] = b; in getNextNode() 158 tEdge[2] = b; in getNextNode() 283 GLfloat tEdge[3]; in getNextNode() local 336 tEdge[2] = z; in getNextNode() 347 tEdge[2] = z; in getNextNode() 358 tEdge[2] = z; in getNextNode() 369 tEdge[2] = z; in getNextNode() [all …]
|
H A D | WallSceneNodeGenerator.cxx | 42 GLfloat tEdge[3]; in getNextNode() local 56 tEdge[0] = 0.0f; in getNextNode() 57 tEdge[1] = 0.0f; in getNextNode() 58 tEdge[2] = wall->getHeight(); in getNextNode() 61 return new QuadWallSceneNode(base, sEdge, tEdge, uRepeats, vRepeats, lod); in getNextNode()
|
H A D | PyramidSceneNodeGenerator.cxx | 123 GLfloat tEdge[3]; in getNextNode() local 127 tEdge[0] = tCorner[0] - base[0]; in getNextNode() 128 tEdge[1] = tCorner[1] - base[1]; in getNextNode() 129 tEdge[2] = tCorner[2] - base[2]; in getNextNode() 132 return new TriWallSceneNode(base, sEdge, tEdge, uRepeats, vRepeats, lod); in getNextNode() 134 return new QuadWallSceneNode(base, sEdge, tEdge, uRepeats, vRepeats, lod); in getNextNode()
|
H A D | BoxSceneNodeGenerator.cxx | 80 GLfloat tEdge[3]; in getNextNode() local 84 tEdge[0] = tCorner[0] - base[0]; in getNextNode() 85 tEdge[1] = tCorner[1] - base[1]; in getNextNode() 86 tEdge[2] = tCorner[2] - base[2]; in getNextNode() 87 return new QuadWallSceneNode(base, sEdge, tEdge, uRepeats, vRepeats, lod); in getNextNode()
|
H A D | BaseSceneNodeGenerator.cxx | 116 GLfloat tEdge[3]; in getNextNode() local 120 tEdge[0] = tCorner[0] - bPoint[0]; in getNextNode() 121 tEdge[1] = tCorner[1] - bPoint[1]; in getNextNode() 122 tEdge[2] = tCorner[2] - bPoint[2]; in getNextNode() 124 …WallSceneNode *retval = new QuadWallSceneNode(bPoint, sEdge, tEdge, uRepeats, vRepeats, lod, fixed… in getNextNode()
|
/dports/games/bzflag/bzflag-2.4.22/src/obstacle/ |
H A D | TeleporterSceneNodeGenerator.cxx | 65 GLfloat tEdge[3]; in getNextNode() local 103 tEdge[2] = b; in getNextNode() 125 tEdge[2] = b; in getNextNode() 136 tEdge[2] = b; in getNextNode() 158 tEdge[2] = b; in getNextNode() 283 GLfloat tEdge[3]; in getNextNode() local 336 tEdge[2] = z; in getNextNode() 347 tEdge[2] = z; in getNextNode() 358 tEdge[2] = z; in getNextNode() 369 tEdge[2] = z; in getNextNode() [all …]
|
H A D | WallSceneNodeGenerator.cxx | 42 GLfloat tEdge[3]; in getNextNode() local 56 tEdge[0] = 0.0f; in getNextNode() 57 tEdge[1] = 0.0f; in getNextNode() 58 tEdge[2] = wall->getHeight(); in getNextNode() 61 return new QuadWallSceneNode(base, sEdge, tEdge, uRepeats, vRepeats, lod); in getNextNode()
|
H A D | PyramidSceneNodeGenerator.cxx | 123 GLfloat tEdge[3]; in getNextNode() local 127 tEdge[0] = tCorner[0] - base[0]; in getNextNode() 128 tEdge[1] = tCorner[1] - base[1]; in getNextNode() 129 tEdge[2] = tCorner[2] - base[2]; in getNextNode() 132 return new TriWallSceneNode(base, sEdge, tEdge, uRepeats, vRepeats, lod); in getNextNode() 134 return new QuadWallSceneNode(base, sEdge, tEdge, uRepeats, vRepeats, lod); in getNextNode()
|
H A D | BoxSceneNodeGenerator.cxx | 80 GLfloat tEdge[3]; in getNextNode() local 84 tEdge[0] = tCorner[0] - base[0]; in getNextNode() 85 tEdge[1] = tCorner[1] - base[1]; in getNextNode() 86 tEdge[2] = tCorner[2] - base[2]; in getNextNode() 87 return new QuadWallSceneNode(base, sEdge, tEdge, uRepeats, vRepeats, lod); in getNextNode()
|
H A D | BaseSceneNodeGenerator.cxx | 116 GLfloat tEdge[3]; in getNextNode() local 120 tEdge[0] = tCorner[0] - bPoint[0]; in getNextNode() 121 tEdge[1] = tCorner[1] - bPoint[1]; in getNextNode() 122 tEdge[2] = tCorner[2] - bPoint[2]; in getNextNode() 124 …WallSceneNode *retval = new QuadWallSceneNode(bPoint, sEdge, tEdge, uRepeats, vRepeats, lod, fixed… in getNextNode()
|
/dports/net-mgmt/libsmi/libsmi-0.4.8/tools/ |
H A D | dump-cm.c | 226 tEdge; in diaPrintXMLRelatedScalars() 227 tEdge = graphGetNextEdgeByNode(graph, tEdge, node)) { in diaPrintXMLRelatedScalars() 270 tEdge; in diaPrintAugmentIndex() 271 tEdge = graphGetNextEdgeByNode(graph, tEdge, tNode)) { in diaPrintAugmentIndex() 593 scon = getConPoint(tEdge->startNode, tEdge->endNode); in diaPrintXMLCoordinates() 594 econ = getConPoint(tEdge->endNode, tEdge->startNode); in diaPrintXMLCoordinates() 962 tEdge; in diaCalcSize() 963 tEdge = graphGetNextEdgeByNode(graph, tEdge, node)) { in diaCalcSize() 1007 tEdge; in diaPrintNode() 1008 tEdge = graphGetNextEdgeByNode(graph, tEdge, node)) { in diaPrintNode() [all …]
|
H A D | rea.c | 271 for (tEdge = graph->edges; tEdge; tEdge = tEdge->nextPtr) { in graphInsertEdge() 306 tEdge = tEdge->nextPtr; in graphExit() 337 for (tEdge = graph->edges; tEdge; tEdge = tEdge->nextPtr) { in graphGetFirstEdgeByNode() 344 return tEdge; in graphGetFirstEdgeByNode() 363 for (tEdge = graph->edges; tEdge; tEdge = tEdge->nextPtr) { in graphGetNextEdgeByNode() 373 for (tEdge = tEdge->nextPtr; tEdge; tEdge = tEdge->nextPtr) { in graphGetNextEdgeByNode() 398 for (tEdge = graph->edges; tEdge; tEdge = tEdge->nextPtr) { in graphCheckForRedundantEdge() 476 for (tEdge = graph->edges; tEdge; tEdge = tEdge->nextPtr) { in graphShowEdges() 1313 for (tEdge = graph->edges; tEdge; tEdge = tEdge->nextPtr) { in algCheckLinksByName() 1627 for (tEdge = graph->edges; tEdge; tEdge = tEdge->nextPtr) { in createDependencies() [all …]
|
H A D | dump-svg.c | 417 tEdge; in printSVGRelatedScalars() 467 tEdge; in printSVGAugmentIndex() 809 tEdge->dia.endX = tEdge->endNode->dia.x + tEdge->endNode->dia.w/2; in calculateIntersectionPoints() 811 tEdge->dia.endX = tEdge->endNode->dia.x - tEdge->endNode->dia.w/2; in calculateIntersectionPoints() 814 tEdge->dia.endY = tEdge->endNode->dia.y + in calculateIntersectionPoints() 817 tEdge->dia.endY = tEdge->endNode->dia.y - in calculateIntersectionPoints() 823 tEdge->dia.endY = tEdge->endNode->dia.y + tEdge->endNode->dia.h/2; in calculateIntersectionPoints() 825 tEdge->dia.endY = tEdge->endNode->dia.y - tEdge->endNode->dia.h/2; in calculateIntersectionPoints() 2918 for (tEdge = graph->edges; tEdge; tEdge = tEdge->nextPtr) { in addNodeToComponent() 3017 for (tEdge = graph->edges; tEdge; tEdge = tEdge->nextPtr) { in printSVG() [all …]
|
/dports/devel/indi/indi-1.9.1/libs/indibase/alignment/ |
H A D | ConvexHull.h | 122 typedef tsEdge *tEdge; typedef 131 tEdge duplicate; // pointer to incident cone edge (or NULL) 143 tEdge next, prev; 150 tEdge edge[3]; 165 tEdge edges; 268 void MakeCcw(tFace f, tEdge e, tVertex p); 274 tFace MakeConeFace(tEdge e, tVertex p); 288 tEdge MakeNullEdge();
|
H A D | ConvexHull.cpp | 52 tEdge e, temp; in AddOne() 105 tEdge e; in CheckEndpts() 160 tEdge e; in Checks() 264 tEdge e; in CleanVertices() 319 tEdge e; in Consistency() 464 tEdge newEdge; in EdgeOrderOnFaces() 534 tEdge new_edge[2]; in MakeConeFace() 573 tEdge e0, e1, e2; in MakeFace() 628 tEdge e; in MakeNullEdge() 670 tEdge e; in Print() [all …]
|
/dports/databases/grass7/grass-7.8.6/vector/v.hull/ |
H A D | chull.c | 42 typedef tsEdge *tEdge; typedef 63 tEdge next, prev; 68 tEdge edge[3]; 82 tEdge edges = NULL; 95 tEdge MakeNullEdge(void); 433 tEdge e, temp; in AddOne() 515 tEdge new_edge[2]; in MakeConeFace() 589 tEdge MakeNullEdge(void) in MakeNullEdge() 591 tEdge e; in MakeNullEdge() 628 tEdge e0, e1, e2; in MakeFace() [all …]
|
/dports/devel/boost-docs/boost_1_72_0/libs/graph/test/ |
H A D | max_flow_test.cpp | 73 typedef graph_traits<Graph>::edge_descriptor tEdge; in test_main() typedef 108 std::list<tEdge> edges_copy; in test_main() 111 std::copy(ei, e_end, std::back_insert_iterator< std::list<tEdge> >(edges_copy)); in test_main() 113 tEdge old_edge=edges_copy.front(); in test_main() 118 tEdge new_edge; in test_main()
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/ |
H A D | max_flow_test.cpp | 73 typedef graph_traits<Graph>::edge_descriptor tEdge; in test_main() typedef 108 std::list<tEdge> edges_copy; in test_main() 111 std::copy(ei, e_end, std::back_insert_iterator< std::list<tEdge> >(edges_copy)); in test_main() 113 tEdge old_edge=edges_copy.front(); in test_main() 118 tEdge new_edge; in test_main()
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/ |
H A D | max_flow_test.cpp | 73 typedef graph_traits<Graph>::edge_descriptor tEdge; in test_main() typedef 108 std::list<tEdge> edges_copy; in test_main() 111 std::copy(ei, e_end, std::back_insert_iterator< std::list<tEdge> >(edges_copy)); in test_main() 113 tEdge old_edge=edges_copy.front(); in test_main() 118 tEdge new_edge; in test_main()
|
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/ |
H A D | max_flow_test.cpp | 73 typedef graph_traits<Graph>::edge_descriptor tEdge; in test_main() typedef 108 std::list<tEdge> edges_copy; in test_main() 111 std::copy(ei, e_end, std::back_insert_iterator< std::list<tEdge> >(edges_copy)); in test_main() 113 tEdge old_edge=edges_copy.front(); in test_main() 118 tEdge new_edge; in test_main()
|
/dports/databases/percona57-server/boost_1_59_0/libs/graph/test/ |
H A D | max_flow_test.cpp | 73 typedef graph_traits<Graph>::edge_descriptor tEdge; in test_main() typedef 108 std::list<tEdge> edges_copy; in test_main() 111 std::copy(ei, e_end, std::back_insert_iterator< std::list<tEdge> >(edges_copy)); in test_main() 113 tEdge old_edge=edges_copy.front(); in test_main() 118 tEdge new_edge; in test_main()
|
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/ |
H A D | max_flow_test.cpp | 73 typedef graph_traits<Graph>::edge_descriptor tEdge; in test_main() typedef 108 std::list<tEdge> edges_copy; in test_main() 111 std::copy(ei, e_end, std::back_insert_iterator< std::list<tEdge> >(edges_copy)); in test_main() 113 tEdge old_edge=edges_copy.front(); in test_main() 118 tEdge new_edge; in test_main()
|
/dports/databases/percona57-client/boost_1_59_0/libs/graph/test/ |
H A D | max_flow_test.cpp | 73 typedef graph_traits<Graph>::edge_descriptor tEdge; in test_main() typedef 108 std::list<tEdge> edges_copy; in test_main() 111 std::copy(ei, e_end, std::back_insert_iterator< std::list<tEdge> >(edges_copy)); in test_main() 113 tEdge old_edge=edges_copy.front(); in test_main() 118 tEdge new_edge; in test_main()
|
/dports/devel/boost-libs/boost_1_72_0/libs/graph/test/ |
H A D | max_flow_test.cpp | 73 typedef graph_traits<Graph>::edge_descriptor tEdge; in test_main() typedef 108 std::list<tEdge> edges_copy; in test_main() 111 std::copy(ei, e_end, std::back_insert_iterator< std::list<tEdge> >(edges_copy)); in test_main() 113 tEdge old_edge=edges_copy.front(); in test_main() 118 tEdge new_edge; in test_main()
|
/dports/devel/hyperscan/boost_1_75_0/libs/graph/test/ |
H A D | max_flow_test.cpp | 75 typedef graph_traits< Graph >::edge_descriptor tEdge; in main() typedef 114 std::list< tEdge > edges_copy; in main() 118 ei, e_end, std::back_insert_iterator< std::list< tEdge > >(edges_copy)); in main() 121 tEdge old_edge = edges_copy.front(); in main() 126 tEdge new_edge; in main()
|