Trait bdk_chain::Append

pub trait Append {
    fn append(&mut self, other: Self);
    fn is_empty(&self) -> bool;
}

Trait that makes an object appendable.

Required Methods

fn append(&mut self, other: Self)

Append another object of the same type onto self.

fn is_empty(&self) -> bool

Returns whether the structure is considered empty.

Implementations on Foreign Types

impl<K: Ord, V> Append for BTreeMap<K, V>

fn append(&mut self, other: Self)

fn is_empty(&self) -> bool

impl<T: Ord> Append for BTreeSet<T>

fn append(&mut self, other: Self)

fn is_empty(&self) -> bool

impl<T> Append for Vec<T>

fn append(&mut self, other: Self)

fn is_empty(&self) -> bool

impl Append for ()

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0> Append for (T0,)where
    T0: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1> Append for (T0, T1)where
    T0: Append,
    T1: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2> Append for (T0, T1, T2)where
    T0: Append,
    T1: Append,
    T2: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3> Append for (T0, T1, T2, T3)where
    T0: Append,
    T1: Append,
    T2: Append,
    T3: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4> Append for (T0, T1, T2, T3, T4)where
    T0: Append,
    T1: Append,
    T2: Append,
    T3: Append,
    T4: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4, T5> Append for (T0, T1, T2, T3, T4, T5)where
    T0: Append,
    T1: Append,
    T2: Append,
    T3: Append,
    T4: Append,
    T5: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4, T5, T6> Append for (T0, T1, T2, T3, T4, T5, T6)where
    T0: Append,
    T1: Append,
    T2: Append,
    T3: Append,
    T4: Append,
    T5: Append,
    T6: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4, T5, T6, T7> Append for (T0, T1, T2, T3, T4, T5, T6, T7)where
    T0: Append,
    T1: Append,
    T2: Append,
    T3: Append,
    T4: Append,
    T5: Append,
    T6: Append,
    T7: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Append for (T0, T1, T2, T3, T4, T5, T6, T7, T8)where
    T0: Append,
    T1: Append,
    T2: Append,
    T3: Append,
    T4: Append,
    T5: Append,
    T6: Append,
    T7: Append,
    T8: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Append for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)where
    T0: Append,
    T1: Append,
    T2: Append,
    T3: Append,
    T4: Append,
    T5: Append,
    T6: Append,
    T7: Append,
    T8: Append,
    T9: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Append for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)where
    T0: Append,
    T1: Append,
    T2: Append,
    T3: Append,
    T4: Append,
    T5: Append,
    T6: Append,
    T7: Append,
    T8: Append,
    T9: Append,
    T10: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

Implementors

impl<A: Ord> Append for bdk_chain::tx_graph::ChangeSet<A>

impl<A: Anchor, IA: Append> Append for bdk_chain::indexed_tx_graph::ChangeSet<A, IA>

impl<K: Ord> Append for bdk_chain::keychain::ChangeSet<K>