Searched refs:edges_begin (Results 1 – 7 of 7) sorted by relevance
38 FruitAssert(itr->edges_begin != 1); in getNode()44 FruitAssert(itr->edges_begin != 1); in isTerminal()45 return itr->edges_begin == 0; in isTerminal()50 FruitAssert(itr->edges_begin != 1); in setTerminal()51 itr->edges_begin = 0; in setTerminal()67 FruitAssert(itr->edges_begin != 1); in getNode()73 FruitAssert(itr->edges_begin != 1); in isTerminal()74 return itr->edges_begin == 0; in isTerminal()85 FruitAssert(itr->edges_begin != 0); in neighborsBegin()86 FruitAssert(itr->edges_begin != 1); in neighborsBegin()[all …]
124 nodeData.edges_begin = 0; in SemistaticGraph()126 …nodeData.edges_begin = reinterpret_cast<std::uintptr_t>(edges_storage.data() + edges_storage.size(… in SemistaticGraph()201 nodeData.edges_begin = 0; in SemistaticGraph()203 …nodeData.edges_begin = reinterpret_cast<std::uintptr_t>(edges_storage.data() + edges_storage.size(… in SemistaticGraph()220 if (data.edges_begin == 1) { in checkFullyConstructed()
78 std::uintptr_t edges_begin;
93 edge_iterator edges_begin() { in edges_begin() function99 const_edge_iterator edges_begin() const { in edges_begin() function106 return make_range(edges_begin(), edges_end()); in edges()109 return make_range(edges_begin(), edges_end()); in edges()
326 return *(MatchDag.edges_begin() + Idx); in getEdge()329 return *(MatchDag.edges_begin() + Idx); in getEdge()
68 const Edge *edges_begin() const { return Edges; } in edges_begin() function75 return makeArrayRef(edges_begin(), edges_end()); in edges()95 const Edge *edges_begin() const { return edges().begin(); } in edges_begin() function107 return std::distance(edges_begin(), &E); in getEdgeIndex()274 return Set.G.edges_begin() + Current;416 return {N->edges_begin(), &edge_dest};435 return N->edges_begin();
633 Nodes[Graph->getNodeIndex(N)] = Graph->getEdgeIndex(*N.edges_begin()); in hardenLoadsWithPlugin()