Trait bdk_chain::Append

source ·
pub trait Append: Default {
    // Required methods
    fn append(&mut self, other: Self);
    fn is_empty(&self) -> bool;

    // Provided method
    fn take(&mut self) -> Option<Self> { ... }
}
Expand description

Trait that makes an object appendable.

Required Methods§

source

fn append(&mut self, other: Self)

Append another object of the same type onto self.

source

fn is_empty(&self) -> bool

Returns whether the structure is considered empty.

Provided Methods§

source

fn take(&mut self) -> Option<Self>

Take the value, replacing it with the default value.

Object Safety§

This trait is not object safe.

Implementations on Foreign Types§

source§

impl Append for ()

source§

fn append(&mut self, _other: Self)

source§

fn is_empty(&self) -> bool

source§

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

source§

fn append(&mut self, other: Self)

source§

fn is_empty(&self) -> bool

source§

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

source§

fn append(&mut self, _other: Self)

source§

fn is_empty(&self) -> bool

source§

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

source§

fn append(&mut self, _other: Self)

source§

fn is_empty(&self) -> bool

source§

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

source§

fn append(&mut self, _other: Self)

source§

fn is_empty(&self) -> bool

source§

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

source§

fn append(&mut self, _other: Self)

source§

fn is_empty(&self) -> bool

source§

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

source§

fn append(&mut self, _other: Self)

source§

fn is_empty(&self) -> bool

source§

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,

source§

fn append(&mut self, _other: Self)

source§

fn is_empty(&self) -> bool

source§

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,

source§

fn append(&mut self, _other: Self)

source§

fn is_empty(&self) -> bool

source§

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,

source§

fn append(&mut self, _other: Self)

source§

fn is_empty(&self) -> bool

source§

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,

source§

fn append(&mut self, _other: Self)

source§

fn is_empty(&self) -> bool

source§

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,

source§

fn append(&mut self, _other: Self)

source§

fn is_empty(&self) -> bool

source§

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,

source§

fn append(&mut self, _other: Self)

source§

fn is_empty(&self) -> bool

source§

impl<T> Append for Vec<T>

source§

fn append(&mut self, other: Self)

source§

fn is_empty(&self) -> bool

source§

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

source§

fn append(&mut self, other: Self)

source§

fn is_empty(&self) -> bool

Implementors§

source§

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

source§

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

source§

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

source§

impl<K: Ord, A: Anchor> Append for CombinedChangeSet<K, A>