/****************************************************************************

**

** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies).

** All rights reserved.

** Contact: Nokia Corporation (qt-info@nokia.com)

**

** This file is part of the documentation of the Qt Toolkit.

**

** $QT_BEGIN_LICENSE:LGPL$

** No Commercial Usage

** This file contains pre-release code and may not be distributed.

** You may use this file in accordance with the terms and conditions

** contained in the Technology Preview License Agreement accompanying

** this package.

**

** GNU Lesser General Public License Usage

** Alternatively, this file may be used under the terms of the GNU Lesser

** General Public License version 2.1 as published by the Free Software

** Foundation and appearing in the file LICENSE.LGPL included in the

** packaging of this file.  Please review the following information to

** ensure the GNU Lesser General Public License version 2.1 requirements

** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.

**

** In addition, as a special exception, Nokia gives you certain additional

** rights.  These rights are described in the Nokia Qt LGPL Exception

** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.

**

** If you have questions regarding the use of this file, please contact

** Nokia at qt-info@nokia.com.

**

**

**

**

**

**

**

**

** $QT_END_LICENSE$

**

****************************************************************************/

/*

    treeitem.cpp

    A container for items of data supplied by the simple tree model.

*/

#include <QStringList>

#include "treeitem.h"

TreeItem::TreeItem(const QList<QVariant> &data, TreeItem *parent)

{

    parentItem = parent;

    itemData = data;

}

TreeItem::~TreeItem()

{

    qDeleteAll(childItems);

}

void TreeItem::appendChild(TreeItem *item)

{

    childItems.append(item);

}

TreeItem *TreeItem::child(int row)

{

    return childItems.value(row);

}

int TreeItem::childCount() const

{

    return childItems.count();

}

int TreeItem::columnCount() const

{

    return itemData.count();

}

QVariant TreeItem::data(int column) const

{

    return itemData.value(column);

}

bool TreeItem::insertChild(int row, TreeItem *item)

{

    if (row < 0 || row > childItems.count())

        return false;

    childItems.insert(row, item);

    return true;

}

TreeItem *TreeItem::parent()

{

    return parentItem;

}

bool TreeItem::removeChild(int row)

{

    if (row < 0 || row >= childItems.count())

        return false;

    delete childItems.takeAt(row);

    return true;

}

int TreeItem::row() const

{

    if (parentItem)

        return parentItem->childItems.indexOf(const_cast<TreeItem*>(this));

    return 0;

}

bool TreeItem::setData(int column, const QVariant &data)

{

    if (column < 0 || column >= itemData.count())

        return false;

    itemData.replace(column, data);

    return true;

}