Struct Intersection

pub struct Intersection<S0, S1> { /* private fields */ }

Trait Implementations

impl<S0, S1> Borrowable for Intersection<S0, S1>

type Borrowed = Intersection<S0, S1>

Borrowed = Self

impl<S0, S1> HibitTree for Intersection<S0, S1>

where S0: Borrowable<Borrowed: HibitTree>, S1: Borrowable<Borrowed: HibitTree<LevelCount = <S0::Borrowed as HibitTree>::LevelCount, LevelMask = <S0::Borrowed as HibitTree>::LevelMask>>,

type DefaultData = <<<S0 as Borrowable>::Borrowed as HibitTree>::DefaultData as ConstBool>::And<<<S1 as Borrowable>::Borrowed as HibitTree>::DefaultData>

true if S0 & S1 are having DefaultData.

const EXACT_HIERARCHY: bool = false

Marker that this tree as a bitmap hierarchy does not have false-positive bits in bitmasks.

type LevelCount = <<S0 as Borrowable>::Borrowed as HibitTree>::LevelCount

Hierarchy levels count (without a data level).

type LevelMask = <<S0 as Borrowable>::Borrowed as HibitTree>::LevelMask

Bitmask used in each Node.

fn data( &self, index: &HierarchyIndex<Self::LevelMask, Self::LevelCount>, ) -> Option<<Self as HibitTreeTypes<'_>>::Data>

Safety

unsafe fn data_unchecked( &self, index: &HierarchyIndex<Self::LevelMask, Self::LevelCount>, ) -> <Self as HibitTreeTypes<'_>>::DataUnchecked

Safety

unsafe fn data_or_default( &self, index: &HierarchyIndex<Self::LevelMask, Self::LevelCount>, ) -> <Self as HibitTreeTypes<'_>>::DataOrDefault

Safety

fn get( &self, index: impl TryInto<HierarchyIndex<<Self as HibitTree>::LevelMask, Self::LevelCount>>, ) -> Option<<Self as HibitTreeTypes<'_>>::Data>

You can use usize or HierarchyIndex for index.

unsafe fn get_unchecked( &self, index: impl TryInto<HierarchyIndex<<Self as HibitTree>::LevelMask, Self::LevelCount>>, ) -> <Self as HibitTreeTypes<'_>>::DataUnchecked

Safety

fn get_or_default( &self, index: impl TryInto<HierarchyIndex<<Self as HibitTree>::LevelMask, Self::LevelCount>>, ) -> <Self as HibitTreeTypes<'_>>::DataOrDefault

where Self::DefaultData: IsConstTrue,

Panic

fn iter(&self) -> Iter<'_, Self>

fn map<F>(self, f: F) -> Map<Self, F>

where for<'a, 'b> F: UnaryFunction<<Self as HibitTreeTypes<'a>>::Data> + UnaryFunction<<Self as HibitTreeTypes<'a>>::DataUnchecked> + UnaryFunction<<Self as HibitTreeTypes<'a>>::DataOrDefault> + UnaryFunction<<<Self as HibitTreeTypes<'a>>::Cursor as HibitTreeCursorTypes<'b>>::Data> + UnaryFunction<<<Self as HibitTreeTypes<'a>>::Cursor as HibitTreeCursorTypes<'b>>::DataUnchecked> + UnaryFunction<<<Self as HibitTreeTypes<'a>>::Cursor as HibitTreeCursorTypes<'b>>::DataOrDefault>,

See crate::map

fn map_w_default<F>(self, f: F) -> Map<Self, F, ConstTrue>

where Self::DefaultData: IsConstTrue, for<'a, 'b> F: UnaryFunction<<Self as HibitTreeTypes<'a>>::Data> + UnaryFunction<<Self as HibitTreeTypes<'a>>::DataUnchecked> + UnaryFunction<<Self as HibitTreeTypes<'a>>::DataOrDefault> + UnaryFunction<<<Self as HibitTreeTypes<'a>>::Cursor as HibitTreeCursorTypes<'b>>::Data> + UnaryFunction<<<Self as HibitTreeTypes<'a>>::Cursor as HibitTreeCursorTypes<'b>>::DataUnchecked> + UnaryFunction<<<Self as HibitTreeTypes<'a>>::Cursor as HibitTreeCursorTypes<'b>>::DataOrDefault>,

See crate::map_w_default

fn ref_map<F>(&self, f: F) -> Map<&Self, F>

where for<'a, 'b> F: UnaryFunction<<Self as HibitTreeTypes<'a>>::Data> + UnaryFunction<<Self as HibitTreeTypes<'a>>::DataUnchecked> + UnaryFunction<<Self as HibitTreeTypes<'a>>::DataOrDefault> + UnaryFunction<<<Self as HibitTreeTypes<'a>>::Cursor as HibitTreeCursorTypes<'b>>::Data> + UnaryFunction<<<Self as HibitTreeTypes<'a>>::Cursor as HibitTreeCursorTypes<'b>>::DataUnchecked> + UnaryFunction<<<Self as HibitTreeTypes<'a>>::Cursor as HibitTreeCursorTypes<'b>>::DataOrDefault>,

See crate::map

fn ref_map_w_default<F>(&self, f: F) -> Map<&Self, F, ConstTrue>

where Self::DefaultData: IsConstTrue, for<'a, 'b> F: UnaryFunction<<Self as HibitTreeTypes<'a>>::Data> + UnaryFunction<<Self as HibitTreeTypes<'a>>::DataUnchecked> + UnaryFunction<<Self as HibitTreeTypes<'a>>::DataOrDefault> + UnaryFunction<<<Self as HibitTreeTypes<'a>>::Cursor as HibitTreeCursorTypes<'b>>::Data> + UnaryFunction<<<Self as HibitTreeTypes<'a>>::Cursor as HibitTreeCursorTypes<'b>>::DataUnchecked> + UnaryFunction<<<Self as HibitTreeTypes<'a>>::Cursor as HibitTreeCursorTypes<'b>>::DataOrDefault>,

See crate::map_w_default

fn index_range() -> RangeTo<usize>

Index range this SparseHierarchy can handle - 0..width^depth.

impl<'this, S0, S1> HibitTreeTypes<'this> for Intersection<S0, S1>

where S0: Borrowable<Borrowed: HibitTree>, S1: Borrowable<Borrowed: HibitTree<LevelCount = <S0::Borrowed as HibitTree>::LevelCount, LevelMask = <S0::Borrowed as HibitTree>::LevelMask>>,

type Data = (<<S0 as Borrowable>::Borrowed as HibitTreeTypes<'this>>::Data, <<S1 as Borrowable>::Borrowed as HibitTreeTypes<'this>>::Data)

type DataUnchecked = (<<S0 as Borrowable>::Borrowed as HibitTreeTypes<'this>>::DataUnchecked, <<S1 as Borrowable>::Borrowed as HibitTreeTypes<'this>>::DataUnchecked)

type DataOrDefault = (<<S0 as Borrowable>::Borrowed as HibitTreeTypes<'this>>::DataOrDefault, <<S1 as Borrowable>::Borrowed as HibitTreeTypes<'this>>::DataOrDefault)

type Cursor = Cursor<'this, S0, S1>

impl<S0, S1> LazyHibitTree for Intersection<S0, S1>

where Intersection<S0, S1>: RegularHibitTree,

fn materialize<T>(self) -> T

where Self: RegularHibitTree, T: FromHibitTree<Self, LevelMask = Self::LevelMask, LevelCount = Self::LevelCount>,

Make a concrete collection from a lazy/virtual one.

fn materialize_filtered<T, F>(self, f: F) -> T

where Self: RegularHibitTree, T: FromHibitTree<Self, LevelMask = Self::LevelMask, LevelCount = Self::LevelCount>, for<'a, 'b> F: UnaryFunction<&'a HibitTreeData<'b, Self>, Output = bool>,