trino-rust-client 0.7.3

A trino client library
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99

use std::cmp::Ord;
use std::collections::{BTreeMap, HashMap};
use std::fmt;
use std::hash::Hash;
use std::marker::PhantomData;

use serde::de::{DeserializeSeed, Deserializer, MapAccess, Visitor};

use super::util::SerializeVecMap;
use super::{Context, Trino, TrinoMapKey, TrinoTy};

macro_rules! gen_map {
    ($ty:ident < $($bound:ident ),* >,  $seed:ident) => {
        impl<K: TrinoMapKey + $($bound+)*, V: Trino> Trino for $ty<K, V> {
            // TODO: use impl trait after https://github.com/rust-lang/rust/issues/63063 stablized.
            // type ValueType<'a> = impl Serialize + 'a where K: 'a, V: 'a;
            type ValueType<'a> = SerializeVecMap<K::ValueType<'a>, V::ValueType<'a>> where K: 'a, V: 'a;
            type Seed<'a, 'de> = $seed<'a, K, V>;

            // fn value(&self) -> Self::ValueType<'_> {
            //     let iter = self.iter().map(|(k, v)| (k.value(), v.value()));
            //
            //     SerializePairIterator {
            //         iter,
            //         size: Some(self.len()),
            //     }
            // }
            fn value(&self) -> Self::ValueType<'_> {
                SerializeVecMap {
                    iter: self.iter().map(|(k, v)| (k.value(), v.value())).collect()
                }
            }

            fn ty() -> TrinoTy {
                TrinoTy::Map(Box::new(K::ty()), Box::new(V::ty()))
            }

            fn seed<'a, 'de>(ctx: &'a Context<'a>) -> Self::Seed<'a, 'de> {
                if let TrinoTy::Map(t1, t2) = ctx.ty() {
                    $seed {
                        ctx,
                        key_ty: &*t1,
                        value_ty: &*t2,
                        _marker: PhantomData,
                    }
                } else {
                    unreachable!()
                }
            }

            fn empty() -> Self {
                Default::default()
            }
        }

        pub struct $seed<'a, K, V> {
            ctx: &'a Context<'a>,
            key_ty: &'a TrinoTy,
            value_ty: &'a TrinoTy,
            _marker: PhantomData<(K, V)>,
        }

        impl<'a, 'de, K: TrinoMapKey + $($bound+)*, V: Trino> Visitor<'de> for $seed<'a, K, V> {
            type Value = $ty<K, V>;
            fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
                formatter.write_str("map")
            }
            fn visit_map<A>(self, mut map: A) -> Result<Self::Value, A::Error>
            where
                A: MapAccess<'de>,
            {
                let mut ret: Self::Value =  Default::default();
                let key_ctx = self.ctx.with_ty(self.key_ty);
                let value_ctx = self.ctx.with_ty(self.value_ty);
                while let Some((k, v)) =
                    map.next_entry_seed(K::seed(&key_ctx), V::seed(&value_ctx))?
                {
                    ret.insert(k, v);
                }
                Ok(ret)
            }
        }

        impl<'a, 'de, K: TrinoMapKey + $($bound+)*, V: Trino> DeserializeSeed<'de>
            for $seed<'a, K, V>
        {
            type Value = $ty<K, V>;
            fn deserialize<D>(self, deserializer: D) -> Result<Self::Value, D::Error>
            where
                D: Deserializer<'de>,
            {
                deserializer.deserialize_map(self)
            }
        }
    };
}

gen_map!(HashMap<Eq, Hash>, HashMapSeed);
gen_map!(BTreeMap<Ord>, BTreeMapSeed);