Struct IndexRow 

pub struct IndexRow<K, V> {
    pub primary: K,
    pub secondary: String,
    pub value: V,
}

A row in a reactive index: primary key, secondary sort key, value.

Fields

primary: K

secondary: String

value: V

Trait Implementations

impl<K: Clone, V: Clone> Clone for IndexRow<K, V>

fn clone(&self) -> IndexRow<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for IndexRow<K, V>

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

Formats the value using the given formatter.

impl<'de, K, V> Deserialize<'de> for IndexRow<K, V>

where K: Deserialize<'de>, V: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K: PartialEq, V: PartialEq> PartialEq for IndexRow<K, V>

fn eq(&self, other: &IndexRow<K, V>) -> 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<K, V> Serialize for IndexRow<K, V>

where K: Serialize, V: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<K: Eq, V: Eq> Eq for IndexRow<K, V>

impl<K, V> StructuralPartialEq for IndexRow<K, V>