|
| template<typename K , typename I > |
| static std::unique_ptr< I[]> | fixedKeys (K const *const keys, size_t const num) |
| | Generate a permutation for a given set of keys. The range of the keys must be limited to [0,n), where n is the number of keys. More...
|
| |
| template<typename K , typename I , typename URBG > |
| static std::unique_ptr< I[]> | fixedKeysRandom (K const *const keys, size_t const num, URBG &&rng) |
| | Generate a permutation for a given set of keys. The range of the keys must be limited to [0,n), where n is the number of keys. More...
|
| |
◆ fixedKeys()
template<typename K , typename I >
| static std::unique_ptr<I[]> sl::Sort::fixedKeys |
( |
K const *const |
keys, |
|
|
size_t const |
num |
|
) |
| |
|
inlinestatic |
Generate a permutation for a given set of keys. The range of the keys must be limited to [0,n), where n is the number of keys.
- Template Parameters
-
| K | The key type (must be integral). |
| I | The index type (must be integral). |
- Parameters
-
| keys | The set of keys to use to generate the sorted permutation. |
| num | The number of keys. |
- Returns
- The sorted permutation array.
◆ fixedKeysRandom()
template<typename K , typename I , typename URBG >
| static std::unique_ptr<I[]> sl::Sort::fixedKeysRandom |
( |
K const *const |
keys, |
|
|
size_t const |
num, |
|
|
URBG && |
rng |
|
) |
| |
|
inlinestatic |
Generate a permutation for a given set of keys. The range of the keys must be limited to [0,n), where n is the number of keys.
- Template Parameters
-
| K | The key type (must be integral). |
| I | The index type (must be integral). |
- Parameters
-
| keys | The set of keys to use to generate the sorted permutation. |
| num | The number of keys. |
- Returns
- The sorted permutation array.
The documentation for this class was generated from the following file:
