Searched refs:Tree_iterator (Results 1 – 3 of 3) sorted by relevance
| /dports/math/cgal/CGAL-5.3/include/CGAL/Partition_2/ |
| H A D | Rotation_tree_node_2.h | 47 typedef typename Tree::iterator Tree_iterator; typedef
48 typedef std::pair<Tree_iterator, bool> Node_ref;
65 Tree_iterator left_sibling() const in left_sibling()
71 Tree_iterator right_sibling() const in right_sibling()
77 Tree_iterator parent() const in parent()
83 Tree_iterator rightmost_child() const in rightmost_child()
86 void set_left_sibling(Tree_iterator ls) in set_left_sibling()
97 void set_right_sibling(Tree_iterator rs) in set_right_sibling()
108 void set_parent(Tree_iterator p) in set_parent()
119 void set_rightmost_child(Tree_iterator c) in set_rightmost_child()
|
| H A D | Vertex_visibility_graph_2.h | 87 typedef typename Tree::iterator Tree_iterator; typedef
140 std::stack<Tree_iterator, std::list<Tree_iterator> > stack; in build()
144 Tree_iterator p, p_r, q; in build()
145 Tree_iterator z; in build()
343 bool left_turn_to_parent(Tree_iterator p, Tree_iterator q, Tree& tree);
391 void handle(Tree_iterator p, Tree_iterator q, const Polygon& polygon,
|
| H A D | Vertex_visibility_graph_2_impl.h | 219 Tree_iterator p, in left_turn_to_parent()
220 Tree_iterator q, in left_turn_to_parent()
618 void Vertex_visibility_graph_2<Traits>::handle(Tree_iterator p, in handle()
619 Tree_iterator q, in handle()
|