1*cdf0e10cSrcweir /************************************************************************* 2*cdf0e10cSrcweir * 3*cdf0e10cSrcweir * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4*cdf0e10cSrcweir * 5*cdf0e10cSrcweir * Copyright 2000, 2010 Oracle and/or its affiliates. 6*cdf0e10cSrcweir * 7*cdf0e10cSrcweir * OpenOffice.org - a multi-platform office productivity suite 8*cdf0e10cSrcweir * 9*cdf0e10cSrcweir * This file is part of OpenOffice.org. 10*cdf0e10cSrcweir * 11*cdf0e10cSrcweir * OpenOffice.org is free software: you can redistribute it and/or modify 12*cdf0e10cSrcweir * it under the terms of the GNU Lesser General Public License version 3 13*cdf0e10cSrcweir * only, as published by the Free Software Foundation. 14*cdf0e10cSrcweir * 15*cdf0e10cSrcweir * OpenOffice.org is distributed in the hope that it will be useful, 16*cdf0e10cSrcweir * but WITHOUT ANY WARRANTY; without even the implied warranty of 17*cdf0e10cSrcweir * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 18*cdf0e10cSrcweir * GNU Lesser General Public License version 3 for more details 19*cdf0e10cSrcweir * (a copy is included in the LICENSE file that accompanied this code). 20*cdf0e10cSrcweir * 21*cdf0e10cSrcweir * You should have received a copy of the GNU Lesser General Public License 22*cdf0e10cSrcweir * version 3 along with OpenOffice.org. If not, see 23*cdf0e10cSrcweir * <http://www.openoffice.org/license.html> 24*cdf0e10cSrcweir * for a copy of the LGPLv3 License. 25*cdf0e10cSrcweir * 26*cdf0e10cSrcweir ************************************************************************/ 27*cdf0e10cSrcweir 28*cdf0e10cSrcweir #include <precomp.h> 29*cdf0e10cSrcweir #include <toolkit/out_node.hxx> 30*cdf0e10cSrcweir 31*cdf0e10cSrcweir 32*cdf0e10cSrcweir // NOT FULLY DEFINED SERVICES 33*cdf0e10cSrcweir #include <algorithm> 34*cdf0e10cSrcweir 35*cdf0e10cSrcweir 36*cdf0e10cSrcweir namespace output 37*cdf0e10cSrcweir { 38*cdf0e10cSrcweir 39*cdf0e10cSrcweir 40*cdf0e10cSrcweir namespace 41*cdf0e10cSrcweir { 42*cdf0e10cSrcweir 43*cdf0e10cSrcweir struct Less_NodePtr 44*cdf0e10cSrcweir { 45*cdf0e10cSrcweir bool operator()( 46*cdf0e10cSrcweir Node * p1, 47*cdf0e10cSrcweir Node * p2 ) const 48*cdf0e10cSrcweir { return p1->Name() < p2->Name(); } 49*cdf0e10cSrcweir }; 50*cdf0e10cSrcweir 51*cdf0e10cSrcweir struct Less_NodePtr C_Less_NodePtr; 52*cdf0e10cSrcweir 53*cdf0e10cSrcweir 54*cdf0e10cSrcweir Node C_aNullNode(Node::null_object); 55*cdf0e10cSrcweir 56*cdf0e10cSrcweir 57*cdf0e10cSrcweir } // namepace anonymous 58*cdf0e10cSrcweir 59*cdf0e10cSrcweir 60*cdf0e10cSrcweir //********************** Node ***************************// 61*cdf0e10cSrcweir 62*cdf0e10cSrcweir 63*cdf0e10cSrcweir Node::Node() 64*cdf0e10cSrcweir : sName(), 65*cdf0e10cSrcweir pParent(0), 66*cdf0e10cSrcweir aChildren(), 67*cdf0e10cSrcweir nDepth(0), 68*cdf0e10cSrcweir nNameRoomId(0) 69*cdf0e10cSrcweir { 70*cdf0e10cSrcweir } 71*cdf0e10cSrcweir 72*cdf0e10cSrcweir Node::Node( E_NullObject ) 73*cdf0e10cSrcweir : sName(), 74*cdf0e10cSrcweir pParent(0), 75*cdf0e10cSrcweir aChildren(), 76*cdf0e10cSrcweir nDepth(-1), 77*cdf0e10cSrcweir nNameRoomId(0) 78*cdf0e10cSrcweir { 79*cdf0e10cSrcweir } 80*cdf0e10cSrcweir 81*cdf0e10cSrcweir Node::Node( const String & i_name, 82*cdf0e10cSrcweir Node & i_parent ) 83*cdf0e10cSrcweir : sName(i_name), 84*cdf0e10cSrcweir pParent(&i_parent), 85*cdf0e10cSrcweir aChildren(), 86*cdf0e10cSrcweir nDepth(i_parent.Depth()+1), 87*cdf0e10cSrcweir nNameRoomId(0) 88*cdf0e10cSrcweir { 89*cdf0e10cSrcweir } 90*cdf0e10cSrcweir 91*cdf0e10cSrcweir Node::~Node() 92*cdf0e10cSrcweir { 93*cdf0e10cSrcweir for ( List::iterator it = aChildren.begin(); 94*cdf0e10cSrcweir it != aChildren.end(); 95*cdf0e10cSrcweir ++it ) 96*cdf0e10cSrcweir { 97*cdf0e10cSrcweir delete *it; 98*cdf0e10cSrcweir } 99*cdf0e10cSrcweir } 100*cdf0e10cSrcweir 101*cdf0e10cSrcweir Node & 102*cdf0e10cSrcweir Node::Provide_Child( const String & i_name ) 103*cdf0e10cSrcweir { 104*cdf0e10cSrcweir Node * 105*cdf0e10cSrcweir ret = find_Child(i_name); 106*cdf0e10cSrcweir if (ret != 0) 107*cdf0e10cSrcweir return *ret; 108*cdf0e10cSrcweir return add_Child(i_name); 109*cdf0e10cSrcweir } 110*cdf0e10cSrcweir 111*cdf0e10cSrcweir void 112*cdf0e10cSrcweir Node::Get_Path( StreamStr & o_result, 113*cdf0e10cSrcweir intt i_maxDepth ) const 114*cdf0e10cSrcweir { 115*cdf0e10cSrcweir // Intentionally 'i_maxDepth != 0', so max_Depth == -1 sets no limit: 116*cdf0e10cSrcweir if (i_maxDepth != 0) 117*cdf0e10cSrcweir { 118*cdf0e10cSrcweir if (pParent != 0) 119*cdf0e10cSrcweir pParent->Get_Path(o_result, i_maxDepth-1); 120*cdf0e10cSrcweir o_result << sName << '/'; 121*cdf0e10cSrcweir } 122*cdf0e10cSrcweir } 123*cdf0e10cSrcweir 124*cdf0e10cSrcweir void 125*cdf0e10cSrcweir Node::Get_Chain( StringVector & o_result, 126*cdf0e10cSrcweir intt i_maxDepth ) const 127*cdf0e10cSrcweir { 128*cdf0e10cSrcweir if (i_maxDepth != 0) 129*cdf0e10cSrcweir { 130*cdf0e10cSrcweir // This is called also for the toplevel Node, 131*cdf0e10cSrcweir // but there happens nothing: 132*cdf0e10cSrcweir if (pParent != 0) 133*cdf0e10cSrcweir { 134*cdf0e10cSrcweir pParent->Get_Chain(o_result, i_maxDepth-1); 135*cdf0e10cSrcweir o_result.push_back(sName); 136*cdf0e10cSrcweir } 137*cdf0e10cSrcweir } 138*cdf0e10cSrcweir } 139*cdf0e10cSrcweir 140*cdf0e10cSrcweir Node * 141*cdf0e10cSrcweir Node::find_Child( const String & i_name ) 142*cdf0e10cSrcweir { 143*cdf0e10cSrcweir Node aSearch; 144*cdf0e10cSrcweir aSearch.sName = i_name; 145*cdf0e10cSrcweir 146*cdf0e10cSrcweir List::const_iterator 147*cdf0e10cSrcweir ret = std::lower_bound( aChildren.begin(), 148*cdf0e10cSrcweir aChildren.end(), 149*cdf0e10cSrcweir &aSearch, 150*cdf0e10cSrcweir C_Less_NodePtr ); 151*cdf0e10cSrcweir if ( ret != aChildren.end() ? (*ret)->Name() == i_name : false ) 152*cdf0e10cSrcweir return *ret; 153*cdf0e10cSrcweir 154*cdf0e10cSrcweir return 0; 155*cdf0e10cSrcweir } 156*cdf0e10cSrcweir 157*cdf0e10cSrcweir Node & 158*cdf0e10cSrcweir Node::add_Child( const String & i_name ) 159*cdf0e10cSrcweir { 160*cdf0e10cSrcweir DYN Node * 161*cdf0e10cSrcweir pNew = new Node(i_name,*this); 162*cdf0e10cSrcweir aChildren.insert( std::lower_bound( aChildren.begin(), 163*cdf0e10cSrcweir aChildren.end(), 164*cdf0e10cSrcweir pNew, 165*cdf0e10cSrcweir C_Less_NodePtr ), 166*cdf0e10cSrcweir pNew ); 167*cdf0e10cSrcweir return *pNew; 168*cdf0e10cSrcweir } 169*cdf0e10cSrcweir 170*cdf0e10cSrcweir Node & 171*cdf0e10cSrcweir Node::provide_Child( StringVector::const_iterator i_next, 172*cdf0e10cSrcweir StringVector::const_iterator i_end ) 173*cdf0e10cSrcweir { 174*cdf0e10cSrcweir if (i_next == i_end) 175*cdf0e10cSrcweir return *this; 176*cdf0e10cSrcweir return Provide_Child(*i_next).provide_Child(i_next+1,i_end); 177*cdf0e10cSrcweir } 178*cdf0e10cSrcweir 179*cdf0e10cSrcweir 180*cdf0e10cSrcweir 181*cdf0e10cSrcweir 182*cdf0e10cSrcweir Node & 183*cdf0e10cSrcweir Node::Null_() 184*cdf0e10cSrcweir { 185*cdf0e10cSrcweir return C_aNullNode; 186*cdf0e10cSrcweir } 187*cdf0e10cSrcweir 188*cdf0e10cSrcweir 189*cdf0e10cSrcweir } // namespace output 190