predictive_shuffle
| Crates.io | predictive_shuffle |
| lib.rs | predictive_shuffle |
| version | 0.1.0 |
| created_at | 2023-07-17 17:31:00.896879+00 |
| updated_at | 2023-07-17 17:31:00.896879+00 |
| description | A vector shuffling library that allows for in-place shuffling, or predictive sub-item shuffling. |
| homepage | |
| repository | |
| max_upload_size | |
| id | 918707 |
| size | 44,882 |
Devon Tietjen (d-tietjen)
documentation
README
predictive_shuffle
A predictive shuffling algorithm that allows for the predetermined selection of one or many items from a shuffled vec.
We define predictive as the ability for users to define the traits of a vector and some sub-set of positional indices, as to return the shuffled positions of those indices. This is a one-time operation that only computes the final shuffled locations of the input indices.
All algorithms can handle cryptographic, or non-cryptographic shuffling, with all shuffling implementations derived from an optimized version of the modern implementation of the Fisher-Yates shuffling algo, or other methods defined within the relevant crates.
License: MIT