| 1008 | } |
| 1009 | |
| 1010 | Set Set::operator +(const Set& first) const |
| 1011 | { |
| 1012 | if (!first.m_tree) |
| 1013 | return *this; |
| 1014 | else if (!m_tree || !m_repository) |
| 1015 | return first; |
| 1016 | |
| 1017 | Q_ASSERT(m_repository == first.m_repository); |
| 1018 | |
| 1019 | QMutexLocker lock(m_repository->m_mutex); |
| 1020 | |
| 1021 | SetRepositoryAlgorithms alg(m_repository->m_dataRepository, m_repository); |
| 1022 | |
| 1023 | uint retNode = alg.set_union(m_tree, first.m_tree, m_repository->m_dataRepository.itemFromIndex( |
| 1024 | m_tree), m_repository->m_dataRepository.itemFromIndex(first.m_tree)); |
| 1025 | |
| 1026 | ifDebug(alg.check(retNode)); |
| 1027 | |
| 1028 | return Set(retNode, m_repository); |
| 1029 | } |
| 1030 | |
| 1031 | Set& Set::operator +=(const Set& first) |
| 1032 | { |
nothing calls this directly
no test coverage detected