SourceItem *sourceItem = sourceToInternal(parent);
Q_ASSERT(sourceItem);
+ Q_UNUSED(sourceItem);
// sanity check - if that check fails our indexes would be messed up
for(int row = start; row <= end; row++) {
}
qDebug() << "Last item in tree:" << item << item->pos();
Q_ASSERT(lastPos == item->pos());
+ Q_UNUSED(lastPos);
qDebug() << "success!";
}
int start = 0;
int end = _childs.count() - 1;
int pivot;
- while(end - start != 1) {
+ while(end - start > 1) {
pivot = (end + start) / 2;
if(_childs[pivot]->pos() > proxyPos)
end = pivot;