Kaydet (Commit) 48649cdf authored tarafından Caolán McNamara's avatar Caolán McNamara

lock in those ByteString gains so there's no back-sliding

üst d37abad9
This diff is collapsed.
This diff is collapsed.
...@@ -83,21 +83,6 @@ xub_StrLen ImplStringLen( const sal_Unicode* pStr ) ...@@ -83,21 +83,6 @@ xub_StrLen ImplStringLen( const sal_Unicode* pStr )
#include <strimp.cxx> #include <strimp.cxx>
#include <strcvt.cxx> #include <strcvt.cxx>
void STRING::SearchAndReplaceAll( const STRCODE* pCharStr, const STRING& rRepStr )
{
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
DBG_CHKOBJ( &rRepStr, STRING, DBGCHECKSTRING );
xub_StrLen nCharLen = ImplStringLen( pCharStr );
xub_StrLen nSPos = Search( pCharStr, 0 );
while ( nSPos != STRING_NOTFOUND )
{
Replace( nSPos, nCharLen, rRepStr );
nSPos = nSPos + rRepStr.Len();
nSPos = Search( pCharStr, nSPos );
}
}
xub_StrLen STRING::SearchAndReplace( const STRCODE* pCharStr, const STRING& rRepStr, xub_StrLen STRING::SearchAndReplace( const STRCODE* pCharStr, const STRING& rRepStr,
xub_StrLen nIndex ) xub_StrLen nIndex )
{ {
...@@ -197,39 +182,4 @@ sal_Bool STRING::Equals( const STRCODE* pCharStr ) const ...@@ -197,39 +182,4 @@ sal_Bool STRING::Equals( const STRCODE* pCharStr ) const
return (ImplStringCompare( mpData->maStr, pCharStr ) == 0); return (ImplStringCompare( mpData->maStr, pCharStr ) == 0);
} }
STRING& STRING::Insert( const STRCODE* pCharStr, xub_StrLen nIndex )
{
DBG_CHKTHIS( STRING, DBGCHECKSTRING );
DBG_ASSERT( pCharStr, "String::Insert() - pCharStr is NULL" );
// Stringlaenge ermitteln
sal_Int32 nCopyLen = ImplStringLen( pCharStr );
// Ueberlauf abfangen
nCopyLen = ImplGetCopyLen( mpData->mnLen, nCopyLen );
// 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, pCharStr, 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;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */ /* vim:set shiftwidth=4 softtabstop=4 expandtab: */
ByteString::Append(char const*, unsigned short)
ByteString::Append(char)
ByteString::Assign(char const*, unsigned short)
ByteString::Assign(char)
ByteString::ByteString(char const*, unsigned short)
ByteString::CompareTo(ByteString const&, unsigned short) const
ByteString::Equals(ByteString const&) const
ByteString::Equals(ByteString const&, unsigned short, unsigned short) const
ByteString::Equals(char const*, unsigned short, unsigned short) const
ByteString::EqualsIgnoreCaseAscii(ByteString const&) const
ByteString::GetToken(unsigned short, char, unsigned short&) const
ByteString::Insert(char const*, unsigned short)
ByteString::Insert(char, unsigned short)
ByteString::Match(ByteString const&) const
ByteString::SearchAndReplaceAll(ByteString const&, ByteString const&)
ByteString::SearchAndReplaceAll(char const*, ByteString const&)
ByteString::SearchBackward(char, unsigned short) const
ByteString::SetToken(unsigned short, char, ByteString const&, unsigned short)
ByteString::ToUpperAscii()
CertificateExtension_XmlSecImpl::setCertExtn(com::sun::star::uno::Sequence<signed char>, com::sun::star::uno::Sequence<signed char>, unsigned char) CertificateExtension_XmlSecImpl::setCertExtn(com::sun::star::uno::Sequence<signed char>, com::sun::star::uno::Sequence<signed char>, unsigned char)
CharPosArray::Insert(CharPosArray const*, unsigned short, unsigned short, unsigned short) CharPosArray::Insert(CharPosArray const*, unsigned short, unsigned short, unsigned short)
CharPosArray::Replace(int const&, unsigned short) CharPosArray::Replace(int const&, unsigned short)
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment