HPCombi
High Performance Combinatorics in C++ using vector instructions v1.1.0
|
NHPCombi | |
Npower_helper | |
CMonoid | Algebraic monoid structure used by default for type T by the pow function and prod function |
CMonoid< Perm16 > | |
CMonoid< std::string > | |
CBMat16 | |
CBMat8 | Boolean matrices of dimension up to 8×8, stored as a single uint64; isomorph to binary relations with methods for composition |
CPerm16 | Permutations of \(\{0\dots 15\}\): A permutation is a bijective mapping of a set of n elements onto itself |
CPermGeneric | Vanilla (ie NOT optimized) implementation of a permutation, used to check for test correctness and as baseline to measure speedup |
CPPerm16 | Partial permutation of \(\{0\dots 15\}\); see also HPCombi::Perm16; partial means it might not be defined everywhere (but where it's defined, it's injective) |
CPTransf16 | Partial transformation of \(\{0\dots 15\}\); see HPCombi::Transf16; partial means it might not be defined everywhere |
CTPUBuild | Given a transformation from 0..15 → 0..15, build at compile-time the array representing the transformation |
CTransf16 | Full transformation of \(\{0\dots 15\}\): a transformation is a mapping of a set of n elements into itself; ie as opposed to a permutation, it is not necessarily injective |
CVect16 | Vector of 16 bytes, with some optimized methods, superclass of HPCombi::Transf16 |
CVectGeneric | VectGeneric is to Vect16 what PermGeneric is to Perm16; see PermGeneric |
Nlibsemigroups | |
CTimer | |
Nstd | |
Cequal_to< HPCombi::epu8 > | |
Chash< HPCombi::BMat8 > | |
Chash< HPCombi::epu8 > | |
Chash< HPCombi::Perm16 > | |
Chash< HPCombi::PermGeneric< Size, Expo > > | |
Chash< HPCombi::PPerm16 > | |
Chash< HPCombi::PTransf16 > | |
Chash< HPCombi::Transf16 > | |
Chash< HPCombi::Vect16 > | |
Chash< HPCombi::VectGeneric< Size, Expo > > | |
Cless< HPCombi::epu8 > | |
Cnot_equal_to< HPCombi::epu8 > | |
CEqEpu8 | |
CPTransf16 | Partial transformation of \(\{0\dots 15\}\); see HPCombi::Transf16; partial means it might not be defined everywhere |
CTransf16 | Full transformation of \(\{0\dots 15\}\): a transformation is a mapping of a set of n elements into itself; ie as opposed to a permutation, it is not necessarily injective |