impl<T: Eq> Eq for TrieMap<T> {}
+impl<T: PartialOrd> PartialOrd for TrieMap<T> {
+ #[inline]
+ fn partial_cmp(&self, other: &TrieMap<T>) -> Option<Ordering> {
+ iter::order::partial_cmp(self.iter(), other.iter())
+ }
+}
+
impl<T: Show> Show for TrieMap<T> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
try!(write!(f, "{{"));
/// set.clear();
/// assert!(set.is_empty());
/// ```
-#[deriving(Clone, Hash, PartialEq, Eq)]
+#[deriving(Clone, Hash, PartialEq, Eq, PartialOrd)]
pub struct TrieSet {
map: TrieMap<()>
}
assert!(a == b);
}
+ #[test]
+ fn test_lt() {
+ let mut a = TrieMap::new();
+ let mut b = TrieMap::new();
+
+ assert!(!(a < b) && !(b < a));
+ assert!(b.insert(2u, 5i));
+ assert!(a < b);
+ assert!(a.insert(2, 7));
+ assert!(!(a < b) && b < a);
+ assert!(b.insert(1, 0));
+ assert!(b < a);
+ assert!(a.insert(0, 6));
+ assert!(a < b);
+ assert!(a.insert(6, 2));
+ assert!(a < b && !(b < a));
+ }
+
+ #[test]
+ fn test_ord() {
+ let mut a = TrieMap::new();
+ let mut b = TrieMap::new();
+
+ assert!(a <= b && a >= b);
+ assert!(a.insert(1u, 1i));
+ assert!(a > b && a >= b);
+ assert!(b < a && b <= a);
+ assert!(b.insert(2, 2));
+ assert!(b > a && b >= a);
+ assert!(a < b && a <= b);
+ }
+
#[test]
fn test_hash() {
let mut x = TrieMap::new();
assert!(a.clone() == a);
}
+
+ #[test]
+ fn test_lt() {
+ let mut a = TrieSet::new();
+ let mut b = TrieSet::new();
+
+ assert!(!(a < b) && !(b < a));
+ assert!(b.insert(2u));
+ assert!(a < b);
+ assert!(a.insert(3u));
+ assert!(!(a < b) && b < a);
+ assert!(b.insert(1));
+ assert!(b < a);
+ assert!(a.insert(0));
+ assert!(a < b);
+ assert!(a.insert(6));
+ assert!(a < b && !(b < a));
+ }
+
+ #[test]
+ fn test_ord() {
+ let mut a = TrieSet::new();
+ let mut b = TrieSet::new();
+
+ assert!(a <= b && a >= b);
+ assert!(a.insert(1u));
+ assert!(a > b && a >= b);
+ assert!(b < a && b <= a);
+ assert!(b.insert(2u));
+ assert!(b > a && b >= a);
+ assert!(a < b && a <= b);
+ }
}