2010-10-14 01:27:31 -05:00
|
|
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
2005-04-13 05:19:06 -05:00
|
|
|
/*************************************************************************
|
|
|
|
*
|
2008-04-10 15:23:23 -05:00
|
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
2005-04-13 05:19:06 -05:00
|
|
|
*
|
2010-02-12 08:01:35 -06:00
|
|
|
* Copyright 2000, 2010 Oracle and/or its affiliates.
|
2005-04-13 05:19:06 -05:00
|
|
|
*
|
2008-04-10 15:23:23 -05:00
|
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
2005-04-13 05:19:06 -05:00
|
|
|
*
|
2008-04-10 15:23:23 -05:00
|
|
|
* This file is part of OpenOffice.org.
|
2005-04-13 05:19:06 -05:00
|
|
|
*
|
2008-04-10 15:23:23 -05: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.
|
2005-04-13 05:19:06 -05:00
|
|
|
*
|
2008-04-10 15:23:23 -05: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).
|
2005-04-13 05:19:06 -05:00
|
|
|
*
|
2008-04-10 15:23:23 -05: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.
|
2005-04-13 05:19:06 -05:00
|
|
|
*
|
|
|
|
************************************************************************/
|
|
|
|
|
2006-09-17 09:08:08 -05:00
|
|
|
// MARKER(update_precomp.py): autogen include statement, do not remove
|
2009-10-08 09:48:26 -05:00
|
|
|
#include "precompiled_svl.hxx"
|
2006-09-17 09:08:08 -05:00
|
|
|
|
2009-10-08 09:59:48 -05:00
|
|
|
#include <svl/slstitm.hxx>
|
|
|
|
#include <svl/poolitem.hxx>
|
2005-04-13 05:19:06 -05:00
|
|
|
#include <com/sun/star/uno/Any.hxx>
|
|
|
|
#include <com/sun/star/uno/Sequence.hxx>
|
|
|
|
#include <tools/stream.hxx>
|
|
|
|
|
|
|
|
// STATIC DATA -----------------------------------------------------------
|
|
|
|
|
2006-06-19 15:17:58 -05:00
|
|
|
DBG_NAME(SfxStringListItem)
|
2005-04-13 05:19:06 -05:00
|
|
|
|
|
|
|
// -----------------------------------------------------------------------
|
|
|
|
|
|
|
|
TYPEINIT1_AUTOFACTORY(SfxStringListItem, SfxPoolItem);
|
|
|
|
|
|
|
|
class SfxImpStringList
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
USHORT nRefCount;
|
|
|
|
List aList;
|
|
|
|
|
|
|
|
SfxImpStringList() { nRefCount = 1; }
|
|
|
|
~SfxImpStringList();
|
|
|
|
void Sort( BOOL bAscending, List* );
|
|
|
|
};
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
SfxImpStringList::~SfxImpStringList()
|
|
|
|
{
|
2008-11-10 09:06:12 -06:00
|
|
|
DBG_ASSERT(nRefCount!=0xffff,"ImpList already deleted");
|
2005-04-13 05:19:06 -05:00
|
|
|
String* pStr = (String*)aList.First();
|
|
|
|
while( pStr )
|
|
|
|
{
|
|
|
|
delete pStr;
|
|
|
|
pStr = (String*)aList.Next();
|
|
|
|
}
|
|
|
|
nRefCount = 0xffff;
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
void SfxImpStringList::Sort( BOOL bAscending, List* pParallelList )
|
|
|
|
{
|
|
|
|
DBG_ASSERT(!pParallelList || pParallelList->Count() >= aList.Count(),"Sort:ParallelList too small");
|
|
|
|
ULONG nCount = aList.Count();
|
|
|
|
if( nCount > 1 )
|
|
|
|
{
|
|
|
|
nCount -= 2;
|
|
|
|
// Bubble Dir Einen
|
|
|
|
BOOL bSwapped = TRUE;
|
|
|
|
while( bSwapped )
|
|
|
|
{
|
|
|
|
bSwapped = FALSE;
|
|
|
|
for( ULONG nCur = 0; nCur <= nCount; nCur++ )
|
|
|
|
{
|
|
|
|
String* pStr1 = (String*)aList.GetObject( nCur );
|
|
|
|
String* pStr2 = (String*)aList.GetObject( nCur+1 );
|
|
|
|
// COMPARE_GREATER => pStr2 ist groesser als pStr1
|
|
|
|
StringCompare eCompare = pStr1->CompareIgnoreCaseToAscii( *pStr2 ); //@@@
|
|
|
|
BOOL bSwap = FALSE;
|
|
|
|
if( bAscending )
|
|
|
|
{
|
|
|
|
if( eCompare == COMPARE_LESS )
|
|
|
|
bSwap = TRUE;
|
|
|
|
}
|
|
|
|
else if( eCompare == COMPARE_GREATER )
|
|
|
|
bSwap = TRUE;
|
|
|
|
|
|
|
|
if( bSwap )
|
|
|
|
{
|
|
|
|
bSwapped = TRUE;
|
|
|
|
aList.Replace( pStr1, nCur + 1 );
|
|
|
|
aList.Replace( pStr2, nCur );
|
|
|
|
if( pParallelList )
|
|
|
|
{
|
|
|
|
void* p1 = pParallelList->GetObject( nCur );
|
|
|
|
void* p2 = pParallelList->GetObject( nCur + 1 );
|
|
|
|
pParallelList->Replace( p1, nCur + 1 );
|
|
|
|
pParallelList->Replace( p2, nCur );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// class SfxStringListItem -----------------------------------------------
|
|
|
|
|
|
|
|
SfxStringListItem::SfxStringListItem() :
|
|
|
|
pImp(NULL)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
2006-06-19 15:17:58 -05:00
|
|
|
SfxStringListItem::SfxStringListItem( USHORT which, const List* pList ) :
|
|
|
|
SfxPoolItem( which ),
|
2005-04-13 05:19:06 -05:00
|
|
|
pImp(NULL)
|
|
|
|
{
|
|
|
|
// PB: das Putten einer leeren Liste funktionierte nicht,
|
|
|
|
// deshalb habe ich hier die Abfrage nach dem Count auskommentiert
|
|
|
|
if( pList /*!!! && pList->Count() */ )
|
|
|
|
{
|
|
|
|
pImp = new SfxImpStringList;
|
|
|
|
|
|
|
|
long i, nCount = pList->Count();
|
|
|
|
String *pStr1, *pStr2;
|
|
|
|
for( i=0; i < nCount; i++ )
|
|
|
|
{
|
|
|
|
pStr1 = (String*)pList->GetObject(i);
|
|
|
|
pStr2 = new String( *pStr1 );
|
|
|
|
pImp->aList.Insert( pStr2, LIST_APPEND );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
2006-06-19 15:17:58 -05:00
|
|
|
SfxStringListItem::SfxStringListItem( USHORT which, SvStream& rStream ) :
|
|
|
|
SfxPoolItem( which ),
|
2005-04-13 05:19:06 -05:00
|
|
|
pImp(NULL)
|
|
|
|
{
|
|
|
|
long nEntryCount;
|
|
|
|
rStream >> nEntryCount;
|
|
|
|
|
|
|
|
if( nEntryCount )
|
|
|
|
pImp = new SfxImpStringList;
|
|
|
|
|
|
|
|
long i;
|
|
|
|
String* pStr;
|
|
|
|
for( i=0; i < nEntryCount; i++ )
|
|
|
|
{
|
|
|
|
pStr = new String;
|
|
|
|
readByteString(rStream, *pStr);
|
|
|
|
pImp->aList.Insert( pStr, LIST_APPEND );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
SfxStringListItem::SfxStringListItem( const SfxStringListItem& rItem ) :
|
|
|
|
SfxPoolItem( rItem ),
|
|
|
|
pImp(NULL)
|
|
|
|
{
|
|
|
|
pImp = rItem.pImp;
|
|
|
|
|
|
|
|
if( pImp )
|
|
|
|
{
|
2008-11-10 09:06:12 -06:00
|
|
|
DBG_ASSERT(pImp->nRefCount!=0xffff,"ImpList not valid");
|
2005-04-13 05:19:06 -05:00
|
|
|
pImp->nRefCount++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
SfxStringListItem::~SfxStringListItem()
|
|
|
|
{
|
|
|
|
if( pImp )
|
|
|
|
{
|
2008-11-10 09:06:12 -06:00
|
|
|
DBG_ASSERT(pImp->nRefCount!=0xffff,"ImpList not valid");
|
2005-04-13 05:19:06 -05:00
|
|
|
if( pImp->nRefCount > 1 )
|
|
|
|
pImp->nRefCount--;
|
|
|
|
else
|
|
|
|
delete pImp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
List* SfxStringListItem::GetList()
|
|
|
|
{
|
|
|
|
if( !pImp )
|
|
|
|
pImp = new SfxImpStringList;
|
2008-11-10 09:06:12 -06:00
|
|
|
DBG_ASSERT(pImp->nRefCount!=0xffff,"ImpList not valid");
|
2005-04-13 05:19:06 -05:00
|
|
|
return &(pImp->aList);
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
int SfxStringListItem::operator==( const SfxPoolItem& rItem ) const
|
|
|
|
{
|
|
|
|
DBG_ASSERT( SfxPoolItem::operator==( rItem ), "unequal type" );
|
|
|
|
|
|
|
|
SfxStringListItem* pItem = (SfxStringListItem*)&rItem;
|
|
|
|
|
|
|
|
if( pImp == pItem->pImp )
|
|
|
|
return TRUE;
|
|
|
|
else
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
SfxItemPresentation SfxStringListItem::GetPresentation
|
|
|
|
(
|
2006-06-19 15:17:58 -05:00
|
|
|
SfxItemPresentation /*ePresentation*/,
|
|
|
|
SfxMapUnit /*eCoreMetric*/,
|
|
|
|
SfxMapUnit /*ePresentationMetric*/,
|
2005-04-13 05:19:06 -05:00
|
|
|
XubString& rText,
|
|
|
|
const IntlWrapper *
|
|
|
|
) const
|
|
|
|
{
|
|
|
|
rText.AssignAscii(RTL_CONSTASCII_STRINGPARAM("(List)"));
|
|
|
|
return SFX_ITEM_PRESENTATION_NONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
SfxPoolItem* SfxStringListItem::Clone( SfxItemPool *) const
|
|
|
|
{
|
|
|
|
return new SfxStringListItem( *this );
|
|
|
|
/*
|
|
|
|
if( pImp )
|
|
|
|
return new SfxStringListItem( Which(), &(pImp->aList) );
|
|
|
|
else
|
|
|
|
return new SfxStringListItem( Which(), NULL );
|
|
|
|
*/
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
2006-06-19 15:17:58 -05:00
|
|
|
SfxPoolItem* SfxStringListItem::Create( SvStream & rStream, USHORT ) const
|
2005-04-13 05:19:06 -05:00
|
|
|
{
|
|
|
|
return new SfxStringListItem( Which(), rStream );
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
2006-06-19 15:17:58 -05:00
|
|
|
SvStream& SfxStringListItem::Store( SvStream & rStream, USHORT ) const
|
2005-04-13 05:19:06 -05:00
|
|
|
{
|
|
|
|
if( !pImp )
|
|
|
|
{
|
|
|
|
rStream << 0L;
|
|
|
|
return rStream;
|
|
|
|
}
|
|
|
|
|
2008-11-10 09:06:12 -06:00
|
|
|
DBG_ASSERT(pImp->nRefCount!=0xffff,"ImpList not valid");
|
2005-04-13 05:19:06 -05:00
|
|
|
|
|
|
|
long nCount = pImp->aList.Count();
|
|
|
|
rStream << nCount;
|
|
|
|
|
|
|
|
long i;
|
|
|
|
String* pStr;
|
|
|
|
for( i=0; i < nCount; i++ )
|
|
|
|
{
|
|
|
|
pStr = (String*)(pImp->aList.GetObject( i ));
|
|
|
|
writeByteString(rStream, *pStr);
|
|
|
|
}
|
|
|
|
|
|
|
|
return rStream;
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
void SfxStringListItem::SetString( const XubString& rStr )
|
|
|
|
{
|
2008-11-10 09:06:12 -06:00
|
|
|
DBG_ASSERT(GetRefCount()==0,"SetString:RefCount!=0");
|
2005-04-13 05:19:06 -05:00
|
|
|
|
|
|
|
if ( pImp && (pImp->nRefCount == 1) )
|
|
|
|
delete pImp;
|
|
|
|
else
|
|
|
|
if( pImp )
|
|
|
|
pImp->nRefCount--;
|
|
|
|
pImp = new SfxImpStringList;
|
|
|
|
|
|
|
|
xub_StrLen nStart = 0;
|
|
|
|
xub_StrLen nDelimPos;
|
|
|
|
XubString aStr(rStr);
|
|
|
|
aStr.ConvertLineEnd(LINEEND_CR);
|
|
|
|
do
|
|
|
|
{
|
|
|
|
nDelimPos = aStr.Search( _CR, nStart );
|
|
|
|
xub_StrLen nLen;
|
|
|
|
if ( nDelimPos == STRING_NOTFOUND )
|
|
|
|
nLen = 0xffff;
|
|
|
|
else
|
|
|
|
nLen = nDelimPos - nStart;
|
|
|
|
|
|
|
|
XubString* pStr = new XubString(aStr.Copy(nStart, nLen));
|
|
|
|
// String gehoert der Liste
|
|
|
|
pImp->aList.Insert( pStr, LIST_APPEND );
|
|
|
|
|
|
|
|
nStart += nLen + 1 ; // delimiter ueberspringen
|
|
|
|
} while( nDelimPos != STRING_NOTFOUND );
|
|
|
|
|
|
|
|
// Kein Leerstring am Ende
|
|
|
|
if( pImp->aList.Last() &&
|
|
|
|
!((XubString*)pImp->aList.Last())->Len() )
|
2006-06-19 15:17:58 -05:00
|
|
|
delete (XubString*)pImp->aList.Remove( pImp->aList.Count()-1 );
|
2005-04-13 05:19:06 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
XubString SfxStringListItem::GetString()
|
|
|
|
{
|
|
|
|
XubString aStr;
|
|
|
|
if ( pImp )
|
|
|
|
{
|
2008-11-10 09:06:12 -06:00
|
|
|
DBG_ASSERT(pImp->nRefCount!=0xffff,"ImpList not valid");
|
2005-04-13 05:19:06 -05:00
|
|
|
XubString* pStr = (XubString*)(pImp->aList.First());
|
|
|
|
while( pStr )
|
|
|
|
{
|
|
|
|
aStr += *pStr;
|
|
|
|
pStr = (XubString*)(pImp->aList.Next());
|
|
|
|
if ( pStr )
|
|
|
|
aStr += '\r';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
aStr.ConvertLineEnd();
|
|
|
|
return aStr;
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
#ifndef TF_POOLABLE
|
|
|
|
|
|
|
|
int SfxStringListItem::IsPoolable() const
|
|
|
|
{
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
void SfxStringListItem::Sort( BOOL bAscending, List* pParallelList )
|
|
|
|
{
|
2008-11-10 09:06:12 -06:00
|
|
|
DBG_ASSERT(GetRefCount()==0,"Sort:RefCount!=0");
|
2005-04-13 05:19:06 -05:00
|
|
|
if( pImp )
|
|
|
|
pImp->Sort( bAscending, pParallelList );
|
|
|
|
}
|
|
|
|
|
|
|
|
//----------------------------------------------------------------------------
|
|
|
|
void SfxStringListItem::SetStringList( const com::sun::star::uno::Sequence< rtl::OUString >& rList )
|
|
|
|
{
|
2008-11-10 09:06:12 -06:00
|
|
|
DBG_ASSERT(GetRefCount()==0,"SetString:RefCount!=0");
|
2005-04-13 05:19:06 -05:00
|
|
|
|
|
|
|
if ( pImp && (pImp->nRefCount == 1) )
|
|
|
|
delete pImp;
|
|
|
|
else
|
|
|
|
if( pImp )
|
|
|
|
pImp->nRefCount--;
|
|
|
|
pImp = new SfxImpStringList;
|
|
|
|
|
|
|
|
for ( sal_Int32 n = 0; n < rList.getLength(); n++ )
|
|
|
|
{
|
|
|
|
XubString* pStr = new XubString( rList[n] );
|
|
|
|
// String gehoert der Liste
|
|
|
|
pImp->aList.Insert( pStr, LIST_APPEND );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//----------------------------------------------------------------------------
|
|
|
|
void SfxStringListItem::GetStringList( com::sun::star::uno::Sequence< rtl::OUString >& rList ) const
|
|
|
|
{
|
|
|
|
long nCount = pImp->aList.Count();
|
|
|
|
|
|
|
|
rList.realloc( nCount );
|
|
|
|
for( long i=0; i < nCount; i++ )
|
|
|
|
rList[i] = *(String*)(pImp->aList.GetObject( i ));
|
|
|
|
}
|
|
|
|
|
|
|
|
//----------------------------------------------------------------------------
|
|
|
|
// virtual
|
2010-10-04 09:23:50 -05:00
|
|
|
bool SfxStringListItem::PutValue( const com::sun::star::uno::Any& rVal,BYTE )
|
2005-04-13 05:19:06 -05:00
|
|
|
{
|
|
|
|
com::sun::star::uno::Sequence< rtl::OUString > aValue;
|
|
|
|
if ( rVal >>= aValue )
|
|
|
|
{
|
|
|
|
SetStringList( aValue );
|
2010-10-04 09:23:50 -05:00
|
|
|
return true;
|
2005-04-13 05:19:06 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
DBG_ERROR( "SfxStringListItem::PutValue - Wrong type!" );
|
2010-10-04 09:23:50 -05:00
|
|
|
return false;
|
2005-04-13 05:19:06 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
//----------------------------------------------------------------------------
|
|
|
|
// virtual
|
2010-10-04 09:23:50 -05:00
|
|
|
bool SfxStringListItem::QueryValue( com::sun::star::uno::Any& rVal,BYTE ) const
|
2005-04-13 05:19:06 -05:00
|
|
|
{
|
|
|
|
// GetString() is not const!!!
|
|
|
|
SfxStringListItem* pThis = const_cast< SfxStringListItem * >( this );
|
|
|
|
|
|
|
|
com::sun::star::uno::Sequence< rtl::OUString > aStringList;
|
|
|
|
pThis->GetStringList( aStringList );
|
|
|
|
rVal = ::com::sun::star::uno::makeAny( aStringList );
|
2010-10-04 09:23:50 -05:00
|
|
|
return true;
|
2005-04-13 05:19:06 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-10-14 01:27:31 -05:00
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|