Struct PrefixSet

pub struct PrefixSet<T> { /* private fields */ }

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

Implementations

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

pub fn new() -> PrefixSet<T>

Creates an empty PrefixSet.

Examples

use prefix_tree::PrefixSet;

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

pub fn clear(&mut self)

Clears the set, removing all key-value pairs.

Examples

use prefix_tree::PrefixSet;

let mut set: PrefixSet<u8> = PrefixSet::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::PrefixSet;

let mut set: PrefixSet<u8> = PrefixSet::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::PrefixSet;

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

pub fn remove<Q>(&mut self, key: Q) -> bool

where Q: AsRef<[T]>,

Removes a value from the set. Returns whether the value was present in the set.

Examples

use prefix_tree::PrefixSet;

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

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

Examples

use prefix_tree::PrefixSet;

let mut set: PrefixSet<u8> = PrefixSet::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::PrefixSet;

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

pub fn iter(&self) -> Iter<'_, T>

Gets an iterator that visits the values in PrefixSet.

Examples

use prefix_tree::PrefixSet;

let mut set: PrefixSet<u8> = PrefixSet::new();
set.insert("1");
set.insert("2");
let mut iter = set.iter();
assert_eq!(iter.next(), Some(vec![b'1']));
assert_eq!(iter.next(), Some(vec![b'2']));

Trait Implementations

impl<T: Debug> Debug for PrefixSet<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for PrefixSet<T>

fn default() -> PrefixSet<T>

Returns the “default value” for a type.

impl<'a, T: 'a + Eq + Clone> FromIterator<&'a [T]> for PrefixSet<T>

fn from_iter<I>(iter: I) -> PrefixSet<T>

where I: IntoIterator<Item = &'a [T]>,

Creates a value from an iterator.

impl<T: Eq + Clone + Hash> Hash for PrefixSet<T>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, T: 'a + Eq + Clone> IntoIterator for &'a PrefixSet<T>

type Item = Vec<T>

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Eq + Clone> PartialEq for PrefixSet<T>

fn eq(&self, other: &PrefixSet<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T: Eq + Clone> Eq for PrefixSet<T>