Struct mango_v4::state::OrderTreeNodes

#[repr(C)]
pub struct OrderTreeNodes {
    pub order_tree_type: u8,
    pub padding: [u8; 3],
    pub bump_index: u32,
    pub free_list_len: u32,
    pub free_list_head: NodeHandle,
    pub reserved: [u8; 512],
    pub nodes: [AnyNode; 1024],
}

A binary tree on AnyNode::key()

The key encodes the price in the top 64 bits.

Fields

order_tree_type: u8

padding: [u8; 3]

bump_index: u32

free_list_len: u32

free_list_head: NodeHandle

reserved: [u8; 512]

nodes: [AnyNode; 1024]

Implementations

impl OrderTreeNodes

pub fn order_tree_type(&self) -> OrderTreeType

pub fn iter(&self, root: &OrderTreeRoot) -> OrderTreeIter<'_>

Iterate over all entries, including invalid orders

smallest to highest for asks highest to smallest for bids

pub fn node_mut(&mut self, handle: NodeHandle) -> Option<&mut AnyNode>

pub fn node(&self, handle: NodeHandle) -> Option<&AnyNode>

pub fn remove_worst(&mut self, root: &mut OrderTreeRoot) -> Option<LeafNode>

pub fn find_worst(&self, root: &OrderTreeRoot) -> Option<(NodeHandle, &LeafNode)>

pub fn remove_one_expired(
    &mut self,
    root: &mut OrderTreeRoot,
    now_ts: u64
) -> Option<LeafNode>

Remove the order with the lowest expiry timestamp, if that’s < now_ts.

pub fn min_leaf(&self, root: &OrderTreeRoot) -> Option<(NodeHandle, &LeafNode)>

pub fn max_leaf(&self, root: &OrderTreeRoot) -> Option<(NodeHandle, &LeafNode)>

pub fn remove_by_key(
    &mut self,
    root: &mut OrderTreeRoot,
    search_key: u128
) -> Option<LeafNode>

pub fn insert_leaf(
    &mut self,
    root: &mut OrderTreeRoot,
    new_leaf: &LeafNode
) -> Result<(NodeHandle, Option<LeafNode>)>

pub fn is_full(&self) -> bool

pub fn update_parent_earliest_expiry(
    &mut self,
    stack: &[(NodeHandle, bool)],
    outdated_expiry: u64,
    new_expiry: u64
)

When a node changes, the parents’ child_earliest_expiry may need to be updated.

This function walks up the stack of parents and applies the change where the previous child’s outdated_expiry is replaced by new_expiry.

pub fn find_earliest_expiry(
    &self,
    root: &OrderTreeRoot
) -> Option<(NodeHandle, u64)>

Returns the handle of the node with the lowest expiry timestamp, and this timestamp

Trait Implementations

impl Clone for OrderTreeNodes

fn clone(&self) -> OrderTreeNodes

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Zeroable for OrderTreeNodes

fn zeroed() -> Self

Calls zeroed.

impl Copy for OrderTreeNodes

impl Pod for OrderTreeNodes