Home
last modified time | relevance | path

Searched refs:tree_node (Results 1 – 13 of 13) sorted by relevance

/third_party/boost/boost/spirit/home/classic/tree/
Dparse_tree_utils.hpp29 tree_node<T> const &
30 get_first_leaf (tree_node<T> const &node);
41 find_node (tree_node<T> const &node, parser_id node_to_search,
42 tree_node<T> const **found_node);
53 get_node_range (tree_node<T> const &node, parser_id node_to_search,
54 std::pair<typename tree_node<T>::const_tree_iterator,
55 typename tree_node<T>::const_tree_iterator> &nodes);
Dcommon.hpp46 void swap(tree_node<T>& a, tree_node<T>& b);
57 struct tree_node struct
62 typedef std::allocator<tree_node<T> > allocator_type; argument
64 typedef boost::pool_allocator<tree_node<T> > allocator_type; argument
66 typedef boost::fast_pool_allocator<tree_node<T> > allocator_type; argument
70 typedef std::vector<tree_node<T>, allocator_type> children_t; argument
72 typedef std::list<tree_node<T>, allocator_type> children_t; argument
81 tree_node() in tree_node() argument
86 explicit tree_node(T const& v) in tree_node() argument
91 tree_node(T const& v, children_t const& c) in tree_node() argument
[all …]
Dcommon_fwd.hpp19 struct tree_node;
Dtypeof.hpp25 BOOST_TYPEOF_REGISTER_TEMPLATE(BOOST_SPIRIT_CLASSIC_NS::tree_node,1)
/third_party/boost/boost/spirit/home/classic/tree/impl/
Dparse_tree_utils.ipp26 inline tree_node<T> const &
27 get_first_leaf (tree_node<T> const &node)
41 find_node (tree_node<T> const &node, parser_id node_to_search,
42 tree_node<T> const **found_node)
49 typedef typename tree_node<T>::const_tree_iterator const_tree_iterator;
71 get_node_range (typename tree_node<T>::const_tree_iterator const &start,
73 std::pair<typename tree_node<T>::const_tree_iterator,
74 typename tree_node<T>::const_tree_iterator> &nodes)
77 tree_node<T> const &node = *start;
96 typedef typename tree_node<T>::const_tree_iterator const_tree_iterator;
[all …]
/third_party/boost/libs/iostreams/doc/tree/
Dtree.js92 return state == tree_node.expanded ?
94 state == tree_node.collapsed ?
119 if (this.state == tree_node.neutral)
120 this.state = tree_node.collapsed;
123 k = new tree_node(text_or_node, link_or_hide);
186 this.state == tree_node.collapsed &&
204 (this.state == tree_node.expanded) )
209 this.state == tree_node.expanded ?
210 tree_node.collapsed :
211 tree_node.expanded;
[all …]
/third_party/boost/libs/container/example/
Ddoc_recursive_containers.cpp45 struct tree_node struct
51 list<tree_node> children_; argument
52 list<tree_node>::iterator selected_child_; argument
65 tree_node root; in main()
/third_party/boost/boost/intrusive/detail/
Dtree_node.hpp32 struct tree_node struct
34 typedef typename pointer_rebind<VoidPointer, tree_node>::type node_ptr; argument
42 typedef tree_node<VoidPointer> node;
/third_party/boost/tools/quickbook/src/
Dtree.hpp19 template <typename T> struct tree_node;
46 template <typename T> struct tree_node : tree_node_base struct
Dboostbook_chunker.hpp18 struct chunk : tree_node<chunk>
Dxml_parse.hpp26 struct xml_element : tree_node<xml_element>
/third_party/boost/boost/container/detail/
Dtree.hpp125 struct tree_node struct
134 typedef tree_node< T, VoidPointer
171 BOOST_CONTAINER_FORCEINLINE ~tree_node() in ~tree_node() argument
220 struct iiterator_node_value_type< tree_node<T, VoidPointer, tree_type_value, OptimizeSize> > {
323 typedef typename dtl::tree_node
441 key_from(const tree_node<T, VoidPointer, tree_type_value, OptimizeSize> &n) in key_from()
/third_party/boost/libs/spirit/classic/test/
Dtree_tests.cpp330 typedef tree_node<node_t> tree_t; in operator ()()