Type Alias bao_tree::ChunkRanges
source · pub type ChunkRanges = RangeSet2<ChunkNum>;Expand description
A set of chunk ranges
Aliased Type§
struct ChunkRanges(/* private fields */);Methods from Deref<Target = RangeSetRef<T>>§
sourcepub fn split(&self, at: T) -> (&RangeSetRef<T>, &RangeSetRef<T>)where
T: Ord,
pub fn split(&self, at: T) -> (&RangeSetRef<T>, &RangeSetRef<T>)where T: Ord,
Split this range set into two parts left, right at position at,
so that left is identical to self for all x < at
and right is identical to self for all x >= at.
More precisely: contains(left, x) == contains(ranges, x) for x < at contains(right, x) == contains(ranges, x) for x >= at
This is not the same as limiting the ranges to the left or right of
at, but it is much faster. It requires just a binary search and no
allocations.
sourcepub fn boundaries(&self) -> &[T]
pub fn boundaries(&self) -> &[T]
The boundaries of the range set, guaranteed to be strictly sorted
sourcepub fn contains(&self, value: &T) -> boolwhere
T: Ord,
pub fn contains(&self, value: &T) -> boolwhere T: Ord,
true if the value is contained in the range set
sourcepub fn is_all(&self) -> boolwhere
T: RangeSetEntry,
pub fn is_all(&self) -> boolwhere T: RangeSetEntry,
true if the range set contains all values
sourcepub fn intersects(&self, that: &RangeSetRef<T>) -> boolwhere
T: Ord,
pub fn intersects(&self, that: &RangeSetRef<T>) -> boolwhere T: Ord,
true if this range set intersects from another range set
This is just the opposite of is_disjoint, but is provided for
better discoverability.
sourcepub fn is_disjoint(&self, that: &RangeSetRef<T>) -> boolwhere
T: Ord,
pub fn is_disjoint(&self, that: &RangeSetRef<T>) -> boolwhere T: Ord,
true if this range set is disjoint from another range set
sourcepub fn is_subset(&self, that: &RangeSetRef<T>) -> boolwhere
T: Ord,
pub fn is_subset(&self, that: &RangeSetRef<T>) -> boolwhere T: Ord,
true if this range set is a superset of another range set
A range set is considered to be a superset of itself
sourcepub fn is_superset(&self, that: &RangeSetRef<T>) -> boolwhere
T: Ord,
pub fn is_superset(&self, that: &RangeSetRef<T>) -> boolwhere T: Ord,
true if this range set is a subset of another range set
A range set is considered to be a subset of itself
sourcepub fn intersection<A>(&self, that: &RangeSetRef<T>) -> RangeSet<A>where
A: Array<Item = T>,
T: Ord + Clone,
pub fn intersection<A>(&self, that: &RangeSetRef<T>) -> RangeSet<A>where A: Array<Item = T>, T: Ord + Clone,
intersection
sourcepub fn union<A>(&self, that: &RangeSetRef<T>) -> RangeSet<A>where
A: Array<Item = T>,
T: Ord + Clone,
pub fn union<A>(&self, that: &RangeSetRef<T>) -> RangeSet<A>where A: Array<Item = T>, T: Ord + Clone,
union
sourcepub fn difference<A>(&self, that: &RangeSetRef<T>) -> RangeSet<A>where
A: Array<Item = T>,
T: Ord + Clone,
pub fn difference<A>(&self, that: &RangeSetRef<T>) -> RangeSet<A>where A: Array<Item = T>, T: Ord + Clone,
difference
sourcepub fn symmetric_difference<A>(&self, that: &RangeSetRef<T>) -> RangeSet<A>where
A: Array<Item = T>,
T: Ord + Clone,
pub fn symmetric_difference<A>(&self, that: &RangeSetRef<T>) -> RangeSet<A>where A: Array<Item = T>, T: Ord + Clone,
symmetric difference (xor)