pegasus/src/Pegasus/Common/String.cpp - diff

Return to String.cpp CVS log

Up to [Pegasus] / pegasus / src / Pegasus / Common

Diff for /pegasus/src/Pegasus/Common/String.cpp between version 1.1.1.1 and 1.65.2.1

version 1.1.1.1, 2001/01/14 19:53:14

version 1.65.2.1, 2002/10/28 15:43:24

Line 1

//BEGIN_LICENSE

//%/////////////////////////////////////////////////////////////////////////////

// The Open Group, Tivoli Systems

// 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.1.1.1 2001/01/14 19:53:14 mike

// Pegasus import

//%/////////////////////////////////////////////////////////////////////////////

//END_HISTORY

#include <cctype>

#include "String.h"

#include "Array.h"

#include "Exception.h"

#include "String.h"

#include <iostream>

PEGASUS_USING_STD;

PEGASUS_NAMESPACE_BEGIN

const String String::EMPTY;

///////////////////////////////////////////////////////////////////////////////

// String

///////////////////////////////////////////////////////////////////////////////

const String String::EMPTY = String();

void ThrowNullPointer()

Uint32 _strnlen(const char* str, Uint32 n)

{

if (!str)

throw NullPointer();

for (Uint32 i=0; i<n; i++)

{

if (!*str)

{

return i;

}

Uint32 StrLen(const Char16* str)

return n;

}

Uint32 _strnlen(const Char16* str, Uint32 n)

{

if (!str)

ThrowNullPointer();

throw NullPointer();

for (Uint32 i=0; i<n; i++)

{

if (!*str)

{

return i;

}

return n;

}

inline Uint32 _StrLen(const char* str)

{

if (!str)

throw NullPointer();

return strlen(str);

}

inline Uint32 _StrLen(const Char16* str)

{

if (!str)

throw NullPointer();

Uint32 n = 0;

Line 55

Line 99

return n;

}

class StringRep

{

public:

StringRep()

{}

StringRep(const StringRep& r)

: c16a(r.c16a)

{}

StringRep(const Char16* str)

: c16a(str, _StrLen(str) + 1)

{}

Array<Char16> c16a;

};

String::String()

{

_rep.append('\0');

_rep = new StringRep;

_rep->c16a.append('\0');

}

String::String(const String& x) : _rep(x._rep)

String::String(const String& str)

{

_rep = new StringRep(*str._rep);

}

String::String(const String& x, Uint32 n)

String::String(const String& str, Uint32 n)

{

_rep.append('\0');

_rep = new StringRep;

append(x.getData(), n);

assign(str.getData(), n);

}

String::String(const Char16* x) : _rep(x, StrLen(x) + 1)

String::String(const Char16* str)

{

_rep = new StringRep(str);

}

String::String(const Char16* x, Uint32 n)

String::String(const Char16* str, Uint32 n)

{

assign(x, n);

_rep = new StringRep;

assign(str, n);

}

String::String(const char* str)

{

Uint32 n = ::strlen(str) + 1;

_rep = new StringRep;

reserve(n);

assign(str);

}

while (n--)

String::String(const char* str, Uint32 n)

_rep.append(*str++);

{

_rep = new StringRep;

assign(str, n);

}

String::String(const char* str, Uint32 n_)

String::~String()

{

Uint32 n = _min(strlen(str), n_);

delete _rep;

reserve(n + 1);

}

while (n--)

String& String::operator=(const String& str)

_rep.append(*str++);

{

return assign(str);

}

_rep.append('\0');

String& String::assign(const String& str)

{

_rep->c16a = str._rep->c16a;

return *this;

}

String& String::assign(const Char16* x)

String& String::assign(const Char16* str)

{

_rep.clear();

_rep->c16a.clear();

_rep.append(x, StrLen(x) + 1);

_rep->c16a.append(str, _StrLen(str) + 1);

return *this;

}

String& String::assign(const Char16* str, Uint32 n)

{

_rep.clear();

_rep->c16a.clear();

Uint32 m = _min(StrLen(str), n);

Uint32 m = _strnlen(str, n);

_rep.append(str, m);

_rep->c16a.append(str, m);

_rep.append('\0');

_rep->c16a.append('\0');

return *this;

}

String& String::assign(const char* x)

String& String::assign(const char* str)

{

_rep.clear();

_rep->c16a.clear();

Uint32 n = strlen(x);

_rep.reserve(n + 1);

while (n--)

Uint32 n = strlen(str) + 1;

_rep.append(*x++);

_rep->c16a.reserveCapacity(n);

_rep.append('\0');

while (n--)

_rep->c16a.append(*str++);

return *this;

}

String& String::assign(const char* x, Uint32 n_)

String& String::assign(const char* str, Uint32 n)

{

_rep.clear();

_rep->c16a.clear();

Uint32 n = _min(strlen(x), n_);

Uint32 _n = _strnlen(str, n);

_rep.reserve(n + 1);

_rep->c16a.reserveCapacity(_n + 1);

while (n--)

while (_n--)

_rep.append(*x++);

_rep->c16a.append(*str++);

_rep.append('\0');

_rep->c16a.append('\0');

return *this;

}

void String::clear()

{

_rep->c16a.clear();

_rep->c16a.append('\0');

}

void String::reserveCapacity(Uint32 capacity)

{

_rep->c16a.reserveCapacity(capacity + 1);

}

Uint32 String::size() const

{

return _rep->c16a.size() - 1;

}

const Char16* String::getData() const

{

return _rep->c16a.getData();

}

char* String::allocateCString(Uint32 extraBytes, Boolean noThrow) const

{

Uint32 n = getLength() + 1;

Uint32 n = size() + 1;

char* str = new char[n + extraBytes];

char* p = str;

const Char16* q = getData();

Line 165

Line 254

return str;

}

void String::appendToCString(

Char16& String::operator[](Uint32 i)

char* str,

Uint32 length,

Boolean noThrow) const

{

if (!str)

if (i > size())

throw NullPointer();

throw OutOfBounds();

Uint32 n = _min(getLength(), length);

return _rep->c16a[i];

}

char* p = str + strlen(str);

const Char16* q = getData();

for (Uint32 i = 0; i < n; i++)

const Char16 String::operator[](Uint32 i) const

{

Uint16 c = *q++;

if (i > size())

*p++ = char(c);

throw OutOfBounds();

if ((c & 0xff00) && !noThrow)

return _rep->c16a[i];

throw TruncatedCharacter();

}

*p = '\0';

String& String::append(const Char16& c)

{

_rep->c16a.insert(_rep->c16a.size() - 1, c);

return *this;

}

Char16& String::operator[](Uint32 i)

String& String::append(const Char16* str, Uint32 n)

{

if (i > getLength())

Uint32 m = _strnlen(str, n);

ThrowOutOfBounds();

_rep->c16a.reserveCapacity(_rep->c16a.size() + m);

_rep->c16a.remove(_rep->c16a.size() - 1);

_rep->c16a.append(str, m);

_rep->c16a.append('\0');

return *this;

}

return _rep[i];

String& String::append(const String& str)

{

return append(str.getData(), str.size());

}

const Char16 String::operator[](Uint32 i) const

String& String::operator+=(const String& str)

{

if (i > getLength())

return append(str);

ThrowOutOfBounds();

}

return _rep[i];

String& String::operator+=(Char16 c)

{

return append(c);

}

String& String::append(const Char16* str, Uint32 n)

String& String::operator+=(char c)

{

Uint32 m = _min(StrLen(str), n);

return append(Char16(c));

_rep.reserve(_rep.getSize() + m);

_rep.remove(_rep.getSize() - 1);

_rep.append(str, m);

_rep.append('\0');

return *this;

}

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();

throw OutOfBounds();

if (size)

_rep.remove(pos, size);

_rep->c16a.remove(pos, size);

}

Boolean operator==(const String& x, const String& y)

String String::subString(Uint32 pos, Uint32 length) const

{

if (x.getLength() != y.getLength())

if (pos < size())

return false;

{

if (length == PEG_NOT_FOUND)

length = size() - pos;

return String::compare(x.getData(), y.getData(), x.getLength()) == 0;

return String(getData() + pos, length);

}

else

return String();

}

Boolean operator==(const String& x, const Char16* y)

Uint32 String::find(Char16 c) const

{

if (x.getLength() != StrLen(y))

const Char16* first = getData();

return false;

for (const Char16* p = first; *p; p++)

{

if (*p == c)

return p - first;

}

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;

}

Uint32 String::reverseFind(Char16 c) const

{

const Char16* first = getData();

const Char16* last = getData() + size();

while (last != first)

{

if (*--last == c)

return last - first;

}

return String::compare(x.getData(), y, x.getLength()) == 0;

return PEG_NOT_FOUND;

}

inline Boolean operator==(const Char16* x, const String& y)

void String::toLower()

{

for (Char16* p = &_rep->c16a[0]; *p; p++)

{

return operator==(y, x);

if (*p <= PEGASUS_MAX_PRINTABLE_CHAR)

*p = tolower(*p);

}

int String::compare(const Char16* s1, const Char16* s2, Uint32 n)

int String::compare(const String& s1, const String& s2, Uint32 n)

{

const Char16* s1c16 = s1.getData();

const Char16* s2c16 = s2.getData();

while (n--)

{

int r = *s1++ - *s2++;

int r = *s1c16++ - *s2c16++;

if (r)

return r;

Line 262

Line 429

return 0;

}

String String::subString(Uint32 pos, Uint32 length) const

int String::compare(const String& s1, const String& s2)

{

if (pos < getLength())

const Char16* s1c16 = s1.getData();

const Char16* s2c16 = s2.getData();

while (*s1c16 && *s2c16)

{

if (length == Uint32(-1))

int r = *s1c16++ - *s2c16++;

length = getLength() - pos;

return String(getData() + pos, length);

if (r)

return r;

}

else

return String();

if (*s2c16)

return -1;

else if (*s1c16)

return 1;

return 0;

}

Uint32 String::find(Char16 c) const

int String::compareNoCase(const char* s1, const char* s2, Uint32 n)

{

const Char16* first = getData();

while (n--)

for (const Char16* p = first; *p; p++)

{

if (*p == c)

int r = tolower(*s1++) - tolower(*s2++);

return p - first;

if (r)

return r;

}

return Uint32(-1);

return 0;

}

int String::compare(const Char16* s1, const Char16* s2)

int String::compareNoCase(const char* s1, const char* s2)

{

while (*s1 && *s2)

{

int r = *s1++ - *s2++;

int r = tolower(*s1++) - tolower(*s2++);

if (r)

return r;

Line 306

Line 481

return 0;

}

std::ostream& operator<<(std::ostream& os, const String& x)

int String::compareNoCase(const String& s1, const String& s2)

{

const Char16* _s1 = s1.getData();

const Char16* _s2 = s2.getData();

while (*_s1 && *_s2)

{

int r;

if (*_s1 <= PEGASUS_MAX_PRINTABLE_CHAR &&

*_s2 <= PEGASUS_MAX_PRINTABLE_CHAR)

{

r = tolower(*_s1++) - tolower(*_s2++);

}

else

{

r = *_s1++ - *_s2++;

}

if (r)

return r;

}

if (*_s2)

return -1;

else if (*_s1)

return 1;

return 0;

}

Boolean String::equal(const String& str1, const String& str2)

{

return String::compare(str1, str2) == 0;

}

Boolean String::equalNoCase(const String& str1, const String& str2)

{

if (str1.size() != str2.size())

return false;

const Char16* p = str1.getData();

const Char16* q = str2.getData();

Uint32 n = str1.size();

while (n--)

{

if (*p <= PEGASUS_MAX_PRINTABLE_CHAR &&

*q <= PEGASUS_MAX_PRINTABLE_CHAR)

{

if (tolower(*p++) != tolower(*q++))

return false;

}

else if (*p++ != *q++)

return false;

}

return true;

}

// 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)

{

for (Uint32 i = 0, n = x.getLength(); i < n; i++)

return ch <= PEGASUS_MAX_PRINTABLE_CHAR ? tolower(char(ch)) : ch;

os << x[i];

}

inline Boolean _Equal(MatchChar ch1, MatchChar ch2, int nocase)

{

if (nocase)

return _ToLower(ch1) == _ToLower(ch2);

else

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;

}

Boolean String::match(const String& str, const String& pattern)

{

return _StringMatch(

(Uint16*)str.getData(), (Uint16*)pattern.getData(), 0) != 0;

}

Boolean String::matchNoCase(const String& str, const String& pattern)

{

return _StringMatch(

(Uint16*)str.getData(), (Uint16*)pattern.getData(), 1) != 0;

}

///////////////////////////////////////////////////////////////////////////////

// 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);

}

Boolean operator!=(const String& str1, const String& str2)

{

return !String::equal(str1, str2);

}

PEGASUS_STD(ostream)& operator<<(PEGASUS_STD(ostream)& os, const String& str1)

{

for (Uint32 i = 0, n = str1.size(); i < n; i++)

os << str1[i];

return os;

}

Boolean operator==(const String& x, const char* y)

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 operator==(x, String(y));

return String::compare(str1, str2) >= 0;

}

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 operator==(const char* x, const String& y)

int EqualNoCase(const char* s1, const char* s2)

{

return operator==(String(x), y);

return CompareNoCase(s1, s2) == 0;

}

PEGASUS_NAMESPACE_END

Legend:

Removed from v.1.1.1.1
changed lines
	Added in v.1.65.2.1

No CVS admin address has been configured