void ColumnFixedString::getPermutation(bool reverse, size_t limit, int /*nan_direction_hint*/, Permutation & res) const { size_t s = size(); res.resize(s); for (size_t i = 0; i < s; ++i) res[i] = i; if (limit >= s) limit = 0; if (limit) { if (reverse) std::partial_sort(res.begin(), res.begin() + limit, res.end(), less<false>(*this)); else std::partial_sort(res.begin(), res.begin() + limit, res.end(), less<true>(*this)); } else { if (reverse) std::sort(res.begin(), res.end(), less<false>(*this)); else std::sort(res.begin(), res.end(), less<true>(*this)); } }
void ColumnString::getPermutationWithCollation(const Collator & collator, bool reverse, size_t limit, Permutation & res) const { size_t s = offsets.size(); res.resize(s); for (size_t i = 0; i < s; ++i) res[i] = i; if (limit >= s) limit = 0; if (limit) { if (reverse) std::partial_sort(res.begin(), res.begin() + limit, res.end(), lessWithCollation<false>(*this, collator)); else std::partial_sort(res.begin(), res.begin() + limit, res.end(), lessWithCollation<true>(*this, collator)); } else { if (reverse) std::sort(res.begin(), res.end(), lessWithCollation<false>(*this, collator)); else std::sort(res.begin(), res.end(), lessWithCollation<true>(*this, collator)); } }
void ColumnTuple::getPermutation(bool reverse, size_t limit, int nan_direction_hint, Permutation & res) const { size_t rows = size(); res.resize(rows); for (size_t i = 0; i < rows; ++i) res[i] = i; if (limit >= rows) limit = 0; if (limit) { if (reverse) std::partial_sort(res.begin(), res.begin() + limit, res.end(), Less<false>(columns, nan_direction_hint)); else std::partial_sort(res.begin(), res.begin() + limit, res.end(), Less<true>(columns, nan_direction_hint)); } else { if (reverse) std::sort(res.begin(), res.end(), Less<false>(columns, nan_direction_hint)); else std::sort(res.begin(), res.end(), Less<true>(columns, nan_direction_hint)); } }
void union_perm(Permutation<element_type, rank_type> &sigma, Permutation<element_type, rank_type> &tau){ for (typename Permutation<element_type, rank_type>::iterator it = tau.begin(); it != tau.end(); ++it) { sigma.addElement(it->first, sigma(it->first)); } }