Struct acacia::partition::Interval

pub struct Interval<T> { /* fields omitted */ }

A half-open interval [a, b) between two points a and b

Methods

impl<T: PartialOrd> Interval<T>

fn new(start: T, end: T) -> Interval<T>

Create a new interval given lower and upper bound

This constructor dynamically asserts that start < end.

Trait Implementations

impl<T: Copy> Copy for Interval<T>

impl<T: Clone> Clone for Interval<T>

fn clone(&self) -> Interval<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Interval<T>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T: Mid + Copy> Subdivide for Interval<T>

fn subdivide(&self) -> Vec<Interval<T>>

Subdivide into smaller partitions

impl<T: Mid + PartialOrd + Copy> Partition<T> for Interval<T>

fn contains(&self, elem: &T) -> bool

Does the partition contain an element?

fn dispatch(&self, elem: &T) -> usize

Dispatch an element to the correct subpartition