pub struct ColdArchiveDeletedLeaf {
pub index: u32,
pub deleted_key: LedgerKey,
}
Expand description
ColdArchiveDeletedLeaf is an XDR Struct defines as:
struct ColdArchiveDeletedLeaf
{
uint32 index;
LedgerKey deletedKey;
};
Fields§
§index: u32
§deleted_key: LedgerKey
Trait Implementations§
Source§impl<'arbitrary> Arbitrary<'arbitrary> for ColdArchiveDeletedLeaf
impl<'arbitrary> Arbitrary<'arbitrary> for ColdArchiveDeletedLeaf
Source§fn arbitrary(
u: &mut Unstructured<'arbitrary>,
) -> Result<ColdArchiveDeletedLeaf, Error>
fn arbitrary( u: &mut Unstructured<'arbitrary>, ) -> Result<ColdArchiveDeletedLeaf, Error>
Generate an arbitrary value of
Self
from the given unstructured data. Read moreSource§fn arbitrary_take_rest(
u: Unstructured<'arbitrary>,
) -> Result<ColdArchiveDeletedLeaf, Error>
fn arbitrary_take_rest( u: Unstructured<'arbitrary>, ) -> Result<ColdArchiveDeletedLeaf, Error>
Generate an arbitrary value of
Self
from the entirety of the given
unstructured data. Read moreSource§impl Clone for ColdArchiveDeletedLeaf
impl Clone for ColdArchiveDeletedLeaf
Source§fn clone(&self) -> ColdArchiveDeletedLeaf
fn clone(&self) -> ColdArchiveDeletedLeaf
Returns a copy of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl Debug for ColdArchiveDeletedLeaf
impl Debug for ColdArchiveDeletedLeaf
Source§impl Hash for ColdArchiveDeletedLeaf
impl Hash for ColdArchiveDeletedLeaf
Source§impl Ord for ColdArchiveDeletedLeaf
impl Ord for ColdArchiveDeletedLeaf
Source§fn cmp(&self, other: &ColdArchiveDeletedLeaf) -> Ordering
fn cmp(&self, other: &ColdArchiveDeletedLeaf) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialEq for ColdArchiveDeletedLeaf
impl PartialEq for ColdArchiveDeletedLeaf
Source§impl PartialOrd for ColdArchiveDeletedLeaf
impl PartialOrd for ColdArchiveDeletedLeaf
Source§impl ReadXdr for ColdArchiveDeletedLeaf
impl ReadXdr for ColdArchiveDeletedLeaf
Source§fn read_xdr<R>(r: &mut Limited<R>) -> Result<ColdArchiveDeletedLeaf, Error>where
R: Read,
fn read_xdr<R>(r: &mut Limited<R>) -> Result<ColdArchiveDeletedLeaf, Error>where
R: Read,
Read the XDR and construct the type. Read more
Source§fn read_xdr_base64<R>(r: &mut Limited<R>) -> Result<Self, Error>where
R: Read,
fn read_xdr_base64<R>(r: &mut Limited<R>) -> Result<Self, Error>where
R: Read,
Construct the type from the XDR bytes base64 encoded. Read more
Source§fn read_xdr_to_end<R>(r: &mut Limited<R>) -> Result<Self, Error>where
R: Read,
fn read_xdr_to_end<R>(r: &mut Limited<R>) -> Result<Self, Error>where
R: Read,
Read the XDR and construct the type, and consider it an error if the
read does not completely consume the read implementation. Read more
Source§fn read_xdr_base64_to_end<R>(r: &mut Limited<R>) -> Result<Self, Error>where
R: Read,
fn read_xdr_base64_to_end<R>(r: &mut Limited<R>) -> Result<Self, Error>where
R: Read,
Construct the type from the XDR bytes base64 encoded. Read more
Source§fn read_xdr_into<R>(&mut self, r: &mut Limited<R>) -> Result<(), Error>where
R: Read,
fn read_xdr_into<R>(&mut self, r: &mut Limited<R>) -> Result<(), Error>where
R: Read,
Read the XDR and construct the type. Read more
Source§fn read_xdr_into_to_end<R>(&mut self, r: &mut Limited<R>) -> Result<(), Error>where
R: Read,
fn read_xdr_into_to_end<R>(&mut self, r: &mut Limited<R>) -> Result<(), Error>where
R: Read,
Read the XDR into the existing value, and consider it an error if the
read does not completely consume the read implementation. Read more
Source§fn read_xdr_iter<R>(r: &mut Limited<R>) -> ReadXdrIter<&mut R, Self> ⓘwhere
R: Read,
fn read_xdr_iter<R>(r: &mut Limited<R>) -> ReadXdrIter<&mut R, Self> ⓘwhere
R: Read,
Create an iterator that reads the read implementation as a stream of
values that are read into the implementing type. Read more
Source§fn read_xdr_base64_iter<R>(
r: &mut Limited<R>,
) -> ReadXdrIter<DecoderReader<'_, R>, Self> ⓘwhere
R: Read,
fn read_xdr_base64_iter<R>(
r: &mut Limited<R>,
) -> ReadXdrIter<DecoderReader<'_, R>, Self> ⓘwhere
R: Read,
Create an iterator that reads the read implementation as a stream of
values that are read into the implementing type.
Source§impl WriteXdr for ColdArchiveDeletedLeaf
impl WriteXdr for ColdArchiveDeletedLeaf
impl Eq for ColdArchiveDeletedLeaf
impl StructuralPartialEq for ColdArchiveDeletedLeaf
Auto Trait Implementations§
impl Freeze for ColdArchiveDeletedLeaf
impl RefUnwindSafe for ColdArchiveDeletedLeaf
impl Send for ColdArchiveDeletedLeaf
impl Sync for ColdArchiveDeletedLeaf
impl Unpin for ColdArchiveDeletedLeaf
impl UnwindSafe for ColdArchiveDeletedLeaf
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<T, U, V, W, E, C> Compare<(T, U, V, W)> for C
impl<T, U, V, W, E, C> Compare<(T, U, V, W)> for C
type Error = E
fn compare( &self, a: &(T, U, V, W), b: &(T, U, V, W), ) -> Result<Ordering, <C as Compare<(T, U, V, W)>>::Error>
Source§impl<T, U, V, W, X, E, C> Compare<(T, U, V, W, X)> for C
impl<T, U, V, W, X, E, C> Compare<(T, U, V, W, X)> for C
type Error = E
fn compare( &self, a: &(T, U, V, W, X), b: &(T, U, V, W, X), ) -> Result<Ordering, <C as Compare<(T, U, V, W, X)>>::Error>
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.