Struct rkyv::collections::btree_set::ArchivedBTreeSet

#[repr(transparent)]
pub struct ArchivedBTreeSet<K>(_);

An archived BTreeSet. This is a wrapper around a B-tree map with the same key and a value of ().

Implementations

impl<K> ArchivedBTreeSet<K>

pub fn contains_key<Q: Ord + ?Sized>(&self, key: &Q) -> boolwhere K: Borrow<Q> + Ord,

Returns true if the set contains a value for the specified key.

The key may be any borrowed form of the set’s key type, but the ordering on the borrowed form must match the ordering on the key type.

pub fn get<Q: Ord + ?Sized>(&self, value: &Q) -> Option<&K>where K: Borrow<Q> + Ord,

Returns a reference to the value int he set, if any, that is equal to the given value.

The value may be any borrowed form of the set’s value type, but the ordering on the borrowed form must match the ordering on the value type.

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

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

Gets an iterator over the keys of the set, in sorted order.

pub fn len(&self) -> usize

Returns the number of items in the archived B-tree set.

pub unsafe fn resolve_from_len( len: usize, pos: usize, resolver: BTreeSetResolver, out: *mut Self )

Resolves a B-tree set from its length.

Safety

• len must be the number of elements that were serialized
• pos must be the position of out within the archive
• resolver must be the result of serializing a B-tree set

impl<K> ArchivedBTreeSet<K>

pub unsafe fn serialize_from_reverse_iter<'a, UK, S, I>( iter: I, serializer: &mut S ) -> Result<BTreeSetResolver, S::Error>where UK: 'a + Serialize<S, Archived = K>, S: Serializer + ?Sized, I: ExactSizeIterator<Item = &'a UK>,

Serializes an ordered iterator of key-value pairs as a B-tree map.

Safety

• Keys returned by the iterator must be unique
• Keys must be in reverse sorted order from last to first

Trait Implementations

impl<__C: ?Sized, K> CheckBytes<__C> for ArchivedBTreeSet<K>where ArchivedBTreeMap<K, ()>: CheckBytes<__C>,

type Error = TupleStructCheckError

The error that may result from checking the type.

unsafe fn check_bytes<'__bytecheck>( value: *const Self, context: &mut __C ) -> Result<&'__bytecheck Self, TupleStructCheckError>

Checks whether the given pointer points to a valid value within the given context.

impl<K: Debug> Debug for ArchivedBTreeSet<K>

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

Formats the value using the given formatter.

impl<K, D> Deserialize<BTreeSet<K, Global>, D> for ArchivedBTreeSet<K::Archived>where K: Archive + Ord, K::Archived: Deserialize<K, D> + Ord, D: Fallible + ?Sized,

fn deserialize(&self, deserializer: &mut D) -> Result<BTreeSet<K>, D::Error>

Deserializes using the given deserializer

impl<K: Hash> Hash for ArchivedBTreeSet<K>

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, K> IntoIterator for &'a ArchivedBTreeSet<K>

type Item = &'a K

The type of the elements being iterated over.

type IntoIter = Keys<'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: Ord> Ord for ArchivedBTreeSet<K>

fn cmp(&self, other: &ArchivedBTreeSet<K>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<K, AK: PartialEq<K>> PartialEq<ArchivedBTreeSet<AK>> for BTreeSet<K>

fn eq(&self, other: &ArchivedBTreeSet<AK>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<K: PartialEq> PartialEq<ArchivedBTreeSet<K>> for ArchivedBTreeSet<K>

fn eq(&self, other: &ArchivedBTreeSet<K>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<K, AK: PartialEq<K>> PartialEq<BTreeSet<K, Global>> for ArchivedBTreeSet<AK>

fn eq(&self, other: &BTreeSet<K>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<K: PartialOrd> PartialOrd<ArchivedBTreeSet<K>> for ArchivedBTreeSet<K>

fn partial_cmp(&self, other: &ArchivedBTreeSet<K>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<K: Eq> Eq for ArchivedBTreeSet<K>

impl<K> StructuralEq for ArchivedBTreeSet<K>

impl<K> StructuralPartialEq for ArchivedBTreeSet<K>