Struct AppendTree 

pub struct AppendTree<T> { /* private fields */ }

Implementations

impl<T: Send + Sync + Clone + Traversible + InlineOutput> AppendTree<T>

pub const fn new() -> Self

pub async fn get(&self, index: u64) -> Result<Option<T>>

pub fn push(&mut self, value: T) -> Result<(), PushError<T>>

pub fn is_empty(&self) -> bool

pub fn len(&self) -> u64

pub fn last(&self) -> Option<&T>

Trait Implementations

impl<T: Clone> Clone for AppendTree<T>

fn clone(&self) -> AppendTree<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for AppendTree<T>

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

Formats the value using the given formatter.

impl<T: Send + Sync + Clone + Traversible + InlineOutput> Default for AppendTree<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Send + Sync + InlineOutput> InlineOutput for AppendTree<T>

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

where Self: Sized,

impl<T> ListHashes for AppendTree<T>

where TreeKind<T>: ListHashes,

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

fn topology_hash(&self) -> Hash

fn point_count(&self) -> usize

impl<T, __I: ParseInput> Parse<__I> for AppendTree<T>

where Self: ParseInline<__I>,

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

Parse consuming the whole stream.

impl<T, I: ParseInput> ParseInline<I> for AppendTree<T>

where Node<T, U256, Leaf>: ParseWithLen<I, History = ()>, Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>: ParseWithLen<I, History = (Node<T, U256, Leaf>, ())>, Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>: ParseWithLen<I, History = (Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>, (Node<T, U256, Leaf>, ()))>, Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>: ParseWithLen<I, History = (Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>, (Node<T, U256, Leaf>, ())))>, Node<Point<Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>: ParseWithLen<I, History = (Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>, (Node<T, U256, Leaf>, ()))))>, Node<Point<Node<Point<Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>: ParseWithLen<I, History = (Node<Point<Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>, (Node<T, U256, Leaf>, ())))))>, Node<Point<Node<Point<Node<Point<Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>: ParseWithLen<I, History = (Node<Point<Node<Point<Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>, (Node<T, U256, Leaf>, ()))))))>, Node<Point<Node<Point<Node<Point<Node<Point<Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>: ParseWithLen<I, History = (Node<Point<Node<Point<Node<Point<Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<Point<Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>>, U256, NonLeaf>, (Node<Point<Node<T, U256, Leaf>>, U256, NonLeaf>, (Node<T, U256, Leaf>, ())))))))>,

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<T: PartialEq> PartialEq for AppendTree<T>

fn eq(&self, other: &AppendTree<T>) -> 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<T> Tagged for AppendTree<T>

where TreeKind<T>: Tagged,

const TAGS: Tags

const HASH: Hash = _

impl<T: Send + Sync + InlineOutput> ToOutput for AppendTree<T>

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<T> Topological for AppendTree<T>

where TreeKind<T>: Topological,

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

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

impl<T: Eq> Eq for AppendTree<T>

impl<T> StructuralPartialEq for AppendTree<T>