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
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
#
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
#*************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_sal.hxx"
#include <math.h>
#include <stdlib.h>
#ifndef _SAL_TYPES_H_
#include <sal/types.h>
#endif
#ifndef _RTL_USTRING_H_
#include <rtl/ustring.h>
#endif
#ifndef _RTL_STRING_HXX_
#include <rtl/string.hxx>
#endif
#ifndef _RTL_STRING_UTILS_CONST_H_
#include <rtl_String_Utils_Const.h>
#endif
using ::rtl::OString;
sal_uInt32 AStringLen( const sal_Char *pAStr )
{
sal_uInt32 nStrLen = 0;
if ( pAStr != NULL )
{
const sal_Char *pTempStr = pAStr;
while( *pTempStr )
{
pTempStr++;
} // while
nStrLen = (sal_uInt32)( pTempStr - pAStr );
} // if
return nStrLen;
} // AStringLen
sal_Char* cpystr( sal_Char* dst, const sal_Char* src )
{
const sal_Char* psrc = src;
sal_Char* pdst = dst;
while( *pdst++ = *psrc++ );
return ( dst );
}
sal_Char* cpynstr( sal_Char* dst, const sal_Char* src, sal_uInt32 cnt )
{
const sal_Char* psrc = src;
sal_Char* pdst = dst;
sal_uInt32 len = cnt;
sal_uInt32 i;
if ( len >= AStringLen(src) )
{
return( cpystr( dst, src ) );
}
// copy string by char
for( i = 0; i < len; i++ )
*pdst++ = *psrc++;
*pdst = '\0';
return ( dst );
}
//------------------------------------------------------------------------
sal_Bool cmpstr( const sal_Char* str1, const sal_Char* str2, sal_uInt32 len )
{
const sal_Char* pBuf1 = str1;
const sal_Char* pBuf2 = str2;
sal_uInt32 i = 0;
while ( (*pBuf1 == *pBuf2) && i < len )
{
(pBuf1)++;
(pBuf2)++;
i++;
}
return( i == len );
}
//------------------------------------------------------------------------
sal_Bool cmpustr( const sal_Unicode* str1, const sal_Unicode* str2, sal_uInt32 len )
{
const sal_Unicode* pBuf1 = str1;
const sal_Unicode* pBuf2 = str2;
sal_uInt32 i = 0;
while ( (*pBuf1 == *pBuf2) && i < len )
{
(pBuf1)++;
(pBuf2)++;
i++;
}
return( i == len );
}
//-----------------------------------------------------------------------
sal_Bool cmpustr( const sal_Unicode* str1, const sal_Unicode* str2 )
{
const sal_Unicode* pBuf1 = str1;
const sal_Unicode* pBuf2 = str2;
sal_Bool res = sal_True;
while ( (*pBuf1 == *pBuf2) && *pBuf1 !='\0' && *pBuf2 != '\0')
{
(pBuf1)++;
(pBuf2)++;
}
if (*pBuf1 == '\0' && *pBuf2 == '\0')
res = sal_True;
else
res = sal_False;
return (res);
}
sal_Char* createName( sal_Char* dst, const sal_Char* meth, sal_uInt32 cnt )
{
sal_Char* pdst = dst;
sal_Char nstr[16];
sal_Char* pstr = nstr;
rtl_str_valueOfInt32( pstr, cnt, 10 );
cpystr( pdst, meth );
cpystr( pdst+ AStringLen(meth), "_" );
if ( cnt < 100 )
{
cpystr(pdst + AStringLen(pdst), "0" );
}
if ( cnt < 10 )
{
cpystr(pdst + AStringLen(pdst), "0" );
}
cpystr( pdst + AStringLen(pdst), nstr );
return( pdst );
}
//------------------------------------------------------------------------
// testing the method compareTo( const OString & aStr )
//------------------------------------------------------------------------
void makeComment( char *com, const char *str1, const char *str2,
sal_Int32 sgn )
{
cpystr(com, str1);
int str1Length = AStringLen( str1 );
const char *sign = (sgn == 0) ? " == " : (sgn > 0) ? " > " : " < " ;
cpystr(com + str1Length, sign);
int signLength = AStringLen(sign);
cpystr(com + str1Length + signLength, str2);
com[str1Length + signLength + AStringLen(str2)] = 0;
}
sal_uInt32 UStringLen( const sal_Unicode *pUStr )
{
sal_uInt32 nUStrLen = 0;
if ( pUStr != NULL )
{
const sal_Unicode *pTempUStr = pUStr;
while( *pTempUStr )
{
pTempUStr++;
} // while
nUStrLen = (sal_uInt32)( pTempUStr - pUStr );
} // if
return nUStrLen;
} // UStringLen
//------------------------------------------------------------------------
sal_Bool AStringNIsValid( const sal_Char *pAStr,
const sal_uInt32 nStrLen
)
{
sal_uInt32 nLen = nStrLen;
sal_uChar uChar = 0;
while ( ( nLen >= 0 ) && ( *pAStr ) )
{
uChar = (unsigned char)*pAStr;
if ( uChar > 127 )
{
return sal_False;
} // if
pAStr++;
// Since we are dealing with unsigned integers
// we want to make sure that the last number is
// indeed zero.
if ( nLen > 0 )
{
nLen--;
} // if
else
{
break;
} // else
} // while
return sal_True;
} // AStringNIsValid
//------------------------------------------------------------------------
static inline sal_Int32 ACharToUCharCompare( const sal_Unicode *pUStr,
const sal_Char *pAStr
)
{
sal_Int32 nCmp = 0;
sal_Int32 nUChar = (sal_Int32)*pUStr;
sal_Int32 nChar = (sal_Int32)((unsigned char)*pAStr);
nCmp = nUChar - nChar;
return nCmp;
} // ACharToUCharCompare
//------------------------------------------------------------------------
sal_Int32 AStringToUStringCompare( const sal_Unicode *pUStr,
const sal_Char *pAStr
)
{
sal_Int32 nCmp = kErrCompareAStringToUString;
if ( ( pUStr != NULL ) && ( pAStr != NULL ) )
{
nCmp = ACharToUCharCompare( pUStr, pAStr );
while ( ( nCmp == 0 ) && ( *pAStr ) )
{
pUStr++;
pAStr++;
nCmp = ACharToUCharCompare( pUStr, pAStr );
} // while
} // if
return nCmp;
} // AStringToUStringCompare
//------------------------------------------------------------------------
sal_Int32 AStringToUStringNCompare( const sal_Unicode *pUStr,
const sal_Char *pAStr,
const sal_uInt32 nAStrCount
)
{
sal_Int32 nCmp = kErrCompareNAStringToUString;
if ( ( pUStr != NULL ) && ( pAStr != NULL ) )
{
sal_uInt32 nCount = nAStrCount;
nCmp = ACharToUCharCompare( pUStr, pAStr );
while ( ( nCmp == 0 ) && ( *pAStr ) && ( nCount ) )
{
pUStr++;
pAStr++;
nCmp = ACharToUCharCompare( pUStr, pAStr );
// Since we are dealing with unsigned integers
// we want to make sure that the last number is
// indeed zero.
if ( nCount > 0 )
{
nCount--;
} // if
else
{
break;
} // else
} // while
} // if
return nCmp;
} // AStringToUStringNCompare
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
