Struct DiamondSquare 

pub struct DiamondSquare { /* private fields */ }

Generate a grid using diamond square algorithm

Arguments

• rng:
• vs:

returns: f32

Examples

use ndarray::Array2;

Implementations

impl DiamondSquare

pub fn get_iteration(&self) -> u32

Generate a grid using diamond square algorithm

Arguments

• rng:
• vs:

returns: f32

Examples

let mut cfg = DiamondSquare::default();
assert_eq!(cfg.get_iteration(), 2);

pub fn set_iteration(&mut self, iteration: u32)

Generate a grid using diamond square algorithm

Arguments

• rng:
• vs:

returns: f32

Examples

let mut cfg = DiamondSquare::default();
cfg.set_iteration(5);
assert_eq!(cfg.get_iteration(), 5);

pub fn with_iteration(self, iteration: u32) -> Self

Generate a grid using diamond square algorithm

Arguments

• rng:
• vs:

returns: f32

Examples

let mut cfg = DiamondSquare::default().with_iteration(5);
assert_eq!(cfg.get_iteration(), 5);

pub fn get_roughness(&self) -> f32

Generate a grid using diamond square algorithm

Arguments

• rng:
• vs:

returns: f32

Examples

let mut cfg = DiamondSquare::default();
assert_eq!(cfg.get_roughness(), 1.1);

pub fn set_roughness(&mut self, roughness: f32)

Generate a grid using diamond square algorithm

Arguments

• rng:
• vs:

returns: f32

Examples

let mut cfg = DiamondSquare::default();
cfg.set_roughness(1.5);
assert_eq!(cfg.get_roughness(), 1.5);

pub fn with_roughness(self, roughness: f32) -> Self

Generate a grid using diamond square algorithm

Arguments

• rng:
• vs:

returns: f32

Examples

let mut cfg = DiamondSquare::default().with_roughness(1.5);
assert_eq!(cfg.get_roughness(), 1.5);

pub fn get_seed(&self) -> u64

Generate a grid using diamond square algorithm

Arguments

• rng:
• vs:

returns: f32

Examples

let mut cfg = DiamondSquare::default();
assert_eq!(cfg.get_seed(), 42);

pub fn set_seed(&mut self, seed: u64)

Generate a grid using diamond square algorithm

Arguments

• rng:
• vs:

returns: f32

Examples

let mut cfg = DiamondSquare::default();
cfg.set_seed(0);
assert_eq!(cfg.get_seed(), 0);

pub fn with_seed(self, seed: u64) -> Self

Generate a grid using diamond square algorithm

Arguments

• rng:
• vs:

returns: f32

Examples

let mut cfg = DiamondSquare::default().with_seed(0);
assert_eq!(cfg.get_seed(), 0);

impl DiamondSquare

pub fn enlarge(&self, matrix: ArrayView2<'_, f32>) -> Array2<f32>

Generate a grid using diamond square algorithm

Arguments

• rng:
• vs:

returns: f32

Examples

use ndarray::Array2;

Trait Implementations

impl Clone for DiamondSquare

fn clone(&self) -> DiamondSquare

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DiamondSquare

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

Formats the value using the given formatter.

impl Default for DiamondSquare

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for DiamondSquare

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for DiamondSquare

fn eq(&self, other: &DiamondSquare) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for DiamondSquare

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for DiamondSquare

impl StructuralPartialEq for DiamondSquare