Struct ReducedUniformPoint

pub struct ReducedUniformPoint<P, const SIZE: u8, const SALT: u64> {
    pub points: ArrayVec<P, 7>,
}

Removes locations that are too close to others.

Fields

points: ArrayVec<P, 7>

The points remaining after removing ones that are too close to others.

Trait Implementations

impl<P: Reducible, const SIZE: u8, const SALT: u64> Chunk for ReducedUniformPoint<P, SIZE, SALT>

const SIZE: Point2d<u8>

Width and height of the chunk (in powers of two);

type LayerStore<T> = Arc<T>

Data structure that stores the layer. Usually Arc<Self>, but some layers are only used to simplify another layer, so they can get stored directly without the Arc indirection.

type Dependencies = Layer<UniformPoint<P, SIZE, SALT>>

The actual dependencies. Usually a struct with fields of Layer<T> type, but can be of any type to specify non-layer dependencies, too. It is the type of the first argument of Chunk::compute.

fn compute(raw_points: &Self::Dependencies, index: GridPoint<Self>) -> Self

Compute a chunk from its dependencies

fn clear(raw_points: &Self::Dependencies, index: GridPoint<Self>)

Clear all information that [compute] would have computed

const GRID_SIZE: Point2d<u8> = _

Exponent of 2 of the cached area (in grid chunk numbers, not world coordinates). This is the area that should stay in memory at all times as it will get requested a lot.

const GRID_OVERLAP: u8 = 3u8

Internal RollingGrid overlap before the system drops old chunks. Basically scales the grid width/height by this number to allow moving across the grid width/height boundaries completely transparently. Increasing this number makes indexing the RollingGrid more expensive if there is a lot of overlap.

fn bounds(index: GridPoint<Self>) -> Bounds

Get the bounds for the chunk at the given index

fn bounds_to_grid(bounds: Bounds) -> Bounds<GridIndex<Self>>

Get the grids that are touched by the given bounds.

fn pos_to_grid(point: Point2d) -> GridPoint<Self>

Get the grid the position is in

fn vision_range(bounds: Bounds) -> Bounds

Pad by a chunk size to make sure we see effects from the neighboring chunks

fn moore_neighborhood(index: GridPoint<Self>) -> [[GridPoint<Self>; 3]; 3]

Get 3x3 grid points around a central one

impl<P: Clone, const SIZE: u8, const SALT: u64> Clone for ReducedUniformPoint<P, SIZE, SALT>

fn clone(&self) -> ReducedUniformPoint<P, SIZE, SALT>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P: Debug, const SIZE: u8, const SALT: u64> Debug for ReducedUniformPoint<P, SIZE, SALT>

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

Formats the value using the given formatter.

impl<P: Reducible, const SIZE: u8, const SALT: u64> Debug for ReducedUniformPoint<P, SIZE, SALT>

fn debug(&self) -> Vec<DebugContent>

Render the elements of this chunk type.

impl<P, const SIZE: u8, const SALT: u64> Default for ReducedUniformPoint<P, SIZE, SALT>

fn default() -> Self

Returns the “default value” for a type.

impl<P: PartialEq, const SIZE: u8, const SALT: u64> PartialEq for ReducedUniformPoint<P, SIZE, SALT>

fn eq(&self, other: &ReducedUniformPoint<P, SIZE, SALT>) -> 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<P, const SIZE: u8, const SALT: u64> StructuralPartialEq for ReducedUniformPoint<P, SIZE, SALT>