1*cdf0e10cSrcweir /************************************************************************* 2*cdf0e10cSrcweir * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 3*cdf0e10cSrcweir * 4*cdf0e10cSrcweir * Copyright 2000, 2010 Oracle and/or its affiliates. 5*cdf0e10cSrcweir * 6*cdf0e10cSrcweir * OpenOffice.org - a multi-platform office productivity suite 7*cdf0e10cSrcweir * 8*cdf0e10cSrcweir * This file is part of OpenOffice.org. 9*cdf0e10cSrcweir * 10*cdf0e10cSrcweir * OpenOffice.org is free software: you can redistribute it and/or modify 11*cdf0e10cSrcweir * it under the terms of the GNU Lesser General Public License version 3 12*cdf0e10cSrcweir * only, as published by the Free Software Foundation. 13*cdf0e10cSrcweir * 14*cdf0e10cSrcweir * OpenOffice.org is distributed in the hope that it will be useful, 15*cdf0e10cSrcweir * but WITHOUT ANY WARRANTY; without even the implied warranty of 16*cdf0e10cSrcweir * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17*cdf0e10cSrcweir * GNU Lesser General Public License version 3 for more details 18*cdf0e10cSrcweir * (a copy is included in the LICENSE file that accompanied this code). 19*cdf0e10cSrcweir * 20*cdf0e10cSrcweir * You should have received a copy of the GNU Lesser General Public License 21*cdf0e10cSrcweir * version 3 along with OpenOffice.org. If not, see 22*cdf0e10cSrcweir * <http://www.openoffice.org/license.html> 23*cdf0e10cSrcweir * for a copy of the LGPLv3 License. 24*cdf0e10cSrcweir * 25*cdf0e10cSrcweir ************************************************************************/ 26*cdf0e10cSrcweir 27*cdf0e10cSrcweir #ifndef SVX_TREE_VISITOR_HXX 28*cdf0e10cSrcweir #define SVX_TREE_VISITOR_HXX 29*cdf0e10cSrcweir 30*cdf0e10cSrcweir #include <stack> 31*cdf0e10cSrcweir 32*cdf0e10cSrcweir template< class ELEMENT, class NODEINFO, class PROCESSOR > 33*cdf0e10cSrcweir class TreeVisitor 34*cdf0e10cSrcweir { 35*cdf0e10cSrcweir public: 36*cdf0e10cSrcweir TreeVisitor( NODEINFO _nodeInfo ) 37*cdf0e10cSrcweir :m_visitedRoot( false ) 38*cdf0e10cSrcweir ,m_root() 39*cdf0e10cSrcweir ,m_current() 40*cdf0e10cSrcweir ,m_nodeInfo( _nodeInfo ) 41*cdf0e10cSrcweir { 42*cdf0e10cSrcweir } 43*cdf0e10cSrcweir 44*cdf0e10cSrcweir void process( const ELEMENT& _root, PROCESSOR& _processor ) 45*cdf0e10cSrcweir { 46*cdf0e10cSrcweir m_root = _root; 47*cdf0e10cSrcweir m_visitedRoot = false; 48*cdf0e10cSrcweir 49*cdf0e10cSrcweir while ( do_step() ) 50*cdf0e10cSrcweir _processor.process( m_current ); 51*cdf0e10cSrcweir } 52*cdf0e10cSrcweir 53*cdf0e10cSrcweir private: 54*cdf0e10cSrcweir bool do_step(); 55*cdf0e10cSrcweir 56*cdf0e10cSrcweir private: 57*cdf0e10cSrcweir bool m_visitedRoot; 58*cdf0e10cSrcweir ELEMENT m_root; 59*cdf0e10cSrcweir ELEMENT m_current; 60*cdf0e10cSrcweir const NODEINFO m_nodeInfo; 61*cdf0e10cSrcweir 62*cdf0e10cSrcweir ::std::stack< size_t > m_pathToCurrent; 63*cdf0e10cSrcweir ::std::stack< ELEMENT > m_currentAncestors; 64*cdf0e10cSrcweir }; 65*cdf0e10cSrcweir 66*cdf0e10cSrcweir template< class ELEMENT, class NODEINFO, class PROCESSOR > 67*cdf0e10cSrcweir bool TreeVisitor< ELEMENT, NODEINFO, PROCESSOR >::do_step() 68*cdf0e10cSrcweir { 69*cdf0e10cSrcweir if ( !m_visitedRoot ) 70*cdf0e10cSrcweir { 71*cdf0e10cSrcweir m_current = m_root; 72*cdf0e10cSrcweir m_visitedRoot = true; 73*cdf0e10cSrcweir return true; 74*cdf0e10cSrcweir } 75*cdf0e10cSrcweir 76*cdf0e10cSrcweir // can we step down from the current node? 77*cdf0e10cSrcweir size_t childCount = m_nodeInfo.childCount( m_current ); 78*cdf0e10cSrcweir if ( childCount ) 79*cdf0e10cSrcweir { 80*cdf0e10cSrcweir m_currentAncestors.push( m_current ); 81*cdf0e10cSrcweir m_current = m_nodeInfo.getChild( m_current, 0 ); 82*cdf0e10cSrcweir m_pathToCurrent.push( 0 ); 83*cdf0e10cSrcweir return true; 84*cdf0e10cSrcweir } 85*cdf0e10cSrcweir 86*cdf0e10cSrcweir // is there a right sibling of the current node? 87*cdf0e10cSrcweir while ( !m_pathToCurrent.empty() ) 88*cdf0e10cSrcweir { 89*cdf0e10cSrcweir const ELEMENT& currentParent = m_currentAncestors.top(); 90*cdf0e10cSrcweir childCount = m_nodeInfo.childCount( currentParent ); 91*cdf0e10cSrcweir 92*cdf0e10cSrcweir size_t currentChildPos = m_pathToCurrent.top(); 93*cdf0e10cSrcweir if ( ++currentChildPos < childCount ) 94*cdf0e10cSrcweir { 95*cdf0e10cSrcweir // yes there is 96*cdf0e10cSrcweir m_pathToCurrent.top() = currentChildPos; 97*cdf0e10cSrcweir m_current = m_nodeInfo.getChild( currentParent, currentChildPos ); 98*cdf0e10cSrcweir return true; 99*cdf0e10cSrcweir } 100*cdf0e10cSrcweir 101*cdf0e10cSrcweir // no there isn't => step up 102*cdf0e10cSrcweir m_currentAncestors.pop(); 103*cdf0e10cSrcweir m_pathToCurrent.pop(); 104*cdf0e10cSrcweir } 105*cdf0e10cSrcweir 106*cdf0e10cSrcweir return false; 107*cdf0e10cSrcweir } 108*cdf0e10cSrcweir 109*cdf0e10cSrcweir #endif // SVX_TREE_VISITOR_HXX 110