blob: ec831a5f8018c37b779480a257b43fd0a34ba5e5 (
plain)
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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
|
/* -*- 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 SOLTOOLS_GI_LIST_HXX
#define SOLTOOLS_GI_LIST_HXX
#include "st_list.hxx"
class GenericInfo;
/** Holds set of generic informations in a sorted list.
At different places, methods of this class have a parameter,
whose name includes "path". Those are paths like this:
src370/drives/o:
which are used to access GenericInfo keys in deep search through
the lists and their sublists.
*/
class List_GenericInfo
{
public:
// TYPES
class const_iterator
{
public:
const GenericInfo & operator*() const;
const_iterator & operator++();
bool operator==( const const_iterator & ) const;
bool operator!=( const const_iterator & ) const;
const_iterator();
const_iterator( const DynamicList< GenericInfo >::const_iterator & );
private: DynamicList< GenericInfo >::const_iterator it;
};
class iterator
{ public:
GenericInfo & operator*() const;
iterator & operator++();
bool operator==( const iterator & ) const;
bool operator!=( const iterator & ) const;
iterator();
iterator( const DynamicList< GenericInfo >::iterator & );
private: DynamicList< GenericInfo >::iterator it;
};
typedef const char * KeyPath;
// LIFECYCLE
List_GenericInfo();
List_GenericInfo(
const List_GenericInfo &
i_rList );
~List_GenericInfo();
// OPERATORS
List_GenericInfo & operator=(
const List_GenericInfo &
i_rList );
const GenericInfo * operator[](
KeyPath i_sKeyPath ) const;
GenericInfo * operator[](
KeyPath i_sKeyPath );
// OPERATIONS
bool InsertInfo(
GenericInfo * let_dpInfo, /// Will be owned by this object.
bool i_bOverwrite = true );
bool InsertInfoByPath(
GenericInfo * let_dpInfo, /// Will be owned by this object.
KeyPath i_sKeyPath,
bool i_bCreatePath,
bool i_bOverwrite = true );
GenericInfo * ReleaseInfo( /// Removes the GenericInfo from its parent.
KeyPath i_sKeyPath );
void DeleteInfo(
KeyPath i_sKeyPath );
// INFO
unsigned Size() const;
const_iterator Begin() const;
const_iterator End() const;
// ACCESS
iterator Begin();
iterator End();
private:
typedef DynamicList< GenericInfo >::iterator sub_iterator;
sub_iterator lower_bound(
bool & o_bExists,
const char * & o_sNextPathSegment,
KeyPath i_sKeyPath );
DynamicList< GenericInfo >
aChildren;
};
// IMPLEMENTATION
inline const GenericInfo &
List_GenericInfo::
const_iterator::operator*() const
{ return *(*it); }
inline List_GenericInfo::const_iterator &
List_GenericInfo::
const_iterator::operator++()
{ ++it; return *this; }
inline bool
List_GenericInfo::
const_iterator::operator==( const const_iterator & i_rIter ) const
{ return it == i_rIter.it; }
inline bool
List_GenericInfo::
const_iterator::operator!=( const const_iterator & i_rIter ) const
{ return it != i_rIter.it; }
inline List_GenericInfo::
const_iterator::const_iterator()
: it(0) { }
inline List_GenericInfo::
const_iterator::const_iterator( const DynamicList< GenericInfo >::const_iterator & i_rDynListIter )
: it(i_rDynListIter) { }
inline GenericInfo &
List_GenericInfo::
iterator::operator*() const
{ return *(*it); }
inline List_GenericInfo::iterator &
List_GenericInfo::
iterator::operator++()
{ ++it; return *this; }
inline bool
List_GenericInfo::
iterator::operator==( const iterator & i_rIter ) const
{ return it == i_rIter.it; }
inline bool
List_GenericInfo::
iterator::operator!=( const iterator & i_rIter ) const
{ return it != i_rIter.it; }
inline List_GenericInfo::
iterator::iterator()
: it(0) { }
inline List_GenericInfo::
iterator::iterator( const DynamicList< GenericInfo >::iterator & i_rDynListIter )
: it(i_rDynListIter) { }
inline unsigned
List_GenericInfo::Size() const
{ return aChildren.size(); }
inline List_GenericInfo::const_iterator
List_GenericInfo::Begin() const
{ return aChildren.begin(); }
inline List_GenericInfo::const_iterator
List_GenericInfo::End() const
{ return aChildren.end(); }
inline List_GenericInfo::iterator
List_GenericInfo::Begin()
{ return aChildren.begin(); }
inline List_GenericInfo::iterator
List_GenericInfo::End()
{ return aChildren.end(); }
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
