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:02:32 +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:02:32 +00:00
|
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
2000-09-18 16:07:07 +00:00
|
|
|
*
|
2008-04-11 13:02:32 +00:00
|
|
|
* This file is part of OpenOffice.org.
|
2000-09-18 16:07:07 +00:00
|
|
|
*
|
2008-04-11 13:02:32 +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:02:32 +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:02:32 +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:04:54 +00:00
|
|
|
// MARKER(update_precomp.py): autogen include statement, do not remove
|
|
|
|
#include "precompiled_tools.hxx"
|
|
|
|
|
2000-09-18 16:07:07 +00:00
|
|
|
#include <string.h>
|
|
|
|
|
2006-06-19 12:53:58 +00:00
|
|
|
#include "boost/static_assert.hpp"
|
|
|
|
|
2000-09-18 16:07:07 +00:00
|
|
|
#include <osl/interlck.h>
|
|
|
|
#include <rtl/alloc.h>
|
|
|
|
#include <rtl/memory.h>
|
|
|
|
#include <rtl/tencinfo.h>
|
2004-06-25 16:13:35 +00:00
|
|
|
#include <rtl/instance.hxx>
|
2000-09-18 16:07:07 +00:00
|
|
|
|
2007-06-27 21:20:20 +00:00
|
|
|
#include <tools/string.hxx>
|
2000-09-18 16:07:07 +00:00
|
|
|
#include <impstrg.hxx>
|
|
|
|
|
2007-06-27 21:20:20 +00:00
|
|
|
#include <tools/debug.hxx>
|
2000-09-18 16:07:07 +00:00
|
|
|
|
|
|
|
// =======================================================================
|
|
|
|
|
2006-06-19 12:53:58 +00:00
|
|
|
DBG_NAME( UniString )
|
|
|
|
DBG_NAMEEX( ByteString )
|
2000-09-18 16:07:07 +00:00
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
#define STRCODE sal_Unicode
|
2006-06-19 12:53:58 +00:00
|
|
|
#define STRCODEU sal_Unicode
|
2000-09-18 16:07:07 +00:00
|
|
|
#define STRING UniString
|
|
|
|
#define STRINGDATA UniStringData
|
|
|
|
#define DBGCHECKSTRING DbgCheckUniString
|
2006-05-04 13:53:25 +00:00
|
|
|
#define STRING_TYPE rtl_uString
|
|
|
|
#define STRING_ACQUIRE rtl_uString_acquire
|
|
|
|
#define STRING_RELEASE rtl_uString_release
|
|
|
|
#define STRING_NEW rtl_uString_new
|
2000-09-18 16:07:07 +00:00
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
#include <strimp.cxx>
|
|
|
|
#include <strucvt.cxx>
|
|
|
|
#include <strascii.cxx>
|
|
|
|
|
2004-02-26 12:21:30 +00:00
|
|
|
UniString::UniString(char c): mpData(ImplAllocData(1)) { mpData->maStr[0] = c; }
|
|
|
|
|
2000-09-18 16:07:07 +00:00
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
UniString UniString::CreateFromInt32( sal_Int32 n, sal_Int16 nRadix )
|
|
|
|
{
|
|
|
|
sal_Unicode aBuf[RTL_USTR_MAX_VALUEOFINT32];
|
2006-06-19 12:53:58 +00:00
|
|
|
BOOST_STATIC_ASSERT(RTL_USTR_MAX_VALUEOFINT32 <= STRING_MAXLEN);
|
|
|
|
return UniString(
|
|
|
|
aBuf,
|
|
|
|
static_cast< xub_StrLen >(rtl_ustr_valueOfInt32( aBuf, n, nRadix )) );
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
UniString UniString::CreateFromInt64( sal_Int64 n, sal_Int16 nRadix )
|
|
|
|
{
|
|
|
|
sal_Unicode aBuf[RTL_USTR_MAX_VALUEOFINT64];
|
2006-06-19 12:53:58 +00:00
|
|
|
BOOST_STATIC_ASSERT(RTL_USTR_MAX_VALUEOFINT64 <= STRING_MAXLEN);
|
|
|
|
return UniString(
|
|
|
|
aBuf,
|
|
|
|
static_cast< xub_StrLen >(rtl_ustr_valueOfInt64( aBuf, n, nRadix )) );
|
2000-09-18 16:07:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
2004-06-25 16:13:35 +00:00
|
|
|
namespace { struct Empty : public rtl::Static< const UniString, Empty> {}; }
|
|
|
|
const UniString& UniString::EmptyString()
|
|
|
|
{
|
|
|
|
return Empty::get();
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
2000-09-18 16:07:07 +00:00
|
|
|
sal_Int32 UniString::ToInt32() const
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( UniString, DbgCheckUniString );
|
|
|
|
|
|
|
|
return rtl_ustr_toInt32( mpData->maStr, 10 );
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
sal_Int64 UniString::ToInt64() const
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( UniString, DbgCheckUniString );
|
|
|
|
|
|
|
|
return rtl_ustr_toInt64( mpData->maStr, 10 );
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
float UniString::ToFloat() const
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( UniString, DbgCheckUniString );
|
|
|
|
|
|
|
|
return rtl_ustr_toFloat( mpData->maStr );
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
double UniString::ToDouble() const
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( UniString, DbgCheckUniString );
|
|
|
|
|
|
|
|
return rtl_ustr_toDouble( mpData->maStr );
|
|
|
|
}
|
|
|
|
|
2011-07-10 22:11:06 +01:00
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
xub_StrLen STRING::SearchChar( const STRCODE* pChars, xub_StrLen nIndex ) const
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
sal_Int32 nLen = mpData->mnLen;
|
|
|
|
const STRCODE* pStr = mpData->maStr;
|
|
|
|
pStr += nIndex;
|
|
|
|
while ( nIndex < nLen )
|
|
|
|
{
|
|
|
|
STRCODE c = *pStr;
|
|
|
|
const STRCODE* pCompStr = pChars;
|
|
|
|
while ( *pCompStr )
|
|
|
|
{
|
|
|
|
if ( *pCompStr == c )
|
|
|
|
return nIndex;
|
|
|
|
++pCompStr;
|
|
|
|
}
|
|
|
|
++pStr,
|
|
|
|
++nIndex;
|
|
|
|
}
|
|
|
|
|
|
|
|
return STRING_NOTFOUND;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
xub_StrLen STRING::SearchAndReplace( STRCODE c, STRCODE cRep, xub_StrLen nIndex )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
sal_Int32 nLen = mpData->mnLen;
|
|
|
|
const STRCODE* pStr = mpData->maStr;
|
|
|
|
pStr += nIndex;
|
|
|
|
while ( nIndex < nLen )
|
|
|
|
{
|
|
|
|
if ( *pStr == c )
|
|
|
|
{
|
|
|
|
ImplCopyData();
|
|
|
|
mpData->maStr[nIndex] = cRep;
|
|
|
|
return nIndex;
|
|
|
|
}
|
|
|
|
++pStr,
|
|
|
|
++nIndex;
|
|
|
|
}
|
|
|
|
|
|
|
|
return STRING_NOTFOUND;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING& STRING::Reverse()
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
if ( !mpData->mnLen )
|
|
|
|
return *this;
|
|
|
|
|
|
|
|
// Daten kopieren, wenn noetig
|
|
|
|
ImplCopyData();
|
|
|
|
|
|
|
|
// Reverse
|
|
|
|
sal_Int32 nCount = mpData->mnLen / 2;
|
|
|
|
for ( sal_Int32 i = 0; i < nCount; ++i )
|
|
|
|
{
|
|
|
|
STRCODE cTemp = mpData->maStr[i];
|
|
|
|
mpData->maStr[i] = mpData->maStr[mpData->mnLen-i-1];
|
|
|
|
mpData->maStr[mpData->mnLen-i-1] = cTemp;
|
|
|
|
}
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING& STRING::Insert( const STRING& rStr, xub_StrLen nPos, xub_StrLen nLen,
|
|
|
|
xub_StrLen nIndex )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_CHKOBJ( &rStr, STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Stringlaenge ermitteln
|
|
|
|
if ( nPos > rStr.mpData->mnLen )
|
|
|
|
nLen = 0;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// Laenge korrigieren, wenn noetig
|
|
|
|
sal_Int32 nMaxLen = rStr.mpData->mnLen-nPos;
|
|
|
|
if ( nLen > nMaxLen )
|
|
|
|
nLen = static_cast< xub_StrLen >(nMaxLen);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Ueberlauf abfangen
|
|
|
|
sal_Int32 nCopyLen = ImplGetCopyLen( mpData->mnLen, nLen );
|
|
|
|
|
|
|
|
// Ist der einzufuegende String ein Leerstring
|
|
|
|
if ( !nCopyLen )
|
|
|
|
return *this;
|
|
|
|
|
|
|
|
// Index groesser als Laenge
|
|
|
|
if ( nIndex > mpData->mnLen )
|
|
|
|
nIndex = static_cast< xub_StrLen >(mpData->mnLen);
|
|
|
|
|
|
|
|
// 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+nPos, nCopyLen*sizeof( STRCODE ) );
|
|
|
|
memcpy( pNewData->maStr+nIndex+nCopyLen, mpData->maStr+nIndex,
|
|
|
|
(mpData->mnLen-nIndex)*sizeof( STRCODE ) );
|
|
|
|
|
|
|
|
// Alte Daten loeschen und Neue zuweisen
|
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
|
|
|
mpData = pNewData;
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
xub_StrLen STRING::GetQuotedTokenCount( const STRING& rQuotedPairs, STRCODE cTok ) const
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_CHKOBJ( &rQuotedPairs, STRING, DBGCHECKSTRING );
|
|
|
|
DBG_ASSERT( !(rQuotedPairs.Len()%2), "String::GetQuotedTokenCount() - QuotedString%2 != 0" );
|
|
|
|
DBG_ASSERT( rQuotedPairs.Search(cTok) == STRING_NOTFOUND, "String::GetQuotedTokenCount() - cTok in QuotedString" );
|
|
|
|
|
|
|
|
// Leerer String: TokenCount per Definition 0
|
|
|
|
if ( !mpData->mnLen )
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
xub_StrLen nTokCount = 1;
|
|
|
|
sal_Int32 nLen = mpData->mnLen;
|
|
|
|
xub_StrLen nQuotedLen = rQuotedPairs.Len();
|
|
|
|
STRCODE cQuotedEndChar = 0;
|
|
|
|
const STRCODE* pQuotedStr = rQuotedPairs.mpData->maStr;
|
|
|
|
const STRCODE* pStr = mpData->maStr;
|
|
|
|
sal_Int32 nIndex = 0;
|
|
|
|
while ( nIndex < nLen )
|
|
|
|
{
|
|
|
|
STRCODE c = *pStr;
|
|
|
|
if ( cQuotedEndChar )
|
|
|
|
{
|
|
|
|
// Ende des Quotes erreicht ?
|
|
|
|
if ( c == cQuotedEndChar )
|
|
|
|
cQuotedEndChar = 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// Ist das Zeichen ein Quote-Anfang-Zeichen ?
|
|
|
|
xub_StrLen nQuoteIndex = 0;
|
|
|
|
while ( nQuoteIndex < nQuotedLen )
|
|
|
|
{
|
|
|
|
if ( pQuotedStr[nQuoteIndex] == c )
|
|
|
|
{
|
|
|
|
cQuotedEndChar = pQuotedStr[nQuoteIndex+1];
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
nQuoteIndex += 2;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Stimmt das Tokenzeichen ueberein, dann erhoehe TokCount
|
|
|
|
if ( c == cTok )
|
|
|
|
++nTokCount;
|
|
|
|
}
|
|
|
|
|
|
|
|
++pStr,
|
|
|
|
++nIndex;
|
|
|
|
}
|
|
|
|
|
|
|
|
return nTokCount;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING STRING::GetQuotedToken( xub_StrLen nToken, const STRING& rQuotedPairs,
|
|
|
|
STRCODE cTok, xub_StrLen& rIndex ) const
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_CHKOBJ( &rQuotedPairs, STRING, DBGCHECKSTRING );
|
|
|
|
DBG_ASSERT( !(rQuotedPairs.Len()%2), "String::GetQuotedToken() - QuotedString%2 != 0" );
|
|
|
|
DBG_ASSERT( rQuotedPairs.Search(cTok) == STRING_NOTFOUND, "String::GetQuotedToken() - cTok in QuotedString" );
|
|
|
|
|
|
|
|
const STRCODE* pStr = mpData->maStr;
|
|
|
|
const STRCODE* pQuotedStr = rQuotedPairs.mpData->maStr;
|
|
|
|
STRCODE cQuotedEndChar = 0;
|
|
|
|
xub_StrLen nQuotedLen = rQuotedPairs.Len();
|
|
|
|
xub_StrLen nLen = (xub_StrLen)mpData->mnLen;
|
|
|
|
xub_StrLen nTok = 0;
|
|
|
|
xub_StrLen nFirstChar = rIndex;
|
|
|
|
xub_StrLen i = nFirstChar;
|
|
|
|
|
|
|
|
// Bestimme die Token-Position und Laenge
|
|
|
|
pStr += i;
|
|
|
|
while ( i < nLen )
|
|
|
|
{
|
|
|
|
STRCODE c = *pStr;
|
|
|
|
if ( cQuotedEndChar )
|
|
|
|
{
|
|
|
|
// Ende des Quotes erreicht ?
|
|
|
|
if ( c == cQuotedEndChar )
|
|
|
|
cQuotedEndChar = 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// Ist das Zeichen ein Quote-Anfang-Zeichen ?
|
|
|
|
xub_StrLen nQuoteIndex = 0;
|
|
|
|
while ( nQuoteIndex < nQuotedLen )
|
|
|
|
{
|
|
|
|
if ( pQuotedStr[nQuoteIndex] == c )
|
|
|
|
{
|
|
|
|
cQuotedEndChar = pQuotedStr[nQuoteIndex+1];
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
nQuoteIndex += 2;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Stimmt das Tokenzeichen ueberein, dann erhoehe TokCount
|
|
|
|
if ( c == cTok )
|
|
|
|
{
|
|
|
|
++nTok;
|
|
|
|
|
|
|
|
if ( nTok == nToken )
|
|
|
|
nFirstChar = i+1;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if ( nTok > nToken )
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
++pStr,
|
|
|
|
++i;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( nTok >= nToken )
|
|
|
|
{
|
|
|
|
if ( i < nLen )
|
|
|
|
rIndex = i+1;
|
|
|
|
else
|
|
|
|
rIndex = STRING_NOTFOUND;
|
|
|
|
return Copy( nFirstChar, i-nFirstChar );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
rIndex = STRING_NOTFOUND;
|
|
|
|
return STRING();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
sal_Bool STRING::EqualsIgnoreCaseAscii( const STRING& rStr, xub_StrLen nIndex, xub_StrLen nLen ) const
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_CHKOBJ( &rStr, STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Are there enough codes for comparing?
|
|
|
|
if ( nIndex > mpData->mnLen )
|
|
|
|
return (rStr.mpData->mnLen == 0);
|
|
|
|
sal_Int32 nMaxLen = mpData->mnLen-nIndex;
|
|
|
|
if ( nMaxLen < nLen )
|
|
|
|
{
|
|
|
|
if ( rStr.mpData->mnLen != nMaxLen )
|
|
|
|
return sal_False;
|
|
|
|
nLen = static_cast< xub_StrLen >(nMaxLen);
|
|
|
|
}
|
|
|
|
|
|
|
|
// String vergleichen
|
|
|
|
return (ImplStringICompareWithoutZero( mpData->maStr+nIndex, rStr.mpData->maStr, nLen ) == 0);
|
|
|
|
}
|
|
|
|
|
2011-07-12 21:21:23 +01:00
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
StringCompare STRING::CompareIgnoreCaseToAscii( const STRING& rStr,
|
|
|
|
xub_StrLen nLen ) const
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
DBG_CHKOBJ( &rStr, STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Auf Gleichheit der Pointer testen
|
|
|
|
if ( mpData == rStr.mpData )
|
|
|
|
return COMPARE_EQUAL;
|
|
|
|
|
|
|
|
// Maximale Laenge ermitteln
|
|
|
|
if ( mpData->mnLen < nLen )
|
|
|
|
nLen = static_cast< xub_StrLen >(mpData->mnLen+1);
|
|
|
|
if ( rStr.mpData->mnLen < nLen )
|
|
|
|
nLen = static_cast< xub_StrLen >(rStr.mpData->mnLen+1);
|
|
|
|
|
|
|
|
// String vergleichen
|
|
|
|
sal_Int32 nCompare = ImplStringICompareWithoutZero( mpData->maStr, rStr.mpData->maStr, nLen );
|
|
|
|
|
|
|
|
// Rueckgabewert anpassen
|
|
|
|
if ( nCompare == 0 )
|
|
|
|
return COMPARE_EQUAL;
|
|
|
|
else if ( nCompare < 0 )
|
|
|
|
return COMPARE_LESS;
|
|
|
|
else
|
|
|
|
return COMPARE_GREATER;
|
|
|
|
}
|
|
|
|
|
2011-09-15 11:23:10 +01:00
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING& STRING::Fill( xub_StrLen nCount, STRCODE cFillChar )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
if ( !nCount )
|
|
|
|
return *this;
|
|
|
|
|
|
|
|
// Ist nCount groesser wie der jetzige String, dann verlaengern
|
|
|
|
if ( nCount > mpData->mnLen )
|
|
|
|
{
|
|
|
|
// dann neuen String mit der neuen Laenge anlegen
|
|
|
|
STRINGDATA* pNewData = ImplAllocData( nCount );
|
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
|
|
|
mpData = pNewData;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
ImplCopyData();
|
|
|
|
|
|
|
|
STRCODE* pStr = mpData->maStr;
|
|
|
|
do
|
|
|
|
{
|
|
|
|
*pStr = cFillChar;
|
|
|
|
++pStr,
|
|
|
|
--nCount;
|
|
|
|
}
|
|
|
|
while ( nCount );
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2011-09-17 14:09:38 +01:00
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRING& STRING::Expand( xub_StrLen nCount, STRCODE cExpandChar )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Muss der String erweitert werden
|
|
|
|
sal_Int32 nLen = mpData->mnLen;
|
|
|
|
if ( nCount <= nLen )
|
|
|
|
return *this;
|
|
|
|
|
|
|
|
// Neuen String anlegen
|
|
|
|
STRINGDATA* pNewData = ImplAllocData( nCount );
|
|
|
|
|
|
|
|
// Alten String kopieren
|
|
|
|
memcpy( pNewData->maStr, mpData->maStr, nLen*sizeof( STRCODE ) );
|
|
|
|
|
|
|
|
// und initialisieren
|
|
|
|
STRCODE* pStr = pNewData->maStr;
|
|
|
|
pStr += nLen;
|
|
|
|
for (sal_Int32 i = nCount - nLen; i > 0; --i) {
|
|
|
|
*pStr++ = cExpandChar;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Alte Daten loeschen und Neue zuweisen
|
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
|
|
|
mpData = pNewData;
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2011-09-18 13:34:14 +01:00
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRCODE* STRING::GetBufferAccess()
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
// Daten kopieren, wenn noetig
|
|
|
|
if ( mpData->mnLen )
|
|
|
|
ImplCopyData();
|
|
|
|
|
|
|
|
// Pointer auf den String zurueckgeben
|
|
|
|
return mpData->maStr;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
void STRING::ReleaseBufferAccess( xub_StrLen nLen )
|
|
|
|
{
|
|
|
|
// Hier ohne Funktionstest, da String nicht konsistent
|
|
|
|
DBG_CHKTHIS( STRING, NULL );
|
|
|
|
DBG_ASSERT( mpData->mnRefCount == 1, "String::ReleaseCharStr() called for String with RefCount" );
|
|
|
|
|
|
|
|
if ( nLen > mpData->mnLen )
|
|
|
|
nLen = ImplStringLen( mpData->maStr );
|
|
|
|
OSL_ASSERT(nLen <= mpData->mnLen);
|
|
|
|
if ( !nLen )
|
|
|
|
{
|
|
|
|
STRING_NEW((STRING_TYPE **)&mpData);
|
|
|
|
}
|
|
|
|
// Bei mehr als 8 Zeichen unterschied, kuerzen wir den Buffer
|
|
|
|
else if ( mpData->mnLen - nLen > 8 )
|
|
|
|
{
|
|
|
|
STRINGDATA* pNewData = ImplAllocData( nLen );
|
|
|
|
memcpy( pNewData->maStr, mpData->maStr, nLen*sizeof( STRCODE ) );
|
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
|
|
|
mpData = pNewData;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
mpData->mnLen = nLen;
|
|
|
|
}
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
STRCODE* STRING::AllocBuffer( xub_StrLen nLen )
|
|
|
|
{
|
|
|
|
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
|
|
|
|
|
|
|
|
STRING_RELEASE((STRING_TYPE *)mpData);
|
|
|
|
if ( nLen )
|
|
|
|
mpData = ImplAllocData( nLen );
|
|
|
|
else
|
|
|
|
{
|
|
|
|
mpData = NULL;
|
|
|
|
STRING_NEW((STRING_TYPE **)&mpData);
|
|
|
|
}
|
|
|
|
|
|
|
|
return mpData->maStr;
|
|
|
|
}
|
|
|
|
|
2010-10-14 08:27:31 +02:00
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|