Struct Available 

pub struct Available<T: UpdateSet> {
    pub book: BTreeMap<T::Key, T::Value>,
}

Data structure to hold prices/traded amount

Fields

book: BTreeMap<T::Key, T::Value>

Implementations

impl<T: UpdateSet> Available<T>

pub fn new<A: AsRef<[T]>>(prices: A) -> Self

pub fn update<A: AsRef<[T]>>(&mut self, book_update: A)

pub fn clear(&mut self)

Trait Implementations

impl<T: Clone + UpdateSet> Clone for Available<T>

where T::Key: Clone, T::Value: Clone,

fn clone(&self) -> Available<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + UpdateSet> Debug for Available<T>

where T::Key: Debug, T::Value: Debug,

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

Formats the value using the given formatter.

impl<'de, T: UpdateSet> Deserialize<'de> for Available<T>

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Hash + UpdateSet> Hash for Available<T>

where T::Key: Hash, T::Value: Hash,

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: Ord + UpdateSet> Ord for Available<T>

where T::Key: Ord, T::Value: Ord,

fn cmp(&self, other: &Available<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq + UpdateSet> PartialEq for Available<T>

where T::Key: PartialEq, T::Value: PartialEq,

fn eq(&self, other: &Available<T>) -> 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<T: PartialOrd + UpdateSet> PartialOrd for Available<T>

where T::Key: PartialOrd, T::Value: PartialOrd,

fn partial_cmp(&self, other: &Available<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: UpdateSet> Serialize for Available<T>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Eq + UpdateSet> Eq for Available<T>

where T::Key: Eq, T::Value: Eq,

impl<T: UpdateSet> StructuralPartialEq for Available<T>