Cross Reference: /inkscape/src/2geom/toposweep.cpp

Lines Matching refs:Edge
10 TopoGraph::Edge &TopoGraph::Vertex::operator[](unsigned ix) {
15 TopoGraph::Edge TopoGraph::Vertex::operator[](unsigned ix) const {
28 void TopoGraph::Vertex::insert(unsigned ix, Edge v) {
43 TopoGraph::Edge TopoGraph::remove_edge(unsigned ix, unsigned jx) {
47         Edge &ret = v[jx];
56     return v[0]; // if assert is disabled, return first Edge.
76             Edge e = vertices[i][j];
266     typedef TopoGraph::Edge first_argument_type;
267     typedef TopoGraph::Edge second_argument_type;
271     bool operator()(TopoGraph::Edge const &e1, TopoGraph::Edge const &e2) const { return s(*e1.section, *e2.section); }
389                     std::vector<Edge> enters;
397                             enters.push_back(Edge(context[j].section, context[j].from_vert));
457                         Edge e(sec, context[context_ix].from_vert);
459                         std::vector<Edge>::iterator it = std::lower_bound(vertices[ix].enters.begin(), vertices[ix].enters.end(), e, edge_sort);
474                         for(std::vector<Edge>::iterator it2 = it; it2 != vertices[ix].enters.end(); ++it2) {
515 void add_edge_at(TopoGraph &g, unsigned ix, boost::shared_ptr<Section> s, TopoGraph::Edge jx, bool before = true) {
537             TopoGraph::Edge e = g[i][0];
539                 TopoGraph::Edge next_edge = g[j][1 - g[j].find_section(e.section)];
541                 add_edge_at(g, j,       e.section, TopoGraph::Edge(new_section, e.other), false);
542                 add_edge_at(g, e.other, e.section, TopoGraph::Edge(new_section, j), true);
566             TopoGraph::Edge &e1 = g[i][0], &e2 = g[i][1];
576                 v1->lookup_section(e1.section) = Edge(new_section, v2);
577                 v2->lookup_section(e2.section) = Edge(new_section, v1);
608                 TopoGraph::Edge e = g[cur][e_ix];