std​::collections

Modules

bitvbtreedlistenum_sethashmaplru_cachepriority_queueringbufsmallintmaptreemaptrie

Structs

BTreeBitvBitvSetDListEnumSetPriorityQueueRingBufSmallIntMapTreeMapTreeSetTrieMapTrieSet

Traits

CollectionDequeMapMutableMutableMapMutableSetSet

Struct std::collections::TrieSet[src]

pub struct TrieSet {
    // some fields omitted
}

Methods

impl TrieSet

fn new() -> TrieSet

Create an empty TrieSet

fn each_reverse(&self, f: |&uint| -> bool) -> bool

Visit all values in reverse order

fn iter(&'a self) -> SetItems<'a>

Get an iterator over the values in the set

fn lower_bound(&'a self, val: uint) -> SetItems<'a>

Get an iterator pointing to the first value that is not less than val. If all values in the set are less than val an empty iterator is returned.

fn upper_bound(&'a self, val: uint) -> SetItems<'a>

Get an iterator pointing to the first value that key is greater than val. If all values in the set are not greater than val an empty iterator is returned.

Trait Implementations

impl Collection for TrieSet

fn len(&self) -> uint

Return the number of elements in the set

fn is_empty(&self) -> bool

impl Mutable for TrieSet

fn clear(&mut self)

Clear the set, removing all values.

impl Set<uint> for TrieSet

fn contains(&self, value: &uint) -> bool

fn is_disjoint(&self, other: &TrieSet) -> bool

fn is_subset(&self, other: &TrieSet) -> bool

fn is_superset(&self, other: &TrieSet) -> bool

fn is_superset(&self, &TrieSet) -> bool

impl MutableSet<uint> for TrieSet

fn insert(&mut self, value: uint) -> bool

fn remove(&mut self, value: &uint) -> bool

impl Default for TrieSet

fn default() -> TrieSet

impl FromIterator<uint> for TrieSet

fn from_iter<Iter: Iterator<uint>>(iter: Iter) -> TrieSet

impl Extendable<uint> for TrieSet

fn extend<Iter: Iterator<uint>>(&mut self, iter: Iter)