summaryrefslogtreecommitdiff
path: root/tools/bootstrp/sstring.cxx
diff options
context:
space:
mode:
Diffstat (limited to 'tools/bootstrp/sstring.cxx')
-rw-r--r--tools/bootstrp/sstring.cxx317
1 files changed, 0 insertions, 317 deletions
diff --git a/tools/bootstrp/sstring.cxx b/tools/bootstrp/sstring.cxx
deleted file mode 100644
index 8c83dedf72ec..000000000000
--- a/tools/bootstrp/sstring.cxx
+++ /dev/null
@@ -1,317 +0,0 @@
-/*************************************************************************
- *
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * Copyright 2000, 2010 Oracle and/or its affiliates.
- *
- * OpenOffice.org - a multi-platform office productivity suite
- *
- * This file is part of OpenOffice.org.
- *
- * 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.
- *
- * 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).
- *
- * 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.
- *
- ************************************************************************/
-
-// MARKER(update_precomp.py): autogen include statement, do not remove
-#include "precompiled_tools.hxx"
-
-#ifndef _TOOLS_STRINGLIST
-# define _TOOLS_STRINGLIST
-#endif
-
-#define ENABLE_BYTESTRING_STREAM_OPERATORS
-#include <tools/stream.hxx>
-#include "bootstrp/sstring.hxx"
-
-SByteStringList::SByteStringList()
-{
-}
-
-SByteStringList::~SByteStringList()
-{
-}
-
-ULONG SByteStringList::IsString( ByteString* pStr )
-{
- ULONG nRet = NOT_THERE;
- if ( (nRet = GetPrevString( pStr )) != 0 )
- {
- ByteString* pString = GetObject( nRet );
- if ( *pString == *pStr )
- return nRet;
- else
- return NOT_THERE;
- }
- else
- {
- ByteString* pString = GetObject( 0 );
- if ( pString && (*pString == *pStr) )
- return 0;
- else
- return NOT_THERE;
- }
-}
-
-ULONG SByteStringList::GetPrevString( ByteString* pStr )
-{
- ULONG nRet = 0;
- BOOL bFound = FALSE;
- ULONG nCountMember = Count();
- ULONG nUpper = nCountMember;
- ULONG nLower = 0;
- ULONG nCurrent = nUpper / 2;
- ULONG nRem = 0;
- ByteString* pString;
-
- do
- {
- if ( (nCurrent == nLower) || (nCurrent == nUpper) )
- return nLower;
- pString = GetObject( nCurrent );
- StringCompare nResult = pStr->CompareTo( *pString );
- if ( nResult == COMPARE_LESS )
- {
- nUpper = nCurrent;
- nCurrent = (nCurrent + nLower) /2;
- }
- else if ( nResult == COMPARE_GREATER )
- {
- nLower = nCurrent;
- nCurrent = (nUpper + nCurrent) /2;
- }
- else if ( nResult == COMPARE_EQUAL )
- return nCurrent;
- if ( nRem == nCurrent )
- return nCurrent;
- nRem = nCurrent;
- }
- while ( !bFound );
- return nRet;
-}
-
-/**************************************************************************
-*
-* Sortiert einen ByteString in die Liste ein und gibt die Position,
-* an der einsortiert wurde, zurueck
-*
-**************************************************************************/
-
-ULONG SByteStringList::PutString( ByteString* pStr )
-{
- ULONG nPos = GetPrevString ( pStr );
- if ( Count() )
- {
- {
- ByteString* pString = GetObject( 0 );
- if ( pString->CompareTo( *pStr ) == COMPARE_GREATER )
- {
- Insert( pStr, (ULONG)0 );
- return (ULONG)0;
- }
- }
- ByteString* pString = GetObject( nPos );
- if ( *pStr != *pString )
- {
- Insert( pStr, nPos+1 );
- return ( nPos +1 );
- }
- }
- else
- {
- Insert( pStr );
- return (ULONG)0;
- }
-
- return NOT_THERE;
-}
-
-ByteString* SByteStringList::RemoveString( const ByteString& rName )
-{
- ULONG i;
- ByteString* pReturn;
-
- for( i = 0 ; i < Count(); i++ )
- {
- if ( rName == *GetObject( i ) )
- {
- pReturn = GetObject(i);
- Remove(i);
- return pReturn;
- }
- }
-
- return NULL;
-}
-
-void SByteStringList::CleanUp()
-{
- ByteString* pByteString = First();
- while (pByteString) {
- delete pByteString;
- pByteString = Next();
- }
- Clear();
-}
-
-SByteStringList& SByteStringList::operator<< ( SvStream& rStream )
-{
- sal_uInt32 nListCount;
- rStream >> nListCount;
- for ( USHORT i = 0; i < nListCount; i++ ) {
- ByteString* pByteString = new ByteString();
- rStream >> *pByteString;
- Insert (pByteString, LIST_APPEND);
- }
- return *this;
-}
-
-SByteStringList& SByteStringList::operator>> ( SvStream& rStream )
-{
- sal_uInt32 nListCount = Count();
- rStream << nListCount;
- ByteString* pByteString = First();
- while (pByteString) {
- rStream << *pByteString;
- pByteString = Next();
- }
- return *this;
-}
-
-
-
-
-
-
-
-SUniStringList::SUniStringList()
-{
-}
-
-SUniStringList::~SUniStringList()
-{
-}
-
-ULONG SUniStringList::IsString( UniString* pStr )
-{
- ULONG nRet = NOT_THERE;
- if ( (nRet = GetPrevString( pStr )) != 0 )
- {
- UniString* pString = GetObject( nRet );
- if ( *pString == *pStr )
- return nRet;
- else
- return NOT_THERE;
- }
- else
- {
- UniString* pString = GetObject( 0 );
- if ( pString && (*pString == *pStr) )
- return 0;
- else
- return NOT_THERE;
- }
-}
-
-ULONG SUniStringList::GetPrevString( UniString* pStr )
-{
- ULONG nRet = 0;
- BOOL bFound = FALSE;
- ULONG nCountMember = Count();
- ULONG nUpper = nCountMember;
- ULONG nLower = 0;
- ULONG nCurrent = nUpper / 2;
- ULONG nRem = 0;
- UniString* pString;
-
- do
- {
- if ( (nCurrent == nLower) || (nCurrent == nUpper) )
- return nLower;
- pString = GetObject( nCurrent );
- StringCompare nResult = pStr->CompareTo( *pString );
- if ( nResult == COMPARE_LESS )
- {
- nUpper = nCurrent;
- nCurrent = (nCurrent + nLower) /2;
- }
- else if ( nResult == COMPARE_GREATER )
- {
- nLower = nCurrent;
- nCurrent = (nUpper + nCurrent) /2;
- }
- else if ( nResult == COMPARE_EQUAL )
- return nCurrent;
- if ( nRem == nCurrent )
- return nCurrent;
- nRem = nCurrent;
- }
- while ( !bFound );
- return nRet;
-}
-
-/**************************************************************************
-*
-* Sortiert einen UniString in die Liste ein und gibt die Position,
-* an der einsortiert wurde, zurueck
-*
-**************************************************************************/
-
-ULONG SUniStringList::PutString( UniString* pStr )
-{
- ULONG nPos = GetPrevString ( pStr );
- if ( Count() )
- {
- {
- UniString* pString = GetObject( 0 );
- if ( pString->CompareTo( *pStr ) == COMPARE_GREATER )
- {
- Insert( pStr, (ULONG)0);
- return (ULONG)0;
- }
- }
- UniString* pString = GetObject( nPos );
- if ( *pStr != *pString )
- {
- Insert( pStr, nPos+1 );
- return ( nPos +1 );
- }
- }
- else
- {
- Insert( pStr );
- return (ULONG)0;
- }
-
- return NOT_THERE;
-}
-
-UniString* SUniStringList::RemoveString( const UniString& rName )
-{
- ULONG i;
- UniString* pReturn;
-
- for( i = 0 ; i < Count(); i++ )
- {
- if ( rName == *GetObject( i ) )
- {
- pReturn = GetObject(i);
- Remove(i);
- return pReturn;
- }
- }
-
- return NULL;
-}
generated by cgit v1.2.3 (git 2.39.1) at 2024-04-25 08:32:09 +0000