Struct VecPartitioningScheme 

pub struct VecPartitioningScheme<E: Entity> { /* private fields */ }

Use a vector for partitioning. Binary search will be used to find the appropriate partition.

Trait Implementations

impl<E: Debug + Entity> Debug for VecPartitioningScheme<E>

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

Formats the value using the given formatter.

impl<E: Entity> From<Vec<E>> for VecPartitioningScheme<E>

fn from(entities: Vec<E>) -> Self

Converts to this type from the input type.

impl<E: Entity> PartitioningScheme<E> for VecPartitioningScheme<E>

fn is_empty(&self) -> bool

Whether the partitioning scheme has dividers.

fn len(&self) -> usize

The number of partition dividers. There will be one more partition than this number.

fn partition(&self, partition: usize) -> E

Return the entity that serves as an upper-bound on partition.

fn lower_bound(&self, entity: E) -> usize

Compute the first partition in which the entity could reside.