dbList.cpp

/***************************************************************************
 *   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.             *
 ***************************************************************************/

#include "dbList.h"

dbList::dbList()
{
        pdcList = new QList<DataClass * >();
}

dbList::dbList(QList<DataClass * > * p_dcList)
{
        pdcList = p_dcList;
}

// Access methods
QList<DataClass * > * dbList::list()
{
        return pdcList;
}

QList<DataClass * > * dbList::allChildren(DataClass * parent, bool deep)
{
        if (deep)
                return allChildrenDeep(parent);
                
        QList<DataClass * > * pChildren = new QList<DataClass * >();
        for (int i = 0; i<size(); i++)
                if (pdcList->at(i)->getParent() == parent)
                        pChildren->append(pdcList->at(i));
        return pChildren;
}

QList<DataClass * > * dbList::allChildrenDeep(DataClass * parent)
{
        QList<DataClass * > * pChildren = new QList<DataClass * >();
        DataClass * obj, * objParent;
        for (int i = 0; i<size(); i++)
        {
                obj = pdcList->at(i);
                objParent = obj->getParent();
                while (objParent != 0)
                {
                        if (objParent == parent)
                        {
                                pChildren->append(obj);
                                break;
                        }
                        objParent = objParent->getParent();
                }
        }
        return pChildren;
}

// Modification methods
DataClass * dbList::remove(int posn)
{
        if (posn < 0 || posn >= pdcList->size())
                return 0;
        else
        {
                DataClass * dc = pdcList->at(posn);
                pdcList->removeAt(posn);
                return  dc;
        }
}

// Info Methods
DataClass * dbList::at(int posn)
{
        if (posn < 0 || posn >= pdcList->size())
                return 0;
        else
        {
                return  pdcList->at(posn);
        }
}

void dbList::dump()
{
        std::cout << "      DataClass: ";
        if (pdcList->size() == 0)
                std::cout << "List is empty" << "\n";
        else
                std::cout << pdcList->at(0)->rtti() << "\n";
        for (int i = 0; i<pdcList->size(); i++)
                std::cout << pdcList->at(i)->getDescription().toStdString() << "\n";
}

---