#include "CInOrderBinaryTreeIterator.h" namespace CoreFW { template < typename ClassType > CInOrderBinaryTreeIterator<ClassType>::CInOrderBinaryTreeIterator() { } template < typename ClassType > CInOrderBinaryTreeIterator<ClassType>::CInOrderBinaryTreeIterator( CSortedBinaryTree<ClassType> &SortedBinaryTree ) : ABinaryTreeIterator( SortedBinaryTree ) { } template < typename ClassType > CInOrderBinaryTreeIterator<ClassType>::~CInOrderBinaryTreeIterator() { } template < typename ClassType > void CInOrderBinaryTreeIterator<ClassType>::PushLeftSubTreeNodes( CBinaryTreeNode<ClassType> *pSubTreeRootNode ) { while( pSubTreeRootNode != NULL ) { m_BinaryTreeNodeStack.Push( pSubTreeRootNode ) ; pSubTreeRootNode = pSubTreeRootNode->m_pLeftChildNode ; } } template < typename ClassType > bool CInOrderBinaryTreeIterator<ClassType>::Begin() { m_pSortedBinaryTree->m_pBinaryTreeSyncObject->Lock() ; { if( m_pSortedBinaryTree->m_pRootNode == NULL ) { m_pSortedBinaryTree->m_pBinaryTreeSyncObject->Unlock() ; return false ; } PushLeftSubTreeNodes( m_pSortedBinaryTree->m_pRootNode ) ; } m_pSortedBinaryTree->m_pBinaryTreeSyncObject->Unlock() ; return true ; } template < typename ClassType > ABinaryTreeIterator<ClassType>& CInOrderBinaryTreeIterator<ClassType>::operator++() { CBinaryTreeNode<ClassType> *pBinaryTreeNode = NULL ; m_pSortedBinaryTree->m_pBinaryTreeSyncObject->Lock() ; { if( IsEnd() ) { m_pSortedBinaryTree->m_pBinaryTreeSyncObject->Unlock() ; return *this ; } pBinaryTreeNode = m_BinaryTreeNodeStack.Pop() ; PushLeftSubTreeNodes( pBinaryTreeNode->m_pRightChildNode ) ; } m_pSortedBinaryTree->m_pBinaryTreeSyncObject->Unlock() ; return *this ; } template < typename ClassType > ClassType* CInOrderBinaryTreeIterator<ClassType>::operator*() { ClassType *pClassTypeObject = NULL ; CBinaryTreeNode<ClassType> *pBinaryTreeNode = NULL ; m_pSortedBinaryTree->m_pBinaryTreeSyncObject->Lock() ; { if( IsEnd() ) { m_pSortedBinaryTree->m_pBinaryTreeSyncObject->Unlock() ; return NULL ; } pBinaryTreeNode = m_BinaryTreeNodeStack.Pop( false ) ; pClassTypeObject = pBinaryTreeNode->m_pDataObject ; } m_pSortedBinaryTree->m_pBinaryTreeSyncObject->Unlock() ; return pClassTypeObject ; } template < typename ClassType > bool CInOrderBinaryTreeIterator<ClassType>::IsEnd() { bool bIsEnd = false ; m_pSortedBinaryTree->m_pBinaryTreeSyncObject->Lock() ; { bIsEnd = m_BinaryTreeNodeStack.IsEmpty() ; } m_pSortedBinaryTree->m_pBinaryTreeSyncObject->Unlock() ; return bIsEnd ; } }
By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.
If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.
This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)