Struct brontes_types::db::dex::DexKey

#[repr(transparent)]
pub struct DexKey(pub FixedBytes<10>);

Tuple Fields

0: FixedBytes<10>

Implementations

impl DexKey

pub const ZERO: Self = _

Array of Zero bytes.

pub const fn new(bytes: [u8; 10]) -> Self

Wraps the given byte array in this type.

pub const fn with_last_byte(x: u8) -> Self

Creates a new byte array with the last byte set to x.

pub const fn repeat_byte(byte: u8) -> Self

Creates a new byte array where all bytes are set to byte.

pub const fn len_bytes() -> usize

Returns the size of this array in bytes.

pub fn random() -> Self

Instantiates a new fixed byte array with cryptographically random content.

Panics

Panics if the underlying call to getrandom_uninit fails.

pub fn try_random() -> Result<Self, Error>

Tries to create a new fixed byte array with cryptographically random content.

Errors

This function only propagates the error from the underlying call to getrandom_uninit.

pub fn randomize(&mut self)

Fills this fixed byte array with cryptographically random content.

Panics

Panics if the underlying call to getrandom_uninit fails.

pub fn try_randomize(&mut self) -> Result<(), Error>

Tries to fill this fixed byte array with cryptographically random content.

Errors

This function only propagates the error from the underlying call to getrandom_uninit.

pub fn random_with<R: Rng + ?Sized>(rng: &mut R) -> Self

Creates a new fixed byte array with the given random number generator.

pub fn randomize_with<R: Rng + ?Sized>(&mut self, rng: &mut R)

Fills this fixed byte array with the given random number generator.

pub fn from_slice(src: &[u8]) -> Self

Create a new byte array from the given slice src.

For a fallible version, use the TryFrom<&[u8]> implementation.

Note

The given bytes are interpreted in big endian order.

Panics

If the length of src and the number of bytes in Self do not match.

pub fn left_padding_from(value: &[u8]) -> Self

Create a new byte array from the given slice src, left-padding it with zeroes if necessary.

Note

The given bytes are interpreted in big endian order.

Panics

Panics if src.len() > N.

pub fn right_padding_from(value: &[u8]) -> Self

Create a new byte array from the given slice src, right-padding it with zeroes if necessary.

Note

The given bytes are interpreted in big endian order.

Panics

Panics if src.len() > N.

pub const fn into_array(self) -> [u8; 10]

Returns the inner bytes array.

pub fn covers(&self, b: &Self) -> bool

Returns true if all bits set in b are also set in self.

pub const fn const_eq(&self, other: &Self) -> bool

Compile-time equality. NOT constant-time equality.

pub const fn bit_and(self, rhs: Self) -> Self

Computes the bitwise AND of two FixedBytes.

pub const fn bit_or(self, rhs: Self) -> Self

Computes the bitwise OR of two FixedBytes.

pub const fn bit_xor(self, rhs: Self) -> Self

Computes the bitwise XOR of two FixedBytes.

Methods from Deref<Target = FixedBytes<10>>

pub const ZERO: FixedBytes<N> = _

pub fn randomize(&mut self)

Fills this [FixedBytes] with cryptographically random content.

Panics

Panics if the underlying call to getrandom_uninit fails.

pub fn try_randomize(&mut self) -> Result<(), Error>

Tries to fill this [FixedBytes] with cryptographically random content.

Errors

This function only propagates the error from the underlying call to getrandom_uninit.

pub fn randomize_with<R>(&mut self, rng: &mut R)

where R: Rng + ?Sized,

Fills this [FixedBytes] with the given random number generator.

pub fn as_slice(&self) -> &[u8]

Returns a slice containing the entire array. Equivalent to &s[..].

pub fn as_mut_slice(&mut self) -> &mut [u8]

Returns a mutable slice containing the entire array. Equivalent to &mut s[..].

pub fn covers(&self, other: &FixedBytes<N>) -> bool

Returns true if all bits set in self are also set in b.

pub fn const_eq(&self, other: &FixedBytes<N>) -> bool

Compile-time equality. NOT constant-time equality.

pub fn is_zero(&self) -> bool

Returns true if no bits are set.

pub fn const_is_zero(&self) -> bool

Returns true if no bits are set.

Methods from Deref<Target = [u8; N]>

pub fn as_ascii(&self) -> Option<&[AsciiChar; N]>

🔬This is a nightly-only experimental API. (ascii_char)

Converts this array of bytes into an array of ASCII characters, or returns None if any of the characters is non-ASCII.

Examples

#![feature(ascii_char)]
#![feature(const_option)]

const HEX_DIGITS: [std::ascii::Char; 16] =
    *b"0123456789abcdef".as_ascii().unwrap();

assert_eq!(HEX_DIGITS[1].as_str(), "1");
assert_eq!(HEX_DIGITS[10].as_str(), "a");

pub unsafe fn as_ascii_unchecked(&self) -> &[AsciiChar; N]

🔬This is a nightly-only experimental API. (ascii_char)

Converts this array of bytes into an array of ASCII characters, without checking whether they’re valid.

Safety

Every byte in the array must be in 0..=127, or else this is UB.

pub fn as_slice(&self) -> &[T]

Returns a slice containing the entire array. Equivalent to &s[..].

pub fn as_mut_slice(&mut self) -> &mut [T]

Returns a mutable slice containing the entire array. Equivalent to &mut s[..].

pub fn each_ref(&self) -> [&T; N]

Borrows each element and returns an array of references with the same size as self.

Example

let floats = [3.1, 2.7, -1.0];
let float_refs: [&f64; 3] = floats.each_ref();
assert_eq!(float_refs, [&3.1, &2.7, &-1.0]);

This method is particularly useful if combined with other methods, like map. This way, you can avoid moving the original array if its elements are not Copy.

let strings = ["Ferris".to_string(), "♥".to_string(), "Rust".to_string()];
let is_ascii = strings.each_ref().map(|s| s.is_ascii());
assert_eq!(is_ascii, [true, false, true]);

// We can still access the original array: it has not been moved.
assert_eq!(strings.len(), 3);

pub fn each_mut(&mut self) -> [&mut T; N]

Borrows each element mutably and returns an array of mutable references with the same size as self.

Example

let mut floats = [3.1, 2.7, -1.0];
let float_refs: [&mut f64; 3] = floats.each_mut();
*float_refs[0] = 0.0;
assert_eq!(float_refs, [&mut 0.0, &mut 2.7, &mut -1.0]);
assert_eq!(floats, [0.0, 2.7, -1.0]);

pub fn split_array_ref<const M: usize>(&self) -> (&[T; M], &[T])

🔬This is a nightly-only experimental API. (split_array)

Divides one array reference into two at an index.

The first will contain all indices from [0, M) (excluding the index M itself) and the second will contain all indices from [M, N) (excluding the index N itself).

Panics

Panics if M > N.

Examples

#![feature(split_array)]

let v = [1, 2, 3, 4, 5, 6];

{
   let (left, right) = v.split_array_ref::<0>();
   assert_eq!(left, &[]);
   assert_eq!(right, &[1, 2, 3, 4, 5, 6]);
}

{
    let (left, right) = v.split_array_ref::<2>();
    assert_eq!(left, &[1, 2]);
    assert_eq!(right, &[3, 4, 5, 6]);
}

{
    let (left, right) = v.split_array_ref::<6>();
    assert_eq!(left, &[1, 2, 3, 4, 5, 6]);
    assert_eq!(right, &[]);
}

pub fn split_array_mut<const M: usize>(&mut self) -> (&mut [T; M], &mut [T])

🔬This is a nightly-only experimental API. (split_array)

Divides one mutable array reference into two at an index.

The first will contain all indices from [0, M) (excluding the index M itself) and the second will contain all indices from [M, N) (excluding the index N itself).

Panics

Panics if M > N.

Examples

#![feature(split_array)]

let mut v = [1, 0, 3, 0, 5, 6];
let (left, right) = v.split_array_mut::<2>();
assert_eq!(left, &mut [1, 0][..]);
assert_eq!(right, &mut [3, 0, 5, 6]);
left[1] = 2;
right[1] = 4;
assert_eq!(v, [1, 2, 3, 4, 5, 6]);

pub fn rsplit_array_ref<const M: usize>(&self) -> (&[T], &[T; M])

🔬This is a nightly-only experimental API. (split_array)

Divides one array reference into two at an index from the end.

The first will contain all indices from [0, N - M) (excluding the index N - M itself) and the second will contain all indices from [N - M, N) (excluding the index N itself).

Panics

Panics if M > N.

Examples

#![feature(split_array)]

let v = [1, 2, 3, 4, 5, 6];

{
   let (left, right) = v.rsplit_array_ref::<0>();
   assert_eq!(left, &[1, 2, 3, 4, 5, 6]);
   assert_eq!(right, &[]);
}

{
    let (left, right) = v.rsplit_array_ref::<2>();
    assert_eq!(left, &[1, 2, 3, 4]);
    assert_eq!(right, &[5, 6]);
}

{
    let (left, right) = v.rsplit_array_ref::<6>();
    assert_eq!(left, &[]);
    assert_eq!(right, &[1, 2, 3, 4, 5, 6]);
}

pub fn rsplit_array_mut<const M: usize>(&mut self) -> (&mut [T], &mut [T; M])

🔬This is a nightly-only experimental API. (split_array)

Divides one mutable array reference into two at an index from the end.

The first will contain all indices from [0, N - M) (excluding the index N - M itself) and the second will contain all indices from [N - M, N) (excluding the index N itself).

Panics

Panics if M > N.

Examples

#![feature(split_array)]

let mut v = [1, 0, 3, 0, 5, 6];
let (left, right) = v.rsplit_array_mut::<4>();
assert_eq!(left, &mut [1, 0]);
assert_eq!(right, &mut [3, 0, 5, 6][..]);
left[1] = 2;
right[1] = 4;
assert_eq!(v, [1, 2, 3, 4, 5, 6]);

Trait Implementations

impl<'a> Arbitrary<'a> for DexKey

fn arbitrary(u: &mut Unstructured<'a>) -> Result<Self>

Generate an arbitrary value of Self from the given unstructured data.

fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self>

Generate an arbitrary value of Self from the entirety of the given unstructured data.

fn size_hint(depth: usize) -> (usize, Option<usize>)

Get a size hint for how many bytes out of an Unstructured this type needs to construct itself.

impl Arbitrary for DexKey

type Parameters = <FixedBytes<10> as Arbitrary>::Parameters

The type of parameters that arbitrary_with accepts for configuration of the generated Strategy. Parameters must implement Default.

type Strategy = Map<<FixedBytes<10> as Arbitrary>::Strategy, fn(_: FixedBytes<10>) -> DexKey>

The type of Strategy used to generate values of type Self.

fn arbitrary() -> Self::Strategy

Generates a Strategy for producing arbitrary values of type the implementing type (Self).

fn arbitrary_with(args: Self::Parameters) -> Self::Strategy

Generates a Strategy for producing arbitrary values of type the implementing type (Self). The strategy is passed the arguments given in args.

impl AsMut<[u8]> for DexKey

fn as_mut(&mut self) -> &mut [u8]

Converts this type into a mutable reference of the (usually inferred) input type.

impl AsMut<[u8; 10]> for DexKey

fn as_mut(&mut self) -> &mut [u8; 10]

Converts this type into a mutable reference of the (usually inferred) input type.

impl AsMut<FixedBytes<10>> for DexKey

fn as_mut(&mut self) -> &mut FixedBytes<10>

Converts this type into a mutable reference of the (usually inferred) input type.

impl AsRef<[u8]> for DexKey

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

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<[u8; 10]> for DexKey

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

Converts this type into a shared reference of the (usually inferred) input type.

impl AsRef<FixedBytes<10>> for DexKey

fn as_ref(&self) -> &FixedBytes<10>

Converts this type into a shared reference of the (usually inferred) input type.

impl BitAnd for DexKey

type Output = DexKey

The resulting type after applying the & operator.

fn bitand(self, rhs: DexKey) -> DexKey

Performs the & operation.

impl BitAndAssign for DexKey

fn bitand_assign(&mut self, rhs: DexKey)

Performs the &= operation.

impl BitOr for DexKey

type Output = DexKey

The resulting type after applying the | operator.

fn bitor(self, rhs: DexKey) -> DexKey

Performs the | operation.

impl BitOrAssign for DexKey

fn bitor_assign(&mut self, rhs: DexKey)

Performs the |= operation.

impl BitXor for DexKey

type Output = DexKey

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: DexKey) -> DexKey

Performs the ^ operation.

impl BitXorAssign for DexKey

fn bitxor_assign(&mut self, rhs: DexKey)

Performs the ^= operation.

impl Borrow<[u8]> for &DexKey

fn borrow(&self) -> &[u8]

Immutably borrows from an owned value.

impl Borrow<[u8]> for &mut DexKey

fn borrow(&self) -> &[u8]

Immutably borrows from an owned value.

impl Borrow<[u8]> for DexKey

fn borrow(&self) -> &[u8]

Immutably borrows from an owned value.

impl Borrow<[u8; 10]> for &DexKey

fn borrow(&self) -> &[u8; 10]

Immutably borrows from an owned value.

impl Borrow<[u8; 10]> for &mut DexKey

fn borrow(&self) -> &[u8; 10]

Immutably borrows from an owned value.

impl Borrow<[u8; 10]> for DexKey

fn borrow(&self) -> &[u8; 10]

Immutably borrows from an owned value.

impl BorrowMut<[u8]> for &mut DexKey

fn borrow_mut(&mut self) -> &mut [u8]

Mutably borrows from an owned value.

impl BorrowMut<[u8]> for DexKey

fn borrow_mut(&mut self) -> &mut [u8]

Mutably borrows from an owned value.

impl BorrowMut<[u8; 10]> for &mut DexKey

fn borrow_mut(&mut self) -> &mut [u8; 10]

Mutably borrows from an owned value.

impl BorrowMut<[u8; 10]> for DexKey

fn borrow_mut(&mut self) -> &mut [u8; 10]

Mutably borrows from an owned value.

impl Clone for DexKey

fn clone(&self) -> DexKey

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DexKey

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

Formats the value using the given formatter.

impl Decodable for DexKey

fn decode(buf: &mut &[u8]) -> Result<Self>

Decodes the blob into the appropriate type. buf must be advanced past the decoded object.

impl Decode for DexKey

fn decode<B: AsRef<[u8]>>(value: B) -> Result<Self, DatabaseError>

Decodes data coming from the database.

impl Default for DexKey

fn default() -> DexKey

Returns the “default value” for a type.

impl Deref for DexKey

type Target = FixedBytes<10>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl DerefMut for DexKey

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'de> Deserialize<'de> for DexKey

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

Deserialize this value from the given Serde deserializer.

impl Distribution<DexKey> for Standard

fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> DexKey

Generate a random value of T, using rng as the source of randomness.

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.

fn map<F, S>(self, func: F) -> DistMap<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Create a distribution of values of ‘S’ by mapping the output of Self through the closure F

impl Encodable for DexKey

fn length(&self) -> usize

Returns the length of the encoding of this type in bytes.

fn encode(&self, out: &mut dyn BufMut)

Encodes the type into the out buffer.

impl Encode for DexKey

type Encoded = [u8; 10]

Encoded type.

fn encode(self) -> Self::Encoded

Encodes data going into the database.

impl<'a> From<&'a [u8; 10]> for &'a DexKey

fn from(value: &'a [u8; 10]) -> &'a DexKey

Converts to this type from the input type.

impl<'a> From<&'a [u8; 10]> for DexKey

fn from(value: &'a [u8; 10]) -> Self

Converts to this type from the input type.

impl<'a> From<&'a DexKey> for &'a [u8; 10]

fn from(value: &'a DexKey) -> &'a [u8; 10]

Converts to this type from the input type.

impl<'a> From<&'a mut [u8; 10]> for &'a DexKey

fn from(value: &'a mut [u8; 10]) -> &'a DexKey

Converts to this type from the input type.

impl<'a> From<&'a mut [u8; 10]> for &'a mut DexKey

fn from(value: &'a mut [u8; 10]) -> &'a mut DexKey

Converts to this type from the input type.

impl<'a> From<&'a mut [u8; 10]> for DexKey

fn from(value: &'a mut [u8; 10]) -> Self

Converts to this type from the input type.

impl<'a> From<&'a mut DexKey> for &'a [u8; 10]

fn from(value: &'a mut DexKey) -> &'a [u8; 10]

Converts to this type from the input type.

impl<'a> From<&'a mut DexKey> for &'a mut [u8; 10]

fn from(value: &'a mut DexKey) -> &'a mut [u8; 10]

Converts to this type from the input type.

impl From<[u8; 10]> for DexKey

fn from(value: [u8; 10]) -> Self

Converts to this type from the input type.

impl From<DexKey> for [u8; 10]

fn from(value: DexKey) -> Self

Converts to this type from the input type.

impl From<DexKey> for FixedBytes<10>

fn from(original: DexKey) -> Self

Converts to this type from the input type.

impl From<FixedBytes<10>> for DexKey

fn from(original: FixedBytes<10>) -> DexKey

Converts to this type from the input type.

impl FromHex for DexKey

type Error = FromHexError

The associated error which can be returned from parsing.

fn from_hex<T: AsRef<[u8]>>(hex: T) -> Result<Self, Self::Error>

Creates an instance of type Self from the given hex string, or fails with a custom error type.

impl FromStr for DexKey

type Err = <FixedBytes<10> as FromStr>::Err

The associated error which can be returned from parsing.

fn from_str(src: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl Hash for DexKey

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<__IdxT> Index<__IdxT> for DexKey

where FixedBytes<10>: Index<__IdxT>,

type Output = <FixedBytes<10> as Index<__IdxT>>::Output

The returned type after indexing.

fn index(&self, idx: __IdxT) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<__IdxT> IndexMut<__IdxT> for DexKey

where FixedBytes<10>: IndexMut<__IdxT>,

fn index_mut(&mut self, idx: __IdxT) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'__deriveMoreLifetime> IntoIterator for &'__deriveMoreLifetime DexKey

type Item = <&'__deriveMoreLifetime FixedBytes<10> as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <&'__deriveMoreLifetime FixedBytes<10> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'__deriveMoreLifetime> IntoIterator for &'__deriveMoreLifetime mut DexKey

type Item = <&'__deriveMoreLifetime mut FixedBytes<10> as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <&'__deriveMoreLifetime mut FixedBytes<10> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for DexKey

type Item = <FixedBytes<10> as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <FixedBytes<10> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl LowerHex for DexKey

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

Formats the value using the given formatter.

impl MaxEncodedLenAssoc for DexKey

const LEN: usize = 11usize

The maximum length.

impl Not for DexKey

type Output = DexKey

The resulting type after applying the ! operator.

fn not(self) -> DexKey

Performs the unary ! operation.

impl Ord for DexKey

fn cmp(&self, other: &DexKey) -> 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<&[u8]> for DexKey

fn eq(&self, other: &&[u8]) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialEq<&[u8; 10]> for DexKey

fn eq(&self, other: &&[u8; 10]) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialEq<&DexKey> for [u8]

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialEq<&DexKey> for [u8; 10]

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialEq<[u8]> for &DexKey

fn eq(&self, other: &[u8]) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialEq<[u8]> for DexKey

fn eq(&self, other: &[u8]) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialEq<[u8; 10]> for &DexKey

fn eq(&self, other: &[u8; 10]) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialEq<[u8; 10]> for DexKey

fn eq(&self, other: &[u8; 10]) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialEq<DexKey> for &[u8]

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialEq<DexKey> for &[u8; 10]

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialEq<DexKey> for [u8]

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialEq<DexKey> for [u8; 10]

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialEq for DexKey

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialOrd<&[u8]> for DexKey

fn partial_cmp(&self, other: &&[u8]) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl PartialOrd<&DexKey> for [u8]

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

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl PartialOrd<[u8]> for &DexKey

fn partial_cmp(&self, other: &[u8]) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl PartialOrd<[u8]> for DexKey

fn partial_cmp(&self, other: &[u8]) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl PartialOrd<DexKey> for &[u8]

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

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl PartialOrd<DexKey> for [u8]

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

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl PartialOrd for DexKey

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

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl Serialize for DexKey

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.

impl<'a> TryFrom<&'a [u8]> for &'a DexKey

type Error = TryFromSliceError

The type returned in the event of a conversion error.

fn try_from(slice: &'a [u8]) -> Result<&'a DexKey, Self::Error>

Performs the conversion.

impl TryFrom<&[u8]> for DexKey

type Error = TryFromSliceError

The type returned in the event of a conversion error.

fn try_from(slice: &[u8]) -> Result<Self, Self::Error>

Performs the conversion.

impl<'a> TryFrom<&'a mut [u8]> for &'a mut DexKey

type Error = TryFromSliceError

The type returned in the event of a conversion error.

fn try_from(slice: &'a mut [u8]) -> Result<&'a mut DexKey, Self::Error>

Performs the conversion.

impl TryFrom<&mut [u8]> for DexKey

type Error = TryFromSliceError

The type returned in the event of a conversion error.

fn try_from(slice: &mut [u8]) -> Result<Self, Self::Error>

Performs the conversion.

impl UpperHex for DexKey

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

Formats the value using the given formatter.

impl Copy for DexKey

impl Eq for DexKey

impl MaxEncodedLen<{ $len }> for DexKey

impl StructuralPartialEq for DexKey

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 10 bytes