mirror of
https://github.com/YACReader/yacreader
synced 2025-06-03 09:08:20 -04:00
b551c9484a
falta resetear adecuadamente el modelo interno cuando se cambia de base de datos falta hacer scroll automatico al hacer click en uno de los resultados de b?squeda falta a?adir soporte a la b?squeda con nombres de c?mics
147 lines
3.9 KiB
C++
147 lines
3.9 KiB
C++
/****************************************************************************
|
||
**
|
||
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
|
||
** All rights reserved.
|
||
** Contact: Nokia Corporation (qt-info@nokia.com)
|
||
**
|
||
** This file is part of the examples of the Qt Toolkit.
|
||
**
|
||
** $QT_BEGIN_LICENSE:BSD$
|
||
** You may use this file under the terms of the BSD license as follows:
|
||
**
|
||
** "Redistribution and use in source and binary forms, with or without
|
||
** modification, are permitted provided that the following conditions are
|
||
** met:
|
||
** * Redistributions of source code must retain the above copyright
|
||
** notice, this list of conditions and the following disclaimer.
|
||
** * Redistributions in binary form must reproduce the above copyright
|
||
** notice, this list of conditions and the following disclaimer in
|
||
** the documentation and/or other materials provided with the
|
||
** distribution.
|
||
** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor
|
||
** the names of its contributors may be used to endorse or promote
|
||
** products derived from this software without specific prior written
|
||
** permission.
|
||
**
|
||
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||
** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
|
||
** $QT_END_LICENSE$
|
||
**
|
||
****************************************************************************/
|
||
|
||
/*
|
||
treeitem.cpp
|
||
|
||
A container for items of data supplied by the simple tree model.
|
||
*/
|
||
|
||
#include <QStringList>
|
||
|
||
#include "treeitem.h"
|
||
#include "qnaturalsorting.h"
|
||
|
||
//! [0]
|
||
TreeItem::TreeItem(const QList<QVariant> &data, TreeItem *parent)
|
||
{
|
||
parentItem = parent;
|
||
itemData = data;
|
||
}
|
||
//! [0]
|
||
|
||
//! [1]
|
||
TreeItem::~TreeItem()
|
||
{
|
||
qDeleteAll(childItems);
|
||
}
|
||
//! [1]
|
||
|
||
//! [2]
|
||
void TreeItem::appendChild(TreeItem *item)
|
||
{
|
||
item->parentItem = this;
|
||
//TODO insertar odernado
|
||
if(childItems.isEmpty())
|
||
childItems.append(item);
|
||
else
|
||
{
|
||
TreeItem * last = childItems.back();
|
||
QString nameLast = last->data(1).toString(); //TODO usar info name si est<73> disponible, sino el nombre del fichero.....
|
||
QString nameCurrent = item->data(1).toString();
|
||
QList<TreeItem *>::iterator i;
|
||
i = childItems.end();
|
||
i--;
|
||
while (naturalSortLessThanCI(nameCurrent,nameLast) && i != childItems.begin())
|
||
{
|
||
i--;
|
||
nameLast = (*i)->data(1).toString();
|
||
}
|
||
if(!naturalSortLessThanCI(nameCurrent,nameLast)) //si se ha encontrado un elemento menor que current, se inserta justo despu<70>s
|
||
childItems.insert(++i,item);
|
||
else
|
||
childItems.insert(i,item);
|
||
|
||
}
|
||
|
||
//childItems.append(item);
|
||
}
|
||
//! [2]
|
||
|
||
//! [3]
|
||
TreeItem *TreeItem::child(int row)
|
||
{
|
||
return childItems.value(row);
|
||
}
|
||
//! [3]
|
||
|
||
//! [4]
|
||
int TreeItem::childCount() const
|
||
{
|
||
return childItems.count();
|
||
}
|
||
//! [4]
|
||
|
||
//! [5]
|
||
int TreeItem::columnCount() const
|
||
{
|
||
return itemData.count();
|
||
}
|
||
//! [5]
|
||
|
||
//! [6]
|
||
QVariant TreeItem::data(int column) const
|
||
{
|
||
return itemData.value(column);
|
||
}
|
||
//! [6]
|
||
|
||
//! [7]
|
||
TreeItem *TreeItem::parent()
|
||
{
|
||
return parentItem;
|
||
}
|
||
//! [7]
|
||
|
||
//! [8]
|
||
int TreeItem::row() const
|
||
{
|
||
if (parentItem)
|
||
return parentItem->childItems.indexOf(const_cast<TreeItem*>(this));
|
||
|
||
return 0;
|
||
}
|
||
//! [8]
|
||
|
||
|
||
QList<QVariant> TreeItem::getData() const
|
||
{
|
||
return itemData;
|
||
} |