Struct HamtSet 

pub struct HamtSet(/* private fields */);

Implementations

impl HamtSet

pub fn new() -> Self

pub async fn insert(&mut self, hash: Hash) -> Result<bool>

pub async fn remove(&mut self, hash: Hash) -> Result<bool>

pub async fn contains(&self, hash: Hash) -> Result<bool>

pub async fn append(&mut self, other: &mut Self) -> Result<()>

pub async fn intersect(&mut self, other: &Self) -> Result<()>

pub async fn subtract(&mut self, other: &Self) -> Result<()>

pub fn is_empty(&self) -> bool

pub fn clear(&mut self)

Trait Implementations

impl Clone for HamtSet

fn clone(&self) -> HamtSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for HamtSet

fn default() -> HamtSet

Returns the “default value” for a type.

impl InlineOutput for HamtSet

where HamtMap<()>: InlineOutput,

fn slice_to_output(slice: &[Self], output: &mut impl Output)

where Self: Sized,

impl ListHashes for HamtSet

fn list_hashes(&self, visitor: &mut impl FnMut(Hash))

fn topology_hash(&self) -> Hash

fn point_count(&self) -> usize

impl MaybeHasNiche for HamtSet

where HamtMap<()>: MaybeHasNiche<MnArray: MnArray<MaybeNiche: MaybeNiche>>,

type MnArray = TArr<<<HamtMap<()> as MaybeHasNiche>::MnArray as MnArray>::MaybeNiche, ATerm>

Should implement MnArray. Not constraint explicitly, because that breaks things.

impl<__I: ParseInput> Parse<__I> for HamtSet

where HamtMap<()>: Parse<__I>,

fn parse(input: __I) -> Result<Self>

Parse consuming the whole stream.

impl<__I: ParseInput> ParseInline<__I> for HamtSet

where HamtMap<()>: ParseInline<__I>,

fn parse_inline(input: &mut __I) -> Result<Self>

Parse without consuming the whole stream. Errors on unexpected EOF.

fn parse_as_inline(input: I) -> Result<Self, Error>

For implementing Parse::parse.

fn parse_vec(input: I) -> Result<Vec<Self>, Error>

Parse a Vec of Self. Customisable for optimisations.

fn parse_vec_n(input: &mut I, n: usize) -> Result<Vec<Self>, Error>

Parse a Vec of Self of length n. Customisable for optimisations.

fn parse_array<const N: usize>(input: &mut I) -> Result<[Self; N], Error>

Parse an array of Self. Customisable for optimisations.

fn parse_generic_array<N>(input: &mut I) -> Result<GenericArray<Self, N>, Error>

where N: ArrayLength,

Parse a GenericArray of Self. Customisable for optimisations.

impl PartialEq for HamtSet

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl Size for HamtSet

where TArr<U0, TArr<<HamtMap<()> as Size>::Size, ATerm>>: FoldAdd<Output: Unsigned>,

const SIZE: usize = <HamtMap<()> as ::object_rainbow::Size>::SIZE

type Size = <TArr<UTerm, TArr<<HamtMap<()> as Size>::Size, ATerm>> as FoldAdd>::Output

impl Tagged for HamtSet

const TAGS: Tags = <HamtMap<()> as ::object_rainbow::Tagged>::TAGS

const HASH: Hash = _

impl ToOutput for HamtSet

fn to_output(&self, output: &mut impl Output)

fn data_hash(&self) -> Hash

fn mangle_hash(&self) -> Hash

fn output<T>(&self) -> T

where T: Output + Default,

fn vec(&self) -> Vec<u8>

impl Topological for HamtSet

fn traverse(&self, visitor: &mut impl PointVisitor)

fn topology(&self) -> Vec<Arc<dyn Singular>>

impl Eq for HamtSet

impl StructuralPartialEq for HamtSet