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
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* The Contents of this file are made available subject to the terms of
* either of the following licenses
*
* - GNU Lesser General Public License Version 2.1
* - Sun Industry Standards Source License Version 1.1
*
* Sun Microsystems Inc., October, 2000
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2000 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
*
*
* Sun Industry Standards Source License Version 1.1
* =================================================
* The contents of this file are subject to the Sun Industry Standards
* Source License Version 1.1 (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.openoffice.org/license.html.
*
* Software provided under this License is provided on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
* See the License for the specific provisions governing your rights and
* obligations concerning the Software.
*
* The Initial Developer of the Original Code is: IBM Corporation
*
* Copyright: 2008 by IBM Corporation
*
* All Rights Reserved.
*
* Contributor(s): _______________________________________
*
*
************************************************************************/
#include "first.hxx"
namespace OpenStormBento
{
CUtListElmt::CUtListElmt(pCUtList pList)
{
if (pList == NULL)
cpNext = NULL;
else InsertAfter(pList->GetLast());
}
CUtListElmt::~CUtListElmt()
{
if (OnList())
{
cpPrev->cpNext = cpNext;
cpNext->cpPrev = cpPrev;
}
}
CUtList::~CUtList()
{
pCUtListElmt pTerminating = GetTerminating();
for (pCUtListElmt pCurr = GetFirst(); pCurr != pTerminating; )
{
pCUtListElmt pNext = pCurr->GetNext();
pCurr->MakeNotOnList();
pCurr = pNext;
}
pTerminating->SetPrev(pTerminating);
pTerminating->SetNext(pTerminating);
}
int
CUtList::GetCount()
{
int Count = 0;
pCUtListElmt pTerminating = GetTerminating();
for (pCUtListElmt pCurr = GetFirst(); pCurr != pTerminating;
pCurr = pCurr->GetNext())
{
Count++;
}
return Count;
}
pCUtListElmt
CUtList::GetIndex(int Index)
{
int Count = 0;
pCUtListElmt pTerminating = GetTerminating();
for (pCUtListElmt pCurr = GetFirst(); pCurr != pTerminating;
pCurr = pCurr->GetNext())
{
if (Count == Index)
return pCurr;
Count++;
}
return NULL;
}
int
CUtList::GetIndex(pCUtListElmt pNode)
{
int Count = 0;
pCUtListElmt pTerminating = GetTerminating();
for (pCUtListElmt pCurr = GetFirst(); pCurr != pTerminating;
pCurr = pCurr->GetNext())
{
if (pNode == pCurr)
break;
Count++;
}
return Count;
}
// If pCurr is last item in list, returns first item in list (terminating
// item is skipped when circle around)
pCUtListElmt
CUtList::CircularGetNext(pConstCUtListElmt pCurr)
{
pCUtListElmt pNext = pCurr->GetNext();
if (pNext == GetTerminating())
pNext = GetFirst();
return pNext;
}
pCUtListElmt
CUtList::CircularGetPrev(pConstCUtListElmt pCurr)
{
pCUtListElmt pPrev = pCurr->GetPrev();
if (pPrev == GetTerminating())
pPrev = GetLast();
return pPrev;
}
// If pCurr is NULL, returns first item in list. Otherwise, returns item
// in list after pCurr or NULL if no more items in list. Terminating item
// is never returned
pCUtListElmt
CUtList::GetNextOrNULL(pCUtListElmt pCurr)
{
pCUtListElmt pNext;
if (pCurr == NULL)
pNext = GetFirst();
else pNext = pCurr->GetNext();
if (pNext == GetTerminating())
pNext = NULL;
return pNext;
}
// If pCurr is NULL, returns last item in list. Otherwise, returns item
// in list before pCurr or NULL if no more items in list. Terminating item
// is never returned
pCUtListElmt
CUtList::GetPrevOrNULL(pCUtListElmt pCurr)
{
pCUtListElmt pPrev;
if (pCurr == NULL)
pPrev = GetLast();
else pPrev = pCurr->GetPrev();
if (pPrev == GetTerminating())
pPrev = NULL;
return pPrev;
}
#if 0 // Deleted by 2004-06-16
// Does an insertion sort on list. If list is already sorted, takes O(n)
// time. Assumes elements are of type CUtComparableListElmt
void
CUtList::Sort(LCID LangID)
{
pCUtListElmt pSortedTo = GetFirst();
// Before each iteration, list is sorted up to, but not including,
// pSortedTo. On each iteration, we look backwards through sorted portion
// of list searching for spot that pSortedTo should go and move it to that
// location
while (pSortedTo != GetTerminating())
{
pCUtListElmt pNextSortedTo = pSortedTo->GetNext();
UtBool FoundSpot = UT_FALSE;
for (pCUtListElmt pCurr = pSortedTo->GetPrev();
pCurr != GetTerminating();
pCurr = pCurr->GetPrev())
{
if (((pCUtComparableListElmt) pSortedTo)->
Compare((pCUtComparableListElmt) pCurr, LangID) >= 0)
{
pSortedTo->Remove();
pSortedTo->InsertAfter(pCurr);
FoundSpot = UT_TRUE;
break;
}
}
if (! FoundSpot)
{
pSortedTo->Remove();
pSortedTo->InsertAfter(GetTerminating()); // Add at beginning
}
pSortedTo = pNextSortedTo;
}
}
#endif
void
CUtList::Destroy()
{
pCUtListElmt pTerminating = GetTerminating();
for (pCUtListElmt pCurr = GetFirst(); pCurr != pTerminating; )
{
pCUtListElmt pNext = pCurr->GetNext();
delete pCurr;
pCurr = pNext;
}
}
CUtOwningList::~CUtOwningList()
{
Destroy();
}
}//end namespace OpenStormBento
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
