[−][src]Struct prefix_tree::PrefixSet
A set implemented as a PrefixMap
where the value is ()
.
Methods
impl<T: Eq + Clone> PrefixSet<T>
[src]
pub fn new() -> PrefixSet<T>
[src]
Creates an empty PrefixSet
.
Examples
use prefix_tree::PrefixSet; let mut set: PrefixSet<u8> = PrefixSet::new();
pub fn clear(&mut self)
[src]
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]>,
[src]
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]>,
[src]
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]>,
[src]
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
[src]
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
[src]
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>
[src]
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>
[src]
impl<T: Default> Default for PrefixSet<T>
[src]
impl<T: Eq + Clone> Eq for PrefixSet<T>
[src]
impl<'a, T: 'a + Eq + Clone> FromIterator<&'a [T]> for PrefixSet<T>
[src]
fn from_iter<I>(iter: I) -> PrefixSet<T> where
I: IntoIterator<Item = &'a [T]>,
[src]
I: IntoIterator<Item = &'a [T]>,
impl<T: Eq + Clone + Hash> Hash for PrefixSet<T>
[src]
fn hash<H: Hasher>(&self, state: &mut H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<'a, T: 'a + Eq + Clone> IntoIterator for &'a PrefixSet<T>
[src]
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
[src]
impl<T: Eq + Clone> PartialEq<PrefixSet<T>> for PrefixSet<T>
[src]
Auto Trait Implementations
impl<T> RefUnwindSafe for PrefixSet<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for PrefixSet<T> where
T: Send,
T: Send,
impl<T> Sync for PrefixSet<T> where
T: Sync,
T: Sync,
impl<T> Unpin for PrefixSet<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for PrefixSet<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,