use core::prelude::*;
use core::borrow::BorrowFrom;
use core::fmt;
use PhfHash;
use map;
use Map;
pub struct Set<T:'static> {
#[doc(hidden)]
pub map: Map<T, ()>
}
impl<T> fmt::Show for Set<T> where T: fmt::Show {
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
try!(write!(fmt, "{{"));
let mut first = true;
for entry in self.iter() {
if !first {
try!(write!(fmt, ", "));
}
try!(write!(fmt, "{}", entry));
first = false;
}
write!(fmt, "}}")
}
}
impl<T> Set<T> {
pub fn len(&self) -> uint {
self.map.len()
}
pub fn is_empty(&self) -> bool {
self.len() == 0
}
pub fn get_key<Sized? U>(&self, key: &U) -> Option<&T> where U: Eq + PhfHash + BorrowFrom<T> {
self.map.get_key(key)
}
pub fn contains<Sized? U>(&self, value: &U) -> bool where U: Eq + PhfHash + BorrowFrom<T> {
self.map.contains_key(value)
}
pub fn iter<'a>(&'a self) -> Iter<'a, T> {
Iter { iter: self.map.keys() }
}
}
impl<T> Set<T> where T: Eq + PhfHash {
pub fn is_disjoint(&self, other: &Set<T>) -> bool {
!self.iter().any(|value| other.contains(value))
}
pub fn is_subset(&self, other: &Set<T>) -> bool {
self.iter().all(|value| other.contains(value))
}
pub fn is_superset(&self, other: &Set<T>) -> bool {
other.is_subset(self)
}
}
pub struct Iter<'a, T:'static> {
iter: map::Keys<'a, T, ()>,
}
impl<'a, T> Iterator<&'a T> for Iter<'a, T> {
fn next(&mut self) -> Option<&'a T> {
self.iter.next()
}
fn size_hint(&self) -> (uint, Option<uint>) {
self.iter.size_hint()
}
}
impl<'a, T> DoubleEndedIterator<&'a T> for Iter<'a, T> {
fn next_back(&mut self) -> Option<&'a T> {
self.iter.next_back()
}
}
impl<'a, T> ExactSizeIterator<&'a T> for Iter<'a, T> {}