Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features.

BUG:215923


git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdepim@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da

1 files changed, 97 insertions, 0 deletions

diff --git a/libkcal/listbase.h b/libkcal/listbase.h
new file mode 100644
index 000000000..71a228168
--- /dev/null
+++ b/libkcal/listbase.h
@@ -0,0 +1,97 @@
+/*
+    This file is part of libkcal.
+
+    Copyright (c) 2003 Cornelius Schumacher <schumacher@kde.org>
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Library General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library 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
+    Library General Public License for more details.
+
+    You should have received a copy of the GNU Library General Public License
+    along with this library; see the file COPYING.LIB.  If not, write to
+    the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
+    Boston, MA 02110-1301, USA.
+*/
+#ifndef KCAL_LISTBASE_H
+#define KCAL_LISTBASE_H
+
+#include <qvaluelist.h>
+
+namespace KCal {
+
+/**
+  This class provides a template for lists of pointers.
+  It extends QValueList<T *> by auto delete funtionality known from QPtrList.
+*/
+template<class T>
+class ListBase : public QValueList<T *>
+{
+  public:
+    ListBase()
+      : QValueList<T *>(), mAutoDelete( false )
+    {
+    }
+
+    ListBase( const ListBase &l )
+      : QValueList<T *>( l ), mAutoDelete( false )
+    {
+    }
+
+    ~ListBase()
+    {
+      if ( mAutoDelete ) {
+        QValueListIterator<T *> it;
+        for( it = QValueList<T*>::begin(); it != QValueList<T*>::end(); ++it ) {
+          delete *it;
+        }
+      }
+    }
+
+    ListBase &operator=( const ListBase &l )
+    {
+      if ( this == &l ) return *this;
+      QValueList<T *>::operator=( l );
+      return *this;
+    }
+
+    void setAutoDelete( bool autoDelete )
+    {
+      mAutoDelete = autoDelete;
+    }
+
+    bool removeRef( T *t )
+    {
+      QValueListIterator<T *> it = find( t );
+      if ( it == QValueList<T*>::end() ) {
+        return false;
+      } else {
+        if ( mAutoDelete ) delete t;
+        this->remove( it );
+        return true;
+      }
+    }
+
+    void clearAll()
+    {
+      if ( mAutoDelete ) {
+        for ( QValueListIterator<T*> it = QValueList<T*>::begin();
+              it != QValueList<T*>::end(); ++it ) {
+          delete *it;
+        }
+      }
+      QValueList<T*>::clear();
+    }
+
+  private:
+    bool mAutoDelete;
+};
+
+}
+
+#endif