hash_table_datastruct 0.6.3

Adds a HashTable type, allowing to store values in a table with integer-indexed rows and hashable keys for columns
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61

use serde::{
    ser::{SerializeMap, SerializeSeq},
    Serialize, Serializer,
};

use crate::{row::borrowed::HashTableRowBorrowed, HashTable};

impl<'t, K, V> Serialize for HashTableRowBorrowed<'t, K, V>
where
    K: Serialize,
    V: Serialize,
{
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: serde::Serializer,
    {
        let mut state = serializer.serialize_map(Some(self.columns_len()))?;
        for (k, v) in *self {
            state.serialize_entry(k, v)?;
        }
        state.end()
    }
}

impl<K, V> Serialize for HashTable<K, V>
where
    K: Serialize,
    V: Serialize,
{
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: serde::Serializer,
    {
        let mut state = serializer.serialize_seq(Some(self.rows_len()))?;
        for row in self {
            state.serialize_element(&row)?;
        }
        state.end()
    }
}

/// A function to use in `#[serde(serialize_with = "...")]`
///
/// Serializes the table as a map of column keys to column values
pub fn serialize_hashtable_as_map<S, K, V>(
    table: &HashTable<K, V>,
    ser: S,
) -> Result<S::Ok, S::Error>
where
    S: Serializer,
    K: Serialize,
    V: Serialize,
{
    let mut state = ser.serialize_map(Some(table.columns_len()))?;

    for column in table.iter_columns() {
        state.serialize_entry(column.column_key(), &column.values)?;
    }

    state.end()
}