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
|
/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: nametree.cxx,v $
*
* $Revision: 1.3 $
*
* last change: $Author: rt $ $Date: 2005-09-07 17:13:46 $
*
* 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
*
************************************************************************/
#include <precomp.h>
#include <nametree.hxx>
// NOT FULLY DECLARED SERVICES
namespace ary
{
/** Lexigraphical sequence is: AaBbCc ... Zz_0123456789.
*/
int cCompareValues[128] =
{
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 0, 0, 0, 0, 0, 0,
0, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29,
31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 0, 0, 0, 0, 53,
0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30,
32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 0, 0, 0, 0, 0
};
#if 0
#ifdef WNT
#define strcmp_nocase stricmp
#elif (UNX)
#define strcmp_nocase strcasecmp
#else
#error For running Autodoc, 'WNT' or 'UNX' must be defined.
#endif
bool
NameTree::
Less_Name::operator()( const udmstri & i_r1,
const udmstri & i_r2 ) const
{
int result = strcmp_nocase(i_r1.c_str(),i_r2.c_str());
if (result != 0)
return result < 0;
const unsigned char *
p1 = reinterpret_cast< const unsigned char* >( i_r1.c_str() );
const unsigned char *
p2 = reinterpret_cast< const unsigned char* >( i_r2.c_str() );
int cp = 0;
do {
cp = cCompareValues[*p1] - cCompareValues[*p2++];
if ( cp < 0 )
return true;
if ( cp > 0 )
return false;
} while (*p1++ != 0);
return false;
}
#endif // 0
NameTree::NameTree()
{
}
NameTree::~NameTree()
{
}
const InstanceList &
NameTree::operator[]( const udmstri & i_rName ) const
{
static InstanceList aNull_;
const_iterator itFound = aNames.find(i_rName);
if ( itFound != aNames.end() )
return (*itFound).second;
return aNull_;
}
void
NameTree::insert( const udmstri & i_rName,
ary::Rid i_nId )
{
aNames[i_rName].push_back(i_nId);
}
NameTree::const_iterator
NameTree::find( const udmstri & i_rName )
{
return aNames.find( i_rName );
}
NameTree::const_iterator
NameTree::lower_bound( const udmstri & i_rName ) const
{
return aNames.lower_bound(i_rName);
}
NameTree::const_iterator
NameTree::begin() const
{
return aNames.begin();
}
NameTree::const_iterator
NameTree::end() const
{
return aNames.end();
}
NameTree::iterator
NameTree::begin()
{
return aNames.begin();
}
NameTree::iterator
NameTree::end()
{
return aNames.end();
}
} // namespace ary
|
