Lines Matching defs:Node

61 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 {
165 Node(NodeSharedData const &data, Geom::Point const &pos);
203 Handle *handleToward(Node *to);
209 Node *nodeToward(Handle *h);
215 Handle *handleAwayFrom(Node *to);
221 Node *nodeAwayFrom(Handle *h);
254 Node(Node const &);
264 Node *_next();
265 Node const *_next() const;
266 Node *_prev();
267 Node const *_prev() const;
274 static bool _is_line_segment(Node *first, Node *second);
279 Handle _front; ///< Node handle in the backward direction of the path
280 Handle _back; ///< Node handle in the forward direction of the path
287 friend class NodeIterator<Node>;
288 friend class NodeIterator<Node const>;
368 typedef Node &reference;
369 typedef Node const &const_reference;
370 typedef Node *pointer;
371 typedef Node const *const_pointer;
372 typedef Node value_type;
420 iterator insert(iterator pos, Node *x);
431 void push_front(Node *x) { insert(begin(), x); }
433 void push_back(Node *x) { insert(end(), x); }
444 Node &front() { return *static_cast<Node*>(ln_next); }
445 Node &back() { return *static_cast<Node*>(ln_prev); }
451 static iterator get_iterator(Node *n) { return iterator(n); }
452 static const_iterator get_iterator(Node const *n) { return const_iterator(n); }
453 static NodeList &get(Node *n);
463 friend class Node;
465 friend class NodeIterator<Node>;
466 friend class NodeIterator<Node const>;
484 friend class Node;
490 // define inline Handle funcs after definition of Node
506 inline PathManipulator &Node::_pm() {
510 inline PathManipulator &Node::_pm() const {