Lines Matching refs:to
44 bool addEdge(uptr from, uptr to) {
45 check(from, to);
46 return v[from].setBit(to);
50 uptr addEdges(const BV &from, uptr to, uptr added_edges[],
56 if (v[node].setBit(to))
64 // Returns true if an edge from=>to exist.
69 bool hasEdge(uptr from, uptr to) { return v[from].getBit(to); }
71 // Returns true if the edge from=>to was removed.
72 bool removeEdge(uptr from, uptr to) {
73 return v[from].clearBit(to);
76 // Returns true if at least one edge *=>to was removed.
77 bool removeEdgesTo(const BV &to) {
80 if (v[from].setDifference(to))
104 bool hasEdge(uptr from, uptr to) const {
105 check(from, to);
106 return v[from].getBit(to);
110 // to any of the nodes in 'targets'.
125 // Finds a path from 'from' to one of the nodes in 'target',
126 // stores up to 'path_size' items of the path into 'path',
134 // The function is recursive, so we don't want to create BV on stack.
