Struct Linear 

pub struct Linear<const MAX: usize = 8, const MIN: usize = 3>;

Linear split — cheap inserts, looser trees.

O(n): pick the two children furthest apart along the axis of greatest spread as seeds, then distribute the rest greedily by least enlargement. Mirrors index/detail/rtree/linear/redistribute_elements.hpp.

Trait Implementations

impl<const MAX: usize, const MIN: usize> Clone for Linear<MAX, MIN>

fn clone(&self) -> Linear<MAX, MIN>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const MAX: usize, const MIN: usize> Copy for Linear<MAX, MIN>

impl<const MAX: usize, const MIN: usize> Debug for Linear<MAX, MIN>

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

Formats the value using the given formatter.

impl<const MAX: usize, const MIN: usize> Default for Linear<MAX, MIN>

fn default() -> Linear<MAX, MIN>

Returns the “default value” for a type.

impl<const MAX: usize, const MIN: usize> SplitParameters for Linear<MAX, MIN>

const MAX: usize = MAX

Maximum children per node before it must split.

const MIN: usize = MIN

Minimum children each node must keep after a split.

fn split(entries: &[Bounds]) -> (Vec<usize>, Vec<usize>)

Partition entries (a bounds-per-child list) into two groups of indices, each of size at least Self::MIN.