Struct tantivy_common::TinySet

pub struct TinySet(/* private fields */);

Implementations

impl TinySet

pub fn serialize<T: Write>(&self, writer: &mut T) -> Result<()>

pub fn into_bytes(self) -> [u8; 8]

pub fn deserialize(data: [u8; 8]) -> Self

pub fn empty() -> TinySet

Returns an empty TinySet.

pub fn full() -> TinySet

Returns a full TinySet.

pub fn clear(&mut self)

pub fn contains(self, el: u32) -> bool

Returns true iff the TinySet contains the element el.

pub fn len(self) -> u32

Returns the number of elements in the TinySet.

pub fn intersect(self, other: TinySet) -> TinySet

Returns the intersection of self and other

pub fn singleton(el: u32) -> TinySet

Creates a new TinySet containing only one element within [0; 64[

pub fn insert(self, el: u32) -> TinySet

Insert a new element within [0..64)

pub fn remove(self, el: u32) -> TinySet

Removes an element within [0..64)

pub fn insert_mut(&mut self, el: u32) -> bool

Insert a new element within [0..64)

returns true if the set changed

pub fn remove_mut(&mut self, el: u32) -> bool

Remove a element within [0..64)

returns true if the set changed

pub fn union(self, other: TinySet) -> TinySet

Returns the union of two tinysets

pub fn is_empty(self) -> bool

Returns true iff the TinySet is empty.

pub fn pop_lowest(&mut self) -> Option<u32>

Returns the lowest element in the TinySet and removes it.

pub fn range_lower(upper_bound: u32) -> TinySet

Returns a TinySet than contains all values up to limit excluded.

The limit is assumed to be strictly lower than 64.

pub fn range_greater_or_equal(from_included: u32) -> TinySet

Returns a TinySet that contains all values greater or equal to the given limit, included. (and up to 63)

The limit is assumed to be strictly lower than 64.

Trait Implementations

impl Clone for TinySet

fn clone(&self) -> TinySet

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TinySet

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

Formats the value using the given formatter.

impl IntoIterator for TinySet

type Item = u32

The type of the elements being iterated over.

type IntoIter = TinySetIterator

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for TinySet

fn eq(&self, other: &TinySet) -> 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 Copy for TinySet

impl Eq for TinySet

impl StructuralPartialEq for TinySet