Struct SquareCell 

pub struct SquareCell<F, I, W> {
    pub floored: I,
    pub offset: F,
    pub wrapping: W,
}

Represents a hyper cube of some N dimensions. See also OrthoGrid.

Fields

floored: I

The least corner of this grid square.

offset: F

The positive offset from floored to the point in the grid square.

wrapping: W

The WrappingAmount.

Trait Implementations

impl<F, I, W> BlendableDomainCell for SquareCell<F, I, W>

where Self: DomainCell,

fn blending_half_radius(&self) -> f32

Returns half how far out to consider blending points. Too high a value can produce discontinuities.

impl<F: Clone, I: Clone, W: Clone> Clone for SquareCell<F, I, W>

fn clone(&self) -> SquareCell<F, I, W>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Copy, I: Copy, W: Copy> Copy for SquareCell<F, I, W>

impl<W: WrappingAmount<IVec2>> DifferentiableCell for SquareCell<Vec2, IVec2, W>

type Gradient<D> = [D; 2]

The gradient vector of derivative elements D. This should usually be [D; N] where N is the number of axies.

fn interpolation_gradient<T: VectorSpace<Scalar = f32>>( &self, rng: NoiseRng, f: impl FnMut(CellPoint<Self::Full>) -> T, curve: &impl SampleDerivative<f32>, gradient_scale: f32, ) -> Self::Gradient<T>

Calculates the Gradient vector for the function interpolate_within.

fn interpolate_with_gradient<T: VectorSpace<Scalar = f32>>( &self, rng: NoiseRng, f: impl FnMut(CellPoint<Self::Full>) -> T, curve: &impl SampleDerivative<f32>, gradient_scale: f32, ) -> WithGradient<T, Self::Gradient<T>>

Combines interpolate_within and interpolation_gradient.

impl<W: WrappingAmount<IVec3>> DifferentiableCell for SquareCell<Vec3, IVec3, W>

type Gradient<D> = [D; 3]

The gradient vector of derivative elements D. This should usually be [D; N] where N is the number of axies.

fn interpolation_gradient<T: VectorSpace<Scalar = f32>>( &self, rng: NoiseRng, f: impl FnMut(CellPoint<Self::Full>) -> T, curve: &impl SampleDerivative<f32>, gradient_scale: f32, ) -> Self::Gradient<T>

Calculates the Gradient vector for the function interpolate_within.

fn interpolate_with_gradient<T: VectorSpace<Scalar = f32>>( &self, rng: NoiseRng, f: impl FnMut(CellPoint<Self::Full>) -> T, curve: &impl SampleDerivative<f32>, gradient_scale: f32, ) -> WithGradient<T, Self::Gradient<T>>

Combines interpolate_within and interpolation_gradient.

impl<W: WrappingAmount<IVec3>> DifferentiableCell for SquareCell<Vec3A, IVec3, W>

type Gradient<D> = [D; 3]

The gradient vector of derivative elements D. This should usually be [D; N] where N is the number of axies.

fn interpolation_gradient<T: VectorSpace<Scalar = f32>>( &self, rng: NoiseRng, f: impl FnMut(CellPoint<Self::Full>) -> T, curve: &impl SampleDerivative<f32>, gradient_scale: f32, ) -> Self::Gradient<T>

Calculates the Gradient vector for the function interpolate_within.

fn interpolate_with_gradient<T: VectorSpace<Scalar = f32>>( &self, rng: NoiseRng, f: impl FnMut(CellPoint<Self::Full>) -> T, curve: &impl SampleDerivative<f32>, gradient_scale: f32, ) -> WithGradient<T, Self::Gradient<T>>

Combines interpolate_within and interpolation_gradient.

impl<W: WrappingAmount<IVec4>> DifferentiableCell for SquareCell<Vec4, IVec4, W>

type Gradient<D> = [D; 4]

The gradient vector of derivative elements D. This should usually be [D; N] where N is the number of axies.

fn interpolation_gradient<T: VectorSpace<Scalar = f32>>( &self, rng: NoiseRng, f: impl FnMut(CellPoint<Self::Full>) -> T, curve: &impl SampleDerivative<f32>, gradient_scale: f32, ) -> Self::Gradient<T>

Calculates the Gradient vector for the function interpolate_within.

fn interpolate_with_gradient<T: VectorSpace<Scalar = f32>>( &self, rng: NoiseRng, f: impl FnMut(CellPoint<Self::Full>) -> T, curve: &impl SampleDerivative<f32>, gradient_scale: f32, ) -> WithGradient<T, Self::Gradient<T>>

Combines interpolate_within and interpolation_gradient.

impl<W: WrappingAmount<IVec2>> DomainCell for SquareCell<Vec2, IVec2, W>

type Full = Vec2

The larger/full domain this is a portion of.

fn rough_id(&self, rng: NoiseRng) -> u32

Identifies this cell roughly from others per rng, roughly meaning the ids are not necessarily unique.

fn iter_points( &self, rng: NoiseRng, ) -> impl Iterator<Item = CellPoint<Self::Full>>

Iterates all the points relevant to this cell. This could include bounding points, internal points, nearby points, or any other point relevant to the domain cell.

impl<W: WrappingAmount<IVec3>> DomainCell for SquareCell<Vec3, IVec3, W>

type Full = Vec3

The larger/full domain this is a portion of.

fn rough_id(&self, rng: NoiseRng) -> u32

Identifies this cell roughly from others per rng, roughly meaning the ids are not necessarily unique.

fn iter_points( &self, rng: NoiseRng, ) -> impl Iterator<Item = CellPoint<Self::Full>>

Iterates all the points relevant to this cell. This could include bounding points, internal points, nearby points, or any other point relevant to the domain cell.

impl<W: WrappingAmount<IVec3>> DomainCell for SquareCell<Vec3A, IVec3, W>

type Full = Vec3A

The larger/full domain this is a portion of.

fn rough_id(&self, rng: NoiseRng) -> u32

Identifies this cell roughly from others per rng, roughly meaning the ids are not necessarily unique.

fn iter_points( &self, rng: NoiseRng, ) -> impl Iterator<Item = CellPoint<Self::Full>>

Iterates all the points relevant to this cell. This could include bounding points, internal points, nearby points, or any other point relevant to the domain cell.

impl<W: WrappingAmount<IVec4>> DomainCell for SquareCell<Vec4, IVec4, W>

type Full = Vec4

The larger/full domain this is a portion of.

fn rough_id(&self, rng: NoiseRng) -> u32

Identifies this cell roughly from others per rng, roughly meaning the ids are not necessarily unique.

fn iter_points( &self, rng: NoiseRng, ) -> impl Iterator<Item = CellPoint<Self::Full>>

Iterates all the points relevant to this cell. This could include bounding points, internal points, nearby points, or any other point relevant to the domain cell.

impl<W: WrappingAmount<IVec2>> InterpolatableCell for SquareCell<Vec2, IVec2, W>

fn interpolate_within<T: VectorSpace<Scalar = f32>>( &self, rng: NoiseRng, f: impl FnMut(CellPoint<Self::Full>) -> T, curve: &impl Curve<f32>, ) -> T

Interpolates between the bounding CellPoints of this DomainCell according to some Curve.

impl<W: WrappingAmount<IVec3>> InterpolatableCell for SquareCell<Vec3, IVec3, W>

fn interpolate_within<T: VectorSpace<Scalar = f32>>( &self, rng: NoiseRng, f: impl FnMut(CellPoint<Self::Full>) -> T, curve: &impl Curve<f32>, ) -> T

Interpolates between the bounding CellPoints of this DomainCell according to some Curve.

impl<W: WrappingAmount<IVec3>> InterpolatableCell for SquareCell<Vec3A, IVec3, W>

fn interpolate_within<T: VectorSpace<Scalar = f32>>( &self, rng: NoiseRng, f: impl FnMut(CellPoint<Self::Full>) -> T, curve: &impl Curve<f32>, ) -> T

Interpolates between the bounding CellPoints of this DomainCell according to some Curve.

impl<W: WrappingAmount<IVec4>> InterpolatableCell for SquareCell<Vec4, IVec4, W>

fn interpolate_within<T: VectorSpace<Scalar = f32>>( &self, rng: NoiseRng, f: impl FnMut(CellPoint<Self::Full>) -> T, curve: &impl Curve<f32>, ) -> T

Interpolates between the bounding CellPoints of this DomainCell according to some Curve.

impl<F: PartialEq, I: PartialEq, W: PartialEq> PartialEq for SquareCell<F, I, W>

fn eq(&self, other: &SquareCell<F, I, W>) -> 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<F: PartialEq, I: PartialEq, W: PartialEq> StructuralPartialEq for SquareCell<F, I, W>

impl<F, I, W> WorleyDomainCell for SquareCell<F, I, W>

where Self: DomainCell,

fn next_nearest_1d_point_always_within(&self) -> f32

For every CellPoint::offset produced by DomainCell::iter_points, the second nearest point along each axis will be less than this far away along that axis.

fn nearest_1d_point_always_within(&self) -> f32

For every CellPoint::offset produced by DomainCell::iter_points, the nearest point along each axis will be less than this far away along that axis.