Lines Matching full:edge
16 /// implemented as a bit vector, wherein each bit corresponds to one edge in
17 /// the edge array. This implies a lower bound of 64x spatial improvement
47 class Edge {
62 const Edge *Edges;
68 const Edge *edges_begin() const { return Edges; } in edges_begin()
73 const Edge *edges_end() const { return (this + 1)->Edges; } in edges_end()
74 ArrayRef<Edge> edges() const { in edges()
80 ImmutableGraph(std::unique_ptr<Node[]> Nodes, std::unique_ptr<Edge[]> Edges, in ImmutableGraph()
94 ArrayRef<Edge> edges() const { return ArrayRef(Edges.get(), EdgesSize); } in edges()
95 const Edge *edges_begin() const { return edges().begin(); } in edges_begin()
96 const Edge *edges_end() const { return edges().end(); } in edges_end()
105 // Edge E must belong to this ImmutableGraph.
106 size_type getEdgeIndex(const Edge &E) const { in getEdgeIndex()
206 bool insert(const Edge &E) { in insert()
212 void erase(const Edge &E) { in erase()
216 bool contains(const Edge &E) const { in contains()
272 Edge *operator*() const {
289 std::unique_ptr<Edge[]> Edges;
306 using Edge = typename GraphT::Edge; variable
334 auto EdgeArray = std::make_unique<Edge[]>(EdgeSize); in get()
361 auto NewEdgeArray = std::make_unique<Edge[]>(NewEdgeSize); in trim()
380 for (const Edge &E : N.edges()) { in trim()
408 using EdgeRef = typename GraphT::Edge const &;
412 mapped_iterator<typename GraphT::Edge const *, decltype(&edge_dest)>;
432 using ChildEdgeIteratorType = typename GraphT::Edge const *;