#[cfg(test)]
use std::mem;
use std::{
any::TypeId,
borrow::Borrow,
collections::hash_map::{self, HashMap},
hash::{BuildHasherDefault, Hash, Hasher},
ops::{Index, IndexMut},
};
use crate::any::{Any, UncheckedAnyExt};
#[derive(Default)]
struct TypeIdHasher {
value: u64,
}
impl Hasher for TypeIdHasher {
#[inline]
fn write(&mut self, bytes: &[u8]) {
assert!(bytes.len() == 8);
self.value = u64::from(bytes[0])
| u64::from(bytes[1]) << 8
| u64::from(bytes[2]) << 16
| u64::from(bytes[3]) << 24
| u64::from(bytes[4]) << 32
| u64::from(bytes[5]) << 40
| u64::from(bytes[6]) << 48
| u64::from(bytes[7]) << 56;
}
#[inline]
fn finish(&self) -> u64 {
self.value
}
}
#[test]
fn type_id_hasher() {
fn verify_hashing_with(type_id: TypeId) {
let mut hasher = TypeIdHasher::default();
type_id.hash(&mut hasher);
assert_eq!(hasher.finish(), unsafe {
mem::transmute::<TypeId, u64>(type_id)
});
}
verify_hashing_with(TypeId::of::<usize>());
verify_hashing_with(TypeId::of::<()>());
verify_hashing_with(TypeId::of::<str>());
verify_hashing_with(TypeId::of::<&str>());
verify_hashing_with(TypeId::of::<Vec<u8>>());
}
#[derive(Debug)]
pub struct RawMap<A: ?Sized + UncheckedAnyExt = dyn Any> {
inner: HashMap<TypeId, Box<A>, BuildHasherDefault<TypeIdHasher>>,
}
impl<A: ?Sized + UncheckedAnyExt> Clone for RawMap<A>
where
Box<A>: Clone,
{
#[inline]
fn clone(&self) -> RawMap<A> {
RawMap {
inner: self.inner.clone(),
}
}
}
impl_common_methods! {
field: RawMap.inner;
new() => HashMap::with_hasher(Default::default());
with_capacity(capacity) => HashMap::with_capacity_and_hasher(capacity, Default::default());
}
#[derive(Clone)]
pub struct Iter<'a, A: ?Sized + UncheckedAnyExt> {
inner: hash_map::Iter<'a, TypeId, Box<A>>,
}
impl<'a, A: ?Sized + UncheckedAnyExt> Iterator for Iter<'a, A> {
type Item = &'a A;
#[inline]
fn next(&mut self) -> Option<&'a A> {
self.inner.next().map(|x| &**x.1)
}
#[inline]
fn size_hint(&self) -> (usize, Option<usize>) {
self.inner.size_hint()
}
}
impl<'a, A: ?Sized + UncheckedAnyExt> ExactSizeIterator for Iter<'a, A> {
#[inline]
fn len(&self) -> usize {
self.inner.len()
}
}
pub struct IterMut<'a, A: ?Sized + UncheckedAnyExt> {
inner: hash_map::IterMut<'a, TypeId, Box<A>>,
}
impl<'a, A: ?Sized + UncheckedAnyExt> Iterator for IterMut<'a, A> {
type Item = &'a mut A;
#[inline]
fn next(&mut self) -> Option<&'a mut A> {
self.inner.next().map(|x| &mut **x.1)
}
#[inline]
fn size_hint(&self) -> (usize, Option<usize>) {
self.inner.size_hint()
}
}
impl<'a, A: ?Sized + UncheckedAnyExt> ExactSizeIterator for IterMut<'a, A> {
#[inline]
fn len(&self) -> usize {
self.inner.len()
}
}
pub struct IntoIter<A: ?Sized + UncheckedAnyExt> {
inner: hash_map::IntoIter<TypeId, Box<A>>,
}
impl<A: ?Sized + UncheckedAnyExt> Iterator for IntoIter<A> {
type Item = Box<A>;
#[inline]
fn next(&mut self) -> Option<Box<A>> {
self.inner.next().map(|x| x.1)
}
#[inline]
fn size_hint(&self) -> (usize, Option<usize>) {
self.inner.size_hint()
}
}
impl<A: ?Sized + UncheckedAnyExt> ExactSizeIterator for IntoIter<A> {
#[inline]
fn len(&self) -> usize {
self.inner.len()
}
}
pub struct Drain<'a, A: ?Sized + UncheckedAnyExt> {
inner: hash_map::Drain<'a, TypeId, Box<A>>,
}
impl<'a, A: ?Sized + UncheckedAnyExt> Iterator for Drain<'a, A> {
type Item = Box<A>;
#[inline]
fn next(&mut self) -> Option<Box<A>> {
self.inner.next().map(|x| x.1)
}
#[inline]
fn size_hint(&self) -> (usize, Option<usize>) {
self.inner.size_hint()
}
}
impl<'a, A: ?Sized + UncheckedAnyExt> ExactSizeIterator for Drain<'a, A> {
#[inline]
fn len(&self) -> usize {
self.inner.len()
}
}
impl<A: ?Sized + UncheckedAnyExt> RawMap<A> {
#[inline]
pub fn iter(&self) -> Iter<A> {
Iter {
inner: self.inner.iter(),
}
}
#[inline]
pub fn iter_mut(&mut self) -> IterMut<A> {
IterMut {
inner: self.inner.iter_mut(),
}
}
#[inline]
pub fn drain(&mut self) -> Drain<A> {
Drain {
inner: self.inner.drain(),
}
}
#[inline]
pub fn entry(&mut self, key: TypeId) -> Entry<A> {
match self.inner.entry(key) {
hash_map::Entry::Occupied(e) => Entry::Occupied(OccupiedEntry { inner: e }),
hash_map::Entry::Vacant(e) => Entry::Vacant(VacantEntry { inner: e }),
}
}
#[inline]
pub fn get<Q: ?Sized>(&self, k: &Q) -> Option<&A>
where
TypeId: Borrow<Q>,
Q: Hash + Eq,
{
self.inner.get(k).map(|x| &**x)
}
#[inline]
pub fn contains_key<Q: ?Sized>(&self, k: &Q) -> bool
where
TypeId: Borrow<Q>,
Q: Hash + Eq,
{
self.inner.contains_key(k)
}
#[inline]
pub fn get_mut<Q: ?Sized>(&mut self, k: &Q) -> Option<&mut A>
where
TypeId: Borrow<Q>,
Q: Hash + Eq,
{
self.inner.get_mut(k).map(|x| &mut **x)
}
#[inline]
pub unsafe fn insert(&mut self, key: TypeId, value: Box<A>) -> Option<Box<A>> {
self.inner.insert(key, value)
}
#[inline]
pub fn remove<Q: ?Sized>(&mut self, k: &Q) -> Option<Box<A>>
where
TypeId: Borrow<Q>,
Q: Hash + Eq,
{
self.inner.remove(k)
}
}
impl<A: ?Sized + UncheckedAnyExt, Q> Index<Q> for RawMap<A>
where
TypeId: Borrow<Q>,
Q: Eq + Hash,
{
type Output = A;
#[inline]
fn index(&self, index: Q) -> &A {
self.get(&index).expect("no entry found for key")
}
}
impl<A: ?Sized + UncheckedAnyExt, Q> IndexMut<Q> for RawMap<A>
where
TypeId: Borrow<Q>,
Q: Eq + Hash,
{
#[inline]
fn index_mut(&mut self, index: Q) -> &mut A {
self.get_mut(&index).expect("no entry found for key")
}
}
impl<A: ?Sized + UncheckedAnyExt> IntoIterator for RawMap<A> {
type IntoIter = IntoIter<A>;
type Item = Box<A>;
#[inline]
fn into_iter(self) -> IntoIter<A> {
IntoIter {
inner: self.inner.into_iter(),
}
}
}
pub struct OccupiedEntry<'a, A: ?Sized + UncheckedAnyExt> {
inner: hash_map::OccupiedEntry<'a, TypeId, Box<A>>,
}
pub struct VacantEntry<'a, A: ?Sized + UncheckedAnyExt> {
inner: hash_map::VacantEntry<'a, TypeId, Box<A>>,
}
pub enum Entry<'a, A: ?Sized + UncheckedAnyExt> {
Occupied(OccupiedEntry<'a, A>),
Vacant(VacantEntry<'a, A>),
}
impl<'a, A: ?Sized + UncheckedAnyExt> Entry<'a, A> {
#[inline]
pub unsafe fn or_insert(self, default: Box<A>) -> &'a mut A {
match self {
Entry::Occupied(inner) => inner.into_mut(),
Entry::Vacant(inner) => inner.insert(default),
}
}
#[inline]
pub unsafe fn or_insert_with<F: FnOnce() -> Box<A>>(self, default: F) -> &'a mut A {
match self {
Entry::Occupied(inner) => inner.into_mut(),
Entry::Vacant(inner) => inner.insert(default()),
}
}
}
impl<'a, A: ?Sized + UncheckedAnyExt> OccupiedEntry<'a, A> {
#[inline]
pub fn get(&self) -> &A {
&**self.inner.get()
}
#[inline]
pub fn get_mut(&mut self) -> &mut A {
&mut **self.inner.get_mut()
}
#[inline]
pub fn into_mut(self) -> &'a mut A {
&mut **self.inner.into_mut()
}
#[inline]
pub unsafe fn insert(&mut self, value: Box<A>) -> Box<A> {
self.inner.insert(value)
}
#[inline]
pub fn remove(self) -> Box<A> {
self.inner.remove()
}
}
impl<'a, A: ?Sized + UncheckedAnyExt> VacantEntry<'a, A> {
#[inline]
pub unsafe fn insert(self, value: Box<A>) -> &'a mut A {
&mut **self.inner.insert(value)
}
}