Struct MarginTable 

pub struct MarginTable {
    pub description: String,
    pub margin_tiers: Vec<MarginTier>,
}

Fields

description: String

tiered 40x; empty on some.

margin_tiers: Vec<MarginTier>

Lowest first.

Implementations

impl MarginTable

pub fn flat(max_leverage: u32) -> MarginTable

One tier, from nothing on: what an id under FLAT_TABLES_BELOW is.

pub fn by_id(id: u32, listed: &[(u32, MarginTable)]) -> Option<MarginTable>

A table by its id: flat under FLAT_TABLES_BELOW, else one of listed, a meta’s marginTables. No perp is on table 0.

pub fn max_leverage_at(&self, notional: Dec) -> Option<u32>

The most leverage a position of notional may take: the tier with the highest lower bound at or under it. A short’s notional counts as its size. The docs do not say which tier a notional exactly on a bound falls in; here it is the higher one, the bound being its lower.

pub fn check( &self, name: &str, leverage: u32, notional: Dec, ) -> Result<(), LeverageError>

leverage on the perp name, refused over what the tier a position of notional reaches allows.

Trait Implementations

impl Clone for MarginTable

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MarginTable

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for MarginTable

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for MarginTable

impl PartialEq for MarginTable

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for MarginTable