return child(defaultColumn(), row);
}
-AbstractTreeItem *AbstractTreeItem::childById(int column, const uint &id) const {
+AbstractTreeItem *AbstractTreeItem::childById(int column, const quint64 &id) const {
if(!_childHash.contains(column)
|| !_childHash[column].contains(id))
return 0;
return _childHash[column].value(id);
}
-AbstractTreeItem *AbstractTreeItem::childById(const uint &id) const {
+AbstractTreeItem *AbstractTreeItem::childById(const quint64 &id) const {
return childById(defaultColumn(), id);
}
return QModelIndex();
}
-QModelIndex TreeModel::indexById(uint id, const QModelIndex &parent) const {
+QModelIndex TreeModel::indexById(quint64 id, const QModelIndex &parent) const {
AbstractTreeItem *parentItem;
if(!parent.isValid())
if(column == -1) {
leftIndex = createIndex(item->row(), 0, item);
- rightIndex = createIndex(item->row(), item->columnCount(), item);
+ rightIndex = createIndex(item->row(), item->columnCount()-1, item);
} else {
leftIndex = createIndex(item->row(), column, item);
rightIndex = leftIndex;