Searched refs:m_distribution (Results 1 – 2 of 2) sorted by relevance
69 for ( ; i < m_distribution.size() && j < distribution.size(); ++i, ++j) { in setDistribution()70 if (m_distribution.size() < distribution.size()) { in setDistribution()73 for ( ; j < distribution.size() && m_distribution.at(i) != distribution.at(j); ++j) in setDistribution()75 } else if (m_distribution.size() > distribution.size()) { in setDistribution()78 for ( ; i < m_distribution.size() && m_distribution.at(i) != distribution.at(j); ++i) in setDistribution()79 m_distribution.at(i)->lazyReattachIfAttached(); in setDistribution()80 } else if (m_distribution.at(i) != distribution.at(j)) { in setDistribution()82 m_distribution.at(i)->lazyReattachIfAttached(); in setDistribution()89 for ( ; i < m_distribution.size(); ++i) in setDistribution()90 m_distribution.at(i)->lazyReattachIfAttached(); in setDistribution()[all …]
45 bool hasDistribution() const { return !m_distribution.isEmpty(); } in hasDistribution()47 void clearDistribution() { m_distribution.clear(); } in clearDistribution()63 size_t size() const { return m_distribution.size(); } in size()64 Node* at(size_t index) const { return m_distribution.at(index).get(); } in at()65 Node* first() const { return m_distribution.isEmpty() ? 0 : m_distribution.first().get(); } in first()66 Node* last() const { return m_distribution.isEmpty() ? 0 : m_distribution.last().get(); } in last()67 Node* nextTo(const Node* node) const { return m_distribution.nextTo(node); } in nextTo()68 Node* previousTo(const Node* node) const { return m_distribution.previousTo(node); } in previousTo()83 ContentDistribution m_distribution; variable