# [−][src]Struct sgx_rand::XorShiftRng

`pub struct XorShiftRng { /* fields omitted */ }`

An Xorshift[1] random number generator.

The Xorshift algorithm is not suitable for cryptographic purposes but is very fast. If you do not know for sure that it fits your requirements, use a more secure one such as `IsaacRng` or `SgxRng`.

[1]: Marsaglia, George (July 2003). "Xorshift RNGs". Journal of Statistical Software. Vol. 8 (Issue 14).

## Implementations

### `impl XorShiftRng`[src]

#### `pub fn new_unseeded() -> XorShiftRng`[src]

Creates a new XorShiftRng instance which is not seeded.

The initial values of this RNG are constants, so all generators created by this function will yield the same stream of random numbers. It is highly recommended that this is created through `SeedableRng` instead of this function

## Trait Implementations

### `impl SeedableRng<[u32; 4]> for XorShiftRng`[src]

#### `fn reseed(&mut self, seed: [u32; 4])`[src]

Reseed an XorShiftRng. This will panic if `seed` is entirely 0.

#### `fn from_seed(seed: [u32; 4]) -> XorShiftRng`[src]

Create a new XorShiftRng. This will panic if `seed` is entirely 0.

## Blanket Implementations

### `impl<T> ToOwned for T where    T: Clone, `[src]

#### `type Owned = T`

The resulting type after obtaining ownership.

### `impl<T, U> TryFrom<U> for T where    U: Into<T>, `[src]

#### `type Error = Infallible`

The type returned in the event of a conversion error.

### `impl<T, U> TryInto<U> for T where    U: TryFrom<T>, `[src]

#### `type Error = <U as TryFrom<T>>::Error`

The type returned in the event of a conversion error.