Struct BinArray 

pub struct BinArray {
    pub discriminator: [u8; 8],
    pub index: i64,
    pub version: u8,
    pub padding: [u8; 7],
    pub lb_pair: Pubkey,
    pub bins: [Bin; 70],
}

An account to contain a range of bin. For example: Bin 100 <-> 200. For example: BinArray index: 0 contains bin 0 <-> 599 index: 2 contains bin 600 <-> 1199, …

Fields

discriminator: [u8; 8]

index: i64

version: u8

Version of binArray

padding: [u8; 7]

lb_pair: Pubkey

bins: [Bin; 70]

Implementations

impl BinArray

pub const LEN: usize = 10136

pub fn from_bytes(data: &[u8]) -> Result<Self, Error>

Trait Implementations

impl BorshDeserialize for BinArray

fn deserialize_reader<__R: Read>(reader: &mut __R) -> Result<Self, Error>

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

Deserializes this instance from a given slice of bytes. Updates the buffer to point at the remaining bytes.

fn try_from_slice(v: &[u8]) -> Result<Self, Error>

Deserialize this instance from a slice of bytes.

fn try_from_reader<R>(reader: &mut R) -> Result<Self, Error>

where R: Read,

impl BorshSerialize for BinArray

fn serialize<__W: Write>(&self, writer: &mut __W) -> Result<(), Error>

impl Clone for BinArray

fn clone(&self) -> BinArray

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BinArray

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

Formats the value using the given formatter.

impl Eq for BinArray

impl PartialEq for BinArray

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

impl<'a> TryFrom<&AccountInfo<'a>> for BinArray

type Error = Error

The type returned in the event of a conversion error.

fn try_from(account_info: &AccountInfo<'a>) -> Result<Self, Self::Error>

Performs the conversion.