1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#ifndef ADC_DISPLAY_OUT_NODE_HXX
#define ADC_DISPLAY_OUT_NODE_HXX
namespace output
{
/** @resp
Represents a tree of names where each node can have only one parent,
but a list of children.
@see Position
@see Tree
*/
class Node
{
public:
typedef std::vector< Node* > NodeList;
typedef UINT32 relative_id;
// LIFECYCLE
enum E_NullObject { null_object };
Node();
explicit Node( E_NullObject );
~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
/// Seek, and if not existent, create.
Node& Provide_Child( const String& i_name );
/// Seek, and if not existent, create.
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; }
/// @return Id of a namespace or class etc. this directory represents.
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); }
/// @return a reference to a Node with Depth() == -1.
static Node& Null_();
private:
// Local
Node(
const String& i_name,
Node& i_parent
);
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;
NodeList aChildren;
intt nDepth;
relative_id nNameRoomId;
};
} // namespace output
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
