Lines Matching defs:ix

10 TopoGraph::Edge &TopoGraph::Vertex::operator[](unsigned ix) {
11 ix %= degree();
12 return ix < enters.size() ? enters[ix] : exits[ix - enters.size()];
15 TopoGraph::Edge TopoGraph::Vertex::operator[](unsigned ix) const {
16 ix %= degree();
17 return ix < enters.size() ? enters[ix] : exits[ix - enters.size()];
20 void TopoGraph::Vertex::erase(unsigned ix) {
21 ix %= degree();
22 if(ix < enters.size())
23 enters.erase(enters.begin() + ix);
25 exits.erase(exits.begin() + (ix - enters.size()));
28 void TopoGraph::Vertex::insert(unsigned ix, Edge v) {
29 ix %= degree();
30 if(ix < enters.size())
31 enters.insert(enters.begin() + ix, v);
33 exits.insert(exits.begin() + (ix - enters.size()), v);
43 TopoGraph::Edge TopoGraph::remove_edge(unsigned ix, unsigned jx) {
44 Vertex &v = vertices[ix];
61 unsigned ix = 0;
63 vix.push_back(ix);
64 if(vertices[i].degree() != 0) vertices[ix++] = vertices[i];
67 for(unsigned i = 0; i < ix; i++)
416 unsigned ix = find_vertex(vertices, s->fp, tol);
417 if(ix == vertices.size()) {
423 context.insert(context.begin() + context_ix, Context(s, ix));
454 ix = find_vertex(vertices, context[context_ix].section->tp, tol);
455 if(ix != vertices.size()) {
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);
515 void add_edge_at(TopoGraph &g, unsigned ix, boost::shared_ptr<Section> s, TopoGraph::Edge jx, bool before = true) {
516 TopoGraph::Vertex &v = g[ix];