1999-03-22 12:54:46 +03:00
|
|
|
|
|
|
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*-
|
|
|
|
*
|
|
|
|
* The contents of this file are subject to the Netscape Public License
|
|
|
|
* Version 1.0 (the "NPL"); you may not use this file except in
|
|
|
|
* compliance with the NPL. You may obtain a copy of the NPL at
|
|
|
|
* http://www.mozilla.org/NPL/
|
|
|
|
*
|
|
|
|
* Software distributed under the NPL is distributed on an "AS IS" basis,
|
|
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
|
|
|
|
* for the specific language governing rights and limitations under the
|
|
|
|
* NPL.
|
|
|
|
*
|
|
|
|
* The Initial Developer of this code under the NPL is Netscape
|
|
|
|
* Communications Corporation. Portions created by Netscape are
|
|
|
|
* Copyright (C) 1998 Netscape Communications Corporation. All Rights
|
|
|
|
* Reserved.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <iostream.h>
|
|
|
|
#include <ctype.h>
|
1999-05-06 09:13:08 +04:00
|
|
|
#include <string.h>
|
1999-03-22 12:54:46 +03:00
|
|
|
#include <stdio.h>
|
|
|
|
#include "nsString2.h"
|
|
|
|
#include "nsDebug.h"
|
|
|
|
#include "nsCRT.h"
|
1999-05-06 09:13:08 +04:00
|
|
|
#include "nsIAtom.h"
|
1999-03-23 10:26:27 +03:00
|
|
|
#include "nsDeque.h"
|
1999-03-22 12:54:46 +03:00
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
#ifndef RICKG_TESTBED
|
|
|
|
#include "prdtoa.h"
|
|
|
|
#include "nsISizeOfHandler.h"
|
|
|
|
#endif
|
1999-03-22 12:54:46 +03:00
|
|
|
|
|
|
|
static const char* kNullPointerError = "Error: unexpected null ptr";
|
|
|
|
static const char* kWhitespace="\b\t\r\n ";
|
|
|
|
|
|
|
|
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
#define NOT_USED 0xfffd
|
1999-03-22 12:54:46 +03:00
|
|
|
|
|
|
|
static PRUint16 PA_HackTable[] = {
|
|
|
|
NOT_USED,
|
|
|
|
NOT_USED,
|
|
|
|
0x201a, /* SINGLE LOW-9 QUOTATION MARK */
|
|
|
|
0x0192, /* LATIN SMALL LETTER F WITH HOOK */
|
|
|
|
0x201e, /* DOUBLE LOW-9 QUOTATION MARK */
|
|
|
|
0x2026, /* HORIZONTAL ELLIPSIS */
|
|
|
|
0x2020, /* DAGGER */
|
|
|
|
0x2021, /* DOUBLE DAGGER */
|
|
|
|
0x02c6, /* MODIFIER LETTER CIRCUMFLEX ACCENT */
|
|
|
|
0x2030, /* PER MILLE SIGN */
|
|
|
|
0x0160, /* LATIN CAPITAL LETTER S WITH CARON */
|
|
|
|
0x2039, /* SINGLE LEFT-POINTING ANGLE QUOTATION MARK */
|
|
|
|
0x0152, /* LATIN CAPITAL LIGATURE OE */
|
|
|
|
NOT_USED,
|
|
|
|
NOT_USED,
|
|
|
|
NOT_USED,
|
|
|
|
|
|
|
|
NOT_USED,
|
|
|
|
0x2018, /* LEFT SINGLE QUOTATION MARK */
|
|
|
|
0x2019, /* RIGHT SINGLE QUOTATION MARK */
|
|
|
|
0x201c, /* LEFT DOUBLE QUOTATION MARK */
|
|
|
|
0x201d, /* RIGHT DOUBLE QUOTATION MARK */
|
|
|
|
0x2022, /* BULLET */
|
|
|
|
0x2013, /* EN DASH */
|
|
|
|
0x2014, /* EM DASH */
|
|
|
|
0x02dc, /* SMALL TILDE */
|
|
|
|
0x2122, /* TRADE MARK SIGN */
|
|
|
|
0x0161, /* LATIN SMALL LETTER S WITH CARON */
|
|
|
|
0x203a, /* SINGLE RIGHT-POINTING ANGLE QUOTATION MARK */
|
|
|
|
0x0153, /* LATIN SMALL LIGATURE OE */
|
|
|
|
NOT_USED,
|
|
|
|
NOT_USED,
|
|
|
|
0x0178 /* LATIN CAPITAL LETTER Y WITH DIAERESIS */
|
|
|
|
};
|
|
|
|
|
|
|
|
static PRUnichar gToUCS2[256];
|
|
|
|
|
|
|
|
class CTableConstructor {
|
|
|
|
public:
|
|
|
|
CTableConstructor(){
|
|
|
|
PRUnichar* cp = gToUCS2;
|
|
|
|
PRInt32 i;
|
|
|
|
for (i = 0; i < 256; i++) {
|
|
|
|
*cp++ = PRUnichar(i);
|
|
|
|
}
|
|
|
|
cp = gToUCS2;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
cp[0x80 + i] = PA_HackTable[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
1999-04-25 07:10:44 +04:00
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
/***********************************************************************
|
|
|
|
IMPLEMENTATION NOTES:
|
|
|
|
|
|
|
|
Man I hate writing string classes.
|
|
|
|
You'd think after about a qintrillion lines of code have been written,
|
|
|
|
that no poor soul would ever have to do this again. Sigh.
|
|
|
|
***********************************************************************/
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
void Subsume(nsStr& aDest,nsStr& aSource){
|
1999-05-07 04:47:24 +04:00
|
|
|
if(aSource.mStr && aSource.mLength) {
|
|
|
|
if(aSource.mOwnsBuffer){
|
|
|
|
aDest.mStr=aSource.mStr;
|
|
|
|
aDest.mLength=aSource.mLength;
|
|
|
|
aDest.mCharSize=aSource.mCharSize;
|
|
|
|
aDest.mCapacity=aSource.mCapacity;
|
|
|
|
aDest.mOwnsBuffer=aSource.mOwnsBuffer;
|
1999-05-07 06:21:43 +04:00
|
|
|
aSource.mOwnsBuffer=PR_FALSE;
|
1999-05-07 04:47:24 +04:00
|
|
|
aSource.mStr=0;
|
|
|
|
}
|
|
|
|
else{
|
|
|
|
nsStr::Assign(aDest,aSource,0,aSource.mLength,0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else nsStr::Truncate(aDest,0,0);
|
1999-05-06 09:13:08 +04:00
|
|
|
}
|
1999-03-22 12:54:46 +03:00
|
|
|
|
1999-05-07 04:47:24 +04:00
|
|
|
#ifdef RICKG_DEBUG
|
|
|
|
/********************************************************
|
|
|
|
This class's only purpose in life is to test nsString2.
|
|
|
|
********************************************************/
|
|
|
|
class CStringTester {
|
|
|
|
public:
|
|
|
|
CStringTester();
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
/**
|
|
|
|
* Default constructor. Note that we actually allocate a small buffer
|
|
|
|
* to begin with. This is because the "philosophy" of the string class
|
|
|
|
* was to allow developers direct access to the underlying buffer for
|
|
|
|
* performance reasons.
|
|
|
|
*/
|
|
|
|
nsString2::nsString2(eCharSize aCharSize,nsIMemoryAgent* anAgent) : mAgent(anAgent) {
|
1999-05-06 09:13:08 +04:00
|
|
|
#ifdef RICKG_DEBUG
|
|
|
|
static CStringTester gStringTester;
|
1999-03-22 12:54:46 +03:00
|
|
|
#endif
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr::Initialize(*this,aCharSize);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This constructor accepts an ascii string
|
|
|
|
* @update gess 1/4/99
|
|
|
|
* @param aCString is a ptr to a 1-byte cstr
|
|
|
|
*/
|
|
|
|
nsString2::nsString2(const char* aCString,eCharSize aCharSize,nsIMemoryAgent* anAgent) : mAgent(anAgent) {
|
|
|
|
nsStr::Initialize(*this,aCharSize);
|
|
|
|
Assign(aCString);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This constructor accepts an ascii string
|
|
|
|
* @update gess 1/4/99
|
|
|
|
* @param aCString is a ptr to a 1-byte cstr
|
|
|
|
*/
|
|
|
|
nsString2::nsString2(const PRUnichar* aString,eCharSize aCharSize,nsIMemoryAgent* anAgent) : mAgent(anAgent) {
|
|
|
|
nsStr::Initialize(*this,aCharSize);
|
|
|
|
Assign(aString);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This is our copy constructor
|
|
|
|
* @update gess 1/4/99
|
|
|
|
* @param reference to another nsString2
|
|
|
|
*/
|
|
|
|
nsString2::nsString2(const nsStr &aString,eCharSize aCharSize,nsIMemoryAgent* anAgent) : mAgent(anAgent) {
|
|
|
|
nsStr::Initialize(*this,aCharSize);
|
|
|
|
nsStr::Assign(*this,aString,0,aString.mLength,mAgent);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This is our copy constructor
|
|
|
|
* @update gess 1/4/99
|
|
|
|
* @param reference to another nsString2
|
|
|
|
*/
|
|
|
|
nsString2::nsString2(const nsString2& aString) :mAgent(aString.mAgent) {
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr::Initialize(*this,(eCharSize)aString.mCharSize);
|
1999-03-22 12:54:46 +03:00
|
|
|
nsStr::Assign(*this,aString,0,aString.mLength,mAgent);
|
|
|
|
}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
/**
|
|
|
|
* construct off a subsumeable string
|
|
|
|
* @update gess 1/4/99
|
|
|
|
* @param reference to a subsumeString
|
|
|
|
*/
|
|
|
|
nsString2::nsString2(nsSubsumeStr& aSubsumeStr) :mAgent(0) {
|
|
|
|
Subsume(*this,aSubsumeStr);
|
|
|
|
}
|
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
/**
|
|
|
|
* Destructor
|
|
|
|
* Make sure we call nsStr::Destroy.
|
|
|
|
*/
|
|
|
|
nsString2::~nsString2() {
|
|
|
|
nsStr::Destroy(*this,mAgent);
|
|
|
|
}
|
|
|
|
|
|
|
|
void nsString2::SizeOf(nsISizeOfHandler* aHandler) const {
|
|
|
|
aHandler->Add(sizeof(*this));
|
1999-05-06 09:13:08 +04:00
|
|
|
aHandler->Add(mCapacity << mCharSize);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This method truncates this string to given length.
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param anIndex -- new length of string
|
|
|
|
* @return nada
|
|
|
|
*/
|
|
|
|
void nsString2::Truncate(PRInt32 anIndex) {
|
|
|
|
nsStr::Truncate(*this,anIndex,mAgent);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Determine whether or not the characters in this
|
|
|
|
* string are in sorted order.
|
|
|
|
*
|
|
|
|
* @update gess 8/25/98
|
|
|
|
* @return TRUE if ordered.
|
|
|
|
*/
|
|
|
|
PRBool nsString2::IsOrdered(void) const {
|
|
|
|
PRBool result=PR_TRUE;
|
|
|
|
if(mLength>1) {
|
|
|
|
PRUint32 theIndex;
|
|
|
|
PRUnichar c1=0;
|
1999-04-06 01:38:50 +04:00
|
|
|
PRUnichar c2=GetCharAt(*this,0);
|
1999-03-22 12:54:46 +03:00
|
|
|
for(theIndex=1;theIndex<mLength;theIndex++) {
|
|
|
|
c1=c2;
|
1999-04-06 01:38:50 +04:00
|
|
|
c2=GetCharAt(*this,theIndex);
|
1999-03-22 12:54:46 +03:00
|
|
|
if(c1>c2) {
|
|
|
|
result=PR_FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Call this method if you want to force the string to a certain capacity
|
|
|
|
* @update gess 1/4/99
|
|
|
|
* @param aLength -- contains new length for mStr
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
void nsString2::SetCapacity(PRUint32 aLength) {
|
|
|
|
if(aLength>mLength) {
|
|
|
|
GrowCapacity(*this,aLength,mAgent);
|
|
|
|
}
|
|
|
|
mLength=aLength;
|
|
|
|
AddNullTerminator(*this);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**********************************************************************
|
|
|
|
Accessor methods...
|
|
|
|
*********************************************************************/
|
|
|
|
|
|
|
|
|
1999-03-23 03:28:36 +03:00
|
|
|
//static char gChar=0;
|
1999-03-22 12:54:46 +03:00
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* @update gess1/4/99
|
1999-05-06 09:13:08 +04:00
|
|
|
* @return ptr to internal buffer (if 1-byte), otherwise NULL
|
1999-03-22 12:54:46 +03:00
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
const char* nsString2::GetBuffer(void) const {
|
|
|
|
if(!mCharSize)
|
1999-03-23 10:33:10 +03:00
|
|
|
return mStr;
|
1999-03-22 12:54:46 +03:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* @update gess1/4/99
|
1999-05-06 09:13:08 +04:00
|
|
|
* @return ptr to internal buffer (if 2-byte), otherwise NULL
|
1999-03-22 12:54:46 +03:00
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
const PRUnichar* nsString2::GetUnicode(void) const {
|
|
|
|
if(mCharSize)
|
1999-03-23 10:33:10 +03:00
|
|
|
return (PRUnichar*)mUStr;
|
1999-03-22 12:54:46 +03:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Get nth character.
|
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
PRUnichar nsString2::operator[](PRUint32 anIndex) const {
|
1999-04-06 01:38:50 +04:00
|
|
|
return GetCharAt(*this,anIndex);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
PRUnichar nsString2::CharAt(PRUint32 anIndex) const {
|
1999-04-06 01:38:50 +04:00
|
|
|
return GetCharAt(*this,anIndex);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
PRUnichar nsString2::First(void) const{
|
1999-04-06 01:38:50 +04:00
|
|
|
return GetCharAt(*this,0);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
PRUnichar nsString2::Last(void) const{
|
1999-04-06 01:38:50 +04:00
|
|
|
return GetCharAt(*this,mLength-1);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
PRBool nsString2::SetCharAt(PRUnichar aChar,PRUint32 anIndex){
|
|
|
|
PRBool result=PR_FALSE;
|
|
|
|
if(anIndex<mLength){
|
1999-05-06 09:13:08 +04:00
|
|
|
if(!mCharSize)
|
1999-03-23 10:33:10 +03:00
|
|
|
mStr[anIndex]=char(aChar);
|
|
|
|
else mUStr[anIndex]=aChar;
|
1999-03-22 12:54:46 +03:00
|
|
|
result=PR_TRUE;
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*********************************************************
|
|
|
|
append (operator+) METHODS....
|
|
|
|
*********************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Create a new string by appending given string to this
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString -- 2nd string to be appended
|
|
|
|
* @return new string
|
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
nsSubsumeStr nsString2::operator+(const nsStr& aString){
|
1999-03-22 12:54:46 +03:00
|
|
|
nsString2 temp(*this); //make a temp string the same size as this...
|
|
|
|
nsStr::Append(temp,aString,0,aString.mLength,mAgent);
|
1999-05-06 09:13:08 +04:00
|
|
|
return nsSubsumeStr(temp);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Create a new string by appending given string to this
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString -- 2nd string to be appended
|
|
|
|
* @return new string
|
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
nsSubsumeStr nsString2::operator+(const nsString2& aString){
|
1999-03-22 12:54:46 +03:00
|
|
|
nsString2 temp(*this); //make a temp string the same size as this...
|
|
|
|
nsStr::Append(temp,aString,0,aString.mLength,mAgent);
|
1999-05-06 09:13:08 +04:00
|
|
|
return nsSubsumeStr(temp);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* create a new string by adding this to the given buffer.
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aCString is a ptr to cstring to be added to this
|
|
|
|
* @return newly created string
|
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
nsSubsumeStr nsString2::operator+(const char* aCString) {
|
1999-03-22 12:54:46 +03:00
|
|
|
nsString2 temp(*this);
|
|
|
|
temp.Append(aCString);
|
1999-05-06 09:13:08 +04:00
|
|
|
return nsSubsumeStr(temp);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* create a new string by adding this to the given char.
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aChar is a char to be added to this
|
|
|
|
* @return newly created string
|
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
nsSubsumeStr nsString2::operator+(char aChar) {
|
1999-03-22 12:54:46 +03:00
|
|
|
nsString2 temp(*this);
|
|
|
|
temp.Append(char(aChar));
|
1999-05-06 09:13:08 +04:00
|
|
|
return nsSubsumeStr(temp);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* create a new string by adding this to the given buffer.
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString is a ptr to unistring to be added to this
|
|
|
|
* @return newly created string
|
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
nsSubsumeStr nsString2::operator+(const PRUnichar* aString) {
|
1999-03-22 12:54:46 +03:00
|
|
|
nsString2 temp(*this);
|
|
|
|
temp.Append(aString);
|
1999-05-06 09:13:08 +04:00
|
|
|
return nsSubsumeStr(temp);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* create a new string by adding this to the given char.
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aChar is a unichar to be added to this
|
|
|
|
* @return newly created string
|
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
nsSubsumeStr nsString2::operator+(PRUnichar aChar) {
|
1999-03-22 12:54:46 +03:00
|
|
|
nsString2 temp(*this);
|
|
|
|
temp.Append(char(aChar));
|
1999-05-06 09:13:08 +04:00
|
|
|
return nsSubsumeStr(temp);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/**********************************************************************
|
|
|
|
Lexomorphic transforms...
|
|
|
|
*********************************************************************/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Converts all chars in given string to UCS2
|
|
|
|
*/
|
|
|
|
void nsString2::ToUCS2(PRUint32 aStartOffset){
|
1999-05-06 09:13:08 +04:00
|
|
|
static CTableConstructor gTableConstructor;
|
1999-03-22 12:54:46 +03:00
|
|
|
if(aStartOffset<mLength){
|
1999-05-06 09:13:08 +04:00
|
|
|
if(mCharSize) {
|
1999-03-22 12:54:46 +03:00
|
|
|
PRUint32 theIndex=0;
|
|
|
|
for(theIndex=aStartOffset;theIndex<mLength;theIndex++){
|
1999-03-23 10:33:10 +03:00
|
|
|
unsigned char ch = (unsigned char)mUStr[theIndex];
|
|
|
|
if( 0x0080 == (0xFFE0 & (mUStr[theIndex])) ) // limit to only 0x0080 to 0x009F
|
|
|
|
mUStr[theIndex]=gToUCS2[ch];
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Converts all chars in internal string to lower
|
|
|
|
* @update gess 01/04/99
|
|
|
|
*/
|
|
|
|
void nsString2::ToLowerCase() {
|
|
|
|
nsStr::ChangeCase(*this,PR_FALSE);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Converts all chars in internal string to upper
|
|
|
|
* @update gess 01/04/99
|
|
|
|
*/
|
|
|
|
void nsString2::ToUpperCase() {
|
|
|
|
nsStr::ChangeCase(*this,PR_TRUE);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Converts chars in this to lowercase, and
|
|
|
|
* stores them in aString
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aOut is a string to contain result
|
|
|
|
*/
|
|
|
|
void nsString2::ToLowerCase(nsString2& aString) const {
|
|
|
|
aString=*this;
|
|
|
|
nsStr::ChangeCase(aString,PR_FALSE);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Converts chars in this to lowercase, and
|
|
|
|
* stores them in a given output string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aOut is a string to contain result
|
|
|
|
*/
|
|
|
|
void nsString2::ToUpperCase(nsString2& aString) const {
|
|
|
|
aString=*this;
|
|
|
|
nsStr::ChangeCase(aString,PR_TRUE);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This method is used to remove all occurances of the
|
|
|
|
* characters found in aSet from this string.
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aSet -- characters to be cut from this
|
|
|
|
* @return *this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::StripChars(const char* aSet){
|
|
|
|
if(aSet){
|
|
|
|
nsStr::StripChars(*this,0,mLength,aSet);
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This method strips whitespace throughout the string
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::StripWhitespace() {
|
|
|
|
nsStr::StripChars(*this,0,mLength,kWhitespace);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This method is used to replace all occurances of the
|
|
|
|
* given source char with the given dest char
|
|
|
|
*
|
|
|
|
* @param
|
|
|
|
* @return *this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::ReplaceChar(PRUnichar aSourceChar, PRUnichar aDestChar) {
|
|
|
|
PRUint32 theIndex=0;
|
|
|
|
for(theIndex=0;theIndex<mLength;theIndex++){
|
1999-05-06 09:13:08 +04:00
|
|
|
if(eTwoByte==mCharSize) {
|
1999-03-23 10:33:10 +03:00
|
|
|
if(mUStr[theIndex]==aSourceChar)
|
|
|
|
mUStr[theIndex]=aDestChar;
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
else {
|
1999-03-23 10:33:10 +03:00
|
|
|
if(mStr[theIndex]==aSourceChar)
|
|
|
|
mStr[theIndex]=(char)aDestChar;
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This method trims characters found in aTrimSet from
|
|
|
|
* either end of the underlying string.
|
|
|
|
*
|
|
|
|
* @update gess 3/31/98
|
|
|
|
* @param aTrimSet -- contains chars to be trimmed from
|
|
|
|
* both ends
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Trim(const char* aTrimSet, PRBool aEliminateLeading,PRBool aEliminateTrailing){
|
|
|
|
if(aTrimSet){
|
|
|
|
nsStr::Trim(*this,aTrimSet,aEliminateLeading,aEliminateTrailing);
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This method strips whitespace from string.
|
|
|
|
* You can control whether whitespace is yanked from
|
|
|
|
* start and end of string as well.
|
|
|
|
*
|
|
|
|
* @update gess 3/31/98
|
|
|
|
* @param aEliminateLeading controls stripping of leading ws
|
|
|
|
* @param aEliminateTrailing controls stripping of trailing ws
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::CompressSet(const char* aSet, char aChar, PRBool aEliminateLeading,PRBool aEliminateTrailing){
|
|
|
|
if(aSet){
|
|
|
|
nsStr::CompressSet(*this,aSet,aChar,aEliminateLeading,aEliminateTrailing);
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This method strips whitespace from string.
|
|
|
|
* You can control whether whitespace is yanked from
|
|
|
|
* start and end of string as well.
|
|
|
|
*
|
|
|
|
* @update gess 3/31/98
|
|
|
|
* @param aEliminateLeading controls stripping of leading ws
|
|
|
|
* @param aEliminateTrailing controls stripping of trailing ws
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::CompressWhitespace( PRBool aEliminateLeading,PRBool aEliminateTrailing){
|
|
|
|
nsStr::CompressSet(*this,kWhitespace,' ',aEliminateLeading,aEliminateTrailing);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**********************************************************************
|
|
|
|
string conversion methods...
|
|
|
|
*********************************************************************/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Creates a duplicate clone (ptr) of this string.
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @return ptr to clone of this string
|
|
|
|
*/
|
|
|
|
nsString2* nsString2::ToNewString() const {
|
|
|
|
return new nsString2(*this);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Creates an ascii clone of this string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @return ptr to new ascii string
|
|
|
|
*/
|
|
|
|
char* nsString2::ToNewCString() const {
|
1999-05-06 09:13:08 +04:00
|
|
|
PRUint32 theLength=mLength+2; //one for good measure and one for the Nullchar
|
|
|
|
char* result=new char[theLength];
|
|
|
|
nsAutoString2 temp(result,theLength-1,eOneByte,PR_TRUE);
|
|
|
|
nsStr::Assign(temp,*this,0,mLength,0);
|
1999-03-23 10:33:10 +03:00
|
|
|
temp.mStr=0;
|
1999-03-22 12:54:46 +03:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Creates an ascii clone of this string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @return ptr to new ascii string
|
|
|
|
*/
|
|
|
|
PRUnichar* nsString2::ToNewUnicode() const {
|
1999-05-06 09:13:08 +04:00
|
|
|
|
|
|
|
PRUint32 theLength=mLength+2; //one for good measure and one for the Nullchar
|
|
|
|
PRUnichar* result=new PRUnichar[theLength];
|
|
|
|
nsAutoString2 temp(result,theLength-1,eTwoByte,PR_TRUE);
|
|
|
|
nsStr::Assign(temp,*this,0,mLength,0);
|
|
|
|
temp.mStr=0;
|
1999-03-22 12:54:46 +03:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copies contents of this string into he given buffer
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
char* nsString2::ToCString(char* aBuf, PRUint32 aBufLength) const{
|
1999-05-06 09:13:08 +04:00
|
|
|
PRUint32 theLength=0;
|
|
|
|
if(aBuf && (0<mLength)) {
|
|
|
|
nsStr temp;
|
|
|
|
nsStr::Initialize(temp,eOneByte);
|
|
|
|
temp.mStr=aBuf;
|
|
|
|
temp.mCapacity=aBufLength-1;
|
|
|
|
theLength = (mLength<aBufLength-1) ? mLength : aBufLength-1;
|
|
|
|
nsStr::Assign(temp,*this,0,theLength,mAgent);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
1999-05-06 09:13:08 +04:00
|
|
|
aBuf[theLength]=0;
|
1999-03-22 12:54:46 +03:00
|
|
|
return aBuf;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Perform string to float conversion.
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aErrorCode will contain error if one occurs
|
|
|
|
* @return float rep of string value
|
|
|
|
*/
|
|
|
|
float nsString2::ToFloat(PRInt32* aErrorCode) const {
|
|
|
|
char buf[100];
|
|
|
|
if (mLength > PRInt32(sizeof(buf)-1)) {
|
|
|
|
*aErrorCode = (PRInt32) NS_ERROR_ILLEGAL_VALUE;
|
|
|
|
return 0.0f;
|
|
|
|
}
|
|
|
|
char* cp = ToCString(buf, sizeof(buf));
|
|
|
|
float f = (float) PR_strtod(cp, &cp);
|
|
|
|
if (*cp != 0) {
|
|
|
|
*aErrorCode = (PRInt32) NS_ERROR_ILLEGAL_VALUE;
|
|
|
|
}
|
|
|
|
*aErrorCode = (PRInt32) NS_OK;
|
|
|
|
return f;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Perform numeric string to int conversion with given radix.
|
|
|
|
* @update gess 10/01/98
|
|
|
|
* @param aErrorCode will contain error if one occurs
|
|
|
|
* @param aRadix tells us what base to expect the string in.
|
|
|
|
* @return int rep of string value
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::ToInteger(PRInt32* anErrorCode,PRUint32 aRadix) const {
|
|
|
|
|
|
|
|
//copy chars to local buffer -- step down from 2 bytes to 1 if necessary...
|
|
|
|
PRInt32 result=0;
|
|
|
|
|
|
|
|
nsAutoString2 theString(*this,eOneByte);
|
|
|
|
|
|
|
|
PRInt32 decPt=theString.FindChar(theString,'.',PR_TRUE,0);
|
1999-03-23 10:33:10 +03:00
|
|
|
char* cp = (kNotFound==decPt) ? theString.mStr + theString.mLength-1 : theString.mStr+decPt-1;
|
1999-03-22 12:54:46 +03:00
|
|
|
char digit=0;
|
|
|
|
char theChar;
|
1999-03-23 03:28:36 +03:00
|
|
|
// PRInt32 theShift=0;
|
1999-03-22 12:54:46 +03:00
|
|
|
PRInt32 theMult=1;
|
|
|
|
|
|
|
|
*anErrorCode = (0<theString.mLength) ? NS_OK : NS_ERROR_ILLEGAL_VALUE;
|
|
|
|
|
|
|
|
// Skip trailing non-numeric...
|
1999-03-23 10:33:10 +03:00
|
|
|
while (cp >= theString.mStr) {
|
1999-03-22 12:54:46 +03:00
|
|
|
theChar = toupper(*cp);
|
|
|
|
if((theChar>='0') && (theChar<='9')){
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else if((theChar>='A') && (theChar<='F')) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
cp--;
|
|
|
|
}
|
|
|
|
|
|
|
|
//now iterate the numeric chars and build our result
|
1999-03-23 10:33:10 +03:00
|
|
|
while(cp>=theString.mStr) {
|
1999-03-22 12:54:46 +03:00
|
|
|
theChar=toupper(*cp--);
|
|
|
|
if((theChar>='0') && (theChar<='9')){
|
|
|
|
digit=theChar-'0';
|
|
|
|
}
|
|
|
|
else if((theChar>='A') && (theChar<='F')) {
|
|
|
|
digit=(theChar-'A')+10;
|
|
|
|
}
|
|
|
|
else if('-'==theChar) {
|
|
|
|
result=-result;
|
|
|
|
break;
|
|
|
|
}
|
1999-05-06 09:13:08 +04:00
|
|
|
else if(('+'==theChar) || (' '==theChar) || ('#'==theChar)) { //stop in a good state if you see this...
|
1999-03-22 12:54:46 +03:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
else if(('X'==theChar) && (16==aRadix)) {
|
|
|
|
//stop in a good state.
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else{
|
|
|
|
*anErrorCode=NS_ERROR_ILLEGAL_VALUE;
|
|
|
|
result=0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
result+=digit*theMult;
|
|
|
|
theMult*=aRadix;
|
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**********************************************************************
|
|
|
|
String manipulation methods...
|
|
|
|
*********************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* assign given string to this one
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString: string to be added to this
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Assign(const nsStr& aString,PRInt32 aCount) {
|
|
|
|
if(-1==aCount) aCount=aString.mLength;
|
|
|
|
nsStr::Assign(*this,aString,0,aCount,mAgent);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* assign given string to this one
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString: string to be added to this
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Assign(const nsString2& aString,PRInt32 aCount) {
|
|
|
|
if(-1==aCount) aCount=aString.mLength;
|
|
|
|
nsStr::Assign(*this,aString,0,aCount,mAgent);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* assign given char* to this string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aCString: buffer to be assigned to this
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Assign(const char* aCString,PRInt32 aCount) {
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr::Truncate(*this,0,0);
|
1999-03-22 12:54:46 +03:00
|
|
|
if(aCString){
|
|
|
|
Append(aCString,aCount);
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* assign given unichar* to this string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString: buffer to be assigned to this
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Assign(const PRUnichar* aString,PRInt32 aCount) {
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr::Truncate(*this,0,0);
|
1999-03-22 12:54:46 +03:00
|
|
|
if(aString){
|
|
|
|
Append(aString,aCount);
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* assign given char to this string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aChar: char to be assignd to this
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Assign(char aChar) {
|
|
|
|
nsStr::Truncate(*this,0,0);
|
|
|
|
return Append(aChar);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* assign given char to this string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aChar: char to be assignd to this
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Assign(PRUnichar aChar) {
|
|
|
|
nsStr::Truncate(*this,0,0);
|
|
|
|
return Append(aChar);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
1999-05-06 09:13:08 +04:00
|
|
|
* WARNING! THIS IS A VERY SPECIAL METHOD.
|
|
|
|
* This method "steals" the contents of aSource and hands it to aDest.
|
|
|
|
* Ordinarily a copy is made, but not in this version.
|
|
|
|
* @update gess10/30/98
|
|
|
|
* @param
|
|
|
|
* @return
|
1999-03-22 12:54:46 +03:00
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
nsString2& nsString2::operator=(nsSubsumeStr& aSubsumeString) {
|
|
|
|
Subsume(*this,aSubsumeString);
|
|
|
|
return *this;
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
/**
|
|
|
|
* append given string to this string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString : string to be appended to this
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Append(const nsStr& aString,PRInt32 aCount) {
|
|
|
|
if(-1==aCount) aCount=aString.mLength;
|
|
|
|
nsStr::Append(*this,aString,0,aCount,mAgent);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* append given string to this string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString : string to be appended to this
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Append(const nsString2& aString,PRInt32 aCount) {
|
|
|
|
if(-1==aCount) aCount=aString.mLength;
|
|
|
|
nsStr::Append(*this,aString,0,aCount,mAgent);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* append given string to this string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString : string to be appended to this
|
|
|
|
* @param aCount: #of chars to be copied
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Append(const char* aCString,PRInt32 aCount) {
|
|
|
|
if(aCString){
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
Initialize(temp,eOneByte);
|
|
|
|
temp.mStr=(char*)aCString;
|
1999-05-14 03:44:57 +04:00
|
|
|
if(-1==aCount) aCount= nsCRT::strlen(aCString);
|
|
|
|
temp.mLength = aCount;
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr::Append(*this,temp,0,aCount,mAgent);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* append given uni-string to this string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString : string to be appended to this
|
|
|
|
* @param aCount: #of chars to be copied
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Append(const PRUnichar* aString,PRInt32 aCount) {
|
|
|
|
if(aString){
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
Initialize(temp,eTwoByte);
|
|
|
|
temp.mUStr=(PRUnichar*)aString;
|
1999-05-14 03:44:57 +04:00
|
|
|
if(-1==aCount) aCount= nsCRT::strlen(aString);
|
|
|
|
temp.mLength = aCount;
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr::Append(*this,temp,0,aCount,mAgent);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* append given string to this string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString : string to be appended to this
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Append(char aChar) {
|
|
|
|
char buf[2]={0,0};
|
|
|
|
buf[0]=aChar;
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
Initialize(temp,eOneByte);
|
|
|
|
temp.mStr=buf;
|
|
|
|
temp.mLength=1;
|
|
|
|
nsStr::Append(*this,temp,0,1,mAgent);
|
1999-03-22 12:54:46 +03:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* append given string to this string
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString : string to be appended to this
|
|
|
|
* @return this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Append(PRUnichar aChar) {
|
|
|
|
PRUnichar buf[2]={0,0};
|
|
|
|
buf[0]=aChar;
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
Initialize(temp,eTwoByte);
|
|
|
|
temp.mUStr=buf;
|
|
|
|
temp.mLength=1;
|
|
|
|
nsStr::Append(*this,temp,0,1,mAgent);
|
1999-03-22 12:54:46 +03:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Append(PRInt32 aInteger,PRInt32 aRadix) {
|
|
|
|
char* fmt = "%d";
|
|
|
|
if (8 == aRadix) {
|
|
|
|
fmt = "%o";
|
|
|
|
} else if (16 == aRadix) {
|
|
|
|
fmt = "%x";
|
|
|
|
}
|
|
|
|
char buf[40];
|
|
|
|
// *** XX UNCOMMENT THIS LINE
|
|
|
|
//PR_snprintf(buf, sizeof(buf), fmt, aInteger);
|
|
|
|
sprintf(buf,fmt,aInteger);
|
|
|
|
return Append(buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Append(float aFloat){
|
|
|
|
char buf[40];
|
|
|
|
// *** XX UNCOMMENT THIS LINE
|
|
|
|
//PR_snprintf(buf, sizeof(buf), "%g", aFloat);
|
|
|
|
sprintf(buf,"%g",aFloat);
|
|
|
|
return Append(buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copies n characters from this string to given string,
|
|
|
|
* starting at the leftmost offset.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* @update gess 4/1/98
|
|
|
|
* @param aCopy -- Receiving string
|
|
|
|
* @param aCount -- number of chars to copy
|
|
|
|
* @return number of chars copied
|
|
|
|
*/
|
|
|
|
PRUint32 nsString2::Left(nsString2& aDest,PRInt32 aCount) const{
|
|
|
|
nsStr::Assign(aDest,*this,0,aCount,mAgent);
|
|
|
|
return aDest.mLength;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copies n characters from this string to given string,
|
|
|
|
* starting at the given offset.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* @update gess 4/1/98
|
|
|
|
* @param aDest -- Receiving string
|
|
|
|
* @param aCount -- number of chars to copy
|
|
|
|
* @param anOffset -- position where copying begins
|
|
|
|
* @return number of chars copied
|
|
|
|
*/
|
|
|
|
PRUint32 nsString2::Mid(nsString2& aDest,PRUint32 anOffset,PRInt32 aCount) const{
|
|
|
|
nsStr::Assign(aDest,*this,anOffset,aCount,mAgent);
|
|
|
|
return aDest.mLength;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copies n characters from this string to given string,
|
|
|
|
* starting at rightmost char.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* @update gess 4/1/98
|
|
|
|
* @param aCopy -- Receiving string
|
|
|
|
* @param aCount -- number of chars to copy
|
|
|
|
* @return number of chars copied
|
|
|
|
*/
|
|
|
|
PRUint32 nsString2::Right(nsString2& aCopy,PRInt32 aCount) const{
|
|
|
|
PRInt32 offset=MaxInt(mLength-aCount,0);
|
|
|
|
return Mid(aCopy,offset,aCount);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This method inserts n chars from given string into this
|
|
|
|
* string at str[anOffset].
|
|
|
|
*
|
|
|
|
* @update gess 4/1/98
|
|
|
|
* @param aCopy -- String to be inserted into this
|
|
|
|
* @param anOffset -- insertion position within this str
|
|
|
|
* @param aCount -- number of chars to be copied from aCopy
|
|
|
|
* @return number of chars inserted into this.
|
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
nsString2& nsString2::Insert(const nsString2& aCopy,PRUint32 anOffset,PRInt32 aCount) {
|
1999-03-22 12:54:46 +03:00
|
|
|
nsStr::Insert(*this,anOffset,aCopy,0,aCount,mAgent);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Insert a single unicode char into this string at
|
|
|
|
* a specified offset.
|
|
|
|
*
|
|
|
|
* @update gess4/22/98
|
|
|
|
* @param aChar char to be inserted into this string
|
|
|
|
* @param anOffset is insert pos in str
|
|
|
|
* @return the number of chars inserted into this string
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Insert(const char* aCString,PRUint32 anOffset,PRInt32 aCount){
|
|
|
|
if(aCString){
|
|
|
|
if(0<aCount) {
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
nsStr::Initialize(temp,eOneByte);
|
|
|
|
temp.mStr=(char*)aCString;
|
|
|
|
temp.mLength=nsCRT::strlen(aCString);
|
|
|
|
if(temp.mLength){
|
|
|
|
nsStr::Insert(*this,anOffset,temp,0,aCount,0);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Insert a single char into this string at
|
|
|
|
* a specified offset.
|
|
|
|
*
|
|
|
|
* @update gess4/22/98
|
|
|
|
* @param aChar char to be inserted into this string
|
|
|
|
* @param anOffset is insert pos in str
|
|
|
|
* @return the number of chars inserted into this string
|
|
|
|
*/
|
|
|
|
/*
|
|
|
|
nsString2& nsString2::Insert(char aChar,PRUint32 anOffset){
|
|
|
|
char theBuffer[2]={0,0};
|
|
|
|
theBuffer[0]=aChar;
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
nsStr::Initialize(temp,eOneByte);
|
|
|
|
temp.mStr=(char*)theBuffer;
|
|
|
|
temp.mLength=1;
|
|
|
|
nsStr::Insert(*this,anOffset,temp,0,1,0);
|
1999-03-22 12:54:46 +03:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Insert a unicode* into this string at
|
|
|
|
* a specified offset.
|
|
|
|
*
|
|
|
|
* @update gess4/22/98
|
|
|
|
* @param aChar char to be inserted into this string
|
|
|
|
* @param anOffset is insert pos in str
|
|
|
|
* @return the number of chars inserted into this string
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Insert(const PRUnichar* aString,PRUint32 anOffset,PRInt32 aCount){
|
|
|
|
if(aString){
|
|
|
|
if(0<aCount) {
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
nsStr::Initialize(temp,eTwoByte);
|
|
|
|
temp.mUStr=(PRUnichar*)aString;
|
|
|
|
temp.mLength=nsCRT::strlen(aString);
|
|
|
|
if(temp.mLength){
|
|
|
|
nsStr::Insert(*this,anOffset,temp,0,aCount,0);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Insert a single uni-char into this string at
|
|
|
|
* a specified offset.
|
|
|
|
*
|
|
|
|
* @update gess4/22/98
|
|
|
|
* @param aChar char to be inserted into this string
|
|
|
|
* @param anOffset is insert pos in str
|
|
|
|
* @return the number of chars inserted into this string
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Insert(PRUnichar aChar,PRUint32 anOffset){
|
|
|
|
PRUnichar theBuffer[2]={0,0};
|
|
|
|
theBuffer[0]=aChar;
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
nsStr::Initialize(temp,eTwoByte);
|
|
|
|
temp.mUStr=theBuffer;
|
|
|
|
temp.mLength=1;
|
|
|
|
nsStr::Insert(*this,anOffset,temp,0,1,0);
|
1999-03-22 12:54:46 +03:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This method is used to cut characters in this string
|
|
|
|
* starting at anOffset, continuing for aCount chars.
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param anOffset -- start pos for cut operation
|
|
|
|
* @param aCount -- number of chars to be cut
|
|
|
|
* @return *this
|
|
|
|
*/
|
|
|
|
nsString2& nsString2::Cut(PRUint32 anOffset, PRInt32 aCount) {
|
|
|
|
nsStr::Delete(*this,anOffset,aCount,mAgent);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**********************************************************************
|
|
|
|
Searching methods...
|
|
|
|
*********************************************************************/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Search for given character within this string.
|
|
|
|
* This method does so by using a binary search,
|
|
|
|
* so your string HAD BETTER BE ORDERED!
|
|
|
|
*
|
|
|
|
* @param aChar is the unicode char to be found
|
|
|
|
* @return offset in string, or -1 (kNotFound)
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::BinarySearch(PRUnichar aChar) const{
|
|
|
|
PRInt32 low=0;
|
|
|
|
PRInt32 high=mLength-1;
|
|
|
|
|
|
|
|
while (low <= high) {
|
|
|
|
int middle = (low + high) >> 1;
|
1999-04-06 01:38:50 +04:00
|
|
|
PRUnichar theChar=GetCharAt(*this,middle);
|
1999-03-22 12:54:46 +03:00
|
|
|
if (theChar==aChar)
|
|
|
|
return middle;
|
|
|
|
if (theChar>aChar)
|
|
|
|
high = middle - 1;
|
|
|
|
else
|
|
|
|
low = middle + 1;
|
|
|
|
}
|
|
|
|
return kNotFound;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Search for given buffer within this string
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param aCStringBuf - charstr to be found
|
|
|
|
* @return offset in string, or -1 (kNotFound)
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::Find(const char* aCString,PRBool aIgnoreCase) const{
|
|
|
|
NS_ASSERTION(0!=aCString,kNullPointerError);
|
|
|
|
|
|
|
|
PRInt32 result=kNotFound;
|
|
|
|
if(aCString) {
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
nsStr::Initialize(temp,eOneByte);
|
|
|
|
temp.mLength=nsCRT::strlen(aCString);
|
|
|
|
temp.mStr=(char*)aCString;
|
|
|
|
result=nsStr::FindSubstr(*this,temp,aIgnoreCase,0);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Search for given buffer within this string
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param aCStringBuf - charstr to be found
|
|
|
|
* @return offset in string, or -1 (kNotFound)
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::Find(const PRUnichar* aString,PRBool aIgnoreCase) const{
|
|
|
|
NS_ASSERTION(0!=aString,kNullPointerError);
|
|
|
|
|
|
|
|
PRInt32 result=kNotFound;
|
|
|
|
if(aString) {
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
nsStr::Initialize(temp,eTwoByte);
|
|
|
|
temp.mLength=nsCRT::strlen(aString);
|
|
|
|
temp.mUStr=(PRUnichar*)aString;
|
|
|
|
result=nsStr::FindSubstr(*this,temp,aIgnoreCase,0);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Search for given buffer within this string
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param nsString2 -- buffer to be found
|
|
|
|
* @return offset in string, or -1 (kNotFound)
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::Find(const nsStr& aString,PRBool aIgnoreCase) const{
|
|
|
|
PRInt32 result=nsStr::FindSubstr(*this,aString,aIgnoreCase,0);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
/**
|
|
|
|
* Search for given buffer within this string
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param nsString2 -- buffer to be found
|
|
|
|
* @return offset in string, or -1 (kNotFound)
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::Find(const nsString2& aString,PRBool aIgnoreCase) const{
|
|
|
|
PRInt32 result=nsStr::FindSubstr(*this,aString,aIgnoreCase,0);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
/**
|
|
|
|
* Search for a given char, starting at given offset
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return offset of found char, or -1 (kNotFound)
|
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
PRInt32 nsString2::Find(PRUnichar aChar,PRUint32 anOffset,PRBool aIgnoreCase) const{
|
|
|
|
PRInt32 result=nsStr::FindChar(*this,aChar,aIgnoreCase,anOffset);
|
1999-03-22 12:54:46 +03:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::FindCharInSet(const char* aCStringSet,PRUint32 anOffset) const{
|
|
|
|
NS_ASSERTION(0!=aCStringSet,kNullPointerError);
|
|
|
|
|
|
|
|
PRInt32 result=kNotFound;
|
|
|
|
if(aCStringSet) {
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
nsStr::Initialize(temp,eOneByte);
|
|
|
|
temp.mLength=nsCRT::strlen(aCStringSet);
|
|
|
|
temp.mStr=(char*)aCStringSet;
|
|
|
|
result=nsStr::FindCharInSet(*this,temp,PR_FALSE,anOffset);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::FindCharInSet(const nsString2& aSet,PRUint32 anOffset) const{
|
|
|
|
PRInt32 result=nsStr::FindCharInSet(*this,aSet,PR_FALSE,anOffset);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::RFindCharInSet(const char* aCStringSet,PRUint32 anOffset) const{
|
|
|
|
NS_ASSERTION(0!=aCStringSet,kNullPointerError);
|
|
|
|
|
|
|
|
PRInt32 result=kNotFound;
|
|
|
|
if(aCStringSet) {
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
nsStr::Initialize(temp,eOneByte);
|
|
|
|
temp.mLength=nsCRT::strlen(aCStringSet);
|
|
|
|
temp.mStr=(char*)aCStringSet;
|
|
|
|
result=nsStr::RFindCharInSet(*this,temp,PR_FALSE,anOffset);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::RFindCharInSet(const nsString2& aSet,PRUint32 anOffset) const{
|
|
|
|
PRInt32 result=nsStr::RFindCharInSet(*this,aSet,PR_FALSE,anOffset);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::RFind(const nsStr& aString,PRBool aIgnoreCase) const{
|
|
|
|
PRInt32 result=nsStr::RFindSubstr(*this,aString,aIgnoreCase,0);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
/**
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::RFind(const nsString2& aString,PRBool aIgnoreCase) const{
|
|
|
|
PRInt32 result=nsStr::RFindSubstr(*this,aString,aIgnoreCase,0);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
/**
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::RFind(const char* aString,PRBool aIgnoreCase) const{
|
|
|
|
NS_ASSERTION(0!=aString,kNullPointerError);
|
|
|
|
|
|
|
|
PRInt32 result=kNotFound;
|
|
|
|
if(aString) {
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
nsStr::Initialize(temp,eOneByte);
|
|
|
|
temp.mLength=nsCRT::strlen(aString);
|
|
|
|
temp.mStr=(char*)aString;
|
|
|
|
result=nsStr::RFindSubstr(*this,temp,aIgnoreCase,0);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Search for a given char, starting at given offset
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return offset of found char, or -1 (kNotFound)
|
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
PRInt32 nsString2::RFind(PRUnichar aChar,PRUint32 anOffset,PRBool aIgnoreCase) const{
|
1999-03-22 12:54:46 +03:00
|
|
|
PRInt32 result=nsStr::RFindChar(*this,aChar,aIgnoreCase,anOffset);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**************************************************************
|
|
|
|
COMPARISON METHODS...
|
|
|
|
**************************************************************/
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
/**
|
|
|
|
* Compares given cstring to this string.
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aCString pts to a cstring
|
|
|
|
* @param aIgnoreCase tells us how to treat case
|
|
|
|
* @return -1,0,1
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::Compare(const nsString2& aString,PRBool aIgnoreCase,PRInt32 aLength) const {
|
|
|
|
return nsStr::Compare(*this,aString,aLength,aIgnoreCase);
|
|
|
|
}
|
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
/**
|
|
|
|
* Compares given cstring to this string.
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aCString pts to a cstring
|
|
|
|
* @param aIgnoreCase tells us how to treat case
|
|
|
|
* @return -1,0,1
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::Compare(const char *aCString,PRBool aIgnoreCase,PRInt32 aLength) const {
|
|
|
|
NS_ASSERTION(0!=aCString,kNullPointerError);
|
|
|
|
|
|
|
|
if(aCString) {
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
nsStr::Initialize(temp,eOneByte);
|
|
|
|
temp.mLength=nsCRT::strlen(aCString);
|
|
|
|
temp.mStr=(char*)aCString;
|
|
|
|
return nsStr::Compare(*this,temp,aLength,aIgnoreCase);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Compares given unistring to this string.
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString pts to a uni-string
|
|
|
|
* @param aIgnoreCase tells us how to treat case
|
|
|
|
* @return -1,0,1
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::Compare(const PRUnichar* aString,PRBool aIgnoreCase,PRInt32 aLength) const {
|
|
|
|
NS_ASSERTION(0!=aString,kNullPointerError);
|
|
|
|
|
|
|
|
if(aString) {
|
1999-05-06 09:13:08 +04:00
|
|
|
nsStr temp;
|
|
|
|
nsStr::Initialize(temp,eTwoByte);
|
|
|
|
temp.mLength=nsCRT::strlen(aString);
|
|
|
|
temp.mUStr=(PRUnichar*)aString;
|
|
|
|
return nsStr::Compare(*this,temp,aLength,aIgnoreCase);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* LAST MODS: gess
|
|
|
|
*
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
PRInt32 nsString2::Compare(const nsStr& aString,PRBool aIgnoreCase,PRInt32 aLength) const {
|
|
|
|
return nsStr::Compare(*this,aString,aLength,aIgnoreCase);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
PRBool nsString2::operator==(const nsString2& S) const {return Equals(S);}
|
|
|
|
PRBool nsString2::operator==(const nsStr& S) const {return Equals(S);}
|
1999-03-22 12:54:46 +03:00
|
|
|
PRBool nsString2::operator==(const char* s) const {return Equals(s);}
|
|
|
|
PRBool nsString2::operator==(const PRUnichar* s) const {return Equals(s);}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
PRBool nsString2::operator!=(const nsString2& S) const {return PRBool(Compare(S)!=0);}
|
|
|
|
PRBool nsString2::operator!=(const nsStr& S) const {return PRBool(Compare(S)!=0);}
|
1999-03-22 12:54:46 +03:00
|
|
|
PRBool nsString2::operator!=(const char* s) const {return PRBool(Compare(s)!=0);}
|
|
|
|
PRBool nsString2::operator!=(const PRUnichar* s) const {return PRBool(Compare(s)!=0);}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
PRBool nsString2::operator<(const nsString2& S) const {return PRBool(Compare(S)<0);}
|
|
|
|
PRBool nsString2::operator<(const nsStr& S) const {return PRBool(Compare(S)<0);}
|
1999-03-22 12:54:46 +03:00
|
|
|
PRBool nsString2::operator<(const char* s) const {return PRBool(Compare(s)<0);}
|
|
|
|
PRBool nsString2::operator<(const PRUnichar* s) const {return PRBool(Compare(s)<0);}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
PRBool nsString2::operator>(const nsString2& S) const {return PRBool(Compare(S)>0);}
|
|
|
|
PRBool nsString2::operator>(const nsStr& S) const {return PRBool(Compare(S)>0);}
|
1999-03-22 12:54:46 +03:00
|
|
|
PRBool nsString2::operator>(const char* s) const {return PRBool(Compare(s)>0);}
|
|
|
|
PRBool nsString2::operator>(const PRUnichar* s) const {return PRBool(Compare(s)>0);}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
PRBool nsString2::operator<=(const nsString2& S) const {return PRBool(Compare(S)<=0);}
|
|
|
|
PRBool nsString2::operator<=(const nsStr& S) const {return PRBool(Compare(S)<=0);}
|
1999-03-22 12:54:46 +03:00
|
|
|
PRBool nsString2::operator<=(const char* s) const {return PRBool(Compare(s)<=0);}
|
|
|
|
PRBool nsString2::operator<=(const PRUnichar* s) const {return PRBool(Compare(s)<=0);}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
PRBool nsString2::operator>=(const nsString2& S) const {return PRBool(Compare(S)>=0);}
|
|
|
|
PRBool nsString2::operator>=(const nsStr& S) const {return PRBool(Compare(S)>=0);}
|
1999-03-22 12:54:46 +03:00
|
|
|
PRBool nsString2::operator>=(const char* s) const {return PRBool(Compare(s)>=0);}
|
|
|
|
PRBool nsString2::operator>=(const PRUnichar* s) const {return PRBool(Compare(s)>=0);}
|
|
|
|
|
|
|
|
|
|
|
|
PRBool nsString2::EqualsIgnoreCase(const nsString2& aString) const {
|
|
|
|
return Equals(aString,PR_TRUE);
|
|
|
|
}
|
|
|
|
|
|
|
|
PRBool nsString2::EqualsIgnoreCase(const char* aString,PRInt32 aLength) const {
|
|
|
|
return Equals(aString,aLength,PR_TRUE);
|
|
|
|
}
|
|
|
|
|
|
|
|
PRBool nsString2::EqualsIgnoreCase(const nsIAtom *aAtom) const {
|
|
|
|
return Equals(aAtom,PR_TRUE);
|
|
|
|
}
|
|
|
|
|
|
|
|
PRBool nsString2::EqualsIgnoreCase(const PRUnichar* s1, const PRUnichar* s2) const {
|
|
|
|
return Equals(s1,s2,PR_TRUE);
|
|
|
|
}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
/**
|
|
|
|
* Compare this to given string; note that we compare full strings here.
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString is the other nsString2 to be compared to
|
|
|
|
* @return TRUE if equal
|
|
|
|
*/
|
|
|
|
PRBool nsString2::Equals(const nsString2& aString,PRBool aIgnoreCase) const {
|
|
|
|
PRInt32 result=nsStr::Compare(*this,aString,MinInt(mLength,aString.mLength),aIgnoreCase);
|
|
|
|
return PRBool(0==result);
|
|
|
|
}
|
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
/**
|
|
|
|
* Compare this to given string; note that we compare full strings here.
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString is the other nsString2 to be compared to
|
|
|
|
* @return TRUE if equal
|
|
|
|
*/
|
|
|
|
PRBool nsString2::Equals(const nsStr& aString,PRBool aIgnoreCase) const {
|
|
|
|
PRInt32 result=nsStr::Compare(*this,aString,MinInt(mLength,aString.mLength),aIgnoreCase);
|
|
|
|
return PRBool(0==result);
|
|
|
|
}
|
|
|
|
|
|
|
|
PRBool nsString2::Equals(const char* aString,PRBool aIgnoreCase) const {
|
|
|
|
if(aString) {
|
|
|
|
return Equals(aString,nsCRT::strlen(aString),aIgnoreCase);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Compare this to given string; note that we compare full strings here.
|
|
|
|
* The optional length argument just lets us know how long the given string is.
|
|
|
|
* If you provide a length, it is compared to length of this string as an
|
|
|
|
* optimization.
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aCString -- Cstr to compare to this
|
|
|
|
* @param aLength -- length of given string.
|
|
|
|
* @return TRUE if equal
|
|
|
|
*/
|
|
|
|
PRBool nsString2::Equals(const char* aCString,PRUint32 aCount,PRBool aIgnoreCase) const{
|
|
|
|
NS_ASSERTION(0!=aCString,kNullPointerError);
|
|
|
|
PRBool result=PR_FALSE;
|
|
|
|
if(aCString) {
|
|
|
|
PRInt32 theAnswer=Compare(aCString,aIgnoreCase,aCount);
|
|
|
|
result=PRBool(0==theAnswer);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
PRBool nsString2::Equals(const PRUnichar* aString,PRBool aIgnoreCase) const {
|
|
|
|
NS_ASSERTION(0!=aString,kNullPointerError);
|
|
|
|
PRBool result=PR_FALSE;
|
|
|
|
if(aString) {
|
|
|
|
result=Equals(aString,nsCRT::strlen(aString),aIgnoreCase);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Compare this to given string; note that we compare full strings here.
|
|
|
|
* The optional length argument just lets us know how long the given string is.
|
|
|
|
* If you provide a length, it is compared to length of this string as an
|
|
|
|
* optimization.
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString -- unistring to compare to this
|
|
|
|
* @param aLength -- length of given string.
|
|
|
|
* @return TRUE if equal
|
|
|
|
*/
|
|
|
|
PRBool nsString2::Equals(const PRUnichar* aString,PRUint32 aCount,PRBool aIgnoreCase) const{
|
|
|
|
NS_ASSERTION(0!=aString,kNullPointerError);
|
|
|
|
PRBool result=PR_FALSE;
|
|
|
|
if(aString){
|
|
|
|
PRInt32 theAnswer=Compare(aString,aIgnoreCase,aCount);
|
|
|
|
result=PRBool(0==theAnswer);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Compare this to given string; note that we compare full strings here.
|
|
|
|
* The optional length argument just lets us know how long the given string is.
|
|
|
|
* If you provide a length, it is compared to length of this string as an
|
|
|
|
* optimization.
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param aString -- unistring to compare to this
|
|
|
|
* @param aLength -- length of given string.
|
|
|
|
* @return TRUE if equal
|
|
|
|
*/
|
|
|
|
PRBool nsString2::Equals(const nsIAtom* aAtom,PRBool aIgnoreCase) const{
|
|
|
|
NS_ASSERTION(0!=aAtom,kNullPointerError);
|
|
|
|
PRBool result=PR_FALSE;
|
|
|
|
if(aAtom){
|
1999-03-23 10:33:10 +03:00
|
|
|
PRInt32 cmp=nsCRT::strcasecmp(mUStr,aAtom->GetUnicode());
|
1999-03-22 12:54:46 +03:00
|
|
|
result=PRBool(0==cmp);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Compare given strings
|
|
|
|
* @update gess 7/27/98
|
|
|
|
* @param s1 -- first string to be compared
|
|
|
|
* @param s2 -- second string to be compared
|
|
|
|
* @return TRUE if equal
|
|
|
|
*/
|
|
|
|
PRBool nsString2::Equals(const PRUnichar* s1, const PRUnichar* s2,PRBool aIgnoreCase) const {
|
|
|
|
NS_ASSERTION(0!=s1,kNullPointerError);
|
|
|
|
NS_ASSERTION(0!=s2,kNullPointerError);
|
|
|
|
PRBool result=PR_FALSE;
|
|
|
|
if((s1) && (s2)){
|
|
|
|
PRInt32 cmp=(aIgnoreCase) ? nsCRT::strcasecmp(s1,s2) : nsCRT::strcmp(s1,s2);
|
|
|
|
result=PRBool(0==cmp);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Determine if given char in valid alpha range
|
|
|
|
*
|
|
|
|
* @update gess 3/31/98
|
|
|
|
* @param aChar is character to be tested
|
|
|
|
* @return TRUE if in alpha range
|
|
|
|
*/
|
|
|
|
PRBool nsString2::IsAlpha(PRUnichar aChar) {
|
|
|
|
// XXX i18n
|
|
|
|
if (((aChar >= 'A') && (aChar <= 'Z')) || ((aChar >= 'a') && (aChar <= 'z'))) {
|
|
|
|
return PR_TRUE;
|
|
|
|
}
|
|
|
|
return PR_FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Determine if given char is a valid space character
|
|
|
|
*
|
|
|
|
* @update gess 3/31/98
|
|
|
|
* @param aChar is character to be tested
|
|
|
|
* @return TRUE if is valid space char
|
|
|
|
*/
|
|
|
|
PRBool nsString2::IsSpace(PRUnichar aChar) {
|
|
|
|
// XXX i18n
|
|
|
|
if ((aChar == ' ') || (aChar == '\r') || (aChar == '\n') || (aChar == '\t')) {
|
|
|
|
return PR_TRUE;
|
|
|
|
}
|
|
|
|
return PR_FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Determine if given char is valid digit
|
|
|
|
*
|
|
|
|
* @update gess 3/31/98
|
|
|
|
* @param aChar is character to be tested
|
|
|
|
* @return TRUE if char is a valid digit
|
|
|
|
*/
|
|
|
|
PRBool nsString2::IsDigit(PRUnichar aChar) {
|
|
|
|
// XXX i18n
|
|
|
|
return PRBool((aChar >= '0') && (aChar <= '9'));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
/**************************************************************
|
|
|
|
Define the string deallocator class...
|
|
|
|
**************************************************************/
|
|
|
|
class nsStringDeallocator: public nsDequeFunctor{
|
|
|
|
public:
|
|
|
|
virtual void* operator()(void* anObject) {
|
|
|
|
static nsMemoryAgent theAgent;
|
|
|
|
nsString2* aString= (nsString2*)anObject;
|
|
|
|
if(aString){
|
|
|
|
aString->mAgent=&theAgent;
|
|
|
|
delete aString;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
1999-03-23 10:26:27 +03:00
|
|
|
/****************************************************************************
|
|
|
|
* This class, appropriately enough, creates and recycles nsString2 objects..
|
|
|
|
****************************************************************************/
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
|
1999-03-23 10:26:27 +03:00
|
|
|
class nsStringRecycler {
|
|
|
|
public:
|
|
|
|
nsStringRecycler() : mDeque(0) {
|
|
|
|
}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
~nsStringRecycler() {
|
|
|
|
nsStringDeallocator theDeallocator;
|
|
|
|
mDeque.ForEach(theDeallocator); //now delete the strings
|
|
|
|
}
|
|
|
|
|
1999-03-23 10:26:27 +03:00
|
|
|
void Recycle(nsString2* aString) {
|
|
|
|
mDeque.Push(aString);
|
|
|
|
}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
nsString2* CreateString(eCharSize aCharSize){
|
1999-03-23 10:26:27 +03:00
|
|
|
nsString2* result=(nsString2*)mDeque.Pop();
|
|
|
|
if(!result)
|
|
|
|
result=new nsString2(aCharSize);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
nsDeque mDeque;
|
|
|
|
};
|
|
|
|
|
1999-04-25 06:05:03 +04:00
|
|
|
void Subsume(nsStr& aDest,nsStr& aSource);
|
|
|
|
nsStringRecycler& GetRecycler(void);
|
|
|
|
|
|
|
|
|
1999-03-23 10:26:27 +03:00
|
|
|
/**
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
nsStringRecycler& GetRecycler(void){
|
|
|
|
static nsStringRecycler gRecycler;
|
|
|
|
return gRecycler;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Call this mehod when you're done
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
nsString2* nsString2::CreateString(eCharSize aCharSize){
|
|
|
|
nsString2* result=GetRecycler().CreateString(aCharSize);
|
1999-03-23 10:26:27 +03:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Call this mehod when you're done
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
void nsString2::Recycle(nsString2* aString){
|
|
|
|
GetRecycler().Recycle(aString);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
/**
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
void nsString2::DebugDump(ostream& aStream) const {
|
|
|
|
for(PRUint32 i=0;i<mLength;i++) {
|
1999-03-23 10:33:10 +03:00
|
|
|
aStream <<mStr[i];
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
aStream << endl;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* @update gess8/8/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
ostream& operator<<(ostream& os,nsString2& aString){
|
1999-05-06 09:13:08 +04:00
|
|
|
if(PR_FALSE==aString.mCharSize) {
|
1999-03-23 10:33:10 +03:00
|
|
|
os<<aString.mStr;
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
else{
|
|
|
|
char* theStr=aString.ToNewCString();
|
|
|
|
os<<theStr;
|
|
|
|
delete [] theStr;
|
|
|
|
}
|
|
|
|
return os;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* @update gess 01/04/99
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
1999-05-26 05:38:36 +04:00
|
|
|
NS_COM int fputs(const nsString2& aString, FILE* out)
|
1999-03-22 12:54:46 +03:00
|
|
|
{
|
|
|
|
char buf[100];
|
|
|
|
char* cp = buf;
|
|
|
|
PRInt32 len = aString.mLength;
|
|
|
|
if (len >= PRInt32(sizeof(buf))) {
|
|
|
|
cp = aString.ToNewCString();
|
|
|
|
} else {
|
|
|
|
aString.ToCString(cp, len + 1);
|
|
|
|
}
|
|
|
|
if(len>0)
|
|
|
|
::fwrite(cp, 1, len, out);
|
|
|
|
if (cp != buf) {
|
1999-03-30 05:23:24 +04:00
|
|
|
delete[] cp;
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
return (int) len;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
/***********************************************************************
|
|
|
|
IMPLEMENTATION NOTES: AUTOSTRING...
|
|
|
|
***********************************************************************/
|
1999-04-25 06:05:03 +04:00
|
|
|
|
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
/**
|
1999-05-06 09:13:08 +04:00
|
|
|
* Special case constructor, that allows the consumer to provide
|
|
|
|
* an underlying buffer for performance reasons.
|
|
|
|
* @param aBuffer points to your buffer
|
|
|
|
* @param aBufSize defines the size of your buffer
|
|
|
|
* @param aCurrentLength tells us the current length of the buffer
|
|
|
|
*/
|
|
|
|
nsAutoString2::nsAutoString2(eCharSize aCharSize) : nsString2(aCharSize){
|
|
|
|
nsStr::Initialize(*this,mBuffer,(sizeof(mBuffer)>>aCharSize)-1,0,aCharSize,PR_FALSE);
|
|
|
|
mAgent=0;
|
|
|
|
AddNullTerminator(*this);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* construct from external buffer and given string
|
|
|
|
* @param anExtBuffer describes an external buffer
|
|
|
|
* @param aCString is a ptr to a 1-byte cstr
|
1999-03-22 12:54:46 +03:00
|
|
|
*/
|
1999-05-06 09:13:08 +04:00
|
|
|
nsAutoString2::nsAutoString2(nsStr& aStr,const char* aCString) : nsString2((eCharSize)aStr.mCharSize) {
|
|
|
|
nsStr::Initialize(*this,mBuffer,(sizeof(mBuffer)>>aStr.mCharSize)-1,0,(eCharSize)aStr.mCharSize,PR_FALSE);
|
|
|
|
mAgent=0;
|
|
|
|
AddNullTerminator(*this);
|
|
|
|
Assign(aCString);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy construct from ascii c-string
|
|
|
|
* @param aCString is a ptr to a 1-byte cstr
|
|
|
|
*/
|
|
|
|
nsAutoString2::nsAutoString2(const char* aCString,eCharSize aCharSize) : nsString2((eCharSize)aCharSize) {
|
|
|
|
nsStr::Initialize(*this,mBuffer,(sizeof(mBuffer)>>aCharSize)-1,0,aCharSize,PR_FALSE);
|
|
|
|
mAgent=0;
|
|
|
|
AddNullTerminator(*this);
|
|
|
|
Assign(aCString);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy construct from ascii c-string
|
|
|
|
* @param aCString is a ptr to a 1-byte cstr
|
|
|
|
*/
|
|
|
|
nsAutoString2::nsAutoString2(char* aCString,PRUint32 aCapacity,eCharSize aCharSize,PRBool assumeOwnership) : nsString2(aCharSize) {
|
|
|
|
mAgent=0;
|
|
|
|
if(assumeOwnership) {
|
|
|
|
nsStr::Initialize(*this,aCString,aCapacity,0,eOneByte,PR_TRUE);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
nsStr::Initialize(*this,mBuffer,(sizeof(mBuffer)>>aCharSize)-1,0,aCharSize,PR_FALSE);
|
|
|
|
}
|
|
|
|
AddNullTerminator(*this);
|
|
|
|
Assign(aCString);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy construct from uni-string
|
|
|
|
* @param aString is a ptr to a unistr
|
|
|
|
*/
|
|
|
|
nsAutoString2::nsAutoString2(const PRUnichar* aString,eCharSize aCharSize) : nsString2(aCharSize) {
|
|
|
|
mAgent=0;
|
|
|
|
nsStr::Initialize(*this,mBuffer,(sizeof(mBuffer)>>aCharSize)-1,0,aCharSize,PR_FALSE);
|
|
|
|
AddNullTerminator(*this);
|
|
|
|
Assign(aString);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy construct from uni-string
|
|
|
|
* @param aString is a ptr to a unistr
|
|
|
|
*/
|
|
|
|
nsAutoString2::nsAutoString2(PRUnichar* aString,PRUint32 aCapacity,eCharSize aCharSize,PRBool assumeOwnership) : nsString2(aCharSize) {
|
|
|
|
mAgent=0;
|
|
|
|
if(assumeOwnership) {
|
|
|
|
nsStr::Initialize(*this,(char*)aString,aCapacity,0,eTwoByte,PR_TRUE);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
nsStr::Initialize(*this,mBuffer,(sizeof(mBuffer)>>aCharSize)-1,0,aCharSize,PR_FALSE);
|
|
|
|
}
|
|
|
|
AddNullTerminator(*this);
|
|
|
|
Assign(aString);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy construct from an nsString2
|
|
|
|
* @param
|
|
|
|
*/
|
|
|
|
nsAutoString2::nsAutoString2(const nsStr& aString,eCharSize aCharSize) : nsString2(aCharSize) {
|
|
|
|
mAgent=0;
|
|
|
|
nsStr::Initialize(*this,mBuffer,(sizeof(mBuffer)>>aCharSize)-1,0,aCharSize,PR_FALSE);
|
|
|
|
AddNullTerminator(*this);
|
|
|
|
Assign(aString);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy construct from an nsString2
|
|
|
|
* @param
|
|
|
|
*/
|
|
|
|
nsAutoString2::nsAutoString2(const nsAutoString2& aString,eCharSize aCharSize) : nsString2(aCharSize) {
|
|
|
|
mAgent=0;
|
|
|
|
nsStr::Initialize(*this,mBuffer,(sizeof(mBuffer)>>aCharSize)-1,0,aCharSize,PR_FALSE);
|
|
|
|
AddNullTerminator(*this);
|
|
|
|
Assign(aString);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy construct from an nsString2
|
|
|
|
* @param
|
|
|
|
*/
|
|
|
|
nsAutoString2::nsAutoString2(const nsString2& aString,eCharSize aCharSize) : nsString2(aCharSize){
|
|
|
|
mAgent=0;
|
|
|
|
nsStr::Initialize(*this,mBuffer,(sizeof(mBuffer)>>aCharSize)-1,0,aCharSize,PR_FALSE);
|
|
|
|
AddNullTerminator(*this);
|
|
|
|
Assign(aString);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy construct from an nsString2
|
|
|
|
* @param
|
|
|
|
*/
|
|
|
|
nsAutoString2::nsAutoString2(PRUnichar aChar,eCharSize aCharSize) : nsString2(aCharSize){
|
|
|
|
mAgent=0;
|
|
|
|
nsStr::Initialize(*this,mBuffer,(sizeof(mBuffer)>>aCharSize)-1,0,aCharSize,PR_FALSE);
|
|
|
|
AddNullTerminator(*this);
|
|
|
|
Assign(aChar);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* construct from a subsumeable string
|
|
|
|
* @update gess 1/4/99
|
|
|
|
* @param reference to a subsumeString
|
|
|
|
*/
|
|
|
|
nsAutoString2::nsAutoString2( nsSubsumeStr& aSubsumeStr) :nsString2((eCharSize)aSubsumeStr.mCharSize) {
|
|
|
|
mAgent=0;
|
|
|
|
Subsume(*this,aSubsumeStr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* deconstruct the autstring
|
|
|
|
* @param
|
|
|
|
*/
|
|
|
|
nsAutoString2::~nsAutoString2(){
|
|
|
|
// bool b=true;
|
|
|
|
// mStr=0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void nsAutoString2::SizeOf(nsISizeOfHandler* aHandler) const {
|
|
|
|
aHandler->Add(sizeof(*this));
|
|
|
|
aHandler->Add(mCapacity << mCharSize);
|
|
|
|
}
|
|
|
|
|
|
|
|
nsSubsumeStr::nsSubsumeStr(nsString2& aString) : nsString2((eCharSize)aString.mCharSize) {
|
|
|
|
Subsume(*this,aString);
|
|
|
|
}
|
|
|
|
|
|
|
|
nsSubsumeStr::nsSubsumeStr(nsStr& aString) : nsString2((eCharSize)aString.mCharSize) {
|
|
|
|
Subsume(*this,aString);
|
|
|
|
}
|
|
|
|
|
|
|
|
nsSubsumeStr::nsSubsumeStr(const PRUnichar* aString) : nsString2(aString,eTwoByte) {
|
|
|
|
}
|
|
|
|
|
|
|
|
nsSubsumeStr::nsSubsumeStr(const char* aString) : nsString2(aString,eOneByte) {
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef RICKG_DEBUG
|
|
|
|
/***********************************************************************
|
|
|
|
IMPLEMENTATION of CStringTester...
|
|
|
|
***********************************************************************/
|
|
|
|
CStringTester::CStringTester() {
|
1999-03-22 12:54:46 +03:00
|
|
|
|
|
|
|
static const char* kConstructorError = kConstructorError;
|
|
|
|
static const char* kComparisonError = "Comparision error!";
|
|
|
|
static const char* kEqualsError = "Equals error!";
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
eCharSize theSize=eTwoByte;
|
1999-03-22 12:54:46 +03:00
|
|
|
|
|
|
|
//begin by testing the constructors...
|
|
|
|
{
|
|
|
|
{
|
|
|
|
nsString2 theString0("foo",theSize); //watch it construct and destruct
|
1999-05-06 09:13:08 +04:00
|
|
|
}
|
1999-03-22 12:54:46 +03:00
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
{
|
|
|
|
nsString2 theString("hello");
|
|
|
|
nsString2 temp1=theString+" there!";
|
|
|
|
nsString2 temp2=theString+'!';
|
|
|
|
nsSubsumeStr temp3=theString+'?';
|
|
|
|
nsString2 temp4(temp3);
|
|
|
|
temp1=temp3;
|
1999-05-07 04:47:24 +04:00
|
|
|
nsAutoString2 temp5("hello");
|
|
|
|
nsSubsumeStr temp6(temp5);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
1999-05-06 09:13:08 +04:00
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
nsString2 theString1(theSize);
|
|
|
|
nsString2 theString("hello",theSize);
|
|
|
|
nsString2 theString3(theString,theSize);
|
|
|
|
nsStr& si=theString;
|
|
|
|
nsString2 theString4(si,theSize);
|
|
|
|
PRUint32 theLen=theString3.Length();
|
|
|
|
|
|
|
|
//and hey, why not do a few lexo-morphic tests...
|
|
|
|
theString.ToUpperCase();
|
|
|
|
theString.ToLowerCase();
|
|
|
|
|
|
|
|
//while we're here, let's try truncation and setting the length.
|
|
|
|
theString3.Truncate(3);
|
|
|
|
theLen=theString3.Length();
|
1999-05-06 09:13:08 +04:00
|
|
|
|
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
theString.SetCapacity(3);
|
|
|
|
const char* theBuffer=theString.GetBuffer();
|
|
|
|
const char* theOther=theBuffer;
|
|
|
|
|
|
|
|
{
|
|
|
|
nsString2 temp(" hello there rick ",theSize);
|
|
|
|
temp.CompressWhitespace();
|
|
|
|
}
|
|
|
|
|
|
|
|
nsString2 theString5(" hello there rick ",theSize);
|
|
|
|
theString5.StripChars("reo");
|
|
|
|
theString5.Trim(" ",PR_TRUE,PR_FALSE);
|
|
|
|
theString5.StripWhitespace();
|
|
|
|
|
|
|
|
nsString2* theString6=theString5.ToNewString();
|
1999-05-06 09:13:08 +04:00
|
|
|
nsString2::Recycle(theString6);
|
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
char* str=theString5.ToNewCString();
|
1999-05-06 09:13:08 +04:00
|
|
|
delete [] str;
|
|
|
|
|
1999-03-22 12:54:46 +03:00
|
|
|
char buffer[100];
|
|
|
|
theString5.ToCString(buffer,sizeof(buffer)-1);
|
|
|
|
theOther=theString5.GetBuffer();
|
|
|
|
}
|
1999-05-06 09:13:08 +04:00
|
|
|
|
|
|
|
//try a few numeric conversion routines...
|
1999-03-22 12:54:46 +03:00
|
|
|
{
|
|
|
|
nsString2 str1("10000",theSize);
|
|
|
|
PRInt32 err;
|
|
|
|
PRInt32 theInt=str1.ToInteger(&err);
|
|
|
|
str1="100.100";
|
|
|
|
float theFloat=str1.ToFloat(&err);
|
|
|
|
}
|
|
|
|
//Now test the character accessor methods...
|
|
|
|
{
|
|
|
|
nsString2 theString("hello",theSize);
|
|
|
|
PRUint32 len=theString.Length();
|
1999-05-06 09:13:08 +04:00
|
|
|
PRUnichar ch;
|
1999-03-22 12:54:46 +03:00
|
|
|
for(PRUint32 i=0;i<len;i++) {
|
1999-05-06 09:13:08 +04:00
|
|
|
ch=theString.CharAt(i);
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
1999-05-06 09:13:08 +04:00
|
|
|
ch=theString.First();
|
|
|
|
ch=theString.Last();
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
//**********************************************
|
|
|
|
//Now let's test the CONCATENATION operators...
|
|
|
|
//**********************************************
|
|
|
|
{
|
|
|
|
static const char* s1="hello";
|
|
|
|
static const char* s2="world";
|
|
|
|
|
|
|
|
nsString2 a(s1,theSize);
|
|
|
|
nsString2 b(s2,theSize);
|
|
|
|
nsString2 temp1(theSize);
|
|
|
|
temp1=a+b;
|
|
|
|
nsString2 temp2(theSize);
|
|
|
|
temp2=a+"world!";
|
|
|
|
nsString2 temp3(theSize);
|
|
|
|
temp3=temp2+'!';
|
|
|
|
temp3+='?';
|
|
|
|
temp3+="rick!";
|
|
|
|
temp3+=a;
|
|
|
|
temp3.Append((float)100.100);
|
|
|
|
temp3.Append(10000);
|
|
|
|
}
|
|
|
|
|
|
|
|
static const char* temp="hello";
|
|
|
|
|
|
|
|
//**********************************************
|
|
|
|
//Now let's test the ASSIGNMENT operators...
|
|
|
|
//**********************************************
|
|
|
|
{
|
|
|
|
nsString2 str1(theSize);
|
|
|
|
str1.SetString("abcdefg");
|
|
|
|
str1.Assign("hello");
|
|
|
|
str1.Assign('z');
|
|
|
|
str1='a';
|
|
|
|
str1="hello again";
|
|
|
|
nsString2 str2("whats up doc?",theSize);
|
|
|
|
str1=str2;
|
|
|
|
}
|
|
|
|
|
|
|
|
//**********************************************
|
|
|
|
//Now let's test the APPEND methods...
|
|
|
|
//**********************************************
|
|
|
|
{
|
|
|
|
{
|
|
|
|
nsString2 temp("hello",theSize);
|
|
|
|
temp.Append((float)1.5);
|
|
|
|
}
|
|
|
|
|
|
|
|
nsString2 temp1("hello",theSize);
|
|
|
|
temp1.Append((float)1.5);
|
|
|
|
nsString2 temp2("there",theSize);
|
|
|
|
temp1.Append(temp2);
|
|
|
|
temp1.Append(" xxx ");
|
|
|
|
temp1.Append('4');
|
|
|
|
}
|
|
|
|
|
|
|
|
//**********************************************
|
|
|
|
//Now let's test the SUBSTRING methods...
|
|
|
|
//**********************************************
|
|
|
|
{
|
|
|
|
nsString2 temp1("hello there rick",theSize);
|
|
|
|
nsString2 temp2(theSize);
|
|
|
|
temp1.Left(temp2,10);
|
|
|
|
temp1.Mid(temp2,6,5);
|
|
|
|
temp1.Right(temp2,4);
|
|
|
|
}
|
|
|
|
|
|
|
|
//**********************************************
|
|
|
|
//Now let's test the INSERTION methods...
|
|
|
|
//**********************************************
|
|
|
|
{
|
|
|
|
nsString2 temp1("hello rick",theSize);
|
|
|
|
temp1.Insert("there ",6); //char* insertion
|
|
|
|
temp1.Insert("?",10); //char insertion
|
|
|
|
temp1.Insert('*',10); //char insertion
|
|
|
|
temp1.Insert("xxx",100,100); //this should append.
|
|
|
|
nsString2 temp2("abcdefghijklmnopqrstuvwxyz",theSize);
|
|
|
|
temp2.Insert(temp1,10);
|
|
|
|
temp2.Cut(20,5);
|
|
|
|
temp2.Cut(100,100); //this should fail.
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//**********************************************
|
|
|
|
//Now let's test a few string COMPARISION ops...
|
|
|
|
//**********************************************
|
|
|
|
|
|
|
|
nsString2 temp8("aaaa",theSize);
|
|
|
|
nsString2 temp8a("AAAA",theSize);
|
|
|
|
nsString2 temp9("bbbb",theSize);
|
|
|
|
|
|
|
|
const char* aaaa="aaaa";
|
|
|
|
const char* bbbb="bbbb";
|
|
|
|
|
|
|
|
//First test the string compare routines...
|
|
|
|
|
|
|
|
NS_ASSERTION(0>temp8.Compare(bbbb),kComparisonError);
|
|
|
|
NS_ASSERTION(0>temp8.Compare(temp9),kComparisonError);
|
|
|
|
NS_ASSERTION(0<temp9.Compare(temp8),kComparisonError);
|
|
|
|
NS_ASSERTION(0==temp8.Compare(temp8a,PR_TRUE),kComparisonError);
|
|
|
|
NS_ASSERTION(0==temp8.Compare(aaaa),kComparisonError);
|
|
|
|
|
|
|
|
//Now test the boolean operators...
|
|
|
|
NS_ASSERTION(temp8==temp8,kComparisonError);
|
|
|
|
NS_ASSERTION(temp8==aaaa,kComparisonError);
|
|
|
|
|
|
|
|
NS_ASSERTION(temp8!=temp9,kComparisonError);
|
|
|
|
NS_ASSERTION(temp8!=bbbb,kComparisonError);
|
|
|
|
|
|
|
|
NS_ASSERTION(((temp8<temp9) && (temp9>=temp8)),kComparisonError);
|
|
|
|
|
|
|
|
NS_ASSERTION(((temp9>temp8) && (temp8<=temp9)),kComparisonError);
|
|
|
|
NS_ASSERTION(temp9>aaaa,kComparisonError);
|
|
|
|
|
|
|
|
NS_ASSERTION(temp8<=temp8,kComparisonError);
|
|
|
|
NS_ASSERTION(temp8<=temp9,kComparisonError);
|
|
|
|
NS_ASSERTION(temp8<=bbbb,kComparisonError);
|
|
|
|
|
|
|
|
NS_ASSERTION(((temp9>=temp8) && (temp8<temp9)),kComparisonError);
|
|
|
|
NS_ASSERTION(temp9>=temp8,kComparisonError);
|
|
|
|
NS_ASSERTION(temp9>=aaaa,kComparisonError);
|
|
|
|
|
|
|
|
NS_ASSERTION(temp8.Equals(temp8),kEqualsError);
|
|
|
|
NS_ASSERTION(temp8.Equals(aaaa),kEqualsError);
|
|
|
|
|
|
|
|
nsString2 temp10(temp8);
|
|
|
|
temp10.ToUpperCase();
|
|
|
|
NS_ASSERTION(temp8.Equals(temp10,PR_TRUE),kEqualsError);
|
|
|
|
NS_ASSERTION(temp8.Equals("AAAA",PR_TRUE),kEqualsError);
|
|
|
|
|
|
|
|
|
|
|
|
//**********************************************
|
|
|
|
//Now let's test a few string MANIPULATORS...
|
|
|
|
//**********************************************
|
|
|
|
|
|
|
|
{
|
|
|
|
nsAutoString2 ab("ab",theSize);
|
|
|
|
nsString2 abcde("cde",theSize);
|
|
|
|
nsString2 cut("abcdef",theSize);
|
|
|
|
cut.Cut(7,10); //this is out of bounds, so ignore...
|
|
|
|
cut.DebugDump(cout);
|
|
|
|
cut.Cut(5,2); //cut last chars
|
|
|
|
cut.DebugDump(cout);
|
|
|
|
cut.Cut(1,1); //cut first char
|
|
|
|
cut.DebugDump(cout);
|
|
|
|
cut.Cut(2,1); //cut one from the middle
|
|
|
|
cut.DebugDump(cout);
|
|
|
|
cut="Hello there Rick";
|
|
|
|
cut.DebugDump(cout);
|
|
|
|
|
|
|
|
cut="'\"abcdef\"'";
|
|
|
|
cut.Trim("'");
|
|
|
|
cut.DebugDump(cout);
|
|
|
|
cut.Trim("\"",PR_TRUE,PR_FALSE);
|
|
|
|
cut.DebugDump(cout);
|
|
|
|
cut.Trim("\"",PR_FALSE,PR_TRUE);
|
|
|
|
cut.DebugDump(cout);
|
|
|
|
|
|
|
|
cut="abc def\n\n ghi";
|
|
|
|
cut.StripWhitespace();
|
|
|
|
cut.DebugDump(cout);
|
|
|
|
cut="abc def\n\n ghi";
|
|
|
|
cut.CompressWhitespace();
|
|
|
|
cut.DebugDump(cout);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//**********************************************
|
|
|
|
//Now let's test the SEARCHING operations...
|
|
|
|
//**********************************************
|
|
|
|
|
|
|
|
{
|
|
|
|
nsString2 find1("abcdefghijk",theSize);
|
|
|
|
nsString2 find2("ijk",theSize);
|
|
|
|
|
|
|
|
PRInt32 pos=find1.Find("efg");
|
|
|
|
NS_ASSERTION(pos==4,"Error: Find routine");
|
|
|
|
|
|
|
|
pos=find1.Find('d');
|
|
|
|
NS_ASSERTION(pos==3,"Error: Find char routine");
|
|
|
|
|
|
|
|
pos=find1.Find(find2);
|
|
|
|
NS_ASSERTION(pos==8,"Error: Find char routine");
|
|
|
|
|
|
|
|
pos=find1.FindCharInSet("12k");
|
|
|
|
NS_ASSERTION(pos==10,"Error: FindFirstInChar routine");
|
|
|
|
|
|
|
|
pos=find1.RFindCharInSet("12k");
|
|
|
|
NS_ASSERTION(pos==10,"Error: FindLastInChar routine");
|
|
|
|
|
|
|
|
pos=find1.RFind("efg");
|
|
|
|
NS_ASSERTION(pos==4,"Error: RFind routine");
|
|
|
|
|
|
|
|
pos=find1.RFind("xxx");
|
|
|
|
NS_ASSERTION(pos==-1,"Error: RFind routine"); //this should fail
|
|
|
|
|
|
|
|
pos=find1.RFind("");
|
|
|
|
NS_ASSERTION(pos==-1,"Error: RFind routine"); //this too should fail.
|
|
|
|
|
|
|
|
pos=find1.RFind('a');
|
|
|
|
NS_ASSERTION(pos==0,"Error: RFind routine");
|
|
|
|
|
|
|
|
pos=find1.BinarySearch('a');
|
|
|
|
pos=find1.BinarySearch('b');
|
|
|
|
pos=find1.BinarySearch('c');
|
|
|
|
pos=find1.BinarySearch('d');
|
|
|
|
pos=find1.BinarySearch('e');
|
|
|
|
pos=find1.BinarySearch('f');
|
|
|
|
pos=find1.BinarySearch('g');
|
|
|
|
pos=find1.BinarySearch('h');
|
|
|
|
pos=find1.BinarySearch('i');
|
|
|
|
pos=find1.BinarySearch('z');
|
|
|
|
}
|
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
{
|
|
|
|
//now let's try a memory allocation test...
|
|
|
|
nsString2 temp;
|
|
|
|
for(int i=0;i<100;i++){
|
|
|
|
temp+="hello ";
|
|
|
|
}
|
|
|
|
int x=5;
|
1999-03-22 12:54:46 +03:00
|
|
|
}
|
1999-05-06 09:13:08 +04:00
|
|
|
};
|
1999-03-22 12:54:46 +03:00
|
|
|
|
1999-05-06 09:13:08 +04:00
|
|
|
#endif //rickg_debug
|