//! This crate provides the `AnyMap` type, a safe and convenient store for one value of each type.
-#![crate_id = "anymap#0.9"]
-#![crate_type = "rlib"]
-#![crate_type = "dylib"]
+#![crate_name = "anymap"]
+#![crate_type = "lib"]
#![feature(default_type_params)]
#![warn(unnecessary_qualification, non_uppercase_statics,
variant_size_difference, managed_heap_memory, unnecessary_typecast,
use std::any::Any;
use std::intrinsics::TypeId;
-use std::collections::HashMap;
+use std::collections::{Collection, HashMap, Mutable};
use std::hash::{Hash, Hasher, Writer};
use std::mem::{transmute, transmute_copy};
use std::raw::TraitObject;
pub fn remove<T: 'static>(&mut self) {
self.data.remove(&TypeId::of::<T>());
}
+
+ /// Does a value of type `T` exist?
+ pub fn contains<T: 'static>(&self) -> bool {
+ self.data.contains_key(&TypeId::of::<T>())
+ }
+}
+
+impl Collection for AnyMap {
+ fn len(&self) -> uint {
+ self.data.len()
+ }
+
+ fn is_empty(&self) -> bool {
+ self.data.is_empty()
+ }
+}
+
+impl Mutable for AnyMap {
+ fn clear(&mut self) {
+ self.data.clear();
+ }
}
#[bench]
fn bench_insertion(b: &mut ::test::Bencher) {
b.iter(|| {
let mut data = AnyMap::new();
- for _ in range(0, 100) {
+ for _ in range(0u, 100) {
data.insert(42i);
}
})
fn bench_find_missing(b: &mut ::test::Bencher) {
b.iter(|| {
let data = AnyMap::new();
- for _ in range(0, 100) {
+ for _ in range(0u, 100) {
assert_eq!(data.find(), None::<&int>);
}
})
let mut data = AnyMap::new();
data.insert(42i);
// These inner loops are a feeble attempt to drown the other factors.
- for _ in range(0, 100) {
+ for _ in range(0u, 100) {
assert_eq!(data.find(), Some(&42i));
}
})