pub struct BlockRng<R: BlockRngCore + ?Sized> {
pub core: R,
/* private fields */
}
Expand description
A wrapper type implementing RngCore
for some type implementing
BlockRngCore
with u32
array buffer; i.e. this can be used to implement
a full RNG from just a generate
function.
The core
field may be accessed directly but the results buffer may not.
PRNG implementations can simply use a type alias
(pub type MyRng = BlockRng<MyRngCore>;
) but might prefer to use a
wrapper type (pub struct MyRng(BlockRng<MyRngCore>);
); the latter must
re-implement RngCore
but hides the implementation details and allows
extra functionality to be defined on the RNG
(e.g. impl MyRng { fn set_stream(...){...} }
).
BlockRng
has heavily optimized implementations of the RngCore
methods
reading values from the results buffer, as well as
calling BlockRngCore::generate
directly on the output array when
fill_bytes
/ try_fill_bytes
is called on a large array. These methods
also handle the bookkeeping of when to generate a new batch of values.
No whole generated u32
values are thrown away and all values are consumed
in-order. next_u32
simply takes the next available u32
value.
next_u64
is implemented by combining two u32
values, least
significant first. fill_bytes
and try_fill_bytes
consume a whole
number of u32
values, converting each u32
to a byte slice in
little-endian order. If the requested byte length is not a multiple of 4,
some bytes will be discarded.
See also BlockRng64
which uses u64
array buffers. Currently there is
no direct support for other buffer types.
For easy initialization BlockRng
also implements SeedableRng
.
Fields§
§core: R
The core part of the RNG, implementing the generate
function.
Implementations§
Source§impl<R: BlockRngCore> BlockRng<R>
impl<R: BlockRngCore> BlockRng<R>
Sourcepub fn new(core: R) -> BlockRng<R>
pub fn new(core: R) -> BlockRng<R>
Create a new BlockRng
from an existing RNG implementing
BlockRngCore
. Results will be generated on first use.
Sourcepub fn index(&self) -> usize
pub fn index(&self) -> usize
Get the index into the result buffer.
If this is equal to or larger than the size of the result buffer then
the buffer is “empty” and generate()
must be called to produce new
results.
Sourcepub fn reset(&mut self)
pub fn reset(&mut self)
Reset the number of available results. This will force a new set of results to be generated on next use.
Sourcepub fn generate_and_set(&mut self, index: usize)
pub fn generate_and_set(&mut self, index: usize)
Generate a new set of results immediately, setting the index to the given value.
Trait Implementations§
Source§impl<R: BlockRngCore<Item = u32>> RngCore for BlockRng<R>
impl<R: BlockRngCore<Item = u32>> RngCore for BlockRng<R>
Source§fn fill_bytes(&mut self, dest: &mut [u8])
fn fill_bytes(&mut self, dest: &mut [u8])
dest
with random data. Read moreSource§impl<R: BlockRngCore + SeedableRng> SeedableRng for BlockRng<R>
impl<R: BlockRngCore + SeedableRng> SeedableRng for BlockRng<R>
Source§type Seed = <R as SeedableRng>::Seed
type Seed = <R as SeedableRng>::Seed
u8
arrays (we recommend [u8; N]
for some N
). Read moreSource§fn seed_from_u64(seed: u64) -> Self
fn seed_from_u64(seed: u64) -> Self
u64
seed. Read moreSource§fn from_rng<S: RngCore>(rng: S) -> Result<Self, Error>
fn from_rng<S: RngCore>(rng: S) -> Result<Self, Error>
Rng
. Read moreSource§fn from_entropy() -> Self
fn from_entropy() -> Self
impl<R: BlockRngCore + CryptoRng> CryptoRng for BlockRng<R>
Auto Trait Implementations§
impl<R> Freeze for BlockRng<R>
impl<R> RefUnwindSafe for BlockRng<R>
impl<R> Send for BlockRng<R>
impl<R> Sync for BlockRng<R>
impl<R> Unpin for BlockRng<R>
impl<R> UnwindSafe for BlockRng<R>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> CryptoRngCore for T
impl<T> CryptoRngCore for T
Layout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.