dbList.h

/***************************************************************************
 *   Copyright (C) 2006 by Graeme Foster                                   *
 *   email    foster.graeme@gmail.com                                      *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program 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 General Public License for more details.                          *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/

#ifndef __DB_LIST_H
#define __DB_LIST_H

#include <QList>

#include "../DataClasses/DataClass.h"
#include "sql.h"


class dbList
{
        private: // properties
                QList<DataClass * > * pdcList; 
        private: // methods
                QList<DataClass * > * allChildrenDeep(DataClass * parent);
        public: // methods
                
                dbList();
                dbList(QList<DataClass * > * p_dcList);
                
                // Access methods
                QList<DataClass * > * list();
                QList<DataClass * > * allChildren(DataClass * parent, bool deep = false);
                
                // Modification methods
                inline void insert(int posn, DataClass * data){pdcList->insert(posn,data);}
                inline void append(DataClass * data){pdcList->append(data);}
                DataClass * remove(int posn);
                template <typename LessThan>
                void resort (LessThan lessThan){qSort(pdcList->begin(), pdcList->end(),lessThan);};
                // Info Methods
                
                inline int size()    {return pdcList->size();}
                DataClass * at(int posn);
                
                void dump();
};

#endif

---