Lines Matching refs:Edge
48 class Edge {
63 const Edge *Edges;
69 const Edge *edges_begin() const { return Edges; }
74 const Edge *edges_end() const { return (this + 1)->Edges; }
75 ArrayRef<Edge> edges() const {
81 ImmutableGraph(std::unique_ptr<Node[]> Nodes, std::unique_ptr<Edge[]> Edges,
95 ArrayRef<Edge> edges() const { return makeArrayRef(Edges.get(), EdgesSize); }
96 const Edge *edges_begin() const { return edges().begin(); }
97 const Edge *edges_end() const { return edges().end(); }
106 // Edge E must belong to this ImmutableGraph.
107 size_type getEdgeIndex(const Edge &E) const {
207 bool insert(const Edge &E) {
213 void erase(const Edge &E) {
217 bool contains(const Edge &E) const {
273 Edge *operator*() const {
290 std::unique_ptr<Edge[]> Edges;
307 using Edge = typename GraphT::Edge;
335 auto EdgeArray = std::make_unique<Edge[]>(EdgeSize);
362 auto NewEdgeArray = std::make_unique<Edge[]>(NewEdgeSize);
381 for (const Edge &E : N.edges()) {
409 using EdgeRef = typename GraphT::Edge const &;
413 mapped_iterator<typename GraphT::Edge const *, decltype(&edge_dest)>;
433 using ChildEdgeIteratorType = typename GraphT::Edge const *;