      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
    163
    164
    165
    166
    167
    168
    169
    170
    171
    172
    173
    174
    175
    176
    177
    178
    179
    180
    181
    182
    183
    184
    185
    186

    // Copyright 2014 The Rust Project Developers. See the COPYRIGHT
    // file at the top-level directory of this distribution and at
    // http://rust-lang.org/COPYRIGHT.
    //
    // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
    // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
    // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
    // option. This file may not be copied, modified, or distributed
    // except according to those terms.

    //! Implementations of serialization for structures found in libcollections

    use std::hash::Hash;

    use {Decodable, Encodable, Decoder, Encoder, cap_capacity};
    use std::collections::{LinkedList, VecDeque, BTreeMap, BTreeSet, HashMap, HashSet};

    impl<
        T: Encodable
    > Encodable for LinkedList<T> {
        fn encode<S: Encoder>(&self, s: &mut S) -> Result<(), S::Error> {
            s.emit_seq(self.len(), |s| {
                for (i, e) in self.iter().enumerate() {
                    try!(s.emit_seq_elt(i, |s| e.encode(s)));
                }
                Ok(())
            })
        }
    }

    impl<T:Decodable> Decodable for LinkedList<T> {
        fn decode<D: Decoder>(d: &mut D) -> Result<LinkedList<T>, D::Error> {
            d.read_seq(|d, len| {
                let mut list = LinkedList::new();
                for i in 0..len {
                    list.push_back(try!(d.read_seq_elt(i, |d| Decodable::decode(d))));
                }
                Ok(list)
            })
        }
    }

    impl<T: Encodable> Encodable for VecDeque<T> {
        fn encode<S: Encoder>(&self, s: &mut S) -> Result<(), S::Error> {
            s.emit_seq(self.len(), |s| {
                for (i, e) in self.iter().enumerate() {
                    try!(s.emit_seq_elt(i, |s| e.encode(s)));
                }
                Ok(())
            })
        }
    }

    impl<T:Decodable> Decodable for VecDeque<T> {
        fn decode<D: Decoder>(d: &mut D) -> Result<VecDeque<T>, D::Error> {
            d.read_seq(|d, len| {
                let mut deque: VecDeque<T> = VecDeque::new();
                for i in 0..len {
                    deque.push_back(try!(d.read_seq_elt(i, |d| Decodable::decode(d))));
                }
                Ok(deque)
            })
        }
    }

    impl<
        K: Encodable + Ord,
        V: Encodable
    > Encodable for BTreeMap<K, V> {
        fn encode<S: Encoder>(&self, e: &mut S) -> Result<(), S::Error> {
            e.emit_map(self.len(), |e| {
                let mut i = 0;
                for (key, val) in self.iter() {
                    try!(e.emit_map_elt_key(i, |e| key.encode(e)));
                    try!(e.emit_map_elt_val(i, |e| val.encode(e)));
                    i += 1;
                }
                Ok(())
            })
        }
    }

    impl<
        K: Decodable + Ord,
        V: Decodable
    > Decodable for BTreeMap<K, V> {
        fn decode<D: Decoder>(d: &mut D) -> Result<BTreeMap<K, V>, D::Error> {
            d.read_map(|d, len| {
                let mut map = BTreeMap::new();
                for i in 0..len {
                    let key = try!(d.read_map_elt_key(i, |d| Decodable::decode(d)));
                    let val = try!(d.read_map_elt_val(i, |d| Decodable::decode(d)));
                    map.insert(key, val);
                }
                Ok(map)
            })
        }
    }

    impl<
        T: Encodable + Ord
    > Encodable for BTreeSet<T> {
        fn encode<S: Encoder>(&self, s: &mut S) -> Result<(), S::Error> {
            s.emit_seq(self.len(), |s| {
                let mut i = 0;
                for e in self.iter() {
                    try!(s.emit_seq_elt(i, |s| e.encode(s)));
                    i += 1;
                }
                Ok(())
            })
        }
    }

    impl<
        T: Decodable + Ord
    > Decodable for BTreeSet<T> {
        fn decode<D: Decoder>(d: &mut D) -> Result<BTreeSet<T>, D::Error> {
            d.read_seq(|d, len| {
                let mut set = BTreeSet::new();
                for i in 0..len {
                    set.insert(try!(d.read_seq_elt(i, |d| Decodable::decode(d))));
                }
                Ok(set)
            })
        }
    }

    impl<K, V> Encodable for HashMap<K, V>
        where K: Encodable + Hash + Eq,
              V: Encodable,
    {
        fn encode<E: Encoder>(&self, e: &mut E) -> Result<(), E::Error> {
            e.emit_map(self.len(), |e| {
                let mut i = 0;
                for (key, val) in self.iter() {
                    try!(e.emit_map_elt_key(i, |e| key.encode(e)));
                    try!(e.emit_map_elt_val(i, |e| val.encode(e)));
                    i += 1;
                }
                Ok(())
            })
        }
    }

    impl<K, V> Decodable for HashMap<K, V>
        where K: Decodable + Hash + Eq,
              V: Decodable,
    {
        fn decode<D: Decoder>(d: &mut D) -> Result<HashMap<K, V>, D::Error> {
            d.read_map(|d, len| {
                let mut map = HashMap::with_capacity(cap_capacity::<(K, V)>(len));
                for i in 0..len {
                    let key = try!(d.read_map_elt_key(i, |d| Decodable::decode(d)));
                    let val = try!(d.read_map_elt_val(i, |d| Decodable::decode(d)));
                    map.insert(key, val);
                }
                Ok(map)
            })
        }
    }

    impl<T> Encodable for HashSet<T> where T: Encodable + Hash + Eq {
        fn encode<E: Encoder>(&self, s: &mut E) -> Result<(), E::Error> {
            s.emit_seq(self.len(), |s| {
                let mut i = 0;
                for e in self.iter() {
                    try!(s.emit_seq_elt(i, |s| e.encode(s)));
                    i += 1;
                }
                Ok(())
            })
        }
    }

    impl<T> Decodable for HashSet<T> where T: Decodable + Hash + Eq, {
        fn decode<D: Decoder>(d: &mut D) -> Result<HashSet<T>, D::Error> {
            d.read_seq(|d, len| {
                let mut set = HashSet::with_capacity(cap_capacity::<T>(len));
                for i in 0..len {
                    set.insert(try!(d.read_seq_elt(i, |d| Decodable::decode(d))));
                }
                Ok(set)
            })
        }
    }

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
⇤
  Move up in search results
⇥
  Move down in search results
⏎
  Go to active search result
+
  Collapse/expand all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g. `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)