Struct ArraySet 

pub struct ArraySet { /* private fields */ }

Implementations

impl ArraySet

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

pub fn contains(&self, key: u8) -> bool

Trait Implementations

impl Clone for ArraySet

fn clone(&self) -> ArraySet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for ArraySet

fn default() -> ArraySet

Returns the “default value” for a type.

impl Equivalent<ArrayMap<()>> for ArraySet

fn into_equivalent(self) -> ArrayMap<()>

Inverse of Equivalent::from_equivalent.

fn from_equivalent(_: ArrayMap<()>) -> Self

Inverse of Equivalent::into_equivalent.

impl Extend<u8> for ArraySet

fn extend<T: IntoIterator<Item = u8>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<const N: usize> From<[u8; N]> for ArraySet

fn from(value: [u8; N]) -> Self

Converts to this type from the input type.

impl FromIterator<u8> for ArraySet

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

Creates a value from an iterator.

impl InlineOutput for ArraySet

where BitArray<[u8; 32]>: InlineOutput,

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

where Self: Sized,

impl ListHashes for ArraySet

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

fn topology_hash(&self) -> Hash

fn point_count(&self) -> usize

impl MaybeHasNiche for ArraySet

where BitArray<[u8; 32]>: MaybeHasNiche<MnArray: MnArray<MaybeNiche: MaybeNiche>>,

type MnArray = TArr<<<BitArray<[u8; 32]> as MaybeHasNiche>::MnArray as MnArray>::MaybeNiche, ATerm>

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

where BitArray<[u8; 32]>: Parse<__I>,

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

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

where BitArray<[u8; 32]>: ParseInline<__I>,

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

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

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

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

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

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

where N: ArrayLength,

impl Size for ArraySet

where TArr<U0, TArr<<BitArray<[u8; 32]> as Size>::Size, ATerm>>: FoldAdd<Output: Unsigned>,

const SIZE: usize = <Bits as ::object_rainbow::Size>::SIZE

type Size = <TArr<UTerm, TArr<<BitArray<[u8; 32]> as Size>::Size, ATerm>> as FoldAdd>::Output

impl Tagged for ArraySet

const TAGS: Tags = <Bits as ::object_rainbow::Tagged>::TAGS

const HASH: Hash = _

impl ToOutput for ArraySet

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

fn data_hash(&self) -> Hash

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

where T: Output + Default,

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

impl Topological for ArraySet

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

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