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

//! DEPRECATED: removed in 0.8.0.
#![doc(html_root_url="https://docs.rs/phf_builder/0.7")]
extern crate phf;
extern crate phf_generator;

#[cfg(test)]
mod test;

use phf::PhfHash;
use std::collections::HashSet;
use std::hash::Hash;

/// A builder for the `phf::Map` type.
pub struct Map<K, V> {
    keys: Vec<K>,
    values: Vec<V>,
}

impl<K: Hash + PhfHash + Eq, V> Map<K, V> {
    /// Creates a new `phf::Map` builder.
    pub fn new() -> Map<K, V> {
        Map {
            keys: vec![],
            values: vec![],
        }
    }

    /// Adds an entry to the builder.
    pub fn entry(&mut self, key: K, value: V) -> &mut Map<K, V> {
        self.keys.push(key);
        self.values.push(value);
        self
    }

    /// Constructs a `phf::Map`.
    ///
    /// # Panics
    ///
    /// Panics if there are any duplicate keys.
    pub fn build(self) -> phf::Map<K, V> {
        {
            let mut set = HashSet::new();
            for key in &self.keys {
                if !set.insert(key) {
                    panic!("duplicate key");
                }
            }
        }

        let state = phf_generator::generate_hash(&self.keys);

        let mut entries = self.keys
                              .into_iter()
                              .zip(self.values)
                              .map(Some)
                              .collect::<Vec<_>>();
        let entries = state.map
                           .iter()
                           .map(|&i| entries[i].take().unwrap())
                           .collect();

        phf::Map {
            key: state.key,
            disps: phf::Slice::Dynamic(state.disps),
            entries: phf::Slice::Dynamic(entries),
        }
    }
}

/// A builder for the `phf::Set` type.
pub struct Set<T> {
    map: Map<T, ()>,
}

impl<T: Hash + PhfHash + Eq> Set<T> {
    /// Constructs a new `phf::Set` builder.
    pub fn new() -> Set<T> {
        Set { map: Map::new() }
    }

    /// Adds an entry to the builder.
    pub fn entry(&mut self, entry: T) -> &mut Set<T> {
        self.map.entry(entry, ());
        self
    }

    /// Constructs a `phf::Set`.
    ///
    /// # Panics
    ///
    /// Panics if there are any duplicate entries.
    pub fn build(self) -> phf::Set<T> {
        phf::Set {
            map: self.map.build()
        }
    }
}

/// A builder for the `phf::OrderedMap` type.
pub struct OrderedMap<K, V> {
    keys: Vec<K>,
    values: Vec<V>,
}

impl<K: Hash + PhfHash + Eq, V> OrderedMap<K, V> {
    /// Constructs a enw `phf::OrderedMap` builder.
    pub fn new() -> OrderedMap<K, V> {
        OrderedMap {
            keys: vec![],
            values: vec![],
        }
    }

    /// Adds an entry to the builder.
    pub fn entry(&mut self, key: K, value: V) -> &mut OrderedMap<K, V> {
        self.keys.push(key);
        self.values.push(value);
        self
    }

    /// Constructs a `phf::OrderedMap`.
    ///
    /// # Panics
    ///
    /// Panics if there are any duplicate keys.
    pub fn build(self) -> phf::OrderedMap<K, V> {
        {
            let mut set = HashSet::new();
            for key in &self.keys {
                if !set.insert(key) {
                    panic!("duplicate key");
                }
            }
        }

        let state = phf_generator::generate_hash(&self.keys);

        let entries = self.keys.into_iter().zip(self.values).collect();

        phf::OrderedMap {
            key: state.key,
            disps: phf::Slice::Dynamic(state.disps),
            idxs: phf::Slice::Dynamic(state.map),
            entries: phf::Slice::Dynamic(entries),
        }
    }
}

/// A builder for the `phf::OrderedSet` type.
pub struct OrderedSet<T> {
    map: OrderedMap<T, ()>,
}

impl<T: Hash + PhfHash + Eq> OrderedSet<T> {
    /// Constructs a new `phf::OrderedSet` builder.
    pub fn new() -> OrderedSet<T> {
        OrderedSet { map: OrderedMap::new() }
    }

    /// Adds an entry to the builder.
    pub fn entry(&mut self, entry: T) -> &mut OrderedSet<T> {
        self.map.entry(entry, ());
        self
    }

    /// Constructs a `phf::OrderedSet`.
    ///
    /// # Panics
    ///
    /// Panics if there are any duplicate entries.
    pub fn build(self) -> phf::OrderedSet<T> {
        phf::OrderedSet {
            map: self.map.build(),
        }
    }
}