| /third_party/boost/boost/graph/ |
| D | vector_as_graph.hpp | 47 template < class EdgeList > struct val_out_edge_ret;
48 template < class EdgeList > struct val_out_edge_iter;
49 template < class EdgeList > struct val_edge;
62 template < class EdgeList > struct graph_traits< std::vector< EdgeList > >
64 typedef typename EdgeList::value_type V;
66 typedef typename detail::val_edge< EdgeList >::type edge_descriptor;
67 typedef typename EdgeList::const_iterator adjacency_iterator;
69 typename detail::val_out_edge_iter< EdgeList >::type out_edge_iterator;
76 typedef typename std::vector< EdgeList >::size_type vertices_size_type;
78 typedef typename EdgeList::size_type degree_size_type;
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | edge_list_cc.cpp | 26 EdgeList; in main() typedef
28 typedef graph_traits< EdgeList >::edge_descriptor Edge; in main()
30 BOOST_CONCEPT_ASSERT((EdgeListGraphConcept< EdgeList >)); in main()
33 (ReadablePropertyGraphConcept< EdgeList, Edge, edge_index_t >)); in main()
|
| /third_party/skia/src/gpu/geometry/ |
| D | GrTriangulator.h | 51 struct EdgeList;
144 void setTop(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current,
146 void setBottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current,
148 void mergeEdgesAbove(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current,
150 void mergeEdgesBelow(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current,
155 static void FindEnclosingEdges(Vertex* v, EdgeList* edges, Edge** left, Edge** right);
156 void mergeCollinearEdges(Edge* edge, EdgeList* activeEdges, Vertex** current,
158 bool splitEdge(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current,
160 bool intersectEdgePair(Edge* left, Edge* right, EdgeList* activeEdges, Vertex** current,
165 bool checkForIntersection(Edge* left, Edge* right, EdgeList* activeEdges, Vertex** current,
[all …]
|
| D | GrAATriangulator.h | 55 void extractBoundary(EdgeList* boundary, Edge* e) const;
60 void simplifyBoundary(EdgeList* boundary, const Comparator&) const;
65 void strokeBoundary(EdgeList* boundary, VertexList* innerMesh, const Comparator&) const;
|
| D | GrTriangulator.cpp | 33 using EdgeList = GrTriangulator::EdgeList; typedef
289 void GrTriangulator::EdgeList::insert(Edge* edge, Edge* prev, Edge* next) { in insert()
293 void GrTriangulator::EdgeList::remove(Edge* edge) { in remove()
628 void EdgeList::insert(Edge* edge, Edge* prev) { in insert()
635 void GrTriangulator::FindEnclosingEdges(Vertex* v, EdgeList* edges, Edge** left, Edge** right) { in FindEnclosingEdges()
710 static void rewind(EdgeList* activeEdges, Vertex** current, Vertex* dst, const Comparator& c) { in rewind()
736 static void rewind_if_necessary(Edge* edge, EdgeList* activeEdges, Vertex** current, in rewind_if_necessary()
774 void GrTriangulator::setTop(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, in setTop()
788 void GrTriangulator::setBottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, in setBottom()
802 void GrTriangulator::mergeEdgesAbove(Edge* edge, Edge* other, EdgeList* activeEdges, in mergeEdgesAbove()
[all …]
|
| D | GrAATriangulator.cpp | 30 using EdgeList = GrTriangulator::EdgeList; typedef
144 EdgeList activeEdges; in removeNonBoundaryEdges()
184 void GrAATriangulator::simplifyBoundary(EdgeList* boundary, const Comparator& c) const { in simplifyBoundary()
311 EdgeList activeEdges; in collapseOverlapRegions()
410 void GrAATriangulator::strokeBoundary(EdgeList* boundary, VertexList* innerMesh, in strokeBoundary()
570 void GrAATriangulator::extractBoundary(EdgeList* boundary, Edge* e) const { in extractBoundary()
611 EdgeList boundary; in extractBoundaries()
|
| /third_party/boost/boost/graph/detail/ |
| D | adjacency_list.hpp | 107 template < class EdgeList, class vertex_descriptor >
109 EdgeList& el, vertex_descriptor v, allow_parallel_edge_tag) in erase_from_incidence_list()
115 template < class EdgeList, class vertex_descriptor >
117 EdgeList& el, vertex_descriptor v, disallow_parallel_edge_tag) in erase_from_incidence_list()
119 typedef typename EdgeList::value_type StoredEdge; in erase_from_incidence_list()
436 template < class edge_descriptor, class EdgeList, class StoredProperty >
438 edge_descriptor, EdgeList& el, StoredProperty& p) in remove_directed_edge_dispatch()
440 for (typename EdgeList::iterator i = el.begin(); i != el.end(); ++i) in remove_directed_edge_dispatch()
448 template < class incidence_iterator, class EdgeList, class Predicate >
450 incidence_iterator last, EdgeList& el, Predicate pred, in remove_directed_edge_if_dispatch()
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | dehne_gotz_min_spanning_tree.hpp | 145 typename SupervertexMap, typename Vertex, typename EdgeList>
152 EdgeList& edge_list) in boruvka_merge_step()
159 typedef typename EdgeList::iterator edge_iterator; in boruvka_merge_step()
350 template<typename Graph, typename ForwardIterator, typename EdgeList,
356 EdgeList& edge_list, EdgeMapper edge_mapper, in sorted_mutating_kruskal()
432 typename EdgeList, typename WeightMap, typename GlobalIndexMap,
439 EdgeList& edge_list, in merge_local_minimum_spanning_trees_step()
446 typedef typename EdgeList::value_type edge_descriptor; in merge_local_minimum_spanning_trees_step()
|
| /third_party/flutter/skia/src/gpu/ |
| D | GrTessellator.cpp | 458 struct EdgeList { struct
459 EdgeList() : fHead(nullptr), fTail(nullptr) {} in EdgeList() argument
889 void remove_edge(Edge* edge, EdgeList* edges) { in remove_edge()
895 void insert_edge(Edge* edge, Edge* prev, EdgeList* edges) { in insert_edge()
902 void find_enclosing_edges(Vertex* v, EdgeList* edges, Edge** left, Edge** right) { in find_enclosing_edges()
978 void merge_collinear_edges(Edge* edge, EdgeList* activeEdges, Vertex** current, Comparator& c);
980 void rewind(EdgeList* activeEdges, Vertex** current, Vertex* dst, Comparator& c) { in rewind()
1000 void set_top(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, Comparator& c) { in set_top()
1009 void set_bottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, Comparator& c) { in set_bottom()
1018 void merge_edges_above(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current, in merge_edges_above()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | CFLGraph.h | 66 using EdgeList = std::vector<Edge>; variable
69 EdgeList Edges, ReverseEdges;
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/ |
| D | PGOInstrumentation.cpp | 725 std::vector<Edge *> EdgeList; in getInstrumentBBs() local
726 EdgeList.reserve(MST.AllEdges.size()); in getInstrumentBBs()
728 EdgeList.push_back(E.get()); in getInstrumentBBs()
730 for (auto &E : EdgeList) { in getInstrumentBBs()
|