linear-map 1.2.0

A map implemented by searching linearly in a vector.
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162

//! An optional implementation of serialization/deserialization. Reference
//! implementations used:
//!
//! - [Serialize][1].
//! - [Deserialize][2].
//!
//! [1]: https://github.com/serde-rs/serde/blob/97856462467db2e90cf368e407c7ebcc726a01a9/serde/src/ser/impls.rs#L601-L611
//! [2]: https://github.com/serde-rs/serde/blob/97856462467db2e90cf368e407c7ebcc726a01a9/serde/src/de/impls.rs#L694-L746

extern crate serde;

use super::LinearMap;
use super::set::LinearSet;

use self::serde::{Serialize, Serializer, Deserialize, Deserializer};
use self::serde::de::{Visitor, MapAccess, SeqAccess, Error};
use self::serde::ser::{SerializeMap, SerializeSeq};

use std::marker::PhantomData;
use std::fmt;

impl<K, V> Serialize for LinearMap<K, V>
    where K: Serialize + Eq,
          V: Serialize,
{
    #[inline]
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
        where S: Serializer,
    {
        let mut state = try!(serializer.serialize_map(Some(self.len())));
        for (k, v) in self {
            try!(state.serialize_entry(k, v));
        }
        state.end()
    }
}

#[allow(missing_docs)]
pub struct LinearMapVisitor<K, V> {
    marker: PhantomData<LinearMap<K, V>>,
}

impl<K, V> LinearMapVisitor<K, V> {
    #[allow(missing_docs)]
    pub fn new() -> Self {
        LinearMapVisitor {
            marker: PhantomData,
        }
    }
}

impl<'de, K, V> Visitor<'de> for LinearMapVisitor<K, V>
    where K: Deserialize<'de> + Eq,
          V: Deserialize<'de>,
{
    type Value = LinearMap<K, V>;

    fn expecting(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(f, "a LinearMap")
    }

    #[inline]
    fn visit_unit<E>(self) -> Result<Self::Value, E>
        where E: Error,
    {
        Ok(LinearMap::new())
    }

    #[inline]
    fn visit_map<Visitor>(self, mut visitor: Visitor) -> Result<Self::Value, Visitor::Error>
        where Visitor: MapAccess<'de>
    {
        let mut values = LinearMap::with_capacity(visitor.size_hint().unwrap_or(0));

        while let Some((key, value)) = try!(visitor.next_entry()) {
            values.insert(key, value);
        }

        Ok(values)
    }
}

impl<'de, K, V> Deserialize<'de> for LinearMap<K, V>
    where K: Deserialize<'de> + Eq,
          V: Deserialize<'de>,
{
    fn deserialize<D>(deserializer: D) -> Result<LinearMap<K, V>, D::Error>
        where D: Deserializer<'de>
    {
        deserializer.deserialize_map(LinearMapVisitor::new())
    }
}

impl<K> Serialize for LinearSet<K>
    where K: Serialize + Eq
{
    #[inline]
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
        where S: Serializer,
    {
        let mut state = try!(serializer.serialize_seq(Some(self.len())));
        for k in self {
            try!(state.serialize_element(k));
        }
        state.end()
    }
}


#[allow(missing_docs)]
pub struct LinearSetVisitor<K> {
    marker: PhantomData<LinearSet<K>>,
}

impl<K> LinearSetVisitor<K>{
    #[allow(missing_docs)]
    pub fn new() -> Self {
        LinearSetVisitor {
            marker: PhantomData,
        }
    }
}

impl<'de, K> Visitor<'de> for LinearSetVisitor<K>
    where K: Deserialize<'de> + Eq,
{
    type Value = LinearSet<K>;

    fn expecting(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(f, "a LinearSet")
    }

    #[inline]
    fn visit_unit<E>(self) -> Result<Self::Value, E>
        where E: Error,
    {
        Ok(LinearSet::new())
    }

    #[inline]
    fn visit_seq<Visitor>(self, mut visitor: Visitor) -> Result<Self::Value, Visitor::Error>
        where Visitor: SeqAccess<'de>
    {
        let mut values = LinearSet::with_capacity(visitor.size_hint().unwrap_or(0));

        while let Some(key) = try!(visitor.next_element()) {
            values.insert(key);
        }

        Ok(values)
    }
}

impl<'de, K> Deserialize<'de> for LinearSet<K>
    where K: Deserialize<'de> + Eq,
{
    fn deserialize<D>(deserializer: D) -> Result<LinearSet<K>, D::Error>
        where D: Deserializer<'de>
    {
        deserializer.deserialize_seq(LinearSetVisitor::new())
    }
}