Struct BidderPot 

#[repr(C)]
pub struct BidderPot {
    pub bidder_pot: Pubkey,
    pub bidder_act: Pubkey,
    pub auction_act: Pubkey,
    pub emptied: bool,
}

Fields

bidder_pot: Pubkey

Points at actual pot that is a token account

bidder_act: Pubkey

Originating bidder account

auction_act: Pubkey

Auction account

emptied: bool

emptied or not

Implementations

impl BidderPot

pub fn from_account_info(a: &AccountInfo<'_>) -> Result<BidderPot, ProgramError>

Trait Implementations

impl BorshDeserialize for BidderPot

where Pubkey: BorshDeserialize, bool: BorshDeserialize,

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.

impl BorshSerialize for BidderPot

where Pubkey: BorshSerialize, bool: BorshSerialize,

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

fn try_to_vec(&self) -> Result<Vec<u8>, Error>

Serialize this instance into a vector of bytes.

impl Clone for BidderPot

fn clone(&self) -> BidderPot

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl PartialEq for BidderPot

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