зеркало из https://github.com/mozilla/gecko-dev.git
765 строки
24 KiB
C++
765 строки
24 KiB
C++
/* -*- 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.1 (the "License"); you may not use this file
|
|
* except in compliance with the License. You may obtain a copy of
|
|
* the License at http://www.mozilla.org/NPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS
|
|
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
|
|
* implied. See the License for the specific language governing
|
|
* rights and limitations under the License.
|
|
*
|
|
* The Original Code is mozilla.org code.
|
|
*
|
|
* The Initial Developer of the Original Code is Netscape
|
|
* Communications Corporation. Portions created by Netscape are
|
|
* Copyright (C) 1998 Netscape Communications Corporation. All
|
|
* Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
* Pierre Phaneuf <pp@ludusdesign.com>
|
|
*/
|
|
|
|
/******************************************************************************************
|
|
MODULE NOTES:
|
|
|
|
This file contains the workhorse copy and shift functions used in nsStrStruct.
|
|
Ultimately, I plan to make the function pointers in this system available for
|
|
use by external modules. They'll be able to install their own "handlers".
|
|
Not so, today though.
|
|
|
|
*******************************************************************************************/
|
|
|
|
#ifndef _BUFFERROUTINES_H
|
|
#define _BUFFERROUTINES_H
|
|
|
|
#include "nsCRT.h"
|
|
|
|
#ifndef RICKG_TESTBED
|
|
#include "nsUnicharUtilCIID.h"
|
|
#include "nsIServiceManager.h"
|
|
#include "nsICaseConversion.h"
|
|
#endif
|
|
|
|
#define KSHIFTLEFT (0)
|
|
#define KSHIFTRIGHT (1)
|
|
|
|
|
|
inline PRUnichar GetUnicharAt(const char* aString,PRUint32 anIndex) {
|
|
return ((PRUnichar*)aString)[anIndex];
|
|
}
|
|
|
|
inline PRUnichar GetCharAt(const char* aString,PRUint32 anIndex) {
|
|
return (PRUnichar)aString[anIndex];
|
|
}
|
|
|
|
//----------------------------------------------------------------------------------------
|
|
//
|
|
// This set of methods is used to shift the contents of a char buffer.
|
|
// The functions are differentiated by shift direction and the underlying charsize.
|
|
//
|
|
|
|
/**
|
|
* This method shifts single byte characters left by a given amount from an given offset.
|
|
* @update gess 01/04/99
|
|
* @param aDest is a ptr to a cstring where left-shift is to be performed
|
|
* @param aLength is the known length of aDest
|
|
* @param anOffset is the index into aDest where shifting shall begin
|
|
* @param aCount is the number of chars to be "cut"
|
|
*/
|
|
void ShiftCharsLeft(char* aDest,PRUint32 aLength,PRUint32 anOffset,PRUint32 aCount) {
|
|
char* dst = aDest+anOffset;
|
|
char* src = aDest+anOffset+aCount;
|
|
|
|
memmove(dst,src,aLength-(aCount+anOffset));
|
|
}
|
|
|
|
/**
|
|
* This method shifts single byte characters right by a given amount from an given offset.
|
|
* @update gess 01/04/99
|
|
* @param aDest is a ptr to a cstring where the shift is to be performed
|
|
* @param aLength is the known length of aDest
|
|
* @param anOffset is the index into aDest where shifting shall begin
|
|
* @param aCount is the number of chars to be "inserted"
|
|
*/
|
|
void ShiftCharsRight(char* aDest,PRUint32 aLength,PRUint32 anOffset,PRUint32 aCount) {
|
|
char* src = aDest+anOffset;
|
|
char* dst = aDest+anOffset+aCount;
|
|
|
|
memmove(dst,src,aLength-anOffset);
|
|
}
|
|
|
|
/**
|
|
* This method shifts unicode characters by a given amount from an given offset.
|
|
* @update gess 01/04/99
|
|
* @param aDest is a ptr to a cstring where the shift is to be performed
|
|
* @param aLength is the known length of aDest
|
|
* @param anOffset is the index into aDest where shifting shall begin
|
|
* @param aCount is the number of chars to be "cut"
|
|
*/
|
|
void ShiftDoubleCharsLeft(char* aDest,PRUint32 aLength,PRUint32 anOffset,PRUint32 aCount) {
|
|
PRUnichar* root=(PRUnichar*)aDest;
|
|
PRUnichar* dst = root+anOffset;
|
|
PRUnichar* src = root+anOffset+aCount;
|
|
|
|
memmove(dst,src,(aLength-(aCount+anOffset))*sizeof(PRUnichar));
|
|
}
|
|
|
|
|
|
/**
|
|
* This method shifts unicode characters by a given amount from an given offset.
|
|
* @update gess 01/04/99
|
|
* @param aDest is a ptr to a cstring where the shift is to be performed
|
|
* @param aLength is the known length of aDest
|
|
* @param anOffset is the index into aDest where shifting shall begin
|
|
* @param aCount is the number of chars to be "inserted"
|
|
*/
|
|
void ShiftDoubleCharsRight(char* aDest,PRUint32 aLength,PRUint32 anOffset,PRUint32 aCount) {
|
|
PRUnichar* root=(PRUnichar*)aDest;
|
|
PRUnichar* src = root+anOffset;
|
|
PRUnichar* dst = root+anOffset+aCount;
|
|
|
|
memmove(dst,src,sizeof(PRUnichar)*(aLength-anOffset));
|
|
}
|
|
|
|
|
|
typedef void (*ShiftChars)(char* aDest,PRUint32 aLength,PRUint32 anOffset,PRUint32 aCount);
|
|
ShiftChars gShiftChars[2][2]= {
|
|
{&ShiftCharsLeft,&ShiftCharsRight},
|
|
{&ShiftDoubleCharsLeft,&ShiftDoubleCharsRight}
|
|
};
|
|
|
|
|
|
//----------------------------------------------------------------------------------------
|
|
//
|
|
// This set of methods is used to copy one buffer onto another.
|
|
// The functions are differentiated by the size of source and dest character sizes.
|
|
// WARNING: Your destination buffer MUST be big enough to hold all the source bytes.
|
|
// We don't validate these ranges here (this should be done in higher level routines).
|
|
//
|
|
|
|
|
|
/**
|
|
* Going 1 to 1 is easy, since we assume ascii. No conversions are necessary.
|
|
* @update gess 01/04/99
|
|
* @param aDest is the destination buffer
|
|
* @param aDestOffset is the pos to start copy to in the dest buffer
|
|
* @param aSource is the source buffer
|
|
* @param anOffset is the offset to start copying from in the source buffer
|
|
* @param aCount is the (max) number of chars to copy
|
|
*/
|
|
void CopyChars1To1(char* aDest,PRInt32 anDestOffset,const char* aSource,PRUint32 anOffset,PRUint32 aCount) {
|
|
|
|
char* dst = aDest+anDestOffset;
|
|
char* src = (char*)aSource+anOffset;
|
|
|
|
memcpy(dst,src,aCount);
|
|
}
|
|
|
|
/**
|
|
* Going 1 to 2 requires a conversion from ascii to unicode. This can be expensive.
|
|
* @param aDest is the destination buffer
|
|
* @param aDestOffset is the pos to start copy to in the dest buffer
|
|
* @param aSource is the source buffer
|
|
* @param anOffset is the offset to start copying from in the source buffer
|
|
* @param aCount is the (max) number of chars to copy
|
|
*/
|
|
void CopyChars1To2(char* aDest,PRInt32 anDestOffset,const char* aSource,PRUint32 anOffset,PRUint32 aCount) {
|
|
|
|
PRUnichar* theDest=(PRUnichar*)aDest;
|
|
PRUnichar* to = theDest+anDestOffset;
|
|
const unsigned char* first= (const unsigned char*)aSource+anOffset;
|
|
const unsigned char* last = first+aCount;
|
|
|
|
//now loop over characters, shifting them left...
|
|
while(first<last) {
|
|
*to=(PRUnichar)(*first);
|
|
to++;
|
|
first++;
|
|
}
|
|
}
|
|
|
|
|
|
/**
|
|
* Going 2 to 1 requires a conversion from unicode down to ascii. This can be lossy.
|
|
* @update gess 01/04/99
|
|
* @param aDest is the destination buffer
|
|
* @param aDestOffset is the pos to start copy to in the dest buffer
|
|
* @param aSource is the source buffer
|
|
* @param anOffset is the offset to start copying from in the source buffer
|
|
* @param aCount is the (max) number of chars to copy
|
|
*/
|
|
void CopyChars2To1(char* aDest,PRInt32 anDestOffset,const char* aSource,PRUint32 anOffset,PRUint32 aCount) {
|
|
char* to = aDest+anDestOffset;
|
|
PRUnichar* theSource=(PRUnichar*)aSource;
|
|
const PRUnichar* first= theSource+anOffset;
|
|
const PRUnichar* last = first+aCount;
|
|
|
|
//now loop over characters, shifting them left...
|
|
while(first<last) {
|
|
if(*first<256)
|
|
*to=(char)*first;
|
|
else *to='.';
|
|
to++;
|
|
first++;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Going 2 to 2 is fast and efficient.
|
|
* @update gess 01/04/99
|
|
* @param aDest is the destination buffer
|
|
* @param aDestOffset is the pos to start copy to in the dest buffer
|
|
* @param aSource is the source buffer
|
|
* @param anOffset is the offset to start copying from in the source buffer
|
|
* @param aCount is the (max) number of chars to copy
|
|
*/
|
|
void CopyChars2To2(char* aDest,PRInt32 anDestOffset,const char* aSource,PRUint32 anOffset,PRUint32 aCount) {
|
|
PRUnichar* theDest=(PRUnichar*)aDest;
|
|
PRUnichar* to = theDest+anDestOffset;
|
|
PRUnichar* theSource=(PRUnichar*)aSource;
|
|
PRUnichar* from= theSource+anOffset;
|
|
|
|
memcpy((void*)to,(void*)from,aCount*sizeof(PRUnichar));
|
|
}
|
|
|
|
|
|
//--------------------------------------------------------------------------------------
|
|
|
|
|
|
typedef void (*CopyChars)(char* aDest,PRInt32 anDestOffset,const char* aSource,PRUint32 anOffset,PRUint32 aCount);
|
|
|
|
CopyChars gCopyChars[2][2]={
|
|
{&CopyChars1To1,&CopyChars1To2},
|
|
{&CopyChars2To1,&CopyChars2To2}
|
|
};
|
|
|
|
|
|
//----------------------------------------------------------------------------------------
|
|
//
|
|
// This set of methods is used to search a buffer looking for a char.
|
|
//
|
|
|
|
|
|
/**
|
|
* This methods cans the given buffer for the given char
|
|
*
|
|
* @update gess 3/25/98
|
|
* @param aDest is the buffer to be searched
|
|
* @param aLength is the size (in char-units, not bytes) of the buffer
|
|
* @param anOffset is the start pos to begin searching
|
|
* @param aChar is the target character we're looking for
|
|
* @param aIgnorecase tells us whether to use a case sensitive search
|
|
* @return index of pos if found, else -1 (kNotFound)
|
|
*/
|
|
inline PRInt32 FindChar1(const char* aDest,PRUint32 aLength,PRUint32 anOffset,const PRUnichar aChar,PRBool aIgnoreCase) {
|
|
|
|
if(aChar<256) {
|
|
if(aIgnoreCase) {
|
|
char theChar=(char)nsCRT::ToUpper(aChar);
|
|
const char* ptr=aDest+(anOffset-1);
|
|
const char* last=aDest+aLength;
|
|
while(++ptr<last){
|
|
if(nsCRT::ToUpper(*ptr)==theChar)
|
|
return ptr-aDest;
|
|
}
|
|
}
|
|
else {
|
|
|
|
const char* ptr = aDest+anOffset;
|
|
char theChar=(char)aChar;
|
|
const char* result=(const char*)memchr(ptr, theChar,aLength-anOffset);
|
|
if(result) {
|
|
return result-aDest;
|
|
}
|
|
}
|
|
}
|
|
return kNotFound;
|
|
}
|
|
|
|
/**
|
|
* This methods cans the given buffer for the given char
|
|
*
|
|
* @update gess 3/25/98
|
|
* @param aDest is the buffer to be searched
|
|
* @param aLength is the size (in char-units, not bytes) of the buffer
|
|
* @param anOffset is the start pos to begin searching
|
|
* @param aChar is the target character we're looking for
|
|
* @param aIgnorecase tells us whether to use a case sensitive search
|
|
* @return index of pos if found, else -1 (kNotFound)
|
|
*/
|
|
inline PRInt32 FindChar2(const char* aDest,PRUint32 aLength,PRUint32 anOffset,const PRUnichar aChar,PRBool aIgnoreCase) {
|
|
const PRUnichar* root=(PRUnichar*)aDest;
|
|
const PRUnichar* ptr=root+(anOffset-1);
|
|
const PRUnichar* last=root+aLength;
|
|
|
|
if(aIgnoreCase) {
|
|
PRUnichar theChar=nsCRT::ToUpper(aChar);
|
|
while(++ptr<last){
|
|
if(nsCRT::ToUpper(*ptr)==theChar)
|
|
return ptr-root;
|
|
}
|
|
}
|
|
else {
|
|
while(++ptr<last){
|
|
if(*ptr==aChar)
|
|
return (ptr-root);
|
|
}
|
|
}
|
|
|
|
return kNotFound;
|
|
}
|
|
|
|
|
|
/**
|
|
* This methods cans the given buffer (in reverse) for the given char
|
|
*
|
|
* @update gess 3/25/98
|
|
* @param aDest is the buffer to be searched
|
|
* @param aLength is the size (in char-units, not bytes) of the buffer
|
|
* @param anOffset is the start pos to begin searching
|
|
* @param aChar is the target character we're looking for
|
|
* @param aIgnorecase tells us whether to use a case sensitive search
|
|
* @return index of pos if found, else -1 (kNotFound)
|
|
*/
|
|
inline PRInt32 RFindChar1(const char* aDest,PRUint32 aDestLength,PRUint32 anOffset,const PRUnichar aChar,PRBool aIgnoreCase) {
|
|
PRInt32 theIndex=0;
|
|
|
|
if(aIgnoreCase) {
|
|
PRUnichar theChar=nsCRT::ToUpper(aChar);
|
|
for(theIndex=(PRInt32)anOffset;theIndex>=0;theIndex--){
|
|
if(nsCRT::ToUpper(aDest[theIndex])==theChar)
|
|
return theIndex;
|
|
}
|
|
}
|
|
else {
|
|
for(theIndex=(PRInt32)anOffset;theIndex>=0;theIndex--){
|
|
if(aDest[theIndex]==aChar)
|
|
return theIndex;
|
|
}
|
|
}
|
|
|
|
return kNotFound;
|
|
}
|
|
|
|
|
|
/**
|
|
* This methods cans the given buffer for the given char
|
|
*
|
|
* @update gess 3/25/98
|
|
* @param aDest is the buffer to be searched
|
|
* @param aLength is the size (in char-units, not bytes) of the buffer
|
|
* @param anOffset is the start pos to begin searching
|
|
* @param aChar is the target character we're looking for
|
|
* @param aIgnorecase tells us whether to use a case sensitive search
|
|
* @return index of pos if found, else -1 (kNotFound)
|
|
*/
|
|
inline PRInt32 RFindChar2(const char* aDest,PRUint32 aDestLength,PRUint32 anOffset,const PRUnichar aChar,PRBool aIgnoreCase) {
|
|
|
|
PRInt32 theIndex=0;
|
|
PRUnichar* theBuf=(PRUnichar*)aDest;
|
|
|
|
if(aIgnoreCase) {
|
|
PRUnichar theChar=nsCRT::ToUpper(aChar);
|
|
for(theIndex=(PRInt32)anOffset;theIndex>=0;theIndex--){
|
|
if(nsCRT::ToUpper(theBuf[theIndex])==theChar)
|
|
return theIndex;
|
|
}
|
|
}
|
|
else {
|
|
for(theIndex=(PRInt32)anOffset;theIndex>=0;theIndex--){
|
|
if(theBuf[theIndex]==aChar)
|
|
return theIndex;
|
|
}
|
|
}
|
|
|
|
return kNotFound;
|
|
}
|
|
|
|
typedef PRInt32 (*FindChars)(const char* aDest,PRUint32 aDestLength,PRUint32 anOffset,const PRUnichar aChar,PRBool aIgnoreCase);
|
|
FindChars gFindChars[]={&FindChar1,&FindChar2};
|
|
FindChars gRFindChars[]={&RFindChar1,&RFindChar2};
|
|
|
|
//----------------------------------------------------------------------------------------
|
|
//
|
|
// This set of methods is used to compare one buffer onto another.
|
|
// The functions are differentiated by the size of source and dest character sizes.
|
|
// WARNING: Your destination buffer MUST be big enough to hold all the source bytes.
|
|
// We don't validate these ranges here (this should be done in higher level routines).
|
|
//
|
|
|
|
|
|
/**
|
|
* This method compares the data in one buffer with another
|
|
* @update gess 01/04/99
|
|
* @param aStr1 is the first buffer to be compared
|
|
* @param aStr2 is the 2nd buffer to be compared
|
|
* @param aCount is the number of chars to compare
|
|
* @param aIgnorecase tells us whether to use a case-sensitive comparison
|
|
* @return -1,0,1 depending on <,==,>
|
|
*/
|
|
PRInt32 Compare1To1(const char* aStr1,const char* aStr2,PRUint32 aCount,PRBool aIgnoreCase){
|
|
PRInt32 result=0;
|
|
if(aIgnoreCase)
|
|
result=nsCRT::strncasecmp(aStr1,aStr2,aCount);
|
|
else result=memcmp(aStr1,aStr2,aCount);
|
|
return result;
|
|
}
|
|
|
|
/**
|
|
* This method compares the data in one buffer with another
|
|
* @update gess 01/04/99
|
|
* @param aStr1 is the first buffer to be compared
|
|
* @param aStr2 is the 2nd buffer to be compared
|
|
* @param aCount is the number of chars to compare
|
|
* @param aIgnorecase tells us whether to use a case-sensitive comparison
|
|
* @return -1,0,1 depending on <,==,>
|
|
*/
|
|
PRInt32 Compare2To2(const char* aStr1,const char* aStr2,PRUint32 aCount,PRBool aIgnoreCase){
|
|
PRInt32 result=0;
|
|
if(aIgnoreCase)
|
|
result=nsCRT::strncasecmp((PRUnichar*)aStr1,(PRUnichar*)aStr2,aCount);
|
|
else result=nsCRT::strncmp((PRUnichar*)aStr1,(PRUnichar*)aStr2,aCount);
|
|
return result;
|
|
}
|
|
|
|
|
|
/**
|
|
* This method compares the data in one buffer with another
|
|
* @update gess 01/04/99
|
|
* @param aStr1 is the first buffer to be compared
|
|
* @param aStr2 is the 2nd buffer to be compared
|
|
* @param aCount is the number of chars to compare
|
|
* @param aIgnorecase tells us whether to use a case-sensitive comparison
|
|
* @return -1,0,1 depending on <,==,>
|
|
*/
|
|
PRInt32 Compare2To1(const char* aStr1,const char* aStr2,PRUint32 aCount,PRBool aIgnoreCase){
|
|
PRInt32 result;
|
|
if(aIgnoreCase)
|
|
result=nsCRT::strncasecmp((PRUnichar*)aStr1,aStr2,aCount);
|
|
else result=nsCRT::strncmp((PRUnichar*)aStr1,aStr2,aCount);
|
|
return result;
|
|
}
|
|
|
|
|
|
/**
|
|
* This method compares the data in one buffer with another
|
|
* @update gess 01/04/99
|
|
* @param aStr1 is the first buffer to be compared
|
|
* @param aStr2 is the 2nd buffer to be compared
|
|
* @param aCount is the number of chars to compare
|
|
* @param aIgnorecase tells us whether to use a case-sensitive comparison
|
|
* @return -1,0,1 depending on <,==,>
|
|
*/
|
|
PRInt32 Compare1To2(const char* aStr1,const char* aStr2,PRUint32 aCount,PRBool aIgnoreCase){
|
|
PRInt32 result;
|
|
if(aIgnoreCase)
|
|
result=nsCRT::strncasecmp((PRUnichar*)aStr2,aStr1,aCount)*-1;
|
|
else result=nsCRT::strncmp((PRUnichar*)aStr2,aStr1,aCount)*-1;
|
|
return result;
|
|
}
|
|
|
|
|
|
typedef PRInt32 (*CompareChars)(const char* aStr1,const char* aStr2,PRUint32 aCount,PRBool aIgnoreCase);
|
|
CompareChars gCompare[2][2]={
|
|
{&Compare1To1,&Compare1To2},
|
|
{&Compare2To1,&Compare2To2},
|
|
};
|
|
|
|
//----------------------------------------------------------------------------------------
|
|
//
|
|
// This set of methods is used to convert the case of strings...
|
|
//
|
|
|
|
|
|
/**
|
|
* This method performs a case conversion the data in the given buffer
|
|
*
|
|
* @update gess 01/04/99
|
|
* @param aString is the buffer to be case shifted
|
|
* @param aCount is the number of chars to compare
|
|
* @param aToUpper tells us whether to convert to upper or lower
|
|
* @return 0
|
|
*/
|
|
PRInt32 ConvertCase1(char* aString,PRUint32 aCount,PRBool aToUpper){
|
|
PRInt32 result=0;
|
|
|
|
typedef char chartype;
|
|
chartype* cp = (chartype*)aString;
|
|
chartype* end = cp + aCount-1;
|
|
while (cp <= end) {
|
|
chartype ch = *cp;
|
|
if(aToUpper) {
|
|
if ((ch >= 'a') && (ch <= 'z')) {
|
|
*cp = 'A' + (ch - 'a');
|
|
}
|
|
}
|
|
else {
|
|
if ((ch >= 'A') && (ch <= 'Z')) {
|
|
*cp = 'a' + (ch - 'A');
|
|
}
|
|
}
|
|
cp++;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
//----------------------------------------------------------------------------------------
|
|
|
|
#ifndef RICKG_TESTBED
|
|
class HandleCaseConversionShutdown3 : public nsIShutdownListener {
|
|
public :
|
|
NS_IMETHOD OnShutdown(const nsCID& cid, nsISupports* service);
|
|
HandleCaseConversionShutdown3(void) { NS_INIT_REFCNT(); }
|
|
virtual ~HandleCaseConversionShutdown3(void) {}
|
|
NS_DECL_ISUPPORTS
|
|
};
|
|
|
|
static NS_DEFINE_CID(kUnicharUtilCID, NS_UNICHARUTIL_CID);
|
|
static nsICaseConversion * gCaseConv = 0;
|
|
|
|
NS_IMPL_ISUPPORTS(HandleCaseConversionShutdown3, NS_GET_IID(nsIShutdownListener));
|
|
|
|
nsresult HandleCaseConversionShutdown3::OnShutdown(const nsCID& cid, nsISupports* service) {
|
|
if (cid.Equals(kUnicharUtilCID)) {
|
|
NS_ASSERTION(service == gCaseConv, "wrong service!");
|
|
if(gCaseConv){
|
|
gCaseConv->Release();
|
|
gCaseConv = 0;
|
|
}
|
|
}
|
|
return NS_OK;
|
|
}
|
|
|
|
|
|
class CCaseConversionServiceInitializer {
|
|
public:
|
|
CCaseConversionServiceInitializer(){
|
|
mListener = new HandleCaseConversionShutdown3();
|
|
if(mListener){
|
|
mListener->AddRef();
|
|
nsServiceManager::GetService(kUnicharUtilCID, NS_GET_IID(nsICaseConversion),(nsISupports**) &gCaseConv, mListener);
|
|
}
|
|
}
|
|
protected:
|
|
HandleCaseConversionShutdown3* mListener;
|
|
};
|
|
|
|
#endif
|
|
|
|
//----------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
* This method performs a case conversion the data in the given buffer
|
|
*
|
|
* @update gess 01/04/99
|
|
* @param aString is the buffer to be case shifted
|
|
* @param aCount is the number of chars to compare
|
|
* @param aToUpper tells us whether to convert to upper or lower
|
|
* @return 0
|
|
*/
|
|
PRInt32 ConvertCase2(char* aString,PRUint32 aCount,PRBool aToUpper){
|
|
PRUnichar* cp = (PRUnichar*)aString;
|
|
PRUnichar* end = cp + aCount-1;
|
|
PRInt32 result=0;
|
|
|
|
#ifndef RICKG_TESTBED
|
|
static CCaseConversionServiceInitializer gCaseConversionServiceInitializer;
|
|
|
|
// I18N code begin
|
|
if(gCaseConv) {
|
|
nsresult err=(aToUpper) ? gCaseConv->ToUpper(cp, cp, aCount) : gCaseConv->ToLower(cp, cp, aCount);
|
|
if(NS_SUCCEEDED(err))
|
|
return 0;
|
|
}
|
|
// I18N code end
|
|
#endif
|
|
|
|
|
|
while (cp <= end) {
|
|
PRUnichar ch = *cp;
|
|
if(aToUpper) {
|
|
if ((ch >= 'a') && (ch <= 'z')) {
|
|
*cp = 'A' + (ch - 'a');
|
|
}
|
|
}
|
|
else {
|
|
if ((ch >= 'A') && (ch <= 'Z')) {
|
|
*cp = 'a' + (ch - 'A');
|
|
}
|
|
}
|
|
cp++;
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
typedef PRInt32 (*CaseConverters)(char*,PRUint32,PRBool);
|
|
CaseConverters gCaseConverters[]={&ConvertCase1,&ConvertCase2};
|
|
|
|
|
|
|
|
//----------------------------------------------------------------------------------------
|
|
//
|
|
// This set of methods is used compress char sequences in a buffer...
|
|
//
|
|
|
|
|
|
/**
|
|
* This method compresses duplicate runs of a given char from the given buffer
|
|
*
|
|
* @update gess 11/02/99
|
|
* @param aString is the buffer to be manipulated
|
|
* @param aLength is the length of the buffer
|
|
* @param aSet tells us which chars to compress from given buffer
|
|
* @param aEliminateLeading tells us whether to strip chars from the start of the buffer
|
|
* @param aEliminateTrailing tells us whether to strip chars from the start of the buffer
|
|
* @return the new length of the given buffer
|
|
*/
|
|
PRInt32 CompressChars1(char* aString,PRUint32 aLength,const char* aSet){
|
|
|
|
char* from = aString;
|
|
char* end = aString + aLength-1;
|
|
char* to = from;
|
|
|
|
//this code converts /n, /t, /r into normal space ' ';
|
|
//it also compresses runs of whitespace down to a single char...
|
|
if(aSet && aString && (0 < aLength)){
|
|
PRUint32 aSetLen=strlen(aSet);
|
|
while (from <= end) {
|
|
char theChar = *from++;
|
|
if(kNotFound!=FindChar1(aSet,aSetLen,0,theChar,PR_FALSE)){
|
|
*to++=theChar;
|
|
while (from <= end) {
|
|
theChar = *from++;
|
|
if(kNotFound==FindChar1(aSet,aSetLen,0,theChar,PR_FALSE)){
|
|
*to++ = theChar;
|
|
break;
|
|
}
|
|
}
|
|
} else {
|
|
*to++ = theChar;
|
|
}
|
|
}
|
|
*to = 0;
|
|
}
|
|
return to - (char*)aString;
|
|
}
|
|
|
|
|
|
/**
|
|
* This method compresses duplicate runs of a given char from the given buffer
|
|
*
|
|
* @update gess 12/20/99
|
|
* @param aString is the buffer to be manipulated
|
|
* @param aLength is the length of the buffer
|
|
* @param aSet tells us which chars to compress from given buffer
|
|
* @param aEliminateLeading tells us whether to strip chars from the start of the buffer
|
|
* @param aEliminateTrailing tells us whether to strip chars from the start of the buffer
|
|
* @return the new length of the given buffer
|
|
*/
|
|
PRInt32 CompressChars2(char* aString,PRUint32 aLength,const char* aSet){
|
|
|
|
PRUnichar* from = (PRUnichar*)aString;
|
|
PRUnichar* end = from + aLength-1;
|
|
PRUnichar* to = from;
|
|
|
|
//this code converts /n, /t, /r into normal space ' ';
|
|
//it also compresses runs of whitespace down to a single char...
|
|
if(aSet && aString && (0 < aLength)){
|
|
PRUint32 aSetLen=strlen(aSet);
|
|
while (from <= end) {
|
|
PRUnichar theChar = *from++;
|
|
if((theChar<256) && (kNotFound!=FindChar1(aSet,aSetLen,0,theChar,PR_FALSE))){
|
|
*to++=theChar;
|
|
while (from <= end) {
|
|
theChar = *from++;
|
|
if(kNotFound==FindChar1(aSet,aSetLen,0,theChar,PR_FALSE)){
|
|
*to++ = theChar;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
*to++ = theChar;
|
|
}
|
|
}
|
|
*to = 0;
|
|
}
|
|
return to - (PRUnichar*)aString;
|
|
}
|
|
|
|
typedef PRInt32 (*CompressChars)(char* aString,PRUint32 aCount,const char* aSet);
|
|
CompressChars gCompressChars[]={&CompressChars1,&CompressChars2};
|
|
|
|
/**
|
|
* This method strips chars in a given set from the given buffer
|
|
*
|
|
* @update gess 11/02/99
|
|
* @param aString is the buffer to be manipulated
|
|
* @param aLength is the length of the buffer
|
|
* @param aSet tells us which chars to compress from given buffer
|
|
* @param aEliminateLeading tells us whether to strip chars from the start of the buffer
|
|
* @param aEliminateTrailing tells us whether to strip chars from the start of the buffer
|
|
* @return the new length of the given buffer
|
|
*/
|
|
PRInt32 StripChars1(char* aString,PRUint32 aLength,const char* aSet){
|
|
|
|
char* to = aString;
|
|
char* from = aString-1;
|
|
char* end = aString + aLength;
|
|
|
|
if(aSet && aString && (0 < aLength)){
|
|
PRUint32 aSetLen=strlen(aSet);
|
|
while (++from < end) {
|
|
char theChar = *from;
|
|
if(kNotFound==FindChar1(aSet,aSetLen,0,theChar,PR_FALSE)){
|
|
*to++ = theChar;
|
|
}
|
|
}
|
|
*to = 0;
|
|
}
|
|
return to - (char*)aString;
|
|
}
|
|
|
|
|
|
/**
|
|
* This method strips chars in a given set from the given buffer
|
|
*
|
|
* @update gess 11/02/99
|
|
* @param aString is the buffer to be manipulated
|
|
* @param aLength is the length of the buffer
|
|
* @param aSet tells us which chars to compress from given buffer
|
|
* @param aEliminateLeading tells us whether to strip chars from the start of the buffer
|
|
* @param aEliminateTrailing tells us whether to strip chars from the start of the buffer
|
|
* @return the new length of the given buffer
|
|
*/
|
|
PRInt32 StripChars2(char* aString,PRUint32 aLength,const char* aSet){
|
|
|
|
PRUnichar* to = (PRUnichar*)aString;
|
|
PRUnichar* from = (PRUnichar*)aString-1;
|
|
PRUnichar* end = to + aLength;
|
|
|
|
if(aSet && aString && (0 < aLength)){
|
|
PRUint32 aSetLen=strlen(aSet);
|
|
while (++from < end) {
|
|
PRUnichar theChar = *from;
|
|
//Note the test for ascii range below. If you have a real unicode char,
|
|
//and you're searching for chars in the (given) ascii string, there's no
|
|
//point in doing the real search since it's out of the ascii range.
|
|
|
|
if((255<theChar) || (kNotFound==FindChar1(aSet,aSetLen,0,theChar,PR_FALSE))){
|
|
*to++ = theChar;
|
|
}
|
|
}
|
|
*to = 0;
|
|
}
|
|
return to - (PRUnichar*)aString;
|
|
}
|
|
|
|
typedef PRInt32 (*StripChars)(char* aString,PRUint32 aCount,const char* aSet);
|
|
StripChars gStripChars[]={&StripChars1,&StripChars2};
|
|
|
|
#endif
|