Struct LeafNode 

#[repr(packed(1))]
pub struct LeafNode { /* private fields */ }

Implementations

impl LeafNode

pub fn new( owner_slot: u8, key: u128, owner: [u64; 4], quantity: u64, fee_tier: FeeTier, client_order_id: u64, ) -> Self

pub fn fee_tier(&self) -> FeeTier

pub fn price(&self) -> NonZeroU64

pub fn order_id(&self) -> u128

pub fn quantity(&self) -> u64

pub fn set_quantity(&mut self, quantity: u64)

pub fn owner(&self) -> [u64; 4]

pub fn owner_slot(&self) -> u8

pub fn client_order_id(&self) -> u64

Trait Implementations

impl AsRef<AnyNode> for LeafNode

fn as_ref(&self) -> &AnyNode

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

impl Clone for LeafNode

fn clone(&self) -> LeafNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LeafNode

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

Formats the value using the given formatter.

impl PartialEq for LeafNode

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

fn zeroed() -> Self

Calls zeroed.

impl Copy for LeafNode

impl Eq for LeafNode

impl Pod for LeafNode

impl StructuralPartialEq for LeafNode