Struct bdk_chain::bitcoin::secp256k1::ffi::Keypair

#[repr(C)]
pub struct Keypair(/* private fields */);

Implementations

impl Keypair

pub fn cmp_fast_unstable(&self, other: &Keypair) -> Ordering

Like cmp::Ord but faster and with no guarantees across library versions.

The inner byte array of Self is passed across the FFI boundry, as such there are no guarantees on its layout and it is subject to change across library versions, even minor versions. For this reason comparison function implementations (e.g. Ord, PartialEq) take measures to ensure the data will remain constant (e.g., by serializing it to a guaranteed format). This means they may be slow, this function provides a faster comparison if you know that your types come from the same library version.

pub fn eq_fast_unstable(&self, other: &Keypair) -> bool

Like cmp::Eq but faster and with no guarantees across library versions.

The inner byte array of Self is passed across the FFI boundry, as such there are no guarantees on its layout and it is subject to change across library versions, even minor versions. For this reason comparison function implementations (e.g. Ord, PartialEq) take measures to ensure the data will remain constant (e.g., by serializing it to a guaranteed format). This means they may be slow, this function provides a faster equality check if you know that your types come from the same library version.

impl Keypair

pub unsafe fn new() -> Keypair

Creates an “uninitialized” FFI keypair which is zeroed out

Safety

If you pass this to any FFI functions, except as an out-pointer, the result is likely to be an assertation failure and process termination.

pub unsafe fn from_array_unchecked(data: [u8; 96]) -> Keypair

Create a new keypair usable for the FFI interface from raw bytes

Safety

Does not check the validity of the underlying representation. If it is invalid the result may be assertation failures (and process aborts) from the underlying library. You should not use this method except with data that you obtained from the FFI interface of the same version of this library.

pub fn underlying_bytes(self) -> [u8; 96]

Returns the underlying FFI opaque representation of the x-only public key

You should not use this unless you really know what you are doing. It is essentially only useful for extending the FFI interface itself.

pub fn non_secure_erase(&mut self)

Attempts to erase the contents of the underlying array.

Note, however, that the compiler is allowed to freely copy or move the contents of this array to other places in memory. Preventing this behavior is very subtle. For more discussion on this, please see the documentation of the zeroize crate.

Trait Implementations

impl AsRef<[u8; 96]> for Keypair

fn as_ref(&self) -> &[u8; 96]

Gets a reference to the underlying array

impl CPtr for Keypair

type Target = u8

fn as_c_ptr(&self) -> *const <Keypair as CPtr>::Target

fn as_mut_c_ptr(&mut self) -> *mut <Keypair as CPtr>::Target

impl Clone for Keypair

fn clone(&self) -> Keypair

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Keypair

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

Formats the value using the given formatter.

impl Hash for Keypair

fn hash<H>(&self, state: &mut H)

where H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I> Index<I> for Keypair

where [u8]: Index<I>,

type Output = <[u8] as Index<I>>::Output

The returned type after indexing.

fn index(&self, index: I) -> &<Keypair as Index<I>>::Output

Performs the indexing (container[index]) operation.

impl Ord for Keypair

fn cmp(&self, other: &Keypair) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl PartialEq for Keypair

fn eq(&self, other: &Keypair) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for Keypair

fn partial_cmp(&self, other: &Keypair) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for Keypair

impl Eq for Keypair