Struct raknet::ds::RangeList

pub struct RangeList<const N: usize, I> { /* private fields */ }

Set of number stored as a set of non-adjacent, non-overlapping ranges

For a set with few gaps, this uses much less memory than a standard BTreeSet

Types

N is the number of continuous ranges that can be stored without needing to allocate space on the heap

I is the integer used for the elements

Implementations

impl<const N: usize, I> RangeList<N, I>

pub fn new() -> Self

Create a new sorted set

pub fn is_empty(&self) -> bool

impl<const N: usize, I> RangeList<N, I>where I: PartialOrd + Add<Output = I> + One + Copy,

pub fn contains(&self, v: I) -> bool

Check whether the inversion list contains this value

pub fn insert(&mut self, v: I)

Insert a new element

pub fn insert_all<It: IntoIterator<Item = I>>(&mut self, items: It)

Insert multiple elements from an iterator

pub fn clear(&mut self)

Clear all elements

pub fn min_max_ranges(&self) -> impl Iterator<Item = RangeInclusive<I>> + '_where I: Sub<Output = I>,

Return an iterator over all inclusive ranges

pub fn serialize(&mut self, bs: &mut BitStreamWrite)where I: Sub<Output = I> + WriteSafe,

pub fn deserialize(bs: &mut BitStreamRead<'_>) -> Result<Self>where I: ReadSafe,

Trait Implementations

impl<const N: usize, I> Debug for RangeList<N, I>where I: Add<Output = I> + One + PartialEq + Copy + Debug,

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

Formats the value using the given formatter.

impl<const N: usize, I> Default for RangeList<N, I>

fn default() -> Self

Returns the “default value” for a type.

impl<const N: usize, I: PartialEq> PartialEq<RangeList<N, I>> for RangeList<N, I>

fn eq(&self, other: &RangeList<N, I>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const N: usize, I: Eq> Eq for RangeList<N, I>

impl<const N: usize, I> StructuralEq for RangeList<N, I>

impl<const N: usize, I> StructuralPartialEq for RangeList<N, I>