Lines Matching refs:m_vChildren
374 return (m_vChildren.size() > 0); in hasChildren()
379 return new std::vector< const BufferNode* >( m_vChildren ); in getChildren()
411 if (m_vChildren.size() > 0) in getFirstChild()
413 rc = (BufferNode*)m_vChildren.front(); in getFirstChild()
452 m_vChildren.push_back( pChild ); in addChild()
456 std::vector< const BufferNode* >::iterator ii = m_vChildren.begin(); in addChild()
458 m_vChildren.insert(ii, pChild); in addChild()
520 std::vector< const BufferNode* >::iterator ii = m_vChildren.begin(); in removeChild()
522 for( ; ii != m_vChildren.end() ; ++ii ) in removeChild()
526 m_vChildren.erase( ii ); in removeChild()
562 std::vector< const BufferNode * >::const_iterator ii = m_vChildren.begin(); in indexOfChild()
564 for( ; ii != m_vChildren.end() ; ++ii ) in indexOfChild()
611 if (nIndex < ((sal_Int32)m_vChildren.size()) && nIndex >= 0) in childAt()
613 rc = (BufferNode*)m_vChildren[nIndex]; in childAt()
697 std::vector< const BufferNode* >::const_iterator ii = m_vChildren.begin(); in isAncestor()
699 for( ; ii != m_vChildren.end() ; ++ii ) in isAncestor()
884 std::vector< const BufferNode* >::const_iterator ii = m_vChildren.begin(); in notifyBranch()
886 for( ; ii != m_vChildren.end() ; ++ii ) in notifyBranch()
1066 std::vector< const BufferNode* >::const_iterator ii = m_vChildren.begin(); in isECInSubTreeIncluded()
1068 for( ; ii != m_vChildren.end() ; ++ii ) in isECInSubTreeIncluded()
1166 std::vector< const BufferNode* >::const_iterator ii = m_vChildren.begin(); in isBlockerInSubTreeIncluded()
1168 for( ; ii != m_vChildren.end() ; ++ii ) in isBlockerInSubTreeIncluded()
1221 std::vector< const BufferNode* >::const_iterator ii = m_vChildren.begin(); in getNextChild()
1222 for( ; ii != m_vChildren.end() ; ++ii ) in getNextChild()
1266 std::vector< const BufferNode* >::const_iterator ii = m_vChildren.begin(); in freeAllChildren()
1267 for( ; ii != m_vChildren.end() ; ++ii ) in freeAllChildren()
1274 m_vChildren.clear(); in freeAllChildren()