diff options
Diffstat (limited to 'tools/inc/tools/list.hxx')
| -rw-r--r-- | tools/inc/tools/list.hxx | 143 |
1 files changed, 143 insertions, 0 deletions
diff --git a/tools/inc/tools/list.hxx b/tools/inc/tools/list.hxx new file mode 100644 index 000000000000..dd8fbf454f80 --- /dev/null +++ b/tools/inc/tools/list.hxx @@ -0,0 +1,143 @@ +/************************************************************************* + * + * 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. + * + ************************************************************************/ + +#ifndef _LIST_HXX +#define _LIST_HXX + +#include <tools/solar.h> +#include <tools/contnr.hxx> + +// -------- +// - List - +// -------- + +#define LIST_APPEND CONTAINER_APPEND +#define LIST_ENTRY_NOTFOUND CONTAINER_ENTRY_NOTFOUND + +class List : private Container +{ +public: + using Container::Insert; + using Container::Remove; + using Container::Replace; + using Container::Clear; + using Container::Count; + using Container::GetCurObject; + using Container::GetCurPos; + using Container::GetObject; + using Container::GetPos; + using Container::Seek; + using Container::First; + using Container::Last; + using Container::Next; + using Container::Prev; + + List( USHORT _nInitSize = 16, USHORT _nReSize = 16 ) : + Container( 1024, _nInitSize, _nReSize ) {} + List( USHORT _nBlockSize, USHORT _nInitSize, USHORT _nReSize ) : + Container( _nBlockSize, _nInitSize, _nReSize ) {} + List( const List& rList ) : Container( rList ) {} + + List& operator =( const List& rList ) + { Container::operator =( rList ); return *this; } + + BOOL operator ==( const List& rList ) const + { return Container::operator ==( rList ); } + BOOL operator !=( const List& rList ) const + { return Container::operator !=( rList ); } +}; + +// ---------------- +// - DECLARE_LIST - +// ---------------- + +#define DECLARE_LIST( ClassName, Type ) \ +class ClassName : private List \ +{ \ +public: \ + using List::Clear; \ + using List::Count; \ + using List::GetCurPos; \ + \ + ClassName( USHORT _nInitSize = 16, \ + USHORT _nReSize = 16 ) : \ + List( _nInitSize, _nReSize ) {} \ + ClassName( USHORT _nBlockSize, USHORT _nInitSize, \ + USHORT _nReSize ) : \ + List( _nBlockSize, _nInitSize, _nReSize ) {} \ + ClassName( const ClassName& rClassName ) : \ + List( rClassName ) {} \ + \ + void Insert( Type p, ULONG nIndex ) \ + { List::Insert( (void*)p, nIndex ); } \ + void Insert( Type p ) \ + { List::Insert( (void*)p ); } \ + void Insert( Type pNew, Type pOld ) \ + { List::Insert( (void*)pNew, (void*)pOld ); } \ + Type Remove() \ + { return (Type)List::Remove(); } \ + Type Remove( ULONG nIndex ) \ + { return (Type)List::Remove( nIndex ); } \ + Type Remove( Type p ) \ + { return (Type)List::Remove( (void*)p ); } \ + Type Replace( Type p ) \ + { return (Type)List::Replace( (void*)p ); } \ + Type Replace( Type p, ULONG nIndex ) \ + { return (Type)List::Replace( (void*)p, nIndex ); } \ + Type Replace( Type pNew, Type pOld ) \ + { return (Type)List::Replace( (void*)pNew, \ + (void*)pOld ); } \ + \ + Type GetCurObject() const \ + { return (Type)List::GetCurObject(); } \ + Type GetObject( ULONG nIndex ) const \ + { return (Type)List::GetObject( nIndex ); } \ + ULONG GetPos( const Type p ) const \ + { return List::GetPos( (const void*)p ); } \ + ULONG GetPos( const Type p, ULONG nStartIndex, \ + BOOL bForward = TRUE ) const \ + { return List::GetPos( (const void*)p, nStartIndex, \ + bForward ); } \ + \ + Type Seek( ULONG nIndex ) \ + { return (Type)List::Seek( nIndex ); } \ + Type Seek( void* p ) { return (Type)List::Seek( p ); } \ + Type First() { return (Type)List::First(); } \ + Type Last() { return (Type)List::Last(); } \ + Type Next() { return (Type)List::Next(); } \ + Type Prev() { return (Type)List::Prev(); } \ + \ + ClassName& operator =( const ClassName& rClassName ) \ + { List::operator =( rClassName ); return *this; } \ + \ + BOOL operator ==( const ClassName& rList ) const \ + { return List::operator ==( rList ); } \ + BOOL operator !=( const ClassName& rList ) const \ + { return List::operator !=( rList ); } \ +}; + +#endif // _LIST_HXX |