Struct flatcontainer::impls::deduplicate::CollapseSequence

pub struct CollapseSequence<R: Region> { /* private fields */ }

A region to deduplicate consecutive equal items.

Examples

The following example shows that two inserts can result in the same index.

use flatcontainer::impls::deduplicate::CollapseSequence;
use flatcontainer::{CopyOnto, StringRegion};
let mut r = <CollapseSequence<StringRegion>>::default();

assert_eq!("abc".copy_onto(&mut r), "abc".copy_onto(&mut r));

Trait Implementations

impl<R: Clone + Region> Clone for CollapseSequence<R>

where R::Index: Clone,

fn clone(&self) -> CollapseSequence<R>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<R: Region, T> CopyOnto<CollapseSequence<R>> for T

where for<'a> T: PartialEq<R::ReadItem<'a>> + CopyOnto<R>, for<'a, 'b> R::ReadItem<'a>: PartialEq<R::ReadItem<'b>>,

fn copy_onto( self, target: &mut CollapseSequence<R> ) -> <CollapseSequence<R> as Region>::Index

Copy self into the target container, returning an index that allows to look up the corresponding read item.

impl<R: Debug + Region> Debug for CollapseSequence<R>

where R::Index: Debug,

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

Formats the value using the given formatter.

impl<R: Region> Default for CollapseSequence<R>

fn default() -> Self

Returns the “default value” for a type.

impl<R: Region> Region for CollapseSequence<R>

where for<'a, 'b> R::ReadItem<'a>: PartialEq<R::ReadItem<'b>>,

type ReadItem<'a> = <R as Region>::ReadItem<'a> where Self: 'a

The type of the data that one gets out of the container.

type Index = <R as Region>::Index

The type to index into the container. Should be treated as an opaque type, even if known.

fn merge_regions<'a>(regions: impl Iterator<Item = &'a Self> + Clone) -> Self

where Self: 'a,

Construct a region that can absorb the contents of regions in the future.

fn index(&self, index: Self::Index) -> Self::ReadItem<'_>

Index into the container. The index must be obtained by pushing data into the container.

fn reserve_regions<'a, I>(&mut self, regions: I)

where Self: 'a, I: Iterator<Item = &'a Self> + Clone,

Ensure that the region can absorb the items of regions without reallocation

fn clear(&mut self)

Remove all elements from this region, but retain allocations if possible.

fn heap_size<F: FnMut(usize, usize)>(&self, callback: F)

Heap size, size - capacity