use std::prelude::v1::*;
use std::borrow::BorrowFrom;
use std::iter::{IntoIterator, RandomAccessIterator};
use std::ops::Index;
use std::fmt;
use std::slice;
use PhfHash;
use phf_shared;
pub struct OrderedMap<K:'static, V:'static> {
#[doc(hidden)]
pub key: u64,
#[doc(hidden)]
pub disps: &'static [(u32, u32)],
#[doc(hidden)]
pub idxs: &'static [usize],
#[doc(hidden)]
pub entries: &'static [(K, V)],
}
impl<K, V> fmt::Debug for OrderedMap<K, V> where K: fmt::Debug, V: fmt::Debug {
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
try!(write!(fmt, "OrderedMap {{"));
let mut first = true;
for (k, v) in self.entries() {
if !first {
try!(write!(fmt, ", "));
}
try!(write!(fmt, "{:?}: {:?}", k, v));
first = false;
}
write!(fmt, "}}")
}
}
impl<K, V, T: ?Sized> Index<T> for OrderedMap<K, V> where T: Eq + PhfHash + BorrowFrom<K> {
type Output = V;
fn index(&self, k: &T) -> &V {
self.get(k).expect("invalid key")
}
}
impl<K, V> OrderedMap<K, V> {
pub fn len(&self) -> usize {
self.entries.len()
}
pub fn is_empty(&self) -> bool {
self.len() == 0
}
pub fn get<T: ?Sized>(&self, key: &T) -> Option<&V> where T: Eq + PhfHash + BorrowFrom<K> {
self.get_entry(key).map(|e| e.1)
}
pub fn get_key<T: ?Sized>(&self, key: &T) -> Option<&K> where T: Eq + PhfHash + BorrowFrom<K> {
self.get_entry(key).map(|e| e.0)
}
pub fn contains_key<T: ?Sized>(&self, key: &T) -> bool where T: Eq + PhfHash + BorrowFrom<K> {
self.get(key).is_some()
}
pub fn get_index<T: ?Sized>(&self, key: &T) -> Option<usize>
where T: Eq + PhfHash + BorrowFrom<K> {
self.get_internal(key).map(|(i, _)| i)
}
pub fn get_entry<T: ?Sized>(&self, key: &T) -> Option<(&K, &V)>
where T: Eq + PhfHash + BorrowFrom<K> {
self.get_internal(key).map(|(_, e)| e)
}
fn get_internal<T: ?Sized>(&self, key: &T) -> Option<(usize, (&K, &V))>
where T: Eq + PhfHash + BorrowFrom<K> {
let (g, f1, f2) = key.phf_hash(self.key);
let (d1, d2) = self.disps[(g % (self.disps.len() as u32)) as usize];
let idx = self.idxs[(phf_shared::displace(f1, f2, d1, d2) % (self.idxs.len() as u32)) as usize];
let entry = &self.entries[idx];
let b: &T = BorrowFrom::borrow_from(&entry.0);
if b == key {
Some((idx, (&entry.0, &entry.1)))
} else {
None
}
}
pub fn entries<'a>(&'a self) -> Entries<'a, K, V> {
Entries { iter: self.entries.iter() }
}
pub fn keys<'a>(&'a self) -> Keys<'a, K, V> {
Keys { iter: self.entries() }
}
pub fn values<'a>(&'a self) -> Values<'a, K, V> {
Values { iter: self.entries() }
}
}
impl<'a, K, V> IntoIterator for &'a OrderedMap<K, V> {
type IntoIter = Entries<'a, K, V>;
fn into_iter(self) -> Entries<'a, K, V> {
self.entries()
}
}
pub struct Entries<'a, K:'a, V:'a> {
iter: slice::Iter<'a, (K, V)>,
}
impl<'a, K, V> Iterator for Entries<'a, K, V> {
type Item = (&'a K, &'a V);
fn next(&mut self) -> Option<(&'a K, &'a V)> {
self.iter.next().map(|e| (&e.0, &e.1))
}
fn size_hint(&self) -> (usize, Option<usize>) {
self.iter.size_hint()
}
}
impl<'a, K, V> DoubleEndedIterator for Entries<'a, K, V> {
fn next_back(&mut self) -> Option<(&'a K, &'a V)> {
self.iter.next_back().map(|e| (&e.0, &e.1))
}
}
impl<'a, K, V> RandomAccessIterator for Entries<'a, K, V> {
fn indexable(&self) -> usize {
self.iter.indexable()
}
fn idx(&mut self, index: usize) -> Option<(&'a K, &'a V)> {
self.iter.idx(index).map(|e| (&e.0, &e.1))
}
}
impl<'a, K, V> ExactSizeIterator for Entries<'a, K, V> {}
pub struct Keys<'a, K:'a, V:'a> {
iter: Entries<'a, K, V>,
}
impl<'a, K, V> Iterator for Keys<'a, K, V> {
type Item = &'a K;
fn next(&mut self) -> Option<&'a K> {
self.iter.next().map(|e| e.0)
}
fn size_hint(&self) -> (usize, Option<usize>) {
self.iter.size_hint()
}
}
impl<'a, K, V> DoubleEndedIterator for Keys<'a, K, V> {
fn next_back(&mut self) -> Option<&'a K> {
self.iter.next_back().map(|e| e.0)
}
}
impl<'a, K, V> RandomAccessIterator for Keys<'a, K, V> {
fn indexable(&self) -> usize {
self.iter.indexable()
}
fn idx(&mut self, index: usize) -> Option<&'a K> {
self.iter.idx(index).map(|e| e.0)
}
}
impl<'a, K, V> ExactSizeIterator for Keys<'a, K, V> {}
pub struct Values<'a, K:'a, V:'a> {
iter: Entries<'a, K, V>,
}
impl<'a, K, V> Iterator for Values<'a, K, V> {
type Item = &'a V;
fn next(&mut self) -> Option<&'a V> {
self.iter.next().map(|e| e.1)
}
fn size_hint(&self) -> (usize, Option<usize>) {
self.iter.size_hint()
}
}
impl<'a, K, V> DoubleEndedIterator for Values<'a, K, V> {
fn next_back(&mut self) -> Option<&'a V> {
self.iter.next_back().map(|e| e.1)
}
}
impl<'a, K, V> RandomAccessIterator for Values<'a, K, V> {
fn indexable(&self) -> usize {
self.iter.indexable()
}
fn idx(&mut self, index: usize) -> Option<&'a V> {
self.iter.idx(index).map(|e| e.1)
}
}
impl<'a, K, V> ExactSizeIterator for Values<'a, K, V> {}