Struct Linear 

pub struct Linear<const MAX: usize = 32, const MIN: usize = 9>;

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.

Its <32, 9> type default is a symmetric alternative, not the default of crate::Rtree. See the module tuning guide.

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.

const LEAF_MAX: usize = Self::MAX

Maximum values in a leaf. Defaults to Self::MAX.

const LEAF_MIN: usize = Self::MIN

Minimum values in either half of a split leaf.

const BRANCH_MAX: usize = Self::MAX

Maximum children in a branch. Defaults to Self::MAX.

const BRANCH_MIN: usize = Self::MIN

Minimum children in either half of a split branch.

const BULK_LEAF_MAX: usize = Self::LEAF_MAX

Maximum values per leaf created by bulk loading.

const BULK_BRANCH_MAX: usize = Self::BRANCH_MAX

Maximum children per branch created by bulk loading.

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

Partition an overflowing leaf.

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

Partition an overflowing branch.