29 class PolicyIterator<mcld::Input, Traits, IteratorType> : public PolicyIteratorBase<Input, Traits, …
32   typedef PolicyIterator<Input, Traits, IteratorType> Self;
33   typedef PolicyIteratorBase<Input, Traits, IteratorType> Base;
34   typedef PolicyIterator<Input, typename Traits::nonconst_traits, IteratorType> iterator;
35   typedef PolicyIterator<Input, typename Traits::const_traits, IteratorType>    const_iterator;
71 class BinaryTree<Input> : public BinaryTreeBase<Input>
76   typedef Input              value_type;
82   typedef BinaryTree<Input>  Self;
97   : BinaryTreeBase<Input>()  in BinaryTree()
106      bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);  in bfs_begin()
113   { return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }  in bfs_end()
118                     const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);  in bfs_begin()
125   { return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }  in bfs_end()
129     dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);  in dfs_begin()
136   { return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }  in dfs_end()
141                     const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);  in dfs_begin()
148   { return const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }  in dfs_end()
151   { return iterator(&(BinaryTreeBase<Input>::m_Root.node)); }  in root()
158                     const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node));  in root()
163     iterator it = iterator(BinaryTreeBase<Input>::m_Root.node.left);  in begin()
168   { return iterator(BinaryTreeBase<Input>::m_Root.node.right); }  in end()
172     const_iterator it = const_iterator(BinaryTreeBase<Input>::m_Root.node.left);  in begin()
177   { return const_iterator(BinaryTreeBase<Input>::m_Root.node.right); }  in end()
186   BinaryTree& join(Pos position, const Input& value) {  in join()
187     node_type *node = BinaryTreeBase<Input>::createNode();  in join()
188     node->data = const_cast<Input*>(&value);  in join()
211       BinaryTreeBase<Input>::m_Root.summon(  in merge()
212                                    pTree.BinaryTreeBase<Input>::m_Root);  in merge()
213       BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root);  in merge()
228 class InputTree : public BinaryTree<Input>
231   typedef BinaryTree<Input> BinTreeTy;
239   typedef BinaryTree<Input>::iterator       iterator;
240   typedef BinaryTree<Input>::const_iterator const_iterator;
296                     Input& pInput);
304                     Input& pInput);
339 	                                 mcld::Input& pInput)  in insert()