Struct OwnedSet 

pub struct OwnedSet<K>(/* private fields */);

An ordinary ordered set with exact node layouts and the same enclosing-owner admission contract as OwnedMap.

Implementations

impl<K> OwnedSet<K>

pub fn new() -> Self

pub const fn entry_bytes() -> usize

pub fn allocated_bytes(&self) -> usize

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> OwnedSetIter<'_, K>

impl<K: Ord> OwnedSet<K>

pub fn insert(&mut self, key: K) -> bool

pub fn contains<Q: Ord + ?Sized>(&self, key: &Q) -> bool

where K: Borrow<Q>,

Trait Implementations

impl<K: Ord + Clone> Clone for OwnedSet<K>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Debug> Debug for OwnedSet<K>

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

Formats the value using the given formatter.

impl<K> Default for OwnedSet<K>

fn default() -> Self

Returns the “default value” for a type.

impl<K: Eq> Eq for OwnedSet<K>

impl<K: Ord> FromIterator<K> for OwnedSet<K>

fn from_iter<T: IntoIterator<Item = K>>(iter: T) -> Self

Creates a value from an iterator.

impl<'a, K> IntoIterator for &'a OwnedSet<K>

type Item = &'a K

The type of the elements being iterated over.

type IntoIter = OwnedSetIter<'a, K>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K> IntoIterator for OwnedSet<K>

type Item = K

The type of the elements being iterated over.

type IntoIter = OwnedSetIntoIter<K>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K: PartialEq> PartialEq for OwnedSet<K>

fn eq(&self, other: &Self) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<K: PartialEq> StructuralPartialEq for OwnedSet<K>