| /inkscape/src/extension/internal/bitmap/ |
| H A D | edge.cpp | 21 Edge::applyEffect(Magick::Image *image) {
26 Edge::refreshParameters(Inkscape::Extension::Effect *module) {
33 Edge::init(void)
37 "<name>" N_("Edge") "</name>\n"
47 "</inkscape-extension>\n", new Edge());
|
| 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 | straightener.cpp | 68 void Edge::nodePath(vector<Node*>& nodes) {
71 //printf("Edge::nodePath: (%d,%d) dummyNodes:%d\n",startNode,endNode,ds.size());
106 Edge *e;
109 Event(EventType t, Edge *e, double p) : type(t),v(NULL),e(e),pos(p) {};
129 double conjpos, vector<Edge*>& openEdges,
136 typedef pair<double,Edge*> PosEdgePair;
139 Edge *e=openEdges[i];
157 Edge* e=i->second;
178 Edge* e=i->second;
199 void generateConstraints(vector<Node*>& nodes, vector<Edge*>
[all...] |
| 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;
|
| H A D | shortest_paths.cpp | 14 vector<Edge>& es,
36 static void dijkstra_init(Node* vs, vector<Edge>& es, double* eweights) {
81 vector<Edge>& es,
93 vector<Edge>& es,
|
| H A D | cycle_detector.h | 10 typedef std::vector<cola::Edge> Edges;
|
| H A D | connected_components.cpp | 65 const vector<Edge> &es,
78 vector<Edge>::const_iterator ei;
|
| H A D | cycle_detector.cpp | 40 Edge anEdge;
209 if ((*edges)[i] == Edge(k, otherNode->id)) { (*cyclicEdgesMapping)[i] = true; }
|
| H A D | cola.cpp | 22 std::vector<Edge>& es,
221 void ConstrainedMajorizationLayout::straighten(std::vector<straightener::Edge*>& sedges, Dim dim) {
342 std::vector<straightener::Edge*>* straightenEdges) {
|
| /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...] |
| /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);
|
| H A D | toposweep.cpp | 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 cons
[all...] |
| /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/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/extension/ |
| H A D | init.cpp | 213 Internal::Bitmap::Edge::init();
|
| /inkscape/src/ |
| H A D | graphlayout.cpp | 124 vector<Edge> es;
195 //cout << "Edge: (" << u <<","<<v<<")"<<endl;
|
| /inkscape/src/libdepixelize/ |
| H A D | kopftracer2011.cpp | 65 Edge; typedef in struct:Tracer::Heuristics::SparsePixels
66 typedef std::pair<Edge, int> EdgeWeight;
|