Files
libreoffice/autodoc/source/display/inc/toolkit/out_node.hxx
Rüdiger Timm 59fd624c3b INTEGRATION: CWS ooo19126 (1.1.132); FILE MERGED
2005/09/05 13:11:17 rt 1.1.132.1: #i54170# Change license header: remove SISSL
2005-09-07 16:58:39 +00:00

137 lines
4.7 KiB
C++

/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: out_node.hxx,v $
*
* $Revision: 1.2 $
*
* last change: $Author: rt $ $Date: 2005-09-07 17:57:39 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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 for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
#ifndef ADC_DISPLAY_OUT_NODE_HXX
#define ADC_DISPLAY_OUT_NODE_HXX
// USED SERVICES
// BASE CLASSES
// COMPONENTS
// PARAMETERS
namespace output
{
/** @resp
@descr
*/
class Node
{
public:
typedef std::vector< Node* > List;
typedef UINT32 relative_id;
// LIFECYCLE
enum E_NullObject { null_object };
Node();
explicit Node(
E_NullObject );
Node(
const String & i_name,
Node & i_parent );
~Node();
// OPERATORS
bool operator==(
const Node & i_node ) const
{ return pParent == i_node.pParent AND sName == i_node.sName; }
bool operator!=(
const Node & i_node ) const
{ return NOT operator==(i_node); }
// OPERATIONS
Node & Provide_Child(
const String & i_name );
Node & Provide_Child(
const StringVector &
i_path )
{ return provide_Child(i_path.begin(), i_path.end()); }
// INQUIRY
intt Depth() const { return nDepth; }
const String & Name() const { return sName; }
relative_id RelatedNameRoom() const { return nNameRoomId; }
/// @return No delimiter at start, with delimiter at end.
void Get_Path(
StreamStr & o_result,
intt i_maxDepth = -1 ) const;
void Get_Chain(
StringVector & o_result,
intt i_maxDepth = -1 ) const;
// ACCESS
void Set_RelatedNameRoom(
relative_id i_nNameRoomId )
{ nNameRoomId = i_nNameRoomId; }
Node * Parent() { return pParent; }
Node * Child(
const String & i_name )
{ return find_Child(i_name); }
List & Children() { return aChildren; }
/// @return a reference to a Node with Depth() == -1.
static Node & Null_();
private:
// Local
Node * find_Child(
const String & i_name );
Node & add_Child(
const String & i_name );
Node & provide_Child(
StringVector::const_iterator
i_next,
StringVector::const_iterator
i_end );
// Data
String sName;
Node * pParent;
List aChildren;
intt nDepth;
relative_id nNameRoomId;
};
} // namespace output
#endif