Struct flatcontainer::impls::deduplicate::ConsecutiveOffsetPairs

pub struct ConsecutiveOffsetPairs<R, O = Vec<usize>>
where
    R: Region<Index = (usize, usize)>,
    O: OffsetContainer<usize>,
{ /* private fields */ }

Transform an index of (usize, usize) to a sequence of 0... Requires the pairs to be dense, i.e., (i, j) is followed by (j, k).

Defers to region R for storing items, and uses offset container O to remeber indices. By default, O is Vec<usize>.

Examples

The following example shows that two inserts into a copy region have a collapsible index:

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

let index: usize = b"abc"[..].copy_onto(&mut r);
assert_eq!(b"abc", r.index(index));

Trait Implementations

impl<R, O> Clone for ConsecutiveOffsetPairs<R, O>

where R: Region<Index = (usize, usize)> + Clone, O: OffsetContainer<usize> + Clone,

fn clone(&self) -> ConsecutiveOffsetPairs<R, O>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<R, O> Debug for ConsecutiveOffsetPairs<R, O>

where R: Region<Index = (usize, usize)> + Debug, O: OffsetContainer<usize> + Debug,

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

Formats the value using the given formatter.

impl<R: Region<Index = (usize, usize)>, O: OffsetContainer<usize>> Default for ConsecutiveOffsetPairs<R, O>

fn default() -> Self

Returns the “default value” for a type.

impl<R: Region<Index = (usize, usize)>, O: OffsetContainer<usize>> Region for ConsecutiveOffsetPairs<R, O>

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 = usize

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