Struct uset::core::uset::EMPTY_SET

pub struct EMPTY_SET { /* fields omitted */ }

Methods from Deref<Target = USet>

pub fn len(&self) -> usize

Returns the number of elements in the set, also referred to as its 'length'.

Examples

use self::uset::core::uset::*;

let set = USet::from_slice(&[1, 2, 3]);
assert_eq!(set.len(), 3);

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

Examples

use self::uset::core::uset::*;

let mut set = USet::new();
assert!(set.is_empty());

set.push(1);
assert!(!set.is_empty());

pub fn capacity(&self) -> usize

Returns the number of elements the set can hold without reallocating.

Examples

use self::uset::core::uset::*;

let set: USet = USet::with_capacity(10);
assert_eq!(set.capacity(), 10);

pub fn is_subset_of(&self, other: &USet) -> bool

Returns true if self is a subset of other. Note that every set is a subset of itself, even if empty, and an empty set is a subset of every other set.

Examples

use self::uset::core::uset::*;

let set1 = USet::from_slice(&[1, 2, 3]);
let set2 = USet::from_slice(&[2, 3]);
assert!(set2.is_subset_of(&set1));
assert!(!set1.is_subset_of(&set2));
assert!(set2.is_subset_of(&set2));

let set3 = USet::from_slice(&[2, 3, 4]);
assert!(!set1.is_subset_of(&set3));
assert!(set2.is_subset_of(&set3));

let set4 = USet::new();
assert!(set4.is_subset_of(&set1));
assert!(set4.is_subset_of(&set4));

Important traits for USetIter<'a>

impl<'a> Iterator for USetIter<'a> type Item = usize;

pub fn iter(&self) -> USetIter

Returns an iterator over the set.

Examples

use self::uset::core::uset::*;

let set = USet::from_slice(&[1, 2, 4]);
let mut iterator = set.iter();

assert_eq!(iterator.next(), Some(1));
assert_eq!(iterator.next(), Some(2));
assert_eq!(iterator.next(), Some(4));
assert_eq!(iterator.next(), None);

pub fn contains(&self, id: usize) -> bool

Returns true if the set contains the given id.

Examples

use self::uset::core::uset::*;

let mut set = USet::new();
set.push(1);
assert_eq!(set.contains(1), true);
assert_eq!(set.contains(2), false);

pub fn at_index(&self, index: usize) -> Option<usize>

The set allows to access its values by index. It's the same as if the user created the iterator and took the n-th element. USet does not implement the Index trait because I don't even.

Examples

use self::uset::core::uset::*;

let set = USet::from_slice(&[2,3,4]);
assert_eq!(set.at_index(0), Some(2));
assert_eq!(set.at_index(1), Some(3));
assert_eq!(set.at_index(2), Some(4));
assert_eq!(set.at_index(3), None);

pub fn min(&self) -> Option<usize>

Returns the smallest element in the set or None if the set is empty.

use self::uset::core::uset::*;

let mut set = USet::new();
assert_eq!(set.min(), None);

set.push(2);
assert_eq!(set.min(), Some(2));

set.push(3);
assert_eq!(set.min(), Some(2));

set.push(1);
assert_eq!(set.min(), Some(1));

pub fn max(&self) -> Option<usize>

Returns the largest element in the set or None if the set is empty.

use self::uset::core::uset::*;

let mut set = USet::new();
assert_eq!(set.min(), None);

set.push(2);
assert_eq!(set.max(), Some(2));

set.push(3);
assert_eq!(set.max(), Some(3));

set.push(1);
assert_eq!(set.max(), Some(3));

Trait Implementations

impl Deref for EMPTY_SET

type Target = USet

The resulting type after dereferencing.

fn deref(&self) -> &USet

Dereferences the value.

impl LazyStatic for EMPTY_SET

fn initialize(lazy: &Self)