Struct IntervalSet 

pub struct IntervalSet { /* private fields */ }

A sorted, coalesced set of disjoint byte ranges.

Implementations

impl IntervalSet

pub fn new() -> Self

pub fn full(size: u64) -> Self

The full range [0, size).

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn ranges(&self) -> &[Range]

pub fn total(&self) -> u64

Total bytes covered.

pub fn take_front(&mut self, n: u64) -> Option<Range>

Remove and return up to n bytes from the lowest range.

Front-to-back allocation keeps the set small (usually one range) and makes sequential-write patterns friendly to the OS page cache.

pub fn insert(&mut self, r: Range)

Insert a range, coalescing with neighbours. Overlapping inserts are merged rather than duplicated, so re-inserting a reclaimed range that partially overlaps an existing gap is safe.

pub fn remove(&mut self, lo: u64, hi: u64)

Remove [lo, hi) from the set, splitting ranges as needed.

pub fn invariant_holds(&self) -> bool

True when every range is non-empty, sorted, and strictly disjoint from its neighbours (i.e. the coalescing invariant holds).

Trait Implementations

impl Clone for IntervalSet

fn clone(&self) -> IntervalSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IntervalSet

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

Formats the value using the given formatter.

impl Default for IntervalSet

fn default() -> IntervalSet

Returns the “default value” for a type.