| 188 | } |
| 189 | |
| 190 | void verifyOrder() |
| 191 | { |
| 192 | Data last; |
| 193 | |
| 194 | for (uint a = 0; a < m_itemCount; ++a) { |
| 195 | if (!ItemHandler::isFree(m_items[a])) { |
| 196 | if (!ItemHandler::isFree(last)) |
| 197 | Q_ASSERT(last < m_items[a]); |
| 198 | last = m_items[a]; |
| 199 | } |
| 200 | } |
| 201 | } |
| 202 | |
| 203 | void verifyTreeConsistent() |
| 204 | { |