Lines Matching refs:TreeIteratorBase
176 BinaryTree& join(TreeIteratorBase& pPosition, const Input& value) { in join()
181 pPosition.hook<TreeIteratorBase::Leftward>(node); in join()
194 BinaryTree& merge(TreeIteratorBase& pPosition, BinaryTree& pTree) { in merge()
222 Inclusive = TreeIteratorBase::Leftward,
223 Positional = TreeIteratorBase::Rightward
238 virtual void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const = 0;
239 virtual void move(TreeIteratorBase& pNode) const = 0;
247 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const { in connect()
251 void move(TreeIteratorBase& pNode) const { pNode.move<Positional>(); } in move()
258 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const { in connect()
262 void move(TreeIteratorBase& pNode) const { pNode.move<Inclusive>(); } in move()
274 InputTree& enterGroup(TreeIteratorBase pRoot);
277 InputTree& insert(TreeIteratorBase pRoot, Input& pInput);
279 InputTree& merge(TreeIteratorBase pRoot,
283 InputTree& insert(TreeIteratorBase pRoot, const Mover& pMover, Input& pInput);
285 InputTree& enterGroup(TreeIteratorBase pRoot, const Mover& pMover);
301 mcld::InputTree& mcld::InputTree::enterGroup(mcld::TreeIteratorBase pRoot) { in enterGroup()
305 pRoot.hook<TreeIteratorBase::Leftward>(node); in enterGroup()
313 mcld::InputTree& mcld::InputTree::insert(mcld::TreeIteratorBase pRoot, in insert()
319 pRoot.hook<TreeIteratorBase::Leftward>(node); in insert()