Home
last modified time | relevance | path

Searched refs:blueNode (Results 1 – 25 of 33) sorted by relevance

12

/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/test/
H A Dbpgraph_test.cc62 check(G.redNode(e1) == rn1 && G.blueNode(e1) == bn2, "Wrong edge"); in checkBpGraphBuild()
176 check(G.blueNode(e2) == n3, "Wrong blue node"); in checkBpGraphAlter()
194 check(G.blueNode(e2) == n2, "Wrong blue node"); in checkBpGraphAlter()
412 check(G.blue(G.blueNode(i)), "Wrong node"); in checkFullBpGraph()
413 check(G.index(G.blueNode(i)) == i, "Wrong index"); in checkFullBpGraph()
H A Dlgf_reader_writer_test.cc217 reader.blueNode("blue_node", blue_node); in checkBpGraphReaderCompile()
267 writer.blueNode("blue_node", blue_node); in checkBpGraphWriterCompile()
496 writer.blueNode("blue_node", bn2); in checkBpGraphReaderWriter()
539 reader.blueNode("blue_node", exp_bn2); in checkBpGraphReaderWriter()
H A Dgraph_copy_test.cc294 node(fn, tn).redNode(frn, trn).blueNode(fbn, tbn). in bpgraph_copy_test()
/dports/math/lemon/lemon-1.3.1/test/
H A Dbpgraph_test.cc62 check(G.redNode(e1) == rn1 && G.blueNode(e1) == bn2, "Wrong edge"); in checkBpGraphBuild()
176 check(G.blueNode(e2) == n3, "Wrong blue node"); in checkBpGraphAlter()
194 check(G.blueNode(e2) == n2, "Wrong blue node"); in checkBpGraphAlter()
412 check(G.blue(G.blueNode(i)), "Wrong node"); in checkFullBpGraph()
413 check(G.index(G.blueNode(i)) == i, "Wrong index"); in checkFullBpGraph()
H A Dlgf_reader_writer_test.cc217 reader.blueNode("blue_node", blue_node); in checkBpGraphReaderCompile()
267 writer.blueNode("blue_node", blue_node); in checkBpGraphWriterCompile()
496 writer.blueNode("blue_node", bn2); in checkBpGraphReaderWriter()
539 reader.blueNode("blue_node", exp_bn2); in checkBpGraphReaderWriter()
H A Dgraph_copy_test.cc294 node(fn, tn).redNode(frn, trn).blueNode(fbn, tbn). in bpgraph_copy_test()
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/
H A Dfull_graph.h765 BlueNode blueNode(Edge e) const { in blueNode() function
900 BlueNode blueNode(int index) const { in blueNode() function
1016 using Parent::blueNode;
1041 BlueNode blueNode(int index) const { return Parent::blueNode(index); } in blueNode() function
H A Dcore.h588 blueNodeRefMap[from.blueNode(it)]);
1426 BpGraphCopy& blueNode(const BlueNode& node, TBlueNode& tnode) {
H A Dsmart_graph.h949 BlueNode blueNode(Edge e) const { in blueNode() function
H A Dlgf_writer.h2009 BpGraphWriter& blueNode(const std::string& caption, const BlueNode& node) { in blueNode() function
2310 find(_graph.blueNode(e))->second); in writeEdges()
/dports/math/lemon/lemon-1.3.1/lemon/
H A Dfull_graph.h765 BlueNode blueNode(Edge e) const { in blueNode() function
900 BlueNode blueNode(int index) const { in blueNode() function
1016 using Parent::blueNode;
1041 BlueNode blueNode(int index) const { return Parent::blueNode(index); } in blueNode() function
H A Dcore.h588 blueNodeRefMap[from.blueNode(it)]);
1426 BpGraphCopy& blueNode(const BlueNode& node, TBlueNode& tnode) {
H A Dsmart_graph.h949 BlueNode blueNode(Edge e) const { in blueNode() function
/dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/
H A Dfull_graph.h765 BlueNode blueNode(Edge e) const { in blueNode() function
900 BlueNode blueNode(int index) const { in blueNode() function
1016 using Parent::blueNode;
1041 BlueNode blueNode(int index) const { return Parent::blueNode(index); } in blueNode() function
H A Dcore.h588 blueNodeRefMap[from.blueNode(it)]);
1426 BpGraphCopy& blueNode(const BlueNode& node, TBlueNode& tnode) {
H A Dsmart_graph.h949 BlueNode blueNode(Edge e) const { in blueNode() function
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/concepts/
H A Dbpgraph.h814 BlueNode blueNode(const Edge&) const { return BlueNode(); } in blueNode() function
H A Dgraph_components.h401 BlueNode blueNode(const Edge&) const { return BlueNode(); } in blueNode() function
454 bn = bpgraph.blueNode(e); in constraints()
/dports/math/lemon/lemon-1.3.1/lemon/concepts/
H A Dbpgraph.h814 BlueNode blueNode(const Edge&) const { return BlueNode(); } in blueNode() function
H A Dgraph_components.h401 BlueNode blueNode(const Edge&) const { return BlueNode(); } in blueNode() function
454 bn = bpgraph.blueNode(e); in constraints()
/dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/concepts/
H A Dbpgraph.h814 BlueNode blueNode(const Edge&) const { return BlueNode(); } in blueNode() function
H A Dgraph_components.h401 BlueNode blueNode(const Edge&) const { return BlueNode(); } in blueNode() function
454 bn = bpgraph.blueNode(e); in constraints()
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/bits/
H A Dgraph_extender.h807 Node v(Edge e) const { return this->blueNode(e); } in v()
/dports/math/lemon/lemon-1.3.1/lemon/bits/
H A Dgraph_extender.h807 Node v(Edge e) const { return this->blueNode(e); } in v()
/dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/bits/
H A Dgraph_extender.h807 Node v(Edge e) const { return this->blueNode(e); } in v()

12