2010-10-14 08:27:31 +02:00
|
|
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
2000-09-18 16:07:07 +00:00
|
|
|
/*************************************************************************
|
|
|
|
*
|
2008-04-11 13:01:20 +00:00
|
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
2000-09-18 16:07:07 +00:00
|
|
|
*
|
2010-02-12 15:01:35 +01:00
|
|
|
* Copyright 2000, 2010 Oracle and/or its affiliates.
|
2000-09-18 16:07:07 +00:00
|
|
|
*
|
2008-04-11 13:01:20 +00:00
|
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
2000-09-18 16:07:07 +00:00
|
|
|
*
|
2008-04-11 13:01:20 +00:00
|
|
|
* This file is part of OpenOffice.org.
|
2000-09-18 16:07:07 +00:00
|
|
|
*
|
2008-04-11 13:01:20 +00:00
|
|
|
* OpenOffice.org is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU Lesser General Public License version 3
|
|
|
|
* only, as published by the Free Software Foundation.
|
2000-09-18 16:07:07 +00:00
|
|
|
*
|
2008-04-11 13:01:20 +00:00
|
|
|
* OpenOffice.org is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU Lesser General Public License version 3 for more details
|
|
|
|
* (a copy is included in the LICENSE file that accompanied this code).
|
2000-09-18 16:07:07 +00:00
|
|
|
*
|
2008-04-11 13:01:20 +00:00
|
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
|
|
* version 3 along with OpenOffice.org. If not, see
|
|
|
|
* <http://www.openoffice.org/license.html>
|
|
|
|
* for a copy of the LGPLv3 License.
|
2000-09-18 16:07:07 +00:00
|
|
|
*
|
|
|
|
************************************************************************/
|
|
|
|
|
2006-09-17 00:03:23 +00:00
|
|
|
|
2000-09-18 16:07:07 +00:00
|
|
|
static sal_Int32 ImplStringCompare( const STRCODE* pStr1, const STRCODE* pStr2,
|
|
|
|
xub_StrLen nCount )
|
|
|
|
{
|
|
|
|
sal_Int32 nRet = 0;
|
|
|
|
while ( nCount &&
|
2006-06-19 12:53:11 +00:00
|
|
|
((nRet = ((sal_Int32)((STRCODEU)*pStr1))-((sal_Int32)((STRCODEU)*pStr2))) == 0) &&
|
2000-09-18 16:07:07 +00:00
|
|
|
*pStr2 )
|
|
|
|
{
|
2003-03-27 16:05:12 +00:00
|
|
|
++pStr1,
|
|
|
|
++pStr2,
|
|
|
|
--nCount;
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return nRet;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
static sal_Int32 ImplStringCompareWithoutZero( const STRCODE* pStr1, const STRCODE* pStr2,
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nCount )
|
2000-09-18 16:07:07 +00:00
|
|
|
{
|
|
|
|
sal_Int32 nRet = 0;
|
|
|
|
while ( nCount &&
|
2006-06-19 12:53:11 +00:00
|
|
|
((nRet = ((sal_Int32)((STRCODEU)*pStr1))-((sal_Int32)((STRCODEU)*pStr2))) == 0) )
|
2000-09-18 16:07:07 +00:00
|
|
|
{
|
2003-03-27 16:05:12 +00:00
|
|
|
++pStr1,
|
|
|
|
++pStr2,
|
|
|
|
--nCount;
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return nRet;
|
|
|
|
}
|
|
|
|
|
|
|
|
// =======================================================================
|
|
|
|
|
|
|
|
#ifdef DBG_UTIL
|
|
|
|
const char* DBGCHECKSTRING( const void* pString )
|
|
|
|
{
|
|
|
|
STRING* p = (STRING*)pString;
|
|
|
|
|
2006-06-19 12:53:11 +00:00
|
|
|
if ( p->GetBuffer()[p->Len()] != 0 )
|
2000-09-18 16:07:07 +00:00
|
|
|
return "String damaged: aStr[nLen] != 0";
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// =======================================================================
|
|
|
|
|
2006-06-19 12:53:11 +00:00
|
|
|
static STRINGDATA* ImplAllocData( sal_Int32 nLen )
|
2000-09-18 16:07:07 +00:00
|
|
|
{
|
|
|
|
// Dann kopiere die Daten
|
|
|
|
STRINGDATA* pData = (STRINGDATA*)rtl_allocateMemory( sizeof(STRINGDATA)+(nLen*sizeof( STRCODE )) );
|
|
|
|
pData->mnRefCount = 1;
|
|
|
|
pData->mnLen = nLen;
|
|
|
|
pData->maStr[nLen] = 0;
|
|
|
|
return pData;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
static STRINGDATA* _ImplCopyData( STRINGDATA* pData )
|
|
|
|
{
|
2000-09-25 17:58:44 +00:00
|
|
|
unsigned int nSize = sizeof(STRINGDATA)+(pData->mnLen*sizeof( STRCODE ));
|
2000-09-18 16:07:07 +00:00
|
|
|
STRINGDATA* pNewData = (STRINGDATA*)rtl_allocateMemory( nSize );
|
|
|
|
memcpy( pNewData, pData, nSize );
|
|
|
|
pNewData->mnRefCount = 1;
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_RELEASE((STRING_TYPE *)pData);
|
2000-09-18 16:07:07 +00:00
|
|
|
return pNewData;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
2006-06-19 12:53:11 +00:00
|
|
|
inline void STRING::ImplCopyData()
|
2000-09-18 16:07:07 +00:00
|
|
|
{
|
2007-04-17 10:45:24 +00:00
|
|
|
DBG_ASSERT( (mpData->mnRefCount != 0), "String::ImplCopyData() - RefCount == 0" );
|
2000-09-18 16:07:07 +00:00
|
|
|
|
|
|
|
// ist es ein referenzierter String, dann die Daten abkoppeln
|
2006-06-19 12:53:11 +00:00
|
|
|
if ( mpData->mnRefCount != 1 )
|
|
|
|
mpData = _ImplCopyData( mpData );
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
2006-06-19 12:53:11 +00:00
|
|
|
inline STRCODE* STRING::ImplCopyStringData( STRCODE* pStr )
|
2000-09-18 16:07:07 +00:00
|
|
|
{
|
|
|
|
// Ist der Referenzzaehler groesser 0
|
2006-06-19 12:53:11 +00:00
|
|
|
if ( mpData->mnRefCount != 1 ) {
|
|
|
|
DBG_ASSERT( (pStr >= mpData->maStr) &&
|
|
|
|
((pStr-mpData->maStr) < mpData->mnLen),
|
|
|
|
"ImplCopyStringData - pStr from other String-Instanz" );
|
|
|
|
unsigned int nIndex = (unsigned int)(pStr-mpData->maStr);
|
|
|
|
mpData = _ImplCopyData( mpData );
|
|
|
|
pStr = mpData->maStr + nIndex;
|
|
|
|
}
|
2000-09-18 16:07:07 +00:00
|
|
|
return pStr;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
2006-06-19 12:53:11 +00:00
|
|
|
inline sal_Int32 ImplGetCopyLen( sal_Int32 nStrLen, sal_Int32 nCopyLen )
|
2000-09-18 16:07:07 +00:00
|
|
|
{
|
2006-06-19 12:53:11 +00:00
|
|
|
OSL_ASSERT(nStrLen <= STRING_MAXLEN && nCopyLen <= STRING_MAXLEN);
|
|
|
|
if ( nCopyLen > STRING_MAXLEN-nStrLen )
|
2000-09-18 16:07:07 +00:00
|
|
|
nCopyLen = STRING_MAXLEN-nStrLen;
|
|
|
|
return nCopyLen;
|
|
|
|
}
|
|
|
|
|
|
|
|
// =======================================================================
|
|
|
|
|
|
|
|
STRING::STRING()
|
2006-05-04 13:52:17 +00:00
|
|
|
: mpData(NULL)
|
2000-09-18 16:07:07 +00:00
|
|
|
{
|
|
|
|
DBG_CTOR( STRING, DBGCHECKSTRING );
|
|
|
|
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_NEW((STRING_TYPE **)&mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING::STRING( const STRING& rStr )
|
|
|
|
{
|
|
|
|
DBG_CTOR( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_CHKOBJ( &rStr, STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Pointer auf die Daten des uebergebenen Strings setzen und
|
|
|
|
// Referenzzaehler erhoehen
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_ACQUIRE((STRING_TYPE *)rStr.mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
mpData = rStr.mpData;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING::STRING( const STRING& rStr, xub_StrLen nPos, xub_StrLen nLen )
|
2006-05-04 13:52:17 +00:00
|
|
|
: mpData( NULL )
|
2000-09-18 16:07:07 +00:00
|
|
|
{
|
|
|
|
DBG_CTOR( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_CHKOBJ( &rStr, STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Stringlaenge ermitteln
|
|
|
|
if ( nPos > rStr.mpData->mnLen )
|
|
|
|
nLen = 0;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// Laenge korrigieren, wenn noetig
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nMaxLen = rStr.mpData->mnLen-nPos;
|
2000-09-18 16:07:07 +00:00
|
|
|
if ( nLen > nMaxLen )
|
2006-06-19 12:53:11 +00:00
|
|
|
nLen = static_cast< xub_StrLen >(nMaxLen);
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Ist es kein leerer String
|
|
|
|
if ( nLen )
|
|
|
|
{
|
|
|
|
// Reicht ein einfaches erhoehen des Referenzcounters
|
|
|
|
if ( (nPos == 0) && (nLen == rStr.mpData->mnLen) )
|
|
|
|
{
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_ACQUIRE((STRING_TYPE *)rStr.mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
mpData = rStr.mpData;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// Verwaltungsdaten anlegen und String kopieren
|
|
|
|
mpData = ImplAllocData( nLen );
|
|
|
|
memcpy( mpData->maStr, rStr.mpData->maStr+nPos, nLen*sizeof( STRCODE ) );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_NEW((STRING_TYPE **)&mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING::STRING( const STRCODE* pCharStr )
|
2006-05-04 13:52:17 +00:00
|
|
|
: mpData(NULL)
|
2000-09-18 16:07:07 +00:00
|
|
|
{
|
|
|
|
DBG_CTOR( STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Stringlaenge ermitteln
|
|
|
|
// Bei diesem Ctor darf NULL uebergeben werden
|
|
|
|
xub_StrLen nLen;
|
|
|
|
if ( pCharStr )
|
|
|
|
nLen = ImplStringLen( pCharStr );
|
|
|
|
else
|
|
|
|
nLen = 0;
|
|
|
|
|
|
|
|
// Ist es kein leerer String
|
|
|
|
if ( nLen )
|
|
|
|
{
|
|
|
|
// Verwaltungsdaten anlegen und String kopieren
|
|
|
|
mpData = ImplAllocData( nLen );
|
|
|
|
memcpy( mpData->maStr, pCharStr, nLen*sizeof( STRCODE ) );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_NEW((STRING_TYPE **)&mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING::~STRING()
|
|
|
|
{
|
|
|
|
DBG_DTOR( STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Daten loeschen
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING& STRING::Assign( const STRING& rStr )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_CHKOBJ( &rStr, STRING, DBGCHECKSTRING );
|
|
|
|
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_ACQUIRE((STRING_TYPE *)rStr.mpData);
|
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
mpData = rStr.mpData;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING& STRING::Append( const STRING& rStr )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_CHKOBJ( &rStr, STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Wenn String leer, dann reicht eine Zuweisung
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nLen = mpData->mnLen;
|
2000-09-18 16:07:07 +00:00
|
|
|
if ( !nLen )
|
|
|
|
{
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_ACQUIRE((STRING_TYPE *)rStr.mpData);
|
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
mpData = rStr.mpData;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// Ueberlauf abfangen
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nCopyLen = ImplGetCopyLen( nLen, rStr.mpData->mnLen );
|
2000-09-18 16:07:07 +00:00
|
|
|
|
|
|
|
// Ist der uebergebene String kein Leerstring
|
|
|
|
if ( nCopyLen )
|
|
|
|
{
|
|
|
|
// Neue Datenstruktur und neuen String erzeugen
|
|
|
|
STRINGDATA* pNewData = ImplAllocData( nLen+nCopyLen );
|
|
|
|
|
|
|
|
// String kopieren
|
|
|
|
memcpy( pNewData->maStr, mpData->maStr, nLen*sizeof( STRCODE ) );
|
|
|
|
memcpy( pNewData->maStr+nLen, rStr.mpData->maStr, nCopyLen*sizeof( STRCODE ) );
|
|
|
|
|
|
|
|
// Alte Daten loeschen und Neue zuweisen
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
mpData = pNewData;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING& STRING::Append( const STRCODE* pCharStr )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_ASSERT( pCharStr, "String::Append() - pCharStr is NULL" );
|
|
|
|
|
|
|
|
// Stringlaenge ermitteln
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nLen = mpData->mnLen;
|
|
|
|
sal_Int32 nCopyLen = ImplStringLen( pCharStr );
|
2000-09-18 16:07:07 +00:00
|
|
|
|
|
|
|
// Ueberlauf abfangen
|
|
|
|
nCopyLen = ImplGetCopyLen( nLen, nCopyLen );
|
|
|
|
|
|
|
|
// Ist es kein leerer String
|
|
|
|
if ( nCopyLen )
|
|
|
|
{
|
|
|
|
// Neue Datenstruktur und neuen String erzeugen
|
|
|
|
STRINGDATA* pNewData = ImplAllocData( nLen+nCopyLen );
|
|
|
|
|
|
|
|
// String kopieren
|
|
|
|
memcpy( pNewData->maStr, mpData->maStr, nLen*sizeof( STRCODE ) );
|
|
|
|
memcpy( pNewData->maStr+nLen, pCharStr, nCopyLen*sizeof( STRCODE ) );
|
|
|
|
|
|
|
|
// Alte Daten loeschen und Neue zuweisen
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
mpData = pNewData;
|
|
|
|
}
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
void STRING::SetChar( xub_StrLen nIndex, STRCODE c )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_ASSERT( nIndex < mpData->mnLen, "String::SetChar() - nIndex > String.Len()" );
|
|
|
|
|
|
|
|
// Daten kopieren, wenn noetig und Character zuweisen
|
2006-06-19 12:53:11 +00:00
|
|
|
ImplCopyData();
|
2000-09-18 16:07:07 +00:00
|
|
|
mpData->maStr[nIndex] = c;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING& STRING::Insert( const STRING& rStr, xub_StrLen nIndex )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_CHKOBJ( &rStr, STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Ueberlauf abfangen
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nCopyLen = ImplGetCopyLen( mpData->mnLen, rStr.mpData->mnLen );
|
2000-09-18 16:07:07 +00:00
|
|
|
|
|
|
|
// Ist der einzufuegende String ein Leerstring
|
|
|
|
if ( !nCopyLen )
|
|
|
|
return *this;
|
|
|
|
|
|
|
|
// Index groesser als Laenge
|
|
|
|
if ( nIndex > mpData->mnLen )
|
2006-06-19 12:53:11 +00:00
|
|
|
nIndex = static_cast< xub_StrLen >(mpData->mnLen);
|
2000-09-18 16:07:07 +00:00
|
|
|
|
|
|
|
// Neue Laenge ermitteln und neuen String anlegen
|
|
|
|
STRINGDATA* pNewData = ImplAllocData( mpData->mnLen+nCopyLen );
|
|
|
|
|
|
|
|
// String kopieren
|
|
|
|
memcpy( pNewData->maStr, mpData->maStr, nIndex*sizeof( STRCODE ) );
|
|
|
|
memcpy( pNewData->maStr+nIndex, rStr.mpData->maStr, nCopyLen*sizeof( STRCODE ) );
|
|
|
|
memcpy( pNewData->maStr+nIndex+nCopyLen, mpData->maStr+nIndex,
|
|
|
|
(mpData->mnLen-nIndex)*sizeof( STRCODE ) );
|
|
|
|
|
|
|
|
// Alte Daten loeschen und Neue zuweisen
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
mpData = pNewData;
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING& STRING::Replace( xub_StrLen nIndex, xub_StrLen nCount, const STRING& rStr )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_CHKOBJ( &rStr, STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Wenn Index groessergleich Laenge ist, dann ist es ein Append
|
|
|
|
if ( nIndex >= mpData->mnLen )
|
|
|
|
{
|
|
|
|
Append( rStr );
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Ist es eine Zuweisung
|
|
|
|
if ( (nIndex == 0) && (nCount >= mpData->mnLen) )
|
|
|
|
{
|
|
|
|
Assign( rStr );
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Reicht ein Erase
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nStrLen = rStr.mpData->mnLen;
|
2000-09-18 16:07:07 +00:00
|
|
|
if ( !nStrLen )
|
|
|
|
return Erase( nIndex, nCount );
|
|
|
|
|
|
|
|
// nCount darf nicht ueber das Stringende hinnausgehen
|
2006-06-19 12:53:11 +00:00
|
|
|
if ( nCount > mpData->mnLen - nIndex )
|
|
|
|
nCount = static_cast< xub_StrLen >(mpData->mnLen-nIndex);
|
2000-09-18 16:07:07 +00:00
|
|
|
|
|
|
|
// Reicht ein Insert
|
|
|
|
if ( !nCount )
|
|
|
|
return Insert( rStr, nIndex );
|
|
|
|
|
|
|
|
// Reicht eine zeichenweise Zuweisung
|
|
|
|
if ( nCount == nStrLen )
|
|
|
|
{
|
2006-06-19 12:53:11 +00:00
|
|
|
ImplCopyData();
|
2000-09-18 16:07:07 +00:00
|
|
|
memcpy( mpData->maStr+nIndex, rStr.mpData->maStr, nCount*sizeof( STRCODE ) );
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Ueberlauf abfangen
|
|
|
|
nStrLen = ImplGetCopyLen( mpData->mnLen-nCount, nStrLen );
|
|
|
|
|
|
|
|
// Neue Daten anlegen
|
|
|
|
STRINGDATA* pNewData = ImplAllocData( mpData->mnLen-nCount+nStrLen );
|
|
|
|
|
|
|
|
// String kopieren
|
|
|
|
memcpy( pNewData->maStr, mpData->maStr, nIndex*sizeof( STRCODE ) );
|
|
|
|
memcpy( pNewData->maStr+nIndex, rStr.mpData->maStr, nStrLen*sizeof( STRCODE ) );
|
|
|
|
memcpy( pNewData->maStr+nIndex+nStrLen, mpData->maStr+nIndex+nCount,
|
|
|
|
(mpData->mnLen-nIndex-nCount+1)*sizeof( STRCODE ) );
|
|
|
|
|
|
|
|
// Alte Daten loeschen und Neue zuweisen
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
mpData = pNewData;
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING& STRING::Erase( xub_StrLen nIndex, xub_StrLen nCount )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Ist der Index ausserhalb des Strings oder ist nCount == 0
|
2003-11-12 16:16:03 +00:00
|
|
|
if ( (nIndex >= mpData->mnLen) || !nCount )
|
2000-09-18 16:07:07 +00:00
|
|
|
return *this;
|
|
|
|
|
|
|
|
// nCount darf nicht ueber das Stringende hinnausgehen
|
2006-06-19 12:53:11 +00:00
|
|
|
if ( nCount > mpData->mnLen - nIndex )
|
|
|
|
nCount = static_cast< xub_StrLen >(mpData->mnLen-nIndex);
|
2000-09-18 16:07:07 +00:00
|
|
|
|
|
|
|
// Ist das Ergebnis kein Leerstring
|
|
|
|
if ( mpData->mnLen - nCount )
|
|
|
|
{
|
|
|
|
// Neue Daten anlegen
|
|
|
|
STRINGDATA* pNewData = ImplAllocData( mpData->mnLen-nCount );
|
|
|
|
|
|
|
|
// String kopieren
|
|
|
|
memcpy( pNewData->maStr, mpData->maStr, nIndex*sizeof( STRCODE ) );
|
|
|
|
memcpy( pNewData->maStr+nIndex, mpData->maStr+nIndex+nCount,
|
|
|
|
(mpData->mnLen-nIndex-nCount+1)*sizeof( STRCODE ) );
|
|
|
|
|
|
|
|
// Alte Daten loeschen und Neue zuweisen
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
mpData = pNewData;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2006-05-04 13:52:17 +00:00
|
|
|
STRING_NEW((STRING_TYPE **)&mpData);
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING& STRING::ToLowerAscii()
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nIndex = 0;
|
|
|
|
sal_Int32 nLen = mpData->mnLen;
|
2000-09-18 16:07:07 +00:00
|
|
|
STRCODE* pStr = mpData->maStr;
|
|
|
|
while ( nIndex < nLen )
|
|
|
|
{
|
|
|
|
// Ist das Zeichen zwischen 'A' und 'Z' dann umwandeln
|
|
|
|
if ( (*pStr >= 65) && (*pStr <= 90) )
|
|
|
|
{
|
|
|
|
// Daten kopieren, wenn noetig
|
2006-06-19 12:53:11 +00:00
|
|
|
pStr = ImplCopyStringData( pStr );
|
2000-09-18 16:07:07 +00:00
|
|
|
*pStr += 32;
|
|
|
|
}
|
|
|
|
|
2003-03-27 16:05:12 +00:00
|
|
|
++pStr,
|
|
|
|
++nIndex;
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
xub_StrLen STRING::Search( STRCODE c, xub_StrLen nIndex ) const
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nLen = mpData->mnLen;
|
2000-09-18 16:07:07 +00:00
|
|
|
const STRCODE* pStr = mpData->maStr;
|
|
|
|
pStr += nIndex;
|
|
|
|
while ( nIndex < nLen )
|
|
|
|
{
|
|
|
|
if ( *pStr == c )
|
|
|
|
return nIndex;
|
2003-03-27 16:05:12 +00:00
|
|
|
++pStr,
|
|
|
|
++nIndex;
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return STRING_NOTFOUND;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
xub_StrLen STRING::Search( const STRING& rStr, xub_StrLen nIndex ) const
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_CHKOBJ( &rStr, STRING, DBGCHECKSTRING );
|
|
|
|
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nLen = mpData->mnLen;
|
|
|
|
sal_Int32 nStrLen = rStr.mpData->mnLen;
|
2000-09-18 16:07:07 +00:00
|
|
|
|
|
|
|
// Falls die Laenge des uebergebenen Strings 0 ist oder der Index
|
|
|
|
// hinter dem String liegt, dann wurde der String nicht gefunden
|
|
|
|
if ( !nStrLen || (nIndex >= nLen) )
|
|
|
|
return STRING_NOTFOUND;
|
|
|
|
|
|
|
|
const STRCODE* pStr1 = mpData->maStr;
|
|
|
|
pStr1 += nIndex;
|
|
|
|
|
|
|
|
if ( nStrLen == 1 )
|
|
|
|
{
|
|
|
|
STRCODE cSearch = rStr.mpData->maStr[0];
|
|
|
|
while ( nIndex < nLen )
|
|
|
|
{
|
|
|
|
if ( *pStr1 == cSearch )
|
|
|
|
return nIndex;
|
2003-03-27 16:05:12 +00:00
|
|
|
++pStr1,
|
|
|
|
++nIndex;
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
const STRCODE* pStr2 = rStr.mpData->maStr;
|
|
|
|
|
|
|
|
// Nur innerhalb des Strings suchen
|
2006-06-19 12:53:11 +00:00
|
|
|
while ( nLen - nIndex >= nStrLen )
|
2000-09-18 16:07:07 +00:00
|
|
|
{
|
|
|
|
// Stimmt der String ueberein
|
|
|
|
if ( ImplStringCompareWithoutZero( pStr1, pStr2, nStrLen ) == 0 )
|
|
|
|
return nIndex;
|
2003-03-27 16:05:12 +00:00
|
|
|
++pStr1,
|
|
|
|
++nIndex;
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return STRING_NOTFOUND;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
xub_StrLen STRING::Search( const STRCODE* pCharStr, xub_StrLen nIndex ) const
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nLen = mpData->mnLen;
|
2000-09-18 16:07:07 +00:00
|
|
|
xub_StrLen nStrLen = ImplStringLen( pCharStr );
|
|
|
|
|
|
|
|
// Falls die Laenge des uebergebenen Strings 0 ist oder der Index
|
|
|
|
// hinter dem String liegt, dann wurde der String nicht gefunden
|
|
|
|
if ( !nStrLen || (nIndex >= nLen) )
|
|
|
|
return STRING_NOTFOUND;
|
|
|
|
|
|
|
|
const STRCODE* pStr = mpData->maStr;
|
|
|
|
pStr += nIndex;
|
|
|
|
|
|
|
|
if ( nStrLen == 1 )
|
|
|
|
{
|
|
|
|
STRCODE cSearch = *pCharStr;
|
|
|
|
while ( nIndex < nLen )
|
|
|
|
{
|
|
|
|
if ( *pStr == cSearch )
|
|
|
|
return nIndex;
|
2003-03-27 16:05:12 +00:00
|
|
|
++pStr,
|
|
|
|
++nIndex;
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// Nur innerhalb des Strings suchen
|
2006-06-19 12:53:11 +00:00
|
|
|
while ( nLen - nIndex >= nStrLen )
|
2000-09-18 16:07:07 +00:00
|
|
|
{
|
|
|
|
// Stimmt der String ueberein
|
|
|
|
if ( ImplStringCompareWithoutZero( pStr, pCharStr, nStrLen ) == 0 )
|
|
|
|
return nIndex;
|
2003-03-27 16:05:12 +00:00
|
|
|
++pStr,
|
|
|
|
++nIndex;
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return STRING_NOTFOUND;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
void STRING::SearchAndReplaceAll( STRCODE c, STRCODE cRep )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nLen = mpData->mnLen;
|
2000-09-18 16:07:07 +00:00
|
|
|
const STRCODE* pStr = mpData->maStr;
|
2006-06-19 12:53:11 +00:00
|
|
|
sal_Int32 nIndex = 0;
|
2000-09-18 16:07:07 +00:00
|
|
|
while ( nIndex < nLen )
|
|
|
|
{
|
|
|
|
if ( *pStr == c )
|
|
|
|
{
|
2006-06-19 12:53:11 +00:00
|
|
|
ImplCopyData();
|
2000-09-18 16:07:07 +00:00
|
|
|
mpData->maStr[nIndex] = cRep;
|
|
|
|
}
|
2003-03-27 16:05:12 +00:00
|
|
|
++pStr,
|
|
|
|
++nIndex;
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-10-14 08:27:31 +02:00
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|