| /inkscape/src/extension/internal/bitmap/ |
| H A D | edge.h | 16 class Edge : public ImageMagick { class in namespace:Inkscape::Extension::Internal::Bitmap
|
| /inkscape/src/libcola/ |
| H A D | shortest_paths.h | 21 typedef std::pair<unsigned,unsigned> Edge; typedef in namespace:shortest_paths
24 std::vector<Edge>& es,double* eweights);
27 std::vector<Edge>& es, double* eweights);
30 std::vector<Edge>& es, double* eweights);
|
| H A D | straightener.h | 32 struct Edge { struct in namespace:straightener
40 Edge(unsigned id, unsigned start, unsigned end, Route* route) function in struct:straightener::Edge
45 virtual ~Edge() {
96 Edge *edge;
107 double conjpos, std::vector<Edge*>& openEdges,
109 Node(unsigned id, double x, double y, Edge* e) :
129 void generateConstraints(std::vector<Node*>& nodes, std::vector<Edge*>& edges, std::vector<SimpleConstraint*>& cs, Dim dim);
130 void nodePath(Edge& e, std::vector<Node*>& nodes, std::vector<unsigned>& path);
|
| H A D | cola.h | 21 typedef std::pair<unsigned, unsigned> Edge; typedef in namespace:cola
29 std::vector<Edge> edges;
39 const std::vector<Edge> &es,
154 std::vector<Edge>& es,
174 std::vector<straightener::Edge*>* straightenEdges = NULL);
198 void straighten(std::vector<straightener::Edge*>&, Dim);
224 std::vector<straightener::Edge*>* straightenEdges;
|
| /inkscape/src/libavoid/ |
| H A D | geomtypes.h | 146 class Edge class in namespace:Avoid
156 //! @brief A bounding box, represented with an Edge between top-left and
159 typedef Edge BBox;
|
| /inkscape/src/libdepixelize/ |
| H A D | kopftracer2011.cpp | 65 Edge; typedef in struct:Tracer::Heuristics::SparsePixels
66 typedef std::pair<Edge, int> EdgeWeight;
|
| /inkscape/src/libdepixelize/priv/ |
| H A D | pixelgraph.h | 80 typedef std::pair<iterator, iterator> Edge; typedef in class:Tracer::PixelGraph
81 typedef std::pair<Edge, Edge> EdgePair;
521 Edge(it, nodeBottomRight(it)),
522 Edge(nodeRight(it), nodeBottom(it)));
|
| /inkscape/src/2geom/ |
| H A D | toposweep.h | 88 class Edge { class in class:Geom::TopoGraph
92 Edge(boost::shared_ptr<Section> s, unsigned o) : section(s), other(o) {} function in class:Geom::TopoGraph::Edge
100 std::vector<Edge> enters, exits; // indexes of the enter / exit edges
104 Edge operator[](unsigned ix) const;
105 Edge &operator[](unsigned ix);
107 void insert(unsigned ix, Edge e);
119 Edge remove_edge(unsigned ix, unsigned jx);
|
| /inkscape/share/extensions/ |
| H A D | voronoi.py | 162 if edge.ep[Edge.LE] is not None:
163 sitenumL = edge.ep[Edge.LE].sitenum
165 if edge.ep[Edge.RE] is not None:
166 sitenumR = edge.ep[Edge.RE].sitenum
201 edge = Edge.bisect(bot,newsite)
207 bisector = Halfedge(edge,Edge.LE)
220 bisector = Halfedge(edge,Edge.RE)
274 pm = Edge.LE
277 pm = Edge.RE
279 # Create an Edge (o
348 class Edge(object): class in inherits:object
[all...] |