Searched defs:Node (Results 1 - 12 of 12) sorted by relevance

/inkscape/src/xml/
H A Dnode.h78 class Node : public Inkscape::GC::Anchored { class in namespace:Inkscape::XML
80 Node() {} function in class:Inkscape::XML::Node
81 virtual ~Node() {}
260 virtual Node *root()=0;
261 virtual Node const *root() const=0;
272 virtual Node *parent()=0;
273 virtual Node const *parent() const=0;
287 virtual Node *next()=0;
288 virtual Node const *next() const=0;
299 virtual Node *firstChil
478 Node(Node const &) : Anchored() {} function in class:Inkscape::XML::Node
[all...]
H A Devent.cpp88 typedef Inkscape::XML::Node Node; typedef in class:__anon556::LogPerformer
95 void notifyChildAdded(Node &parent, Node &child, Node *ref) {
99 void notifyChildRemoved(Node &parent, Node &child, Node */*old_ref*/) {
103 void notifyChildOrderChanged(Node &parent, Node
404 typedef Inkscape::XML::Node Node; typedef in class:__anon558::LogPrinter
[all...]
/inkscape/src/libcola/
H A Dcycle_detector.h13 class Node { class
19 Node *cyclicAncestor;
23 Node(unsigned id) { this->id = id; cyclicAncestor = NULL; status = NotVisited; } function in class:Node
24 virtual ~Node() {}
42 std::vector<Node *> *nodes; // the nodes in the graph
50 bool isSink(Node *node);
51 bool find_node(std::vector<Node *> *& list, unsigned k);
H A Dshortest_paths.h9 struct Node { struct in namespace:shortest_paths
12 Node *p; // predecessor
13 std::vector<Node*> neighbours;
15 PairNode<Node*> *qnode;
17 inline bool compareNodes(Node *const &u, Node *const &v) {
H A Dconnected_components.cpp34 struct Node { struct in namespace:cola::ccomponents
37 vector<Node*> neighbours;
38 list<Node*>::iterator listPos;
42 static void dfs(Node* v,
43 list<Node*>& remaining,
52 Node* u=v->neighbours[i];
70 vector<Node> vs(n);
71 list<Node*> remaining;
87 Node* v=*remaining.begin();
H A Dstraightener.h31 class Node;
57 void nodePath(std::vector<Node*>& nodes);
89 class Node { class in namespace:straightener
100 Node(unsigned id, vpsc::Rectangle* r) : function in class:straightener::Node
106 friend void sortNeighbours(Node* v, Node* l, Node* r,
108 std::vector<Node*>& L, std::vector<Node*>& nodes, Dim dim);
109 Node(unsigne function in class:straightener::Node
[all...]
/inkscape/src/libvpsc/
H A Dgenerate-constraints.cpp39 struct Node;
40 struct CmpNodePos { bool operator()(const Node* u, const Node* v) const; };
42 typedef set<Node*,CmpNodePos> NodeSet;
44 struct Node { struct in namespace:vpsc
48 Node *firstAbove, *firstBelow;
50 Node(Variable *v, Rectangle *r, double p) : v(v),r(r),pos(p) { function in struct:vpsc::Node
55 ~Node() {
59 void addLeftNeighbour(Node *u) {
62 void addRightNeighbour(Node *
[all...]
/inkscape/src/libdepixelize/priv/
H A Dpixelgraph.h38 class Node class in class:Tracer::PixelGraph
75 typedef std::vector<Node>::iterator iterator;
76 typedef std::vector<Node>::const_iterator const_iterator;
77 typedef std::vector<Node>::reverse_iterator reverse_iterator;
78 typedef std::vector<Node>::const_reverse_iterator const_reverse_iterator;
87 ColumnView(std::vector<Node> &nodes, int width, int column) :
91 Node &operator[](int line);
94 std::vector<Node> &_nodes;
277 std::vector<Node> _nodes;
290 Node *des
[all...]
/inkscape/src/libavoid/
H A Dmakepath.cpp407 ANode Node, BestNode; // Temporary Node and BestNode local
436 Node = ANode(curr, timestamp++);
439 Node.g = 0;
440 Node.h = estimatedCost(lineRef, NULL, Node.inf->point,
442 Node.f = Node.g + Node.h;
448 Node
[all...]
H A Dorthogonal.cpp207 struct Node;
208 struct CmpNodePos { bool operator()(const Node* u, const Node* v) const; };
210 typedef std::set<Node*,CmpNodePos> NodeSet;
211 struct Node struct in namespace:Avoid
218 Node *firstAbove, *firstBelow;
221 Node(ShapeRef *v, const double p) function in struct:Avoid::Node
232 Node(VertInf *c, const double p) function in struct:Avoid::Node
243 Node(ShiftSegment *ss, const double p) function in struct:Avoid::Node
254 ~Node()
[all...]
/inkscape/src/ui/tool/
H A Dnode.h61 class Node;
114 Node *parent() { return _parent; }
122 Handle(NodeSharedData const &data, Geom::Point const &initial_pos, Node *parent);
138 Node *_parent; // the handle's lifetime does not extend beyond that of the parent node,
139 // so a naked pointer is OK and allows setting it during Node's construction
147 * Keeping the invariant on node moves is left to the %Node class.
154 friend class Node;
157 class Node : ListNode, public SelectableControlPoint { class in namespace:Inkscape::UI
165 Node(NodeSharedData const &data, Geom::Point const &pos);
203 Handle *handleToward(Node *t
[all...]
H A Dnode.cpp66 ControlPoint::ColorSet Node::node_colors = {
109 Handle::Handle(NodeSharedData const &data, Geom::Point const &initial_pos, Node *parent) :
139 Node *node_towards = _parent->nodeToward(this); // node in direction of this handle
140 Node *node_away = _parent->nodeAwayFrom(this); // node in the opposite direction
185 if (_parent->type() == NODE_SMOOTH && Node::_is_line_segment(_parent, node_away)) {
389 Node *n = static_cast<Node*>(*i);
394 Node *node_away = _parent->nodeAwayFrom(this);
395 if (_parent->type() == NODE_SMOOTH && Node::_is_line_segment(_parent, node_away)) {
581 Node function in class:Inkscape::UI::Node
[all...]

Completed in 4538 milliseconds