diff options
Diffstat (limited to 'autodoc/source/display/toolkit/out_node.cxx')
| -rw-r--r-- | autodoc/source/display/toolkit/out_node.cxx | 192 |
1 files changed, 0 insertions, 192 deletions
diff --git a/autodoc/source/display/toolkit/out_node.cxx b/autodoc/source/display/toolkit/out_node.cxx deleted file mode 100644 index ad6a7f07..00000000 --- a/autodoc/source/display/toolkit/out_node.cxx +++ /dev/null @@ -1,192 +0,0 @@ -/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ -/************************************************************************* - * - * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. - * - * Copyright 2000, 2010 Oracle and/or its affiliates. - * - * OpenOffice.org - a multi-platform office productivity suite - * - * This file is part of OpenOffice.org. - * - * OpenOffice.org is free software: you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License version 3 - * only, as published by the Free Software Foundation. - * - * OpenOffice.org is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License version 3 for more details - * (a copy is included in the LICENSE file that accompanied this code). - * - * You should have received a copy of the GNU Lesser General Public License - * version 3 along with OpenOffice.org. If not, see - * <http://www.openoffice.org/license.html> - * for a copy of the LGPLv3 License. - * - ************************************************************************/ - -#include <precomp.h> -#include <toolkit/out_node.hxx> - - -// NOT FULLY DEFINED SERVICES -#include <algorithm> - - -namespace output -{ - - -namespace -{ - -struct Less_NodePtr -{ - bool operator()( - Node * p1, - Node * p2 ) const - { return p1->Name() < p2->Name(); } -}; - -struct Less_NodePtr C_Less_NodePtr; - - -Node C_aNullNode(Node::null_object); - - -} // namepace anonymous - - -//********************** Node ***************************// - - -Node::Node() - : sName(), - pParent(0), - aChildren(), - nDepth(0), - nNameRoomId(0) -{ -} - -Node::Node( E_NullObject ) - : sName(), - pParent(0), - aChildren(), - nDepth(-1), - nNameRoomId(0) -{ -} - -Node::Node( const String & i_name, - Node & i_parent ) - : sName(i_name), - pParent(&i_parent), - aChildren(), - nDepth(i_parent.Depth()+1), - nNameRoomId(0) -{ -} - -Node::~Node() -{ - for ( List::iterator it = aChildren.begin(); - it != aChildren.end(); - ++it ) - { - delete *it; - } -} - -Node & -Node::Provide_Child( const String & i_name ) -{ - Node * - ret = find_Child(i_name); - if (ret != 0) - return *ret; - return add_Child(i_name); -} - -void -Node::Get_Path( StreamStr & o_result, - intt i_maxDepth ) const -{ - // Intentionally 'i_maxDepth != 0', so max_Depth == -1 sets no limit: - if (i_maxDepth != 0) - { - if (pParent != 0) - pParent->Get_Path(o_result, i_maxDepth-1); - o_result << sName << '/'; - } -} - -void -Node::Get_Chain( StringVector & o_result, - intt i_maxDepth ) const -{ - if (i_maxDepth != 0) - { - // This is called also for the toplevel Node, - // but there happens nothing: - if (pParent != 0) - { - pParent->Get_Chain(o_result, i_maxDepth-1); - o_result.push_back(sName); - } - } -} - -Node * -Node::find_Child( const String & i_name ) -{ - Node aSearch; - aSearch.sName = i_name; - - List::const_iterator - ret = std::lower_bound( aChildren.begin(), - aChildren.end(), - &aSearch, - C_Less_NodePtr ); - if ( ret != aChildren.end() ? (*ret)->Name() == i_name : false ) - return *ret; - - return 0; -} - -Node & -Node::add_Child( const String & i_name ) -{ - DYN Node * - pNew = new Node(i_name,*this); - aChildren.insert( std::lower_bound( aChildren.begin(), - aChildren.end(), - pNew, - C_Less_NodePtr ), - pNew ); - return *pNew; -} - -Node & -Node::provide_Child( StringVector::const_iterator i_next, - StringVector::const_iterator i_end ) -{ - if (i_next == i_end) - return *this; - return Provide_Child(*i_next).provide_Child(i_next+1,i_end); -} - - - - -Node & -Node::Null_() -{ - return C_aNullNode; -} - - -} // namespace output - -/* vim:set shiftwidth=4 softtabstop=4 expandtab: */ |