Class PermutationTable

Class Documentation

class brille::PermutationTable

Public Types

using ind_t = unsigned

Public Functions

PermutationTable(size_t ni, size_t branches)
PermutationTable(size_t ni, size_t branches, const std::set<size_t> &kys)
bool refresh(const size_t ni, const size_t br)
std::map<size_t, size_t>::const_iterator find(const size_t i, const size_t j) const
bool has(const size_t i, const size_t j) const
bool value_needed(const size_t i, const size_t j) const
template<class I>
size_t set(const size_t i, const size_t j, const std::vector<I> &vin)
size_t overwrite(const size_t i, const size_t j, const size_t idx)
template<class I>
size_t overwrite(const size_t i, const size_t j, const std::vector<I> &vin)
std::vector<ind_t> safe_get(const size_t i, const size_t j) const
std::set<size_t> keys() const
std::set<size_t> insert_keys(const std::set<size_t> &ks)