| /dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/test/ |
| H A D | bpgraph_test.cc | 363 BpGraph G(redNum, blueNum); in checkFullBpGraph()
364 checkGraphNodeList(G, redNum + blueNum); in checkFullBpGraph()
365 checkGraphRedNodeList(G, redNum); in checkFullBpGraph()
367 checkGraphEdgeList(G, redNum * blueNum); in checkFullBpGraph()
370 G.resize(redNum, blueNum); in checkFullBpGraph()
371 checkGraphNodeList(G, redNum + blueNum); in checkFullBpGraph()
372 checkGraphRedNodeList(G, redNum); in checkFullBpGraph()
384 checkGraphOutArcList(G, n, redNum); in checkFullBpGraph()
385 checkGraphInArcList(G, n, redNum); in checkFullBpGraph()
386 checkGraphIncEdgeList(G, n, redNum); in checkFullBpGraph()
[all …]
|
| /dports/math/lemon/lemon-1.3.1/test/ |
| H A D | bpgraph_test.cc | 363 BpGraph G(redNum, blueNum); in checkFullBpGraph()
364 checkGraphNodeList(G, redNum + blueNum); in checkFullBpGraph()
365 checkGraphRedNodeList(G, redNum); in checkFullBpGraph()
367 checkGraphEdgeList(G, redNum * blueNum); in checkFullBpGraph()
370 G.resize(redNum, blueNum); in checkFullBpGraph()
371 checkGraphNodeList(G, redNum + blueNum); in checkFullBpGraph()
372 checkGraphRedNodeList(G, redNum); in checkFullBpGraph()
384 checkGraphOutArcList(G, n, redNum); in checkFullBpGraph()
385 checkGraphInArcList(G, n, redNum); in checkFullBpGraph()
386 checkGraphIncEdgeList(G, n, redNum); in checkFullBpGraph()
[all …]
|
| /dports/games/xrally/xrally/ |
| H A D | level.c | 529 int redNum = 0, flagNum = 0; in interpretData() local
536 redNum++; in interpretData()
542 if (redNum > 0) { in interpretData()
543 map->red_startX = (int *)calloc(redNum, sizeof(int)); in interpretData()
544 map->red_startY = (int *)calloc(redNum, sizeof(int)); in interpretData()
551 redNum = 0; in interpretData()
634 map->red_startX[redNum] = x; in interpretData()
635 map->red_startY[redNum] = y; in interpretData()
636 redNum++; in interpretData()
657 map->redNum = redNum; in interpretData()
|
| H A D | global.h | 65 int redNum; member
|
| H A D | ai.c | 29 ai->number = map->redNum; in createAI()
|
| H A D | map.c | 256 map->redNum = -1; in initMap()
|
| /dports/graphics/processing/processing-1.5.1/modes/java/examples/Books/Processing Handbook/Synthesis/_15_tree/ |
| H A D | _15_tree.pde | 17 int redNum = 139;
44 s[redNum].setAngle(sin(millis()*0.0001)*10*tmpSpeed);
56 redNum++;
57 println(redNum%391);
|
| H A D | Segment.pde | 147 if(id == redNum) {
|
| /dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/ |
| H A D | full_graph.h | 718 void construct(int redNum, int blueNum) { in construct() argument
719 _red_num = redNum; _blue_num = blueNum; in construct()
720 _node_num = redNum + blueNum; _edge_num = redNum * blueNum; in construct()
730 int redNum() const { return _red_num; } in redNum() function
994 FullBpGraph(int redNum, int blueNum) { construct(redNum, blueNum); } in FullBpGraph() argument
1001 void resize(int redNum, int blueNum) { in resize() argument
1007 construct(redNum, blueNum); in resize()
1069 int redNum() const { return Parent::redNum(); } in redNum() function
|
| H A D | smart_graph.h | 926 int redNum() const { return max_red + 1; } in redNum() function
|
| H A D | core.h | 271 return g.redNum();
|
| /dports/math/lemon/lemon-1.3.1/lemon/ |
| H A D | full_graph.h | 718 void construct(int redNum, int blueNum) { in construct() argument
719 _red_num = redNum; _blue_num = blueNum; in construct()
720 _node_num = redNum + blueNum; _edge_num = redNum * blueNum; in construct()
730 int redNum() const { return _red_num; } in redNum() function
994 FullBpGraph(int redNum, int blueNum) { construct(redNum, blueNum); } in FullBpGraph() argument
1001 void resize(int redNum, int blueNum) { in resize() argument
1007 construct(redNum, blueNum); in resize()
1069 int redNum() const { return Parent::redNum(); } in redNum() function
|
| H A D | smart_graph.h | 926 int redNum() const { return max_red + 1; } in redNum() function
|
| H A D | core.h | 271 return g.redNum();
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/ |
| H A D | full_graph.h | 718 void construct(int redNum, int blueNum) { in construct() argument
719 _red_num = redNum; _blue_num = blueNum; in construct()
720 _node_num = redNum + blueNum; _edge_num = redNum * blueNum; in construct()
730 int redNum() const { return _red_num; } in redNum() function
994 FullBpGraph(int redNum, int blueNum) { construct(redNum, blueNum); } in FullBpGraph() argument
1001 void resize(int redNum, int blueNum) { in resize() argument
1007 construct(redNum, blueNum); in resize()
1069 int redNum() const { return Parent::redNum(); } in redNum() function
|
| H A D | smart_graph.h | 926 int redNum() const { return max_red + 1; } in redNum() function
|
| H A D | core.h | 271 return g.redNum();
|