Lines Matching refs:Input
25 /** \class template<typename Traits, typename Iterator> PolicyIterator<mcld::Input>
26 * \brief PolicyIterator<mcld::Input> is a partially specific PolicyIterator
29 class PolicyIterator<mcld::Input, Traits, IteratorType> : public PolicyIteratorBase<Input, Traits, IteratorType>
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>()
106 bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
113 { return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
118 const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
125 { return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
129 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
136 { return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
141 const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
148 { return const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
151 { return iterator(&(BinaryTreeBase<Input>::m_Root.node)); }
158 const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node));
163 iterator it = iterator(BinaryTreeBase<Input>::m_Root.node.left);
168 { return iterator(BinaryTreeBase<Input>::m_Root.node.right); }
172 const_iterator it = const_iterator(BinaryTreeBase<Input>::m_Root.node.left);
177 { return const_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
186 BinaryTree& join(Pos position, const Input& value) {
187 node_type *node = BinaryTreeBase<Input>::createNode();
188 node->data = const_cast<Input*>(&value);
211 BinaryTreeBase<Input>::m_Root.summon(
212 pTree.BinaryTreeBase<Input>::m_Root);
213 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root);
221 * \brief InputTree is the input tree to contains all inputs from the
226 * @see Input
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)
