| 1050 | } |
| 1051 | |
| 1052 | Set Set::operator &(const Set& first) const |
| 1053 | { |
| 1054 | if (!first.m_tree || !m_tree) |
| 1055 | return Set(); |
| 1056 | |
| 1057 | Q_ASSERT(m_repository); |
| 1058 | |
| 1059 | QMutexLocker lock(m_repository->m_mutex); |
| 1060 | |
| 1061 | SetRepositoryAlgorithms alg(m_repository->m_dataRepository, m_repository); |
| 1062 | |
| 1063 | Set ret(alg.set_intersect(m_tree, first.m_tree, m_repository->m_dataRepository.itemFromIndex( |
| 1064 | m_tree), m_repository->m_dataRepository.itemFromIndex(first.m_tree)), m_repository); |
| 1065 | |
| 1066 | ifDebug(alg.check(ret.m_tree)); |
| 1067 | |
| 1068 | return ret; |
| 1069 | } |
| 1070 | |
| 1071 | Set& Set::operator &=(const Set& first) |
| 1072 | { |
nothing calls this directly
no test coverage detected