Struct Set 

pub struct Set { /* private fields */ }

A Python set.

A dict with nothing in the values, which is what CPython’s set was before it got a structure of its own. The saving from splitting them is one word an element, and it is worth taking once the semantics have stopped moving.

Implementations

impl Set

pub const fn new() -> Self

An empty set.

pub const fn len(&self) -> usize

How many members it has.

pub const fn is_empty(&self) -> bool

Whether there are none.

pub fn contains(&self, value: &Key) -> bool

Whether this value is in it.

pub fn insert(&mut self, value: Key) -> bool

Puts a value in, and says whether it was not already there.

pub fn remove(&mut self, value: &Key) -> bool

Takes a value out, and says whether it was there.

pub fn iter(&self) -> impl Iterator<Item = &Key>

The members.

In insertion order, which is not something a set promises and not something CPython gives, so nothing may lean on it.

pub fn member_at(&self, from: usize) -> Option<(&Key, usize)>

The next member at or after a raw position, and where to look next.

See Dict::entry_at, which this is.

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

Whether two sets have the same members.

Trait Implementations

impl Clone for Set

fn clone(&self) -> Set

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Set

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

Formats the value using the given formatter.

impl Default for Set

fn default() -> Set

Returns the “default value” for a type.

impl FromIterator<Key> for Set

fn from_iter<I: IntoIterator<Item = Key>>(values: I) -> Self

Creates a value from an iterator.