toasty-core 0.2.0

Core types, schema representations, and driver interface for Toasty
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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148

use super::Value;

use std::{hash::Hash, ops};

/// An ordered sequence of [`Value`]s representing a record (row).
///
/// `ValueRecord` stores the field values of a single record. It dereferences
/// to `[Value]`, so slice methods like `len()`, `iter()`, and indexing work
/// directly.
///
/// # Examples
///
/// ```
/// use toasty_core::stmt::{Value, ValueRecord};
///
/// let record = ValueRecord::from_vec(vec![Value::from(1_i64), Value::from("alice")]);
/// assert_eq!(record.len(), 2);
/// assert_eq!(record[0], 1_i64);
/// assert_eq!(record[1], "alice");
/// ```
#[derive(Debug, Default, Clone, Eq)]
pub struct ValueRecord {
    /// The field values in this record, ordered by field index.
    pub fields: Vec<Value>,
}

impl ValueRecord {
    /// Creates a `ValueRecord` from a vector of field values.
    ///
    /// # Examples
    ///
    /// ```
    /// # use toasty_core::stmt::{Value, ValueRecord};
    /// let record = ValueRecord::from_vec(vec![Value::from(42_i64)]);
    /// assert_eq!(record.len(), 1);
    /// ```
    pub fn from_vec(fields: Vec<Value>) -> Self {
        Self { fields }
    }

    /// Returns the fields as a slice of [`Value`]s.
    pub fn as_slice(&self) -> &[Value] {
        &self[..]
    }
}

impl ops::Deref for ValueRecord {
    type Target = [Value];

    fn deref(&self) -> &Self::Target {
        &self.fields[..]
    }
}

impl ops::DerefMut for ValueRecord {
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.fields[..]
    }
}

impl IntoIterator for ValueRecord {
    type Item = Value;
    type IntoIter = std::vec::IntoIter<Value>;

    fn into_iter(self) -> Self::IntoIter {
        self.fields.into_iter()
    }
}

impl<'a> IntoIterator for &'a ValueRecord {
    type Item = &'a Value;
    type IntoIter = std::slice::Iter<'a, Value>;

    fn into_iter(self) -> Self::IntoIter {
        self.iter()
    }
}

impl<'a> IntoIterator for &'a mut ValueRecord {
    type Item = &'a mut Value;
    type IntoIter = std::slice::IterMut<'a, Value>;

    fn into_iter(self) -> Self::IntoIter {
        self.iter_mut()
    }
}

// This implementation delegates the PartialEq implementation to the [Value]
// (slice) implementation of PartialEq
impl PartialEq for ValueRecord {
    fn eq(&self, other: &Self) -> bool {
        **self == **other
    }
}

// had to impl hash for value record because conflicting implementations of hash trait
impl Hash for ValueRecord {
    fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
        (**self).hash(state);
    }
}

macro_rules! impl_value_eq_tuple {
    ( $len:literal; $(($T:ident, $idx:tt)),+ ) => {
        impl<$($T),+> PartialEq<($($T,)+)> for Value
        where
            $(Value: PartialEq<$T>,)+
        {
            fn eq(&self, other: &($($T,)+)) -> bool {
                match self {
                    Value::Record(v) => {
                        v.fields.len() == $len
                            $(&& v.fields[$idx].eq(&other.$idx))+
                    }
                    _ => false,
                }
            }
        }

        impl<$($T),+> PartialEq<Value> for ($($T,)+)
        where
            $($T: PartialEq<Value>,)+
        {
            fn eq(&self, other: &Value) -> bool {
                match other {
                    Value::Record(v) => {
                        v.fields.len() == $len
                            $(&& self.$idx.eq(&v.fields[$idx]))+
                    }
                    _ => false,
                }
            }
        }
    };
}

impl_value_eq_tuple!(1; (T0, 0));
impl_value_eq_tuple!(2; (T0, 0), (T1, 1));
impl_value_eq_tuple!(3; (T0, 0), (T1, 1), (T2, 2));
impl_value_eq_tuple!(4; (T0, 0), (T1, 1), (T2, 2), (T3, 3));
impl_value_eq_tuple!(5; (T0, 0), (T1, 1), (T2, 2), (T3, 3), (T4, 4));
impl_value_eq_tuple!(6; (T0, 0), (T1, 1), (T2, 2), (T3, 3), (T4, 4), (T5, 5));
impl_value_eq_tuple!(7; (T0, 0), (T1, 1), (T2, 2), (T3, 3), (T4, 4), (T5, 5), (T6, 6));
impl_value_eq_tuple!(8; (T0, 0), (T1, 1), (T2, 2), (T3, 3), (T4, 4), (T5, 5), (T6, 6), (T7, 7));
impl_value_eq_tuple!(9; (T0, 0), (T1, 1), (T2, 2), (T3, 3), (T4, 4), (T5, 5), (T6, 6), (T7, 7), (T8, 8));
impl_value_eq_tuple!(10; (T0, 0), (T1, 1), (T2, 2), (T3, 3), (T4, 4), (T5, 5), (T6, 6), (T7, 7), (T8, 8), (T9, 9));
impl_value_eq_tuple!(11; (T0, 0), (T1, 1), (T2, 2), (T3, 3), (T4, 4), (T5, 5), (T6, 6), (T7, 7), (T8, 8), (T9, 9), (T10, 10));
impl_value_eq_tuple!(12; (T0, 0), (T1, 1), (T2, 2), (T3, 3), (T4, 4), (T5, 5), (T6, 6), (T7, 7), (T8, 8), (T9, 9), (T10, 10), (T11, 11));