items are sorted by order
| 168 | |
| 169 | // items are sorted by order |
| 170 | void ReadingListItem::appendChild(ReadingListItem *item) |
| 171 | { |
| 172 | item->parent = this; |
| 173 | |
| 174 | if (childItems.isEmpty()) |
| 175 | childItems.append(item); |
| 176 | else { |
| 177 | if (item->parent->getId() == 0) // sort by name, top level child |
| 178 | { |
| 179 | int i = 0; |
| 180 | while (i < childItems.length() && naturalSortLessThanCI(childItems.at(i)->name(), item->name())) |
| 181 | i++; |
| 182 | childItems.insert(i, item); |
| 183 | } else { |
| 184 | int i = 0; |
| 185 | while (i < childItems.length() && (childItems.at(i)->getOrdering() < item->getOrdering())) |
| 186 | i++; |
| 187 | childItems.insert(i, item); |
| 188 | } |
| 189 | |
| 190 | /*ReadingListItem * last = childItems.back(); |
| 191 | QString nameLast = last->data(1).toString(); //TODO usar info name si est� disponible, sino el nombre del fichero..... |
| 192 | QString nameCurrent = item->data(1).toString(); |
| 193 | QList<FolderItem *>::iterator i; |
| 194 | i = childItems.end(); |
| 195 | i--; |
| 196 | while (naturalSortLessThanCI(nameCurrent,nameLast) && i != childItems.begin()) |
| 197 | { |
| 198 | i--; |
| 199 | nameLast = (*i)->data(1).toString(); |
| 200 | } |
| 201 | if(!naturalSortLessThanCI(nameCurrent,nameLast)) //si se ha encontrado un elemento menor que current, se inserta justo despu�s |
| 202 | childItems.insert(++i,item); |
| 203 | else |
| 204 | childItems.insert(i,item);*/ |
| 205 | } |
| 206 | } |
| 207 | |
| 208 | void ReadingListItem::appendChild(ReadingListItem *item, int pos) |
| 209 | { |
nothing calls this directly
no test coverage detected