| 512 | } |
| 513 | |
| 514 | Set::Iterator Set::iterator() const |
| 515 | { |
| 516 | if (!m_tree || !m_repository) |
| 517 | return Iterator(); |
| 518 | |
| 519 | QMutexLocker lock(m_repository->m_mutex); |
| 520 | |
| 521 | Iterator ret; |
| 522 | ret.d_ptr->repository = m_repository; |
| 523 | |
| 524 | if (m_tree) |
| 525 | ret.d_ptr->startAtNode(m_repository->m_dataRepository.itemFromIndex(m_tree)); |
| 526 | return ret; |
| 527 | } |
| 528 | |
| 529 | //Creates a set item with the given children., they must be valid, and they must be split around their split-position. |
| 530 | uint SetRepositoryAlgorithms::createSetFromNodes(uint leftNode, uint rightNode, const SetNodeData* left, |
no test coverage detected