ROSE
0.11.145.0
|
Combinatoric functions.
Classes | |
class | Hasher |
Hash interface. More... | |
class | HasherFnv |
Fowler-Noll-Vo hashing using the Hasher interface. More... | |
class | HasherGcrypt |
Hasher for any libgcrypt hash algorithm. More... | |
class | HasherSha256Builtin |
Built-in SHA-256 hasher. More... | |
Typedefs | |
typedef HasherGcrypt< 0 > | HasherMd5 |
MD5 hasher. More... | |
typedef HasherGcrypt< 0 > | HasherSha1 |
SHA1 hasher. More... | |
typedef HasherGcrypt< 0 > | HasherSha256 |
SHA-256 hasher. More... | |
typedef HasherGcrypt< 0 > | HasherSha384 |
SHA-384 hasher. More... | |
typedef HasherGcrypt< 0 > | HasherSha512 |
SHA-512 hasher. More... | |
typedef HasherGcrypt< 0 > | HasherCrc32 |
ISO 3309 hasher. More... | |
Functions | |
ROSE_DLL_API bool | flip_coin () |
Simulate flipping a coin. More... | |
template<typename T > | |
void | shuffle (std::vector< T > &vector, size_t nitems=UNLIMITED, size_t limit=UNLIMITED) |
Shuffle the values of a vector. More... | |
template<class T > | |
void | reorder (std::vector< T > &values, const std::vector< size_t > &remap) |
Reorder the values of one vector according to another. More... | |
template<class T , class U > | |
std::vector< std::pair< T, U > > | zip (const std::vector< T > &first, const std::vector< U > &second) |
Convert two vectors to a vector of pairs. More... | |
template<class T , class U > | |
std::pair< std::vector< T >, std::vector< U > > | unzip (const std::vector< std::pair< T, U > > &pairs) |
Convert a vector of pairs to a pair of vectors. More... | |
typedef HasherGcrypt<0> Rose::Combinatorics::HasherMd5 |
MD5 hasher.
Throws exception if libgcrypt is not configured.
Definition at line 418 of file Combinatorics.h.
typedef HasherGcrypt<0> Rose::Combinatorics::HasherSha1 |
SHA1 hasher.
Throws exception if libgcrypt is not configured.
Definition at line 419 of file Combinatorics.h.
typedef HasherGcrypt<0> Rose::Combinatorics::HasherSha256 |
SHA-256 hasher.
Throws exception if libgcrypt is not configured.
Definition at line 420 of file Combinatorics.h.
typedef HasherGcrypt<0> Rose::Combinatorics::HasherSha384 |
SHA-384 hasher.
Throws exception if libgcrypt is not configured.
Definition at line 421 of file Combinatorics.h.
typedef HasherGcrypt<0> Rose::Combinatorics::HasherSha512 |
SHA-512 hasher.
Throws exception if libgcrypt is not configured.
Definition at line 422 of file Combinatorics.h.
typedef HasherGcrypt<0> Rose::Combinatorics::HasherCrc32 |
ISO 3309 hasher.
Throws exception if libgcrypt is not configured.
Definition at line 423 of file Combinatorics.h.
ROSE_DLL_API bool Rose::Combinatorics::flip_coin | ( | ) |
Simulate flipping a coin.
Randomly returns true or false with equal probability.
void Rose::Combinatorics::shuffle | ( | std::vector< T > & | vector, |
size_t | nitems = UNLIMITED , |
||
size_t | limit = UNLIMITED |
||
) |
Shuffle the values of a vector.
This algorithm randomly shuffles the items in the vector by swapping values at indexes zero through limit
with values at randomly selected indexes zero through nitems
. The defaults for nitems
and limit
are the size of the input vector
.
Definition at line 75 of file Combinatorics.h.
References Sawyer::fastRandomIndex().
void Rose::Combinatorics::reorder | ( | std::vector< T > & | values, |
const std::vector< size_t > & | remap | ||
) |
Reorder the values of one vector according to another.
The second vector says how the first vector is rearranged. The argument values
are the values to be reordered, and the argument remap
says how to reorder them. Both arguments must be the same length, n. The remap
argument contains all the integer indices from 0 (inclusive) to n (exclusive). If the values
in their original order are named "old" and the values
in their new desired order are named "new", then new[i] = old[remap[i]].
This function is useful when sorting parallel arrays. Say we have three parallel arrays named a
, b
, and c
and we want to sort them all so array a
is in ascending order according to its natural less-than operator. We could do that as follows:
Definition at line 113 of file Combinatorics.h.
std::vector<std::pair<T, U> > Rose::Combinatorics::zip | ( | const std::vector< T > & | first, |
const std::vector< U > & | second | ||
) |
Convert two vectors to a vector of pairs.
If the two input vectors are not the same length, then the length of the result is the length of the shorter input vector.
Definition at line 462 of file Combinatorics.h.
std::pair<std::vector<T>, std::vector<U> > Rose::Combinatorics::unzip | ( | const std::vector< std::pair< T, U > > & | pairs | ) |
Convert a vector of pairs to a pair of vectors.
Definition at line 474 of file Combinatorics.h.