//! This crate provides the `AnyMap` type, a safe and convenient store for one value of each type. #![crate_name = "anymap"] #![crate_type = "lib"] #![feature(default_type_params)] #![warn(unnecessary_qualification, non_uppercase_statics, variant_size_difference, managed_heap_memory, unnecessary_typecast, missing_doc, unused_result)] #[cfg(test)] extern crate test; use std::any::Any; use std::intrinsics::TypeId; use std::collections::{Collection, HashMap, Mutable}; use std::hash::{Hash, Hasher, Writer}; use std::mem::{transmute, transmute_copy}; use std::raw::TraitObject; struct TypeIdHasher; struct TypeIdState { value: u64, } impl Writer for TypeIdState { #[inline(always)] fn write(&mut self, bytes: &[u8]) { // This expects to receive one and exactly one 64-bit value debug_assert!(bytes.len() == 8); unsafe { std::ptr::copy_nonoverlapping_memory(&mut self.value, transmute(&bytes[0]), 1) } } } impl Hasher for TypeIdHasher { fn hash>(&self, value: &T) -> u64 { let mut state = TypeIdState { value: 0, }; value.hash(&mut state); state.value } } /// An extension of `AnyRefExt` allowing unchecked downcasting of trait objects to `&T`. trait UncheckedAnyRefExt<'a> { /// Returns a reference to the boxed value, assuming that it is of type `T`. This should only be /// called if you are ABSOLUTELY CERTAIN of `T` as you will get really wacky output if it’s not. unsafe fn as_ref_unchecked(self) -> &'a T; } impl<'a> UncheckedAnyRefExt<'a> for &'a Any + 'a { #[inline] unsafe fn as_ref_unchecked(self) -> &'a T { // Get the raw representation of the trait object let to: TraitObject = transmute_copy(&self); // Extract the data pointer transmute(to.data) } } /// An extension of `AnyMutRefExt` allowing unchecked downcasting of trait objects to `&mut T`. trait UncheckedAnyMutRefExt<'a> { /// Returns a reference to the boxed value, assuming that it is of type `T`. This should only be /// called if you are ABSOLUTELY CERTAIN of `T` as you will get really wacky output if it’s not. unsafe fn as_mut_unchecked(self) -> &'a mut T; } impl<'a> UncheckedAnyMutRefExt<'a> for &'a mut Any + 'a { #[inline] unsafe fn as_mut_unchecked(self) -> &'a mut T { // Get the raw representation of the trait object let to: TraitObject = transmute_copy(&self); // Extract the data pointer transmute(to.data) } } /// A map containing zero or one values for any given type and allowing convenient, /// type-safe access to those values. /// /// ```rust /// # use anymap::AnyMap; /// let mut data = AnyMap::new(); /// assert_eq!(data.find(), None::<&int>); /// data.insert(42i); /// assert_eq!(data.find(), Some(&42i)); /// data.remove::(); /// assert_eq!(data.find::(), None); /// /// #[deriving(PartialEq, Show)] /// struct Foo { /// str: String, /// } /// /// assert_eq!(data.find::(), None); /// data.insert(Foo { str: "foo".to_string() }); /// assert_eq!(data.find(), Some(&Foo { str: "foo".to_string() })); /// data.find_mut::().map(|foo| foo.str.push_char('t')); /// assert_eq!(data.find::().unwrap().str.as_slice(), "foot"); /// ``` /// /// Values containing non-static references are not permitted. pub struct AnyMap { data: HashMap, TypeIdHasher>, } impl AnyMap { /// Construct a new `AnyMap`. pub fn new() -> AnyMap { AnyMap { data: HashMap::with_hasher(TypeIdHasher), } } } impl AnyMap { /// Retrieve the value stored in the map for the type `T`, if it exists. pub fn find<'a, T: 'static>(&'a self) -> Option<&'a T> { self.data.find(&TypeId::of::()).map(|any| unsafe { any.as_ref_unchecked::() }) } /// Retrieve a mutable reference to the value stored in the map for the type `T`, if it exists. pub fn find_mut<'a, T: 'static>(&'a mut self) -> Option<&'a mut T> { self.data.find_mut(&TypeId::of::()).map(|any| unsafe { any.as_mut_unchecked::() }) } /// Set the value contained in the map for the type `T`. /// This will override any previous value stored. pub fn insert(&mut self, value: T) { self.data.insert(TypeId::of::(), box value as Box); } /// Remove the value for the type `T` if it existed. pub fn remove(&mut self) { self.data.remove(&TypeId::of::()); } /// Does a value of type `T` exist? pub fn contains(&self) -> bool { self.data.contains_key(&TypeId::of::()) } } 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(0u, 100) { data.insert(42i); } }) } #[bench] fn bench_find_missing(b: &mut ::test::Bencher) { b.iter(|| { let data = AnyMap::new(); for _ in range(0u, 100) { assert_eq!(data.find(), None::<&int>); } }) } #[bench] fn bench_find_present(b: &mut ::test::Bencher) { b.iter(|| { let mut data = AnyMap::new(); data.insert(42i); // These inner loops are a feeble attempt to drown the other factors. for _ in range(0u, 100) { assert_eq!(data.find(), Some(&42i)); } }) }