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.24 and 1.67

version 1.24, 2001/06/16 23:10:05

version 1.67, 2003/04/07 17:50:51

Line 1

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

// The Open Group, Tivoli Systems

// Permission is hereby granted, free of charge, to any person obtaining a copy

// of this software and associated documentation files (the "Software"), to

Line 22

Line 23

// Author: Mike Brasher (mbrasher@bmc.com)

// Modified By:

// Modified By: Roger Kumpf, Hewlett-Packard Company (roger_kumpf@hp.com)

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

#include <cctype>

#include <cstring>

#include "String.h"

#include "Exception.h"

#include "Array.h"

#include "String.h"

#include "InternalException.h"

#include <iostream>

#include <fstream>

#ifndef PEGASUS_REMOVE_DEPRECATED

#include "System.h" // for strcasecmp

#endif

PEGASUS_USING_STD;

PEGASUS_NAMESPACE_BEGIN

#define PEGASUS_ARRAY_T String

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

#include <Pegasus/Common/ArrayImpl.h>

#undef PEGASUS_ARRAY_T

// CString

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

const String String::EMPTY;

CString::CString()

: _rep(0)

{

}

CString::CString(const CString& cstr)

{

_rep = (void*)new char[strlen((char*)cstr._rep)+1];

strcpy((char*)_rep, (char*)cstr._rep);

}

static inline void _SkipWhitespace(const Char16*& p)

CString::CString(char* cstr)

: _rep(cstr)

{

while (*p && isspace(*p))

p++;

}

inline Uint32 StrLen(const char* str)

CString::~CString()

{

if (_rep)

delete [] (char*)_rep;

}

CString& CString::operator=(const CString& cstr)

{

_rep = (char*)new char[strlen((char*)cstr._rep)+1];

strcpy((char*)_rep, (char*)cstr._rep);

return *this;

}

CString::operator const char*() const

{

return (char*)_rep;

}

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

// String

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

const String String::EMPTY = String();

Uint32 _strnlen(const char* str, Uint32 n)

{

if (!str)

throw NullPointer();

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

{

if (!*str)

{

return i;

}

return n;

}

Uint32 _strnlen(const Char16* str, Uint32 n)

{

if (!str)

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

Line 55

Line 131

return strlen(str);

}

inline Uint32 StrLen(const Char16* str)

inline Uint32 _StrLen(const Char16* str)

{

if (!str)

throw NullPointer();

Line 68

Line 144

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)

{

if (str._rep != NULL)

{

_rep = new StringRep(*str._rep);

}

else

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

{

_rep.append('\0');

_rep = new StringRep();

append(x.getData(), n);

}

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

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

{

_rep = new StringRep;

assign(str.getChar16Data(), n);

}

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

_rep.append(*str++);

}

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

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

{

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

_rep = new StringRep;

reserve(n + 1);

assign(str, n);

}

while (n--)

_rep.append(*str++);

_rep.append('\0');

String::~String()

{

delete _rep;

}

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

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

{

_rep.clear();

return assign(str);

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

return *this;

}

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

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

{

_rep.clear();

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

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

_rep.append(str, m);

_rep.append('\0');

return *this;

}

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

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

{

_rep.clear();

_rep->c16a.clear();

Uint32 n = strlen(x);

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

_rep.reserve(n + 1);

while (n--)

_rep.append(*x++);

_rep.append('\0');

return *this;

}

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

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

{

_rep.clear();

_rep->c16a.clear();

Uint32 m = _strnlen(str, n);

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

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

_rep.reserve(n + 1);

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

while (n--)

_rep.append(*x++);

_rep.append('\0');

return *this;

}

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

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

{

Uint32 n = size() + 1;

_rep->c16a.clear();

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

char* p = str;

const Char16* q = getData();

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

Uint32 n = strlen(str) + 1;

{

_rep->c16a.reserveCapacity(n);

Uint16 c = *q++;

*p++ = char(c);

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

while (n--)

throw TruncatedCharacter();

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

}

return str;

return *this;

}

void String::appendToCString(

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

char* str,

Uint32 length,

Boolean noThrow) const

{

if (!str)

_rep->c16a.clear();

throw NullPointer();

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

Uint32 _n = _strnlen(str, n);

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

char* p = str + strlen(str);

while (_n--)

const Char16* q = getData();

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

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

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

{

Uint16 c = *q++;

*p++ = char(c);

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

return *this;

throw TruncatedCharacter();

}

*p = '\0';

}

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

void String::clear()

{

if (i > size())

_rep->c16a.clear();

ThrowOutOfBounds();

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

return _rep[i];

}

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

void String::reserveCapacity(Uint32 capacity)

{

if (i > size())

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

ThrowOutOfBounds();

return _rep[i];

}

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

Uint32 String::size() const

{

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

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

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

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

_rep.append(str, m);

_rep.append('\0');

return *this;

}

void String::remove(Uint32 pos, Uint32 size)

const Char16* String::getChar16Data() const

{

if (size == PEG_NOT_FOUND)

return _rep->c16a.getData();

size = this->size() - pos;

if (pos + size > this->size())

ThrowOutOfBounds();

if (size)

_rep.remove(pos, size);

}

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

CString String::getCString() const

{

while (n--)

Uint32 n = size() + 1;

{

char* str = new char[n];

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

char* p = str;

const Char16* q = getChar16Data();

if (r)

return r;

}

return 0;

}

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

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

{

while (n--)

{

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

Uint16 c = *q++;

*p++ = char(c);

if (r)

//if (c & 0xff00)

return r;

// truncatedCharacters = true;

}

return 0;

return CString(str);

}

Boolean String::equal(const String& x, const String& y)

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

{

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

if (index > size())

return false;

throw IndexOutOfBoundsException();

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

return _rep->c16a[index];

}

Boolean String::equal(const String& x, const Char16* y)

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

{

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

if (index > size())

return false;

throw IndexOutOfBoundsException();

return String::compare(x.getData(), y, x.size()) == 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)

{

return equal(x, String(y));

Uint32 m = _strnlen(str, n);

_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;

}

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

}

Boolean String::equalNoCase(const String& x, const String& y)

void String::remove(Uint32 index, Uint32 size)

{

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

if (size == PEG_NOT_FOUND)

return false;

size = this->size() - index;

const Char16* p = x.getData();

const Char16* q = y.getData();

Uint32 n = x.size();

if (index + size > this->size())

throw IndexOutOfBoundsException();

while (n--)

if (size)

{

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

if (*p <= 127 && *q <= 127)

{

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 index, Uint32 length) const

{

if (pos < size())

if (index < size())

{

if (length == PEG_NOT_FOUND)

if ((length == PEG_NOT_FOUND) || (length > size() - index))

length = size() - pos;

length = size() - index;

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

return String(getChar16Data() + index, length);

}

else

return String();

Line 337

Line 371

Uint32 String::find(Char16 c) const

{

const Char16* first = getData();

const Char16* first = getChar16Data();

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

{

Line 348

Line 382

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

{

const Char16* pSubStr = s.getData();

const Char16* pSubStr = s.getChar16Data();

const Char16* pStr = getData();

const Char16* pStr = getChar16Data();

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

Line 376

Line 428

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

{

const Char16* first = getData();

const Char16* first = getChar16Data();

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

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

while (last != first)

{

Line 396

Line 442

return PEG_NOT_FOUND;

}

// ATTN-RK-P3-20020509: Define case-sensitivity for non-English characters

void String::toLower()

{

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

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

{

if (*p <= 127)

if (*p <= PEGASUS_MAX_PRINTABLE_CHAR)

*p = tolower(*p);

}

void String::translate(Char16 fromChar, Char16 toChar)

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

{

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

const Char16* s1c16 = s1.getChar16Data();

const Char16* s2c16 = s2.getChar16Data();

while (n--)

{

if (*p == fromChar)

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

*p = toChar;

if (r)

return r;

}

return 0;

}

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

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

{

while (*s1 && *s2)

const Char16* s1c16 = s1.getChar16Data();

const Char16* s2c16 = s2.getChar16Data();

while (*s1c16 && *s2c16)

{

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

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

if (r)

return r;

}

if (*s2)

if (*s2c16)

return -1;

else if (*s1)

else if (*s1c16)

return 1;

return 0;

}

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

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

{

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

os << x[i];

return os;

}

void String::toLower(char* str)

{

while (*str)

const Char16* _s1 = s1.getChar16Data();

tolower(*str++);

const Char16* _s2 = s2.getChar16Data();

}

String ToLower(const String& str)

while (*_s1 && *_s2)

{

String tmp(str);

int r;

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

if (*_s1 <= PEGASUS_MAX_PRINTABLE_CHAR &&

*_s2 <= PEGASUS_MAX_PRINTABLE_CHAR)

{

Char16 c = tmp[i];

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

if (c <= 127)

tmp[i] = tolower(c);

}

return tmp;

}

else

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

{

while (*s1 && *s2)

{

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

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

}

if (r)

return r;

}

if (*s2)

if (*_s2)

return -1;

else if (*s1)

else if (*_s1)

return 1;

return 0;

}

Boolean GetLine(PEGASUS_STD(istream)& is, String& line)

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

{

line.clear();

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

}

Boolean gotChar = false;

char c;

while (is.get(c))

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

{

gotChar = true;

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

return false;

if (c == '\n')

break;

line.append(c);

}

return gotChar;

const Char16* p = str1.getChar16Data();

}

const Char16* q = str2.getChar16Data();

String::~String()

Uint32 n = str1.size();

{

}

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

while (n--)

{

_rep = x._rep;

if (*p <= PEGASUS_MAX_PRINTABLE_CHAR &&

return *this;

*q <= PEGASUS_MAX_PRINTABLE_CHAR)

}

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

{

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

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

return *this;

return false;

}

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

void String::clear()

return false;

{

_rep.clear();

_rep.append('\0');

}

void String::reserve(Uint32 capacity)

return true;

{

_rep.reserve(capacity + 1);

}

const Array<String>& EmptyStringArray()

{

static Array<String> tmp;

return tmp;

}

void String::split(const String& line, Array<String>& fields)

#if 0

{

// ATTN-RK-P3-20020603: This code is not completely correct

fields.clear();

// Wildcard String matching function that may be useful in the future

// The following code was provided by Bob Blair.

for (const Char16* p = line.getData(); *p; p++)

/* _StringMatch Match input MatchString against a GLOB style pattern

{

Note that MatchChar is the char type so that this source

_SkipWhitespace(p);

in portable to different string types. This is an internal function

if (!*p)

Results: The return value is 1 if string matches pattern, and

break;

0 otherwise. The matching operation permits the following

special characters in the pattern: *?\[] (see the manual

entry for details on what these mean).

String field;

Side effects: None.

if (*p == '"')

/* MatchChar defined as a separate entity because this function source used

{

elsewhere was an unsigned char *. Here we use Uint16 to maintain 16 bit

p++;

size.

typedef Uint16 MatchChar;

for (; *p && *p != '"'; p++)

inline Uint16 _ToLower(Uint16 ch)

{

if (*p == '\\')

{

p++;

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

}

switch (*p)

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

{

case '\0':

if (nocase)

break;

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

else

return ch1 == ch2;

}

case 'n':

field.append('\n');

break;

case 't':

static const MatchChar *

field.append('\t');

_matchrange(const MatchChar *range, MatchChar c, int nocase)

break;

{

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

@SeeAlso match

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

{

return _StringMatch(

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

}

#endif

case 'r':

field.append('\r');

break;

case 'f':

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

field.append('\f');

break;

// String-related functions

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

default:

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

field.append(*p);

{

}

return String::equal(str1, str2);

}

else

field.append(*p);

Boolean operator==(const String& str1, const char* str2)

{

return String::equal(str1, str2);

}

fields.append(field);

Boolean operator==(const char* str1, const String& str2)

{

return String::equal(str1, str2);

}

else

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

{

for (; *p && !isspace(*p); p++)

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

}

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

{

if (*p == '\\')

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

{

p++;

Uint16 code = str[i];

switch (*p)

if (code > 0 && code <= PEGASUS_MAX_PRINTABLE_CHAR)

{

case '\0':

os << char(code);

break;

case 'n':

field.append('\n');

break;

case 't':

field.append('\t');

break;

case 'r':

field.append('\r');

break;

case 'f':

field.append('\f');

break;

default:

field.append(*p);

}

else

field.append(*p);

{

// Print in hex format:

char buffer[8];

sprintf(buffer, "\\x%04X", code);

os << buffer;

}

fields.append(field);

}

if (!*p)

return os;

break;

}

void String::join(Array<String>& fields, String& line)

String operator+(const String& str1, const String& str2)

{

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

return String(str1).append(str2);

{

String tmp;

Boolean hasSpaces = escape(fields[i], tmp);

if (hasSpaces || tmp.size() == 0)

line += '"';

line += tmp;

if (hasSpaces || tmp.size() == 0)

line += '"';

if (i + 1 != n)

line += ' ';

}

Boolean String::escape(const String& in, String& out)

Boolean operator<(const String& str1, const String& str2)

{

Boolean hasSpaces = false;

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

}

out.reserve(out.size() + (2 * in.size()));

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

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

{

Char16 c = in[i];

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

}

switch (c)

Boolean operator>(const String& str1, const String& str2)

{

case '\n':

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

out += "\\n";

break;

case '\t':

out += "\\t";

break;

case '\r':

out += "\\r";

break;

case '\f':

out += "\\f";

break;

case '\"':

out += "\\\"";

break;

default:

out += c;

if (!hasSpaces)

hasSpaces = c == ' ';

break;

}

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

{

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

}

return hasSpaces;

#ifndef PEGASUS_REMOVE_DEPRECATED

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

{

return System::strcasecmp(s1, s2);

}

#endif

PEGASUS_NAMESPACE_END

Legend:

Removed from v.1.24
changed lines
	Added in v.1.67

No CVS admin address has been configured