diff options
author | Oliver Bolte <obo@openoffice.org> | 2008-10-10 13:02:43 +0000 |
---|---|---|
committer | Oliver Bolte <obo@openoffice.org> | 2008-10-10 13:02:43 +0000 |
commit | 48c3e6a2d615b4bb529a964688ec810fa4c3cf78 (patch) | |
tree | 4bff0dc80beeb03605eb49722f12d5d60ab17ec6 /hwpfilter | |
parent | 7bad4bce519e4bfc38be75cb0de761871fd57486 (diff) |
CWS-TOOLING: integrate CWS cmcfixes49
Diffstat (limited to 'hwpfilter')
-rw-r--r-- | hwpfilter/source/list.hxx | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/hwpfilter/source/list.hxx b/hwpfilter/source/list.hxx index 88353a9948d8..4921a3bb95ee 100644 --- a/hwpfilter/source/list.hxx +++ b/hwpfilter/source/list.hxx @@ -7,7 +7,7 @@ * OpenOffice.org - a multi-platform office productivity suite * * $RCSfile: list.hxx,v $ - * $Revision: 1.6 $ + * $Revision: 1.6.10.1 $ * * This file is part of OpenOffice.org. * @@ -60,17 +60,17 @@ public: T* first(); /// return first element in list T* last(); /// return last element in list - const int count() const; /// return number of elements in list - const int empty() const; /// determine whether list contains any elements + int count() const; /// return number of elements in list + int empty() const; /// determine whether list contains any elements /// insert pItem into list at position n; at end if n == -1; return count() - const int insert( T* pItem, int n = -1 ); + int insert( T* pItem, int n = -1 ); /// remove nth element from list T* remove( const int n ); /// remove given element from list - const int remove( T* pItem ); + int remove( T* pItem ); }; /** iterator class for LinkedList<T>. Iterator may travel outside of @@ -149,19 +149,19 @@ T* LinkedList<T>::last() } template<class T> -const int LinkedList<T>::count() const +int LinkedList<T>::count() const { return static_cast<int>( maList.size() ); } template<class T> -const int LinkedList<T>::empty() const +int LinkedList<T>::empty() const { return count() == 0; } template<class T> -const int LinkedList<T>::insert( T* pItem, int n ) +int LinkedList<T>::insert( T* pItem, int n ) { ASSERT( pItem != NULL ); ASSERT( n >= -1 && n <= static_cast<int>( maList.size() )); @@ -191,7 +191,7 @@ T* LinkedList<T>::remove( const int n ) } template<class T> -const int LinkedList<T>::remove( T* pItem ) +int LinkedList<T>::remove( T* pItem ) { ASSERT( pItem != NULL ); |