Lines Matching refs:enters
12 return ix < enters.size() ? enters[ix] : exits[ix - enters.size()];
17 return ix < enters.size() ? enters[ix] : exits[ix - enters.size()];
22 if(ix < enters.size())
23 enters.erase(enters.begin() + ix);
25 exits.erase(exits.begin() + (ix - enters.size()));
30 if(ix < enters.size())
31 enters.insert(enters.begin() + ix, v);
33 exits.insert(exits.begin() + (ix - enters.size()), v);
386 //we need to create a new vertex; add everything that enters it
389 std::vector<Edge> enters;
397 enters.push_back(Edge(context[j].section, context[j].from_vert));
404 v.enters = enters;
459 std::vector<Edge>::iterator it = std::lower_bound(vertices[ix].enters.begin(), vertices[ix].enters.end(), e, edge_sort);
461 if(vertices[ix].enters.empty()) {
464 } else if(it == vertices[ix].enters.end()) {
474 for(std::vector<Edge>::iterator it2 = it; it2 != vertices[ix].enters.end(); ++it2) {
479 vertices[ix].enters.insert(it, e);
517 for(unsigned i = 0; i < v.enters.size(); i++) {
518 if(v.enters[i].section == s) {
519 v.enters.insert(v.enters.begin() + (before ? i : i + 1), jx);
565 if(g[i].enters.size() == 1 && g[i].exits.size() == 1) {