version 1.11, 2001/04/14 07:35:05
|
version 1.108, 2005/05/16 16:50:39
|
|
|
//BEGIN_LICENSE |
//%2005//////////////////////////////////////////////////////////////////////// |
// | // |
// Copyright (c) 2000 The Open Group, BMC Software, Tivoli Systems, IBM |
// Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development |
|
// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems. |
|
// Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.; |
|
// IBM Corp.; EMC Corporation, The Open Group. |
|
// Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.; |
|
// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group. |
|
// Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
|
// EMC Corporation; VERITAS Software Corporation; The Open Group. |
// | // |
// 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: Roger Kumpf, Hewlett-Packard Company (roger_kumpf@hp.com) |
// Revision 1.11 2001/04/14 07:35:05 mike |
// Josephine Eskaline Joyce, IBM (jojustin@in.ibm.com) for Bug#3297 |
// Added config file loading to OptionManager |
|
// | // |
// Revision 1.10 2001/04/11 19:53:22 mike |
//%///////////////////////////////////////////////////////////////////////////// |
// More porting |
|
// |
|
// Revision 1.9 2001/04/11 07:03:02 mike |
|
// Port to Unix |
|
// |
|
// Revision 1.7 2001/04/10 22:42:55 karl |
|
// Correct error in String find |
|
// |
|
// Revision 1.6 2001/04/09 20:18:47 karl |
|
// add find substring function |
|
// |
|
// Revision 1.5 2001/03/09 19:49:32 karl |
|
// long lines |
|
// |
|
// Revision 1.4 2001/02/26 04:33:28 mike |
|
// Fixed many places where cim names 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 <cstring> |
#include "String.h" | #include "String.h" |
#include "Exception.h" |
#include "Array.h" |
#include "String.h" |
#include "AutoPtr.h" |
|
#include "InternalException.h" |
// For debugging |
|
#include <iostream> | #include <iostream> |
using namespace std; |
#include <fstream> |
|
#include <Pegasus/Common/CommonUTF.h> |
|
|
|
#include "CommonUTF.h" |
| |
|
#ifdef PEGASUS_HAS_ICU |
|
#include <unicode/ustring.h> |
|
#include <unicode/uchar.h> |
|
#endif |
|
|
|
PEGASUS_USING_STD; |
| |
PEGASUS_NAMESPACE_BEGIN | PEGASUS_NAMESPACE_BEGIN |
| |
const String String::EMPTY; |
/////////////////////////////////////////////////////////////////////////////// |
|
// |
|
// CString |
|
// |
|
/////////////////////////////////////////////////////////////////////////////// |
| |
inline Uint32 StrLen(const char* str) |
CString::CString() |
|
: _rep(0) |
{ | { |
if (!str) |
} |
throw NullPointer(); |
|
|
CString::CString(const CString& cstr) |
|
{ |
|
_rep = 0; |
|
|
|
if (cstr._rep) |
|
{ |
|
_rep = (void*)new char[strlen((char*)cstr._rep)+1]; |
|
strcpy((char*)_rep, (char*)cstr._rep); |
|
} |
|
} |
|
|
|
CString::CString(char* cstr) |
|
: _rep(cstr) |
|
{ |
|
} |
|
|
|
CString::~CString() |
|
{ |
|
if (_rep) |
|
{ |
|
delete [] (char*)_rep; |
|
} |
|
} |
|
|
|
CString& CString::operator=(const CString& cstr) |
|
{ |
|
if (&cstr != this) |
|
{ |
|
if (_rep) |
|
{ |
|
delete [] (char*)_rep; |
|
_rep = 0; |
|
} |
|
if (cstr._rep) |
|
{ |
|
_rep = (char*)new char[strlen((char*)cstr._rep)+1]; |
|
strcpy((char*)_rep, (char*)cstr._rep); |
|
} |
|
} |
|
return *this; |
|
} |
| |
return strlen(str); |
CString::operator const char*() const |
|
{ |
|
return (char*)_rep; |
} | } |
| |
inline Uint32 StrLen(const Char16* str) |
/////////////////////////////////////////////////////////////////////////////// |
|
// |
|
// String |
|
// |
|
/////////////////////////////////////////////////////////////////////////////// |
|
|
|
const String String::EMPTY = String(); |
|
|
|
inline Uint32 _StrLen(const Char16* str) |
{ | { |
if (!str) | if (!str) |
throw NullPointer(); | throw NullPointer(); |
|
|
return n; | return n; |
} | } |
| |
String::String() |
// |
|
// Converts a utf-8 char buffer to utf-16 and appends the utf-16 to the Array. |
|
// n is the length of the input char *, if stopAtTerm is 0 |
|
// A terminator character is appended to the end. |
|
// Note that each input char is converted individually, which gives |
|
// the fastest performance. |
|
// |
|
void _convertAndAppend(const char* str, Array<Char16>& c16a, Uint32 n, Uint8 stopAtTerm) |
|
{ |
|
Uint32 i = 0; |
|
while ((stopAtTerm && *str) || (!stopAtTerm && i < n)) |
{ | { |
_rep.append('\0'); |
if (*(Uint8*)str <= 0x7f) |
|
{ |
|
// Current byte sequence is in the us-ascii range. |
|
c16a.append(Uint8(*str++)); |
} | } |
|
else |
String::String(const String& x) : _rep(x._rep) |
|
{ | { |
|
// |
|
// Current byte sequence is not in the us-ascii range. |
|
// |
| |
|
// Check if the byte sequence is valid utf-8, and if so, |
|
// call the converter to utf-16 |
|
Uint16 tgt[3]; |
|
tgt[1] = 0; |
|
Uint8 c = UTF_8_COUNT_TRAIL_BYTES(*str); |
|
if ( (!stopAtTerm && i + c >= n) || |
|
(!isValid_U8((const Uint8 *)str, c+1)) ) |
|
{ |
|
// Note about error conditions. |
|
// It is possible that the last utf-8 char before the |
|
// end of input string extends past the end of the input string. |
|
// This is caught in both cases - |
|
// If counting up to n, then the test above catches it. |
|
// If converting until terminator found, then a terminator |
|
// in the middle of a multi-byte utf-8 char is invalid. |
|
MessageLoaderParms parms("Common.String.BAD_UTF8", |
|
"The byte sequence starting at index $0 is not valid UTF-8 encoding.", |
|
i); |
|
throw Exception(parms); |
} | } |
|
else |
String::String(const String& x, Uint32 n) |
|
{ | { |
_rep.append('\0'); |
// str is incremented by this call to the start of the next char |
append(x.getData(), n); |
Uint16 * tgtBuf = tgt; |
} |
UTF8toUTF16((const Uint8 **)&str, (Uint8 *)&str[c+1], &tgtBuf, &tgtBuf[2]); |
|
c16a.append(tgt[0]); |
String::String(const Char16* x) : _rep(x, StrLen(x) + 1) |
if (tgt[1]) |
{ | { |
|
// Its a utf-16 surrogate pair (uses 2 Char16's) |
|
c16a.append(tgt[1]); |
} | } |
| |
String::String(const Char16* x, Uint32 n) |
// bump by the trailing byte count |
{ |
i += c; |
assign(x, n); |
} |
} | } |
| |
String::String(const char* str) |
i++; |
{ |
} // end while |
Uint32 n = ::strlen(str) + 1; |
|
reserve(n); |
|
| |
while (n--) |
c16a.append('\0'); |
_rep.append(*str++); |
|
} | } |
| |
String::String(const char* str, Uint32 n_) |
class StringRep |
{ | { |
Uint32 n = _min(strlen(str), n_); |
public: |
reserve(n + 1); |
StringRep() |
|
{} |
|
StringRep(const StringRep& r) |
|
: c16a(r.c16a) |
|
{} |
|
StringRep(const Char16* str) |
|
: c16a(str, _StrLen(str) + 1) |
|
{} |
| |
while (n--) |
Array<Char16> c16a; |
_rep.append(*str++); |
}; |
| |
_rep.append('\0'); |
String::String() |
|
{ |
|
_rep = new StringRep; |
|
_rep->c16a.append('\0'); |
} | } |
| |
String& String::assign(const Char16* x) |
String::String(const String& str) |
{ | { |
_rep.clear(); |
if (str._rep != NULL) |
_rep.append(x, StrLen(x) + 1); |
{ |
return *this; |
_rep = new StringRep(*str._rep); |
|
} |
|
else |
|
{ |
|
_rep = new StringRep(); |
|
} |
} | } |
| |
String& String::assign(const Char16* str, Uint32 n) |
|
|
String::String(const String& str, Uint32 n) |
{ | { |
_rep.clear(); |
_rep = new StringRep; |
Uint32 m = _min(StrLen(str), n); |
assign(str.getChar16Data(), n); |
_rep.append(str, m); |
|
_rep.append('\0'); |
|
return *this; |
|
} | } |
| |
String& String::assign(const char* x) |
String::String(const Char16* str) |
|
{ |
|
if ( str == 0 ) |
{ | { |
_rep.clear(); |
throw NullPointer(); |
Uint32 n = strlen(x); |
} |
_rep.reserve(n + 1); |
|
| |
while (n--) |
_rep = new StringRep(str); |
_rep.append(*x++); |
} |
| |
_rep.append('\0'); |
String::String(const Char16* str, Uint32 n) |
|
{ |
|
if ( str == 0 ) |
|
{ |
|
throw NullPointer(); |
|
} |
| |
return *this; |
_rep = new StringRep; |
|
assign(str, n); |
} | } |
| |
String& String::assign(const char* x, Uint32 n_) |
String::String(const char* str) |
{ | { |
_rep.clear(); |
if ( str == 0 ) |
|
{ |
Uint32 n = _min(strlen(x), n_); |
throw NullPointer(); |
_rep.reserve(n + 1); |
} |
| |
while (n--) |
_rep = new StringRep; |
_rep.append(*x++); |
AutoPtr<StringRep> tempRep(_rep); |
|
// An exception can be thrown, so use a temp AutoPtr. |
|
_convertAndAppend(str, _rep->c16a, 0, 1); |
|
tempRep.release(); |
|
} |
| |
_rep.append('\0'); |
String::String(const char* str, Uint32 n) |
|
{ |
|
if ( str == 0 ) |
|
{ |
|
throw NullPointer(); |
|
} |
| |
return *this; |
_rep = new StringRep; |
|
AutoPtr<StringRep> tempRep(_rep); |
|
// An exception can be thrown, so use a temp AutoPtr. |
|
_convertAndAppend(str, _rep->c16a, n, 0); |
|
tempRep.release(); |
} | } |
| |
char* String::allocateCString(Uint32 extraBytes, Boolean noThrow) const |
String::~String() |
{ | { |
Uint32 n = getLength() + 1; |
delete _rep; |
char* str = new char[n + extraBytes]; |
} |
char* p = str; |
|
const Char16* q = getData(); |
|
| |
for (Uint32 i = 0; i < n; i++) |
String& String::operator=(const String& str) |
{ | { |
Uint16 c = *q++; |
if (&str != this) |
*p++ = char(c); |
{ |
|
assign(str); |
if ((c & 0xff00) && !noThrow) |
} |
throw TruncatedCharacter(); |
return *this; |
} | } |
| |
return str; |
String& String::assign(const String& str) |
|
{ |
|
_rep->c16a = str._rep->c16a; |
|
return *this; |
} | } |
| |
void String::appendToCString( |
String& String::assign(const Char16* str) |
char* str, |
{ |
Uint32 length, |
if ( str == 0 ) |
Boolean noThrow) const |
|
{ | { |
if (!str) |
|
throw NullPointer(); | throw NullPointer(); |
|
} |
| |
Uint32 n = _min(getLength(), length); |
_rep->c16a.clear(); |
|
_rep->c16a.append(str, _StrLen(str) + 1); |
char* p = str + strlen(str); |
return *this; |
const Char16* q = getData(); |
} |
| |
for (Uint32 i = 0; i < n; i++) |
String& String::assign(const Char16* str, Uint32 n) |
{ | { |
Uint16 c = *q++; |
if ( str == 0 ) |
*p++ = char(c); |
{ |
|
throw NullPointer(); |
if ((c & 0xff00) && !noThrow) |
|
throw TruncatedCharacter(); |
|
} | } |
| |
*p = '\0'; |
_rep->c16a.clear(); |
|
_rep->c16a.append(str, n); |
|
_rep->c16a.append('\0'); |
|
return *this; |
} | } |
| |
Char16& String::operator[](Uint32 i) |
String& String::assign(const char* str) |
|
{ |
|
if ( str == 0 ) |
{ | { |
if (i > getLength()) |
throw NullPointer(); |
ThrowOutOfBounds(); |
} |
| |
return _rep[i]; |
_rep->c16a.clear(); |
|
_convertAndAppend(str, _rep->c16a, 0, 1); |
|
return *this; |
} | } |
| |
const Char16 String::operator[](Uint32 i) const |
String& String::assign(const char* str, Uint32 n) |
{ | { |
if (i > getLength()) |
if ( str == 0 ) |
ThrowOutOfBounds(); |
{ |
|
throw NullPointer(); |
return _rep[i]; |
|
} | } |
| |
String& String::append(const Char16* str, Uint32 n) |
_rep->c16a.clear(); |
{ |
_convertAndAppend(str, _rep->c16a, n, 0); |
Uint32 m = _min(StrLen(str), n); |
|
_rep.reserve(_rep.getSize() + m); |
|
_rep.remove(_rep.getSize() - 1); |
|
_rep.append(str, m); |
|
_rep.append('\0'); |
|
return *this; | return *this; |
} | } |
| |
void String::remove(Uint32 pos, Uint32 size) |
void String::clear() |
{ | { |
if (size == Uint32(-1)) |
_rep->c16a.clear(); |
size = getLength() - pos; |
_rep->c16a.append('\0'); |
|
} |
if (pos + size > getLength()) |
|
ThrowOutOfBounds(); |
|
| |
if (size) |
void String::reserveCapacity(Uint32 capacity) |
_rep.remove(pos, size); |
{ |
|
_rep->c16a.reserveCapacity(capacity + 1); |
} | } |
| |
int String::compare(const Char16* s1, const Char16* s2, Uint32 n) |
Uint32 String::size() const |
{ | { |
while (n--) |
#if defined (PEGASUS_OS_VMS) |
|
// |
|
// This prevents returning a minus number. |
|
// |
|
// Seems as though the first time through |
|
// the XML parser something doesn't get |
|
// initialized and there is no check for |
|
// a negative number in the parser! |
|
// |
|
Uint32 foo; |
|
foo = _rep->c16a.size(); |
|
if (foo == 0) |
{ | { |
int r = *s1++ - *s2++; |
return 0; |
|
} |
if (r) |
else |
return r; |
{ |
|
return (foo -1); |
|
} |
|
#else |
|
return _rep->c16a.size() - 1; |
|
#endif |
} | } |
| |
return 0; |
const Char16* String::getChar16Data() const |
|
{ |
|
return _rep->c16a.getData(); |
} | } |
| |
Boolean String::equal(const String& x, const String& y) |
Char16& String::operator[](Uint32 index) |
{ | { |
if (x.getLength() != y.getLength()) |
if (index > size()) |
return false; |
throw IndexOutOfBoundsException(); |
| |
return String::compare(x.getData(), y.getData(), x.getLength()) == 0; |
return _rep->c16a[index]; |
} | } |
| |
Boolean String::equal(const String& x, const Char16* y) |
const Char16 String::operator[](Uint32 index) const |
{ | { |
if (x.getLength() != StrLen(y)) |
if (index > size()) |
return false; |
throw IndexOutOfBoundsException(); |
| |
return String::compare(x.getData(), y, x.getLength()) == 0; |
return _rep->c16a[index]; |
} | } |
| |
Boolean String::equal(const Char16* x, const String& y) |
String& String::append(const Char16& c) |
{ | { |
return equal(y, x); |
_rep->c16a.insert(_rep->c16a.size() - 1, c); |
|
return *this; |
} | } |
| |
Boolean String::equal(const String& x, const char* y) |
String& String::append(const Char16* str, Uint32 n) |
|
{ |
|
if (str == 0) |
{ | { |
return equal(x, String(y)); |
throw NullPointer(); |
|
} |
|
|
|
_rep->c16a.reserveCapacity(_rep->c16a.size() + n); |
|
_rep->c16a.remove(_rep->c16a.size() - 1); |
|
_rep->c16a.append(str, n); |
|
_rep->c16a.append('\0'); |
|
return *this; |
} | } |
| |
Boolean String::equal(const char* x, const String& y) |
String& String::append(const String& str) |
{ | { |
return equal(String(x), y); |
return append(str.getChar16Data(), str.size()); |
} | } |
| |
|
void String::remove(Uint32 index, Uint32 size) |
|
{ |
|
if (size == PEG_NOT_FOUND) |
|
size = this->size() - index; |
|
|
|
if (index + size > this->size()) |
|
throw IndexOutOfBoundsException(); |
|
|
|
if (size) |
|
_rep->c16a.remove(index, size); |
|
} |
| |
String String::subString(Uint32 pos, Uint32 length) const |
String String::subString(Uint32 index, Uint32 length) const |
{ | { |
if (pos < getLength()) |
if (index < size()) |
{ | { |
if (length == Uint32(-1)) |
if ((length == PEG_NOT_FOUND) || (length > size() - index)) |
length = getLength() - pos; |
length = size() - index; |
| |
return String(getData() + pos, length); |
return String(getChar16Data() + index, length); |
} | } |
else |
|
return String(); | return String(); |
} | } |
| |
Uint32 String::find(Char16 c) const | Uint32 String::find(Char16 c) const |
{ | { |
const Char16* first = getData(); |
const Char16* first = getChar16Data(); |
| |
for (const Char16* p = first; *p; p++) | for (const Char16* p = first; *p; p++) |
{ | { |
|
|
return p - first; | return p - first; |
} | } |
| |
return Uint32(-1); |
return PEG_NOT_FOUND; |
|
} |
|
|
|
Uint32 String::find(Uint32 index, Char16 c) const |
|
{ |
|
const Char16* data = getChar16Data(); |
|
|
|
for (Uint32 i = index, n = size(); i < n; i++) |
|
{ |
|
if (data[i] == c) |
|
return i; |
|
} |
|
|
|
return PEG_NOT_FOUND; |
} | } |
| |
Uint32 String::find(const String& s) const | Uint32 String::find(const String& s) const |
{ | { |
const Char16* pSubStr = s.getData(); |
const Char16* pSubStr = s.getChar16Data(); |
const Char16* pStr = getData(); |
const Char16* pStr = getChar16Data(); |
Uint32 subStrLen = s.getLength(); |
Uint32 subStrLen = s.size(); |
Uint32 strLen = getLength(); |
Uint32 strLen = size(); |
|
|
|
if (subStrLen > strLen) |
|
{ |
|
return PEG_NOT_FOUND; |
|
} |
| |
// loop to find first char match | // loop to find first char match |
Uint32 loc = 0; | Uint32 loc = 0; |
|
|
Uint32 i = 1; | Uint32 i = 1; |
for (; i < subStrLen; i++) | for (; i < subStrLen; i++) |
if (*pStr++ != *p++ ) | if (*pStr++ != *p++ ) |
{pStr--; break;} // break from loop |
{pStr-=i; break;} // break from loop |
if (i == subStrLen) | if (i == subStrLen) |
return loc; | return loc; |
} | } |
} | } |
return Uint32(-1); |
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 = getChar16Data(); |
const Char16* last = getData() + getLength(); |
const Char16* last = getChar16Data() + size(); |
| |
while (last != first) | while (last != first) |
{ | { |
|
|
return last - first; | return last - first; |
} | } |
| |
return Uint32(-1); |
return PEG_NOT_FOUND; |
} | } |
| |
int String::compare(const Char16* s1, const Char16* s2) |
void String::toLower() |
{ | { |
while (*s1 && *s2) |
#ifdef PEGASUS_HAS_ICU |
|
if (InitializeICU::initICUSuccessful()) |
{ | { |
int r = *s1++ - *s2++; |
// This will do a locale-insensitive, but context-sensitive convert. |
|
// Context-sensitive prevents any optimizations that try to |
|
// convert just the ascii before calling ICU. |
|
// The string may shrink or expand after the convert. |
| |
if (r) |
int32_t sz = size(); |
return r; |
UChar* destbuf = new UChar[sz + 1]; |
|
const UChar* srcbuf = (const UChar *)getChar16Data(); |
|
UErrorCode err = U_ZERO_ERROR; |
|
|
|
int32_t needed = u_strToLower(destbuf, sz + 1 , srcbuf, sz, NULL, &err); |
|
if (err == U_BUFFER_OVERFLOW_ERROR) |
|
{ |
|
delete [] destbuf; |
|
destbuf = new UChar[needed + 1]; |
|
err = U_ZERO_ERROR; |
|
u_strToLower(destbuf, needed + 1 , srcbuf, sz, NULL, &err); |
|
} |
|
if (U_FAILURE(err)) |
|
{ |
|
delete [] destbuf; |
|
throw Exception(u_errorName(err)); |
} | } |
| |
if (*s2) |
if (needed == sz) |
return -1; |
{ |
else if (*s1) |
Char16* from = (Char16*)destbuf; |
return 1; |
for (Char16* to = &_rep->c16a[0]; *to; to++, from++) |
|
{ |
|
*to = *from; |
|
} |
|
} |
|
else |
|
{ |
|
assign((Char16 *)destbuf, needed); |
|
} |
| |
return 0; |
delete [] destbuf; |
|
} |
|
else |
|
#endif |
|
{ |
|
for (Char16* p = &_rep->c16a[0]; *p; p++) |
|
{ |
|
if (*p <= PEGASUS_MAX_PRINTABLE_CHAR) |
|
*p = tolower(*p); |
|
} |
|
} |
} | } |
| |
std::ostream& operator<<(std::ostream& os, const String& x) |
void String::toUpper() |
{ | { |
for (Uint32 i = 0, n = x.getLength(); i < n; i++) |
#ifdef PEGASUS_HAS_ICU |
os << x[i]; |
if (InitializeICU::initICUSuccessful()) |
|
{ |
|
// This will do a locale-insensitive, but context-sensitive convert. |
|
// Context-sensitive prevents any optimizations that try to |
|
// convert just the ascii before calling ICU. |
|
// The string may shrink or expand after the convert. |
| |
return os; |
int32_t sz = size(); |
|
UChar* destbuf = new UChar[sz + 1]; |
|
const UChar* srcbuf = (const UChar *)getChar16Data(); |
|
UErrorCode err = U_ZERO_ERROR; |
|
|
|
int32_t needed = u_strToUpper(destbuf, sz + 1 , srcbuf, sz, NULL, &err); |
|
if (err == U_BUFFER_OVERFLOW_ERROR) |
|
{ |
|
delete [] destbuf; |
|
destbuf = new UChar[needed + 1]; |
|
err = U_ZERO_ERROR; |
|
u_strToUpper(destbuf, needed + 1 , srcbuf, sz, NULL, &err); |
|
} |
|
if (U_FAILURE(err)) |
|
{ |
|
delete [] destbuf; |
|
throw Exception(u_errorName(err)); |
|
} |
|
|
|
if (needed == sz) |
|
{ |
|
Char16* from = (Char16*)destbuf; |
|
for (Char16* to = &_rep->c16a[0]; *to; to++, from++) |
|
{ |
|
*to = *from; |
|
} |
|
} |
|
else |
|
{ |
|
assign((Char16 *)destbuf, needed); |
|
} |
|
|
|
delete [] destbuf; |
|
} |
|
else |
|
#endif |
|
{ |
|
for (Char16* p = &_rep->c16a[0]; *p; p++) |
|
{ |
|
if (*p <= PEGASUS_MAX_PRINTABLE_CHAR) |
|
*p = toupper(*p); |
|
} |
|
} |
} | } |
| |
void String::toLower(char* str) |
int String::compare(const String& s1, const String& s2, Uint32 n) |
{ | { |
while (*str) |
const Char16* s1c16 = s1.getChar16Data(); |
tolower(*str++); |
const Char16* s2c16 = s2.getChar16Data(); |
|
|
|
while (n--) |
|
{ |
|
int r = *s1c16++ - *s2c16++; |
|
|
|
if (r) |
|
return r; |
|
} |
|
|
|
return 0; |
} | } |
| |
String ToLower(const String& str) |
int String::compare(const String& s1, const String& s2) |
{ | { |
String tmp(str); |
const Char16* s1c16 = s1.getChar16Data(); |
|
const Char16* s2c16 = s2.getChar16Data(); |
| |
for (Uint32 i = 0, n = tmp.getLength(); i < n; i++) |
while (*s1c16 && *s2c16) |
{ | { |
Char16 c = tmp[i]; |
int r = *s1c16++ - *s2c16++; |
|
|
|
if (r) |
|
return r; |
|
} |
| |
if (c <= 127) |
if (*s2c16) |
tmp[i] = tolower(c); |
return -1; |
|
else if (*s1c16) |
|
return 1; |
|
|
|
return 0; |
} | } |
| |
return tmp; |
int String::compareNoCase(const String& s1, const String& s2) |
|
{ |
|
#ifdef PEGASUS_HAS_ICU |
|
if (InitializeICU::initICUSuccessful()) |
|
{ |
|
return u_strcasecmp((const UChar*)s1.getChar16Data(), |
|
(const UChar*)s2.getChar16Data(), |
|
U_FOLD_CASE_DEFAULT); |
} | } |
|
#endif |
|
const Char16* _s1 = s1.getChar16Data(); |
|
const Char16* _s2 = s2.getChar16Data(); |
|
|
|
while (*_s1 && *_s2) |
|
{ |
|
int r; |
| |
int CompareIgnoreCase(const char* s1, const char* s2) |
if (*_s1 <= PEGASUS_MAX_PRINTABLE_CHAR && |
|
*_s2 <= PEGASUS_MAX_PRINTABLE_CHAR) |
{ | { |
while (*s1 && *s2) |
r = tolower(*_s1++) - tolower(*_s2++); |
|
} |
|
else |
{ | { |
int r = tolower(*s1++) - tolower(*s2++); |
r = *_s1++ - *_s2++; |
|
} |
| |
if (r) | if (r) |
return r; | return r; |
} | } |
| |
if (*s2) |
if (*_s2) |
return -1; | return -1; |
else if (*s1) |
else if (*_s1) |
return 1; | return 1; |
| |
return 0; | return 0; |
} | } |
| |
Boolean GetLine(istream& is, String& line) |
Boolean String::equal(const String& str1, const String& str2) |
{ | { |
line.clear(); |
return String::compare(str1, str2) == 0; |
|
} |
|
|
|
Boolean String::equalNoCase(const String& str1, const String& str2) |
|
{ |
|
#ifdef PEGASUS_HAS_ICU |
|
return compareNoCase(str1, str2) == 0; |
|
#else |
|
if (str1.size() != str2.size()) |
|
return false; |
| |
Boolean gotChar = false; |
const Char16* p = str1.getChar16Data(); |
char c; |
const Char16* q = str2.getChar16Data(); |
| |
while (is.get(c)) |
Uint32 n = str1.size(); |
|
|
|
while (n--) |
|
{ |
|
if (*p <= PEGASUS_MAX_PRINTABLE_CHAR && |
|
*q <= PEGASUS_MAX_PRINTABLE_CHAR) |
{ | { |
gotChar = true; |
if (tolower(*p++) != tolower(*q++)) |
|
return false; |
|
} |
|
else if (*p++ != *q++) |
|
return false; |
|
} |
|
|
|
return true; |
|
#endif |
|
} |
|
|
| |
if (c == '\n') |
CString String::getCString() const |
break; |
{ |
|
Uint32 n = 3*size() + 1; |
|
char* str = new char[n]; |
|
|
|
const Char16* msg16 = getChar16Data(); |
|
|
|
const Uint16 *strsrc = (Uint16 *)msg16; |
|
Uint16 *endsrc = (Uint16 *)&msg16[size()+1]; |
|
|
|
Uint8 *strtgt = (Uint8 *)str; |
|
Uint8 *endtgt = (Uint8 *)&str[n]; |
|
|
|
UTF16toUTF8 (&strsrc, |
|
endsrc, |
|
&strtgt, |
|
endtgt); |
|
|
|
char* str1 = new char[strlen(str)+1]; |
|
strcpy(str1,str); |
|
delete [] str; |
|
|
|
return CString(str1); |
|
} |
|
|
|
#if 0 |
|
// ATTN-RK-P3-20020603: This code is not completely correct |
|
// Wildcard String matching function that may be useful in the future |
|
// The following code was provided by Bob Blair. |
|
|
|
/* _StringMatch Match input MatchString against a GLOB style pattern |
|
Note that MatchChar is the char type so that this source |
|
in portable to different string types. This is an internal function |
|
|
|
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. |
|
*/ |
|
|
|
/* MatchChar defined as a separate entity because this function source used |
|
elsewhere was an unsigned char *. Here we use Uint16 to maintain 16 bit |
|
size. |
|
*/ |
|
typedef Uint16 MatchChar; |
|
|
|
inline Uint16 _ToLower(Uint16 ch) |
|
{ |
|
// ICU_TODO: If ICU is available we should do this the correct way. |
|
return ch <= PEGASUS_MAX_PRINTABLE_CHAR ? tolower(char(ch)) : ch; |
|
} |
|
|
|
inline Boolean _Equal(MatchChar ch1, MatchChar ch2, int nocase) |
|
{ |
|
// ICU_TODO: If ICU is available we should do this the correct way. |
|
if (nocase) |
|
return _ToLower(ch1) == _ToLower(ch2); |
|
|
|
return ch1 == ch2; |
|
} |
|
|
|
|
|
static const MatchChar * |
|
_matchrange(const MatchChar *range, MatchChar c, int nocase) |
|
{ |
|
const MatchChar *p = range; |
|
const MatchChar *rstart = range + 1; |
|
const MatchChar *rend = 0; |
|
MatchChar compchar; |
|
|
|
for (rend = rstart; *rend && *rend != ']'; rend++); |
|
if (*rend == ']') { // if there is an end to this pattern |
|
for (compchar = *rstart; rstart != rend; rstart++) { |
|
if (_Equal(*rstart, c, nocase)) |
|
return ++rend; |
|
if (*rstart == '-') { |
|
rstart++; |
|
if (c >= compchar && c <= *rstart) |
|
return ++rend; |
|
} |
|
} |
|
} |
|
return (const MatchChar *)0; |
|
} |
|
|
|
static int |
|
_StringMatch( |
|
const MatchChar *testString, |
|
const MatchChar *pattern, |
|
int nocase ) /* Ignore case if this is true */ |
|
{ |
|
const MatchChar *pat = pattern; |
|
const MatchChar *str = testString; |
|
unsigned int done = 0; |
|
unsigned int res = 0; // the result: 1 == match |
|
|
|
while (!done) { // main loop walks through pattern and test string |
|
//cerr << "Comparing <" << *pat << "> and <" << *str << ">" << endl; |
|
if (!*pat) { //end of pattern |
|
done = 1; // we're done |
|
if (!*str) //end of test, too? |
|
res = 1; // then we matched |
|
} else { //Not end of pattern |
|
if (!*str) { // but end of test |
|
done = 1; // We're done |
|
if (*pat == '*') // If pattern openends |
|
res = 1; // then we matched |
|
} else { //Not end of test |
|
if (*pat == '*') { //Ambiguuity found |
|
if (!*++pat) { //and it ends pattern |
|
done = 1; // then we're done |
|
res = 1; // and match |
|
} else { //if it doesn't end |
|
while (!done) { // until we're done |
|
if (_StringMatch(str, pat, nocase)) { // we recurse |
|
done = 1; //if it recurses true |
|
res = 1; // we done and match |
|
} else { //it recurses false |
|
if (!*str) // see if test is done |
|
done = 1; // yes: we done |
|
else // not done: |
|
str++; // keep testing |
|
} // end test on recursive call |
|
} // end looping on recursive calls |
|
} // end logic when pattern is ambiguous |
|
} else { //pattern not ambiguus |
|
if (*pat == '?') { //pattern is 'any' |
|
pat++, str++; // so move along |
|
} else if (*pat == '[') { //see if it's a range |
|
pat = _matchrange(pat, *str, nocase); // and is a match |
|
if (!pat) { //It is not a match |
|
done = 1; // we're done |
|
res = 0; // no match |
|
} else { //Range matches |
|
str++, pat++; // keep going |
|
} |
|
} else { // only case left is individual characters |
|
if (!_Equal(*pat++, *str++, nocase)) // if they don't match |
|
done = 1; // bail. |
|
} |
|
} // end ("pattern is not ambiguous (*)" logic |
|
} // end logic when pattern and string still have data |
|
} // end logic when pattern still has data |
|
} // end main loop |
|
return res; |
|
} |
|
|
|
|
|
/** match matches a string against a GLOB style pattern. |
|
Return trues if the String parameter matches the pattern. C-Shell style |
|
glob matching is used. |
|
@param str String to be matched against the pattern |
|
@param pattern Pattern to use in the match |
|
@return Boolean true if str matches pattern |
|
The pattern definition is as follows: |
|
<pre> |
|
* Matches any number of any characters |
|
? Match exactly one character |
|
[chars] Match any character in chars |
|
[chara-charb] Match any character in the range between chara and charb |
|
</pre> |
|
The literal characters *, ?, [, ] can be included in a string by |
|
escaping them with backslash "\". Ranges of characters can be concatenated. |
|
<pre> |
|
examples: |
|
Boolean result = String::match("This is a test", "*is*"); |
|
Boolean works = String::match("abcdef123", "*[0-9]"); |
|
</pre> |
|
*/ |
|
Boolean String::match(const String& str, const String& pattern) |
|
{ |
|
return _StringMatch( |
|
(Uint16*)str.getChar16Data(), (Uint16*)pattern.getChar16Data(), 0) != 0; |
|
} |
|
|
|
/** matchNoCase Matches a String against a GLOB style pattern independent |
|
of case. |
|
Returns true if the str parameter matches the pattern. C-Shell style |
|
glob matching is used. Ignore case in all comparisons. Case is |
|
ignored in the match. |
|
@parm str String containing the string to be matched\ |
|
@parm pattern GLOB style patterh to use in the match. |
|
@return Boolean true if str matches patterh |
|
@see match |
|
*/ |
|
Boolean String::matchNoCase(const String& str, const String& pattern) |
|
{ |
|
return _StringMatch( |
|
(Uint16*)str.getChar16Data(), (Uint16*)pattern.getChar16Data(), 1) != 0; |
|
} |
|
#endif |
| |
line.append(c); |
|
|
/////////////////////////////////////////////////////////////////////////////// |
|
// |
|
// String-related functions |
|
// |
|
/////////////////////////////////////////////////////////////////////////////// |
|
|
|
Boolean operator==(const String& str1, const String& str2) |
|
{ |
|
return String::equal(str1, str2); |
|
} |
|
|
|
Boolean operator==(const String& str1, const char* str2) |
|
{ |
|
return String::equal(str1, str2); |
|
} |
|
|
|
Boolean operator==(const char* str1, const String& str2) |
|
{ |
|
return String::equal(str1, str2); |
} | } |
| |
return gotChar; |
Boolean operator!=(const String& str1, const String& str2) |
|
{ |
|
return !String::equal(str1, str2); |
|
} |
|
|
|
PEGASUS_STD(ostream)& operator<<(PEGASUS_STD(ostream)& os, const String& str) |
|
{ |
|
|
|
#if defined(PEGASUS_OS_OS400) |
|
CString cstr = str.getCString(); |
|
const char* utf8str = cstr; |
|
|
|
os << utf8str; |
|
|
|
#elif defined(PEGASUS_HAS_ICU) |
|
if (InitializeICU::initICUSuccessful()) |
|
{ |
|
char *buf = NULL; |
|
const int size = str.size() * 6; |
|
UnicodeString UniStr((const UChar *)str.getChar16Data(), (int32_t)str.size()); |
|
Uint32 bufsize = UniStr.extract(0,size,buf); |
|
|
|
buf = new char[bufsize+1]; |
|
UniStr.extract(0,bufsize,buf); |
|
os << buf; |
|
os.flush(); |
|
delete [] buf; |
|
} |
|
else |
|
#endif // End of PEGASUS_HAS_ICU #else leg. |
|
{ |
|
for (Uint32 i = 0, n = str.size(); i < n; i++) |
|
{ |
|
Uint16 code = str[i]; |
|
|
|
if (code > 0 && code <= PEGASUS_MAX_PRINTABLE_CHAR) |
|
{ |
|
os << char(code); |
|
} |
|
else |
|
{ |
|
// Print in hex format: |
|
char buffer[8]; |
|
sprintf(buffer, "\\x%04X", code); |
|
os << buffer; |
|
} |
|
} |
|
} |
|
|
|
return os; |
|
} |
|
|
|
String operator+(const String& str1, const String& str2) |
|
{ |
|
return String(str1).append(str2); |
|
} |
|
|
|
Boolean operator<(const String& str1, const String& str2) |
|
{ |
|
return String::compare(str1, str2) < 0; |
|
} |
|
|
|
Boolean operator<=(const String& str1, const String& str2) |
|
{ |
|
return String::compare(str1, str2) <= 0; |
|
} |
|
|
|
Boolean operator>(const String& str1, const String& str2) |
|
{ |
|
return String::compare(str1, str2) > 0; |
|
} |
|
|
|
Boolean operator>=(const String& str1, const String& str2) |
|
{ |
|
return String::compare(str1, str2) >= 0; |
} | } |
| |
PEGASUS_NAMESPACE_END | PEGASUS_NAMESPACE_END |