version 1.4, 2001/02/26 04:33:28
|
version 1.31, 2001/12/13 14:54:02
|
|
|
//BEGIN_LICENSE |
//%///////////////////////////////////////////////////////////////////////////// |
// | // |
// Copyright (c) 2000 The Open Group, BMC Software, Tivoli Systems, IBM |
// Copyright (c) 2000, 2001 The Open group, BMC Software, Tivoli Systems, IBM |
// | // |
// Permission is hereby granted, free of charge, to any person obtaining a |
// Permission is hereby granted, free of charge, to any person obtaining a copy |
// copy of this software and associated documentation files (the "Software"), |
// of this software and associated documentation files (the "Software"), to |
// to deal in the Software without restriction, including without limitation |
// deal in the Software without restriction, including without limitation the |
// the rights to use, copy, modify, merge, publish, distribute, sublicense, |
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or |
// and/or sell copies of the Software, and to permit persons to whom the |
// sell copies of the Software, and to permit persons to whom the Software is |
// Software is furnished to do so, subject to the following conditions: |
// furnished to do so, subject to the following conditions: |
// | // |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
// THE ABOVE COPYRIGHT NOTICE AND THIS PERMISSION NOTICE SHALL BE INCLUDED IN |
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
// ALL COPIES OR SUBSTANTIAL PORTIONS OF THE SOFTWARE. THE SOFTWARE IS PROVIDED |
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL |
// "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT |
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
// LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR |
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |
// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER |
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN |
// DEALINGS IN THE SOFTWARE. |
// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION |
|
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
// | // |
//END_LICENSE |
//============================================================================== |
//BEGIN_HISTORY |
|
// | // |
// Author: |
// Author: Mike Brasher (mbrasher@bmc.com) |
// | // |
// $Log$ |
// Modified By: |
// Revision 1.4 2001/02/26 04:33:28 mike |
|
// Fixed many places where cim names were be compared with operator==(String,String). |
|
// Changed all of these to use CIMName::equal() |
|
// | // |
// Revision 1.3 2001/02/11 17:19:30 mike |
//%///////////////////////////////////////////////////////////////////////////// |
// added reverseFind() method |
|
// |
|
// Revision 1.2 2001/02/11 05:42:33 mike |
|
// new |
|
// |
|
// Revision 1.1.1.1 2001/01/14 19:53:14 mike |
|
// Pegasus import |
|
// |
|
// |
|
//END_HISTORY |
|
| |
#include <cctype> | #include <cctype> |
#include "String.h" | #include "String.h" |
#include "Exception.h" | #include "Exception.h" |
#include "String.h" | #include "String.h" |
|
#include <iostream> |
|
|
|
PEGASUS_USING_STD; |
| |
PEGASUS_NAMESPACE_BEGIN | PEGASUS_NAMESPACE_BEGIN |
| |
|
#define PEGASUS_ARRAY_T String |
|
#include <Pegasus/Common/ArrayImpl.h> |
|
#undef PEGASUS_ARRAY_T |
|
|
const String String::EMPTY; | const String String::EMPTY; |
| |
|
static inline void _SkipWhitespace(const Char16*& p) |
|
{ |
|
while (*p && isspace(*p)) |
|
p++; |
|
} |
|
|
inline Uint32 StrLen(const char* str) | inline Uint32 StrLen(const char* str) |
{ | { |
if (!str) | if (!str) |
|
|
| |
String::String(const char* str, Uint32 n_) | String::String(const char* str, Uint32 n_) |
{ | { |
Uint32 n = _min(strlen(str), n_); |
Uint32 n = _pegasusMin(strlen(str), n_); |
reserve(n + 1); | reserve(n + 1); |
| |
while (n--) | while (n--) |
|
|
String& String::assign(const Char16* str, Uint32 n) | String& String::assign(const Char16* str, Uint32 n) |
{ | { |
_rep.clear(); | _rep.clear(); |
Uint32 m = _min(StrLen(str), n); |
Uint32 m = _pegasusMin(StrLen(str), n); |
_rep.append(str, m); | _rep.append(str, m); |
_rep.append('\0'); | _rep.append('\0'); |
return *this; | return *this; |
|
|
{ | { |
_rep.clear(); | _rep.clear(); |
| |
Uint32 n = _min(strlen(x), n_); |
Uint32 n = _pegasusMin(strlen(x), n_); |
_rep.reserve(n + 1); | _rep.reserve(n + 1); |
| |
while (n--) | while (n--) |
|
|
| |
char* String::allocateCString(Uint32 extraBytes, Boolean noThrow) const | char* String::allocateCString(Uint32 extraBytes, Boolean noThrow) const |
{ | { |
Uint32 n = getLength() + 1; |
Uint32 n = size() + 1; |
char* str = new char[n + extraBytes]; | char* str = new char[n + extraBytes]; |
char* p = str; | char* p = str; |
const Char16* q = getData(); | const Char16* q = getData(); |
|
|
if (!str) | if (!str) |
throw NullPointer(); | throw NullPointer(); |
| |
Uint32 n = _min(getLength(), length); |
Uint32 n = _pegasusMin(size(), length); |
| |
char* p = str + strlen(str); | char* p = str + strlen(str); |
const Char16* q = getData(); | const Char16* q = getData(); |
|
|
| |
Char16& String::operator[](Uint32 i) | Char16& String::operator[](Uint32 i) |
{ | { |
if (i > getLength()) |
if (i > size()) |
ThrowOutOfBounds(); | ThrowOutOfBounds(); |
| |
return _rep[i]; | return _rep[i]; |
|
|
| |
const Char16 String::operator[](Uint32 i) const | const Char16 String::operator[](Uint32 i) const |
{ | { |
if (i > getLength()) |
if (i > size()) |
ThrowOutOfBounds(); | ThrowOutOfBounds(); |
| |
return _rep[i]; | return _rep[i]; |
|
|
| |
String& String::append(const Char16* str, Uint32 n) | String& String::append(const Char16* str, Uint32 n) |
{ | { |
Uint32 m = _min(StrLen(str), n); |
Uint32 m = _pegasusMin(StrLen(str), n); |
_rep.reserve(_rep.getSize() + m); |
_rep.reserve(_rep.size() + m); |
_rep.remove(_rep.getSize() - 1); |
_rep.remove(_rep.size() - 1); |
_rep.append(str, m); | _rep.append(str, m); |
_rep.append('\0'); | _rep.append('\0'); |
return *this; | return *this; |
|
|
| |
void String::remove(Uint32 pos, Uint32 size) | void String::remove(Uint32 pos, Uint32 size) |
{ | { |
if (size == Uint32(-1)) |
if (size == PEG_NOT_FOUND) |
size = getLength() - pos; |
size = this->size() - pos; |
| |
if (pos + size > getLength()) |
if (pos + size > this->size()) |
ThrowOutOfBounds(); | ThrowOutOfBounds(); |
| |
if (size) | if (size) |
|
|
return 0; | return 0; |
} | } |
| |
|
int String::compareNoCase(const char* s1, const char* s2, Uint32 n) |
|
{ |
|
while (n--) |
|
{ |
|
int r = tolower(*s1++) - tolower(*s2++); |
|
|
|
if (r) |
|
return r; |
|
} |
|
|
|
return 0; |
|
} |
|
|
Boolean String::equal(const String& x, const String& y) | Boolean String::equal(const String& x, const String& y) |
{ | { |
if (x.getLength() != y.getLength()) |
if (x.size() != y.size()) |
return false; | return false; |
| |
return String::compare(x.getData(), y.getData(), x.getLength()) == 0; |
return String::compare(x.getData(), y.getData(), x.size()) == 0; |
} | } |
| |
Boolean String::equal(const String& x, const Char16* y) | Boolean String::equal(const String& x, const Char16* y) |
{ | { |
if (x.getLength() != StrLen(y)) |
if (x.size() != StrLen(y)) |
return false; | return false; |
| |
return String::compare(x.getData(), y, x.getLength()) == 0; |
return String::compare(x.getData(), y, x.size()) == 0; |
} | } |
| |
Boolean String::equal(const Char16* x, const String& y) | Boolean String::equal(const Char16* x, const String& y) |
|
|
return equal(String(x), y); | return equal(String(x), y); |
} | } |
| |
|
Boolean String::equalNoCase(const String& x, const String& y) |
|
{ |
|
if (x.size() != y.size()) |
|
return false; |
|
|
|
const Char16* p = x.getData(); |
|
const Char16* q = y.getData(); |
|
|
|
Uint32 n = x.size(); |
|
|
|
while (n--) |
|
{ |
|
#ifdef PEGASUS_HAS_EBCDIC |
|
if (*p <= 255 && *q <= 255) |
|
#else |
|
if (*p <= 127 && *q <= 127) |
|
#endif |
|
{ |
|
if (tolower(*p++) != tolower(*q++)) |
|
return false; |
|
} |
|
else if (*p++ != *q++) |
|
return false; |
|
} |
|
|
|
return true; |
|
} |
| |
String String::subString(Uint32 pos, Uint32 length) const | String String::subString(Uint32 pos, Uint32 length) const |
{ | { |
if (pos < getLength()) |
if (pos < size()) |
{ | { |
if (length == Uint32(-1)) |
if (length == PEG_NOT_FOUND) |
length = getLength() - pos; |
length = size() - pos; |
| |
return String(getData() + pos, length); | return String(getData() + pos, length); |
} | } |
|
|
return p - first; | return p - first; |
} | } |
| |
return Uint32(-1); |
return PEG_NOT_FOUND; |
|
} |
|
|
|
Uint32 String::find(Uint32 pos, Char16 c) const |
|
{ |
|
const Char16* data = getData(); |
|
|
|
for (Uint32 i = pos, n = size(); i < n; i++) |
|
{ |
|
if (data[i] == c) |
|
return i; |
|
} |
|
|
|
return PEG_NOT_FOUND; |
|
} |
|
|
|
Uint32 String::find(const String& s) const |
|
{ |
|
const Char16* pSubStr = s.getData(); |
|
const Char16* pStr = getData(); |
|
Uint32 subStrLen = s.size(); |
|
Uint32 strLen = size(); |
|
|
|
if (subStrLen > strLen) |
|
{ |
|
return PEG_NOT_FOUND; |
|
} |
|
|
|
// loop to find first char match |
|
Uint32 loc = 0; |
|
for( ; loc <= (strLen-subStrLen); loc++) |
|
{ |
|
if (*pStr++ == *pSubStr) // match first char |
|
{ |
|
// point to substr 2nd char |
|
const Char16* p = pSubStr + 1; |
|
|
|
// Test remaining chars for equal |
|
Uint32 i = 1; |
|
for (; i < subStrLen; i++) |
|
if (*pStr++ != *p++ ) |
|
{pStr--; break;} // break from loop |
|
if (i == subStrLen) |
|
return loc; |
|
} |
|
} |
|
return PEG_NOT_FOUND; |
|
} |
|
|
|
// ATTN:KS 5 apr 2000 Need to add the Char16* version. |
|
Uint32 String::find(const char* s) const |
|
{ |
|
return find(String(s)); |
} | } |
| |
Uint32 String::reverseFind(Char16 c) const | Uint32 String::reverseFind(Char16 c) const |
{ | { |
const Char16* first = getData(); | const Char16* first = getData(); |
const Char16* last = getData() + getLength(); |
const Char16* last = getData() + size(); |
| |
while (last != first) | while (last != first) |
{ | { |
|
|
return last - first; | return last - first; |
} | } |
| |
return Uint32(-1); |
return PEG_NOT_FOUND; |
|
} |
|
|
|
void String::toLower() |
|
{ |
|
for (Char16* p = &_rep[0]; *p; p++) |
|
{ |
|
#ifdef PEGASUS_HAS_EBCDIC |
|
if (*p <= 255) |
|
#else |
|
if (*p <= 127) |
|
#endif |
|
*p = tolower(*p); |
|
} |
|
} |
|
|
|
void String::translate(Char16 fromChar, Char16 toChar) |
|
{ |
|
for (Char16* p = &_rep[0]; *p; p++) |
|
{ |
|
if (*p == fromChar) |
|
*p = toChar; |
|
} |
} | } |
| |
int String::compare(const Char16* s1, const Char16* s2) | int String::compare(const Char16* s1, const Char16* s2) |
|
|
return 0; | return 0; |
} | } |
| |
std::ostream& operator<<(std::ostream& os, const String& x) |
int String::compareNoCase(const char* s1, const char* s2) |
|
{ |
|
while (*s1 && *s2) |
|
{ |
|
int r = tolower(*s1++) - tolower(*s2++); |
|
|
|
if (r) |
|
return r; |
|
} |
|
|
|
if (*s2) |
|
return -1; |
|
else if (*s1) |
|
return 1; |
|
|
|
return 0; |
|
} |
|
|
|
PEGASUS_STD(ostream)& operator<<(PEGASUS_STD(ostream)& os, const String& x) |
{ | { |
for (Uint32 i = 0, n = x.getLength(); i < n; i++) |
for (Uint32 i = 0, n = x.size(); i < n; i++) |
os << x[i]; | os << x[i]; |
| |
return os; | return os; |
|
|
{ | { |
String tmp(str); | String tmp(str); |
| |
for (Uint32 i = 0, n = tmp.getLength(); i < n; i++) |
for (Uint32 i = 0, n = tmp.size(); i < n; i++) |
{ | { |
Char16 c = tmp[i]; | Char16 c = tmp[i]; |
| |
|
#ifdef PEGASUS_HAS_EBCDIC |
|
if (c <= 255) |
|
#else |
if (c <= 127) | if (c <= 127) |
|
#endif |
tmp[i] = tolower(c); | tmp[i] = tolower(c); |
} | } |
| |
return tmp; | return tmp; |
} | } |
| |
|
int CompareNoCase(const char* s1, const char* s2) |
|
{ |
|
while (*s1 && *s2) |
|
{ |
|
int r = tolower(*s1++) - tolower(*s2++); |
|
|
|
if (r) |
|
return r; |
|
} |
|
|
|
if (*s2) |
|
return -1; |
|
else if (*s1) |
|
return 1; |
|
|
|
return 0; |
|
} |
|
|
|
Boolean GetLine(PEGASUS_STD(istream)& is, String& line) |
|
{ |
|
line.clear(); |
|
|
|
Boolean gotChar = false; |
|
char c; |
|
|
|
while (is.get(c)) |
|
{ |
|
gotChar = true; |
|
|
|
if (c == '\n') |
|
break; |
|
|
|
line.append(c); |
|
} |
|
|
|
return gotChar; |
|
} |
|
|
|
String::~String() |
|
{ |
|
} |
|
|
|
String& String::assign(const String& x) |
|
{ |
|
_rep = x._rep; |
|
return *this; |
|
} |
|
|
|
String& String::append(const Char16& c) |
|
{ |
|
_rep.insert(_rep.size() - 1, c); |
|
return *this; |
|
} |
|
|
|
void String::clear() |
|
{ |
|
_rep.clear(); |
|
_rep.append('\0'); |
|
} |
|
|
|
void String::print() const |
|
{ |
|
cout << *this << endl; |
|
} |
|
|
|
void String::reserve(Uint32 capacity) |
|
{ |
|
_rep.reserve(capacity + 1); |
|
} |
|
|
|
const Array<String>& EmptyStringArray() |
|
{ |
|
static Array<String> tmp; |
|
return tmp; |
|
} |
|
|
|
//////////////////////////////////////////////////////////////////////////////// |
|
// |
|
// String matching routines borrowed from Tcl 8.0: |
|
// |
|
//////////////////////////////////////////////////////////////////////////////// |
|
|
|
//////////////////////////////////////////////////////////////////////////////// |
|
// |
|
// This software is copyrighted by the Regents of the University of |
|
// California, Sun Microsystems, Inc., and other parties. The following |
|
// terms apply to all files associated with the software unless explicitly |
|
// disclaimed in individual files. |
|
// |
|
// The authors hereby grant permission to use, copy, modify, distribute, |
|
// and license this software and its documentation for any purpose, provided |
|
// that existing copyright notices are retained in all copies and that this |
|
// notice is included verbatim in any distributions. No written agreement, |
|
// license, or royalty fee is required for any of the authorized uses. |
|
// Modifications to this software may be copyrighted by their authors |
|
// and need not follow the licensing terms described here, provided that |
|
// the new terms are clearly indicated on the first page of each file where |
|
// they apply. |
|
// |
|
// IN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY |
|
// FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES |
|
// ARISING OUT OF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY |
|
// DERIVATIVES THEREOF, EVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE |
|
// POSSIBILITY OF SUCH DAMAGE. |
|
// |
|
// THE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES, |
|
// INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, |
|
// FITNESS FOR A PARTICULAR PURPOSE, AND NON-INFRINGEMENT. THIS SOFTWARE |
|
// IS PROVIDED ON AN "AS IS" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE |
|
// NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR |
|
// MODIFICATIONS. |
|
// |
|
// GOVERNMENT USE: If you are acquiring this software on behalf of the |
|
// U.S. government, the Government shall have only "Restricted Rights" |
|
// in the software and related documentation as defined in the Federal |
|
// Acquisition Regulations (FARs) in Clause 52.227.19 (c) (2). If you |
|
// are acquiring the software on behalf of the Department of Defense, the |
|
// software shall be classified as "Commercial Computer Software" and the |
|
// Government shall have only "Restricted Rights" as defined in Clause |
|
// 252.227-7013 (c) (1) of DFARs. Notwithstanding the foregoing, the |
|
// authors grant the U.S. Government and others acting in its behalf |
|
// permission to use and distribute the software in accordance with the |
|
// terms specified in this license. |
|
// |
|
//////////////////////////////////////////////////////////////////////////////// |
|
|
|
|
|
/* |
|
*---------------------------------------------------------------------- |
|
* |
|
* Tcl_StringMatch -- |
|
* |
|
* See if a particular string matches a particular pattern. |
|
* |
|
* Results: |
|
* The return value is 1 if string matches pattern, and |
|
* 0 otherwise. The matching operation permits the following |
|
* special characters in the pattern: *?\[] (see the manual |
|
* entry for details on what these mean). |
|
* |
|
* Side effects: |
|
* None. |
|
* |
|
*---------------------------------------------------------------------- |
|
*/ |
|
|
|
typedef Uint16 Tcl_Char; |
|
|
|
inline Uint16 _ToLower(Uint16 ch) |
|
{ |
|
#ifdef PEGASUS_HAS_EBCDIC |
|
return ch <= 255 ? tolower(char(ch)) : ch; |
|
#else |
|
return ch <= 127 ? tolower(char(ch)) : ch; |
|
#endif |
|
} |
|
|
|
inline Boolean _Equal(Uint16 ch1, Uint16 ch2, int nocase) |
|
{ |
|
if (nocase) |
|
return _ToLower(ch1) == _ToLower(ch2); |
|
else |
|
return ch1 == ch2; |
|
} |
|
|
|
int Tcl_StringMatch( |
|
Tcl_Char *string, /* String. */ |
|
Tcl_Char *pattern, /* Pattern, which may contain special |
|
* characters. */ |
|
int nocase) /* Ignore case if this is true */ |
|
{ |
|
Tcl_Char c2; |
|
|
|
while (1) { |
|
/* See if we're at the end of both the pattern and the string. |
|
* If so, we succeeded. If we're at the end of the pattern |
|
* but not at the end of the string, we failed. |
|
*/ |
|
|
|
if (*pattern == 0) { |
|
if (*string == 0) { |
|
return 1; |
|
} else { |
|
return 0; |
|
} |
|
} |
|
if ((*string == 0) && (*pattern != '*')) { |
|
return 0; |
|
} |
|
|
|
/* Check for a "*" as the next pattern character. It matches |
|
* any substring. We handle this by calling ourselves |
|
* recursively for each postfix of string, until either we |
|
* match or we reach the end of the string. |
|
*/ |
|
|
|
if (*pattern == '*') { |
|
pattern += 1; |
|
if (*pattern == 0) { |
|
return 1; |
|
} |
|
while (1) { |
|
if (Tcl_StringMatch(string, pattern, nocase)) { |
|
return 1; |
|
} |
|
if (*string == 0) { |
|
return 0; |
|
} |
|
string += 1; |
|
} |
|
} |
|
|
|
/* Check for a "?" as the next pattern character. It matches |
|
* any single character. |
|
*/ |
|
|
|
if (*pattern == '?') { |
|
goto thisCharOK; |
|
} |
|
|
|
/* Check for a "[" as the next pattern character. It is followed |
|
* by a list of characters that are acceptable, or by a range |
|
* (two characters separated by "-"). |
|
*/ |
|
|
|
if (*pattern == '[') { |
|
pattern += 1; |
|
while (1) { |
|
if ((*pattern == ']') || (*pattern == 0)) { |
|
return 0; |
|
} |
|
if (_Equal(*pattern, *string, nocase)) { |
|
break; |
|
} |
|
if (pattern[1] == '-') { |
|
c2 = pattern[2]; |
|
if (c2 == 0) { |
|
return 0; |
|
} |
|
if ((*pattern <= *string) && (c2 >= *string)) { |
|
break; |
|
} |
|
if ((*pattern >= *string) && (c2 <= *string)) { |
|
break; |
|
} |
|
pattern += 2; |
|
} |
|
pattern += 1; |
|
} |
|
while (*pattern != ']') { |
|
if (*pattern == 0) { |
|
pattern--; |
|
break; |
|
} |
|
pattern += 1; |
|
} |
|
goto thisCharOK; |
|
} |
|
|
|
/* If the next pattern character is '/', just strip off the '/' |
|
* so we do exact matching on the character that follows. |
|
*/ |
|
|
|
if (*pattern == '\\') { |
|
pattern += 1; |
|
if (*pattern == 0) { |
|
return 0; |
|
} |
|
} |
|
|
|
/* There's no special character. Just make sure that the next |
|
* characters of each string match. |
|
*/ |
|
|
|
if (!_Equal(*pattern, *string, nocase)) { |
|
return 0; |
|
} |
|
|
|
thisCharOK: pattern += 1; |
|
string += 1; |
|
} |
|
} |
|
|
|
Boolean String::match(const String& str, const String& pattern) |
|
{ |
|
return Tcl_StringMatch( |
|
(Uint16*)str.getData(), (Uint16*)pattern.getData(), 0) != 0; |
|
} |
|
|
|
Boolean String::matchNoCase(const String& str, const String& pattern) |
|
{ |
|
return Tcl_StringMatch( |
|
(Uint16*)str.getData(), (Uint16*)pattern.getData(), 1) != 0; |
|
} |
|
|
PEGASUS_NAMESPACE_END | PEGASUS_NAMESPACE_END |