Struct prefix_tree::PrefixTreeSet

pub struct PrefixTreeSet<T> { /* fields omitted */ }

A set implemented as a PrefixTreeMap where the value is ().

Methods

impl<T: Eq + Clone> PrefixTreeSet<T>

pub fn new() -> PrefixTreeSet<T>

Creates an empty PrefixTreeSet.

Examples

use prefix_tree::PrefixTreeSet;

let mut set: PrefixTreeSet<u8> = PrefixTreeSet::new();

pub fn clear(&mut self)

Clears the set, removing all key-value pairs.

Examples

use prefix_tree::PrefixTreeSet;

let mut set: PrefixTreeSet<u8> = PrefixTreeSet::new();
set.insert("foo");
set.clear();
assert!(set.is_empty());

pub fn contains<Q>(&self, key: Q) -> bool where
    Q: AsRef<[T]>, 

Returns true if the set contains a value.

Examples

use prefix_tree::PrefixTreeSet;

let mut set: PrefixTreeSet<u8> = PrefixTreeSet::new();
set.insert("1");
assert_eq!(set.contains("1"), true);
assert_eq!(set.contains("2"), false);

pub fn insert<Q>(&mut self, key: Q) -> bool where
    Q: AsRef<[T]>, 

Adds a value to the set.

Examples

use prefix_tree::PrefixTreeSet;

let mut set: PrefixTreeSet<u8> = PrefixTreeSet::new();
assert_eq!(set.insert("1"), true);
assert_eq!(set.insert("1"), false);
assert_eq!(set.contains("1"), true);

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

Examples

use prefix_tree::PrefixTreeSet;

let mut set: PrefixTreeSet<u8> = PrefixTreeSet::new();
assert_eq!(set.is_empty(), true);
set.insert("foo");
assert_eq!(set.is_empty(), false);

pub fn len(&self) -> usize

Returns the number of elements in the set.

Examples

use prefix_tree::PrefixTreeSet;

let mut set: PrefixTreeSet<u8> = PrefixTreeSet::new();
assert_eq!(set.len(), 0);
set.insert("foo");
assert_eq!(set.len(), 1);

Trait Implementations

impl<T: Debug> Debug for PrefixTreeSet<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for PrefixTreeSet<T>

fn default() -> PrefixTreeSet<T>

Returns the "default value" for a type.