Enum bech32::primitives::Bech32

pub enum Bech32 {}

The bech32 checksum algorithm, defined in BIP-173.

Trait Implementations

impl Checksum for Bech32

type MidstateRepr = u32

An unsigned integer type capable of holding a packed version of the generator polynomial (without its leading 1) and target residue (which will have the same width).

const CODE_LENGTH: usize = 1_023usize

The length of the code.

const CHECKSUM_LENGTH: usize = 6usize

The number of characters in the checksum.

const GENERATOR_SH: [u32; 5] = GEN

The coefficients of the generator polynomial, except the leading monic term, in “big-endian” (highest-degree coefficients get leftmost bits) order, along with the 4 shifts of the generator.

const TARGET_RESIDUE: u32 = 1u32

The residue, modulo the generator polynomial, that a valid codeword will have.

fn sanity_check()

Sanity checks that the various constants of the trait are set in a way that they are consistent with each other.

impl Clone for Bech32

fn clone(&self) -> Bech32

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Hash for Bech32

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

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 Ord for Bech32

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

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<Bech32> for Bech32

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

fn partial_cmp(&self, other: &Bech32) -> 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 Bech32

impl Eq for Bech32

impl StructuralEq for Bech32

impl StructuralPartialEq for Bech32