Searched refs:pTree (Results 1 – 5 of 5) sorted by relevance
29 InputTree& pTree) in merge() argument31 if (this == &pTree) in merge()34 if (!pTree.empty()) { in merge()35 pConnector.connect(pPosition, iterator(pTree.m_Root.node.right)); in merge()37 pTree.BinaryTreeBase<Input>::m_Root); in merge()38 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root); in merge()39 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node; in merge()
463 BinaryTree& merge(Pos position, BinaryTree& pTree) { in merge() argument464 if (this == &pTree) in merge()467 if (!pTree.empty()) { in merge()469 const_cast<const NodeBase*>(pTree.m_Root.node.left)); in merge()471 pTree.BinaryTreeBase<DataType>::m_Root); in merge()472 BinaryTreeBase<DataType>::m_Root.delegate(pTree.m_Root); in merge()473 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node; in merge()
804 void XML_freeTree(XML_TREE * pTree) in XML_freeTree() argument809 if (NULL == pTree) in XML_freeTree()812 p = pTree->brother; in XML_freeTree()820 if (NULL != pTree->child) in XML_freeTree()821 XML_freeTree(pTree->child); in XML_freeTree()823 pa = pTree->attr; in XML_freeTree()829 xml_free(pTree); in XML_freeTree()
163 void XML_freeTree(XML_TREE * pTree);
151 InputTree& pTree);