Struct noise::permutationtable::PermutationTable

pub struct PermutationTable { /* private fields */ }

A seed table, required by all noise functions.

Table creation is expensive, so in most circumstances you’ll only want to create one of these per generator.

Implementations

impl PermutationTable

pub fn new(seed: u32) -> Self

Deterministically generates a new permutation table based on a u32 seed value.

Internally this uses a XorShiftRng, but we don’t really need to worry about cryptographic security when working with procedural noise.

Trait Implementations

impl Clone for PermutationTable

fn clone(&self) -> PermutationTable

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PermutationTable

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Distribution<PermutationTable> for Standard

fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> PermutationTable

Generates a PermutationTable using a random seed.

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.

fn map<F, S>(self, func: F) -> DistMap<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Create a distribution of values of ‘S’ by mapping the output of Self through the closure F

impl NoiseHasher for PermutationTable

fn hash(&self, to_hash: &[isize]) -> usize

impl Copy for PermutationTable