/dports/biology/cufflinks/cufflinks-2.2.1-89-gdc3b0cb/src/lemon/bits/ |
H A D | base_extender.h | 50 class Edge : public UEdge { 66 return forward==that.forward && UEdge(*this)==UEdge(that); 69 return forward!=that.forward || UEdge(*this)!=UEdge(that); 73 (!(that.forward<forward) && UEdge(*this)<UEdge(that)); 130 if( UEdge(e) != INVALID ) { in firstOut() 142 if( UEdge(e) == INVALID ) { in nextOut() 154 if( UEdge(e) != INVALID ) { in firstIn() 259 UEdge findUEdge(Node s, Node t, UEdge p = INVALID) const { 289 typedef typename Parent::UEdge UEdge; typedef 386 class Edge : public UEdge { [all …]
|
H A D | graph_adaptor_extender.h | 211 typedef typename Parent::UEdge UEdge; typedef 223 int maxId(UEdge) const { in maxId() argument 235 UEdge fromId(int id, UEdge) const { in fromId() argument 364 UEdge(e), graph(&_graph) { } in UEdgeIt() 388 : graph(&_graph), UEdge(ue) { in IncEdgeIt() 454 typedef typename Parent::UEdge UEdge; typedef 469 int maxId(UEdge) const { in maxId() argument 486 UEdge fromId(int id, UEdge) const { in fromId() argument 579 class UEdgeIt : public UEdge { 593 : UEdge(edge), graph(&_graph) { } in UEdgeIt() [all …]
|
H A D | graph_extender.h | 342 typedef typename Parent::UEdge UEdge; typedef 354 int maxId(UEdge) const { in maxId() argument 366 UEdge fromId(int id, UEdge) const { in fromId() argument 694 notifier(UEdge()).clear(); in clear() 704 notifier(UEdge()).build(); in build() 765 typedef typename Parent::UEdge UEdge; typedef 794 int maxId(UEdge) const { in maxId() argument 811 UEdge fromId(int id, UEdge) const { in fromId() argument 1317 notifier(UEdge()).clear(); in clear() 1332 notifier(UEdge()).build(); in build() [all …]
|
H A D | traits.h | 121 class ItemSetTraits<_Graph, typename _Graph::UEdge> { 126 typedef typename Graph::UEdge Item;
|
/dports/biology/cufflinks/cufflinks-2.2.1-89-gdc3b0cb/src/lemon/concepts/ |
H A D | ugraph.h | 178 class UEdge { 184 UEdge() { } in UEdge() function 189 UEdge(const UEdge&) { } in UEdge() function 194 UEdge(Invalid) { } in UEdge() function 226 class UEdgeIt : public UEdge { 275 class IncEdgeIt : public UEdge { 315 class Edge : public UEdge { 326 Edge(const Edge& e) : UEdge(e) { } in Edge() 630 void first(UEdge&) const {} in first() argument 631 void next(UEdge&) const {} in next() argument [all …]
|
H A D | bpugraph.h | 387 class UEdge { 393 UEdge() { } in UEdge() function 398 UEdge(const UEdge&) { } in UEdge() argument 403 UEdge(Invalid) { } in UEdge() function 435 class UEdgeIt : public UEdge { 483 class IncEdgeIt : public UEdge { 522 class Edge : public UEdge { 966 void first(UEdge&) const {} in first() argument 967 void next(UEdge&) const {} in next() argument 985 void nextFromANode(UEdge&) const {} in nextFromANode() argument [all …]
|
H A D | graph_components.h | 210 UEdge(const UEdge &) : Parent() {} in UEdge() argument 273 typedef typename _Graph::UEdge UEdge; typedef 312 typedef BaseUGraphComponent::UEdge UEdge; typedef 416 typedef typename _Graph::UEdge UEdge; typedef 532 typedef typename Base::UEdge UEdge; typedef 991 typedef typename Base::UEdge UEdge; typedef 1118 typedef typename Base::UEdge UEdge; typedef 1309 typedef typename Base::UEdge UEdge; typedef 1608 typedef typename Base::UEdge UEdge; typedef 1860 typedef typename _Base::UEdge UEdge; typedef [all …]
|
/dports/biology/cufflinks/cufflinks-2.2.1-89-gdc3b0cb/src/lemon/ |
H A D | smart_graph.h | 415 class UEdge; variable 432 class UEdge { 440 UEdge() {} in UEdge() function 441 UEdge (Invalid) { id = -1; } in UEdge() function 555 static UEdge uEdgeFromId(int id) { return UEdge(id);} in uEdgeFromId() 579 return UEdge(n / 2); in addEdge() 804 class UEdge { 809 UEdge(int _id) : id(_id) {} in UEdge() function 811 UEdge() {} in UEdge() function 812 UEdge(Invalid) : id(-1) {} in UEdge() function [all …]
|
H A D | list_graph.h | 755 class UEdge; variable 772 class UEdge { 780 UEdge() {} in UEdge() function 941 static UEdge uEdgeFromId(int id) { return UEdge(id);} in uEdgeFromId() 1326 UEdge edge; in build() 1337 UEdge edge; in clear() 1517 class UEdge { 1524 UEdge() {} in UEdge() function 1633 return UEdge(id); in uEdgeFromId() 2104 UEdge edge; in build() [all …]
|
H A D | bipartite_matching.h | 60 typedef typename Graph::UEdge UEdge; typedef 275 UEdge uedge = pred[anode]; in _find_path_bfs() 278 UEdge nedge = _rmatching[bnode]; in _find_path_bfs() 370 bool matchingEdge(const UEdge& edge) const { in matchingEdge() 380 UEdge matchingEdge(const Node& node) const { in matchingEdge() 671 typedef typename BpUGraph::UEdge UEdge; typedef 929 UEdge uedge = bpred[bestNode]; 1052 bool matchingEdge(const UEdge& edge) const { in matchingEdge() 1060 UEdge matchingEdge(const Node& node) const { in matchingEdge() 1270 typedef typename BpUGraph::UEdge UEdge; typedef [all …]
|
H A D | graph_utils.h | 80 typedef Graph:: UEdge UEdge; \ 452 typedef typename Graph::UEdge UEdge; 453 static UEdge find(const Graph &g, Node u, Node v, UEdge e) { 486 typedef typename Graph::UEdge UEdge; 487 static UEdge find(const Graph &g, Node u, Node v, UEdge prev) { 515 inline typename Graph::UEdge 542 typedef typename Graph::UEdge UEdge; 958 typedef typename From::UEdge UEdge; 963 typedef typename To::UEdge TUEdge; 1219 typedef typename From::UEdge UEdge; [all …]
|
H A D | topology.h | 494 typedef typename Graph::UEdge UEdge; typedef 552 typedef typename Graph::UEdge UEdge; typedef 622 std::stack<UEdge> _edgeStack; 632 typedef typename Graph::UEdge UEdge; typedef 698 std::stack<UEdge> _edgeStack; 782 typedef typename UGraph::UEdge UEdge; in biNodeConnectedComponents() typedef 783 checkConcept<concepts::WriteMap<UEdge, int>, UEdgeMap>(); in biNodeConnectedComponents() 851 typedef typename Graph::UEdge UEdge; typedef 907 typedef typename Graph::UEdge UEdge; typedef 974 typedef typename Graph::UEdge UEdge; typedef [all …]
|
/dports/cad/opencascade/opencascade-7.6.0/src/BRepFill/ |
H A D | BRepFill_Sweep.cxx | 2273 UEdge(NbLaw+1, j) = UEdge(1, j); in BuildShell() 2280 UEdge(1, j) = UEdge(NbLaw+1, j); in BuildShell() 2572 if (UEdge(isec+1, ipath).IsNull()) { in BuildShell() 2578 UEdge(isec+1, ipath) = UEdge(isec, ipath); in BuildShell() 2599 if (isec == 1 && UEdge(1, ipath).IsNull()) { in BuildShell() 2630 UEdge(isec+1, ipath) = UEdge(1, ipath); in BuildShell() 2634 if (UEdge(isec+1, ipath).IsNull()) in BuildShell() 2720 DBRep::Set(name,UEdge(isec, ipath)); in BuildShell() 2741 if (UEdge(isec, ipath).IsSame(UEdge(isec+1, ipath))) in BuildShell() 2748 TopoDS::Edge(UEdge(isec, ipath)), in BuildShell() [all …]
|
/dports/biology/cufflinks/cufflinks-2.2.1-89-gdc3b0cb/src/ |
H A D | matching_merge.h | 32 ReachGraph::ANodeMap<ReachGraph::UEdge> matched_a_nodes(bp); in make_chains_from_matching() 35 ReachGraph::BNodeMap<ReachGraph::UEdge> matched_b_nodes(bp); in make_chains_from_matching()
|
/dports/finance/hs-hledger-web/hledger-web-1.19/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/ |
H A D | Example.hs | 39 labUEdges :: [Edge] -> [UEdge] 43 noEdges :: [UEdge]
|
/dports/finance/hs-hledger-ui/hledger-ui-1.19/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/ |
H A D | Example.hs | 39 labUEdges :: [Edge] -> [UEdge] 43 noEdges :: [UEdge]
|
H A D | Graph.hs | 9 Edge,LEdge,UEdge, 88 type UEdge = LEdge () type
|
/dports/finance/hs-hledger/hledger-1.19/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/ |
H A D | Example.hs | 39 labUEdges :: [Edge] -> [UEdge] 43 noEdges :: [UEdge]
|
H A D | Graph.hs | 9 Edge,LEdge,UEdge, 88 type UEdge = LEdge () type
|
/dports/devel/hs-spago/spago-0.20.3/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/ |
H A D | Example.hs | 39 labUEdges :: [Edge] -> [UEdge] 43 noEdges :: [UEdge]
|
/dports/devel/hs-darcs/darcs-2.16.4/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/ |
H A D | Example.hs | 39 labUEdges :: [Edge] -> [UEdge] 43 noEdges :: [UEdge]
|
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/ |
H A D | NEWS | 298 * Edge -> Arc, UEdge -> Edge 299 * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
|
/dports/math/lemon/lemon-1.3.1/ |
H A D | NEWS | 298 * Edge -> Arc, UEdge -> Edge 299 * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
|
/dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/ |
H A D | NEWS | 283 * Edge -> Arc, UEdge -> Edge 284 * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
|
/dports/math/lemon/lemon-1.3.1/doc/ |
H A D | migration.dox | 37 <tt>UEdge</tt>s). These changes reflected thoroughly everywhere in 43 - \c Edge -> \c Arc, \c UEdge -> \c Edge
|