Struct raii_map::set::Set [−][src]
A set in which the presence of an entry is tied to the lifetime of a RAII handle returned by the insertion.
Implementations
impl<T: Ord> Set<T>[src]
pub fn new() -> Self[src]
Creates a new, empty set.
pub fn len(&self) -> usize[src]
Gets the number of items in the set.
pub fn is_empty(&self) -> bool[src]
Checks if the set is empty.
pub fn iter(&self) -> Iter<'_, T>[src]
Gets an iterator over the contents of the set.
Trait Implementations
impl<T: Debug> Debug for Set<T>[src]
impl<T: Ord> Default for Set<T>[src]
impl<T: Eq> Eq for Set<T>[src]
impl<T: Ord> IntoIterator for Set<T>[src]
type Item = T
The type of the elements being iterated over.
type IntoIter = <BTreeSet<T> as IntoIterator>::IntoIter
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter[src]
impl<'a, T: Ord> IntoIterator for &'a Set<T>[src]
type Item = &'a T
The type of the elements being iterated over.
type IntoIter = <&'a BTreeSet<T> as IntoIterator>::IntoIter
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter[src]
impl<T: PartialEq> PartialEq<Set<T>> for Set<T>[src]
impl<T> StructuralEq for Set<T>[src]
impl<T> StructuralPartialEq for Set<T>[src]
Auto Trait Implementations
impl<T> Send for Set<T> where
T: Send,
T: Send,
impl<T> Sync for Set<T> where
T: Sync,
T: Sync,
impl<T> Unpin for Set<T>
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,
pub 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.
pub 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>,