trait-kit 0.2.3

// Copyright (c) 2026 Kirky.X
//
// Licensed under the MIT License
// See LICENSE file in the project root for full license information.

//! Generic type-keyed map backed by `RefCell<HashMap<TypeId, Box<dyn Any>>>`.
//!
//! Single-threaded by design (Kit is `!Sync`).

use std::any::{Any, TypeId};
use std::cell::RefCell;
use std::collections::HashMap;

/// A type-keyed map for storing capabilities and configs.
///
/// Single-threaded by design. Uses `RefCell` for interior mutability
/// (no locking overhead, no poisoning). Kit is `!Sync` by design.
pub struct TypeMap {
    inner: RefCell<HashMap<TypeId, Box<dyn Any>>>,
}

impl TypeMap {
    /// Create an empty map.
    pub fn new() -> Self {
        TypeMap {
            inner: RefCell::new(HashMap::new()),
        }
    }

    /// Insert a value for the given type key. Overwrites any existing entry.
    pub fn insert<T: 'static>(&self, value: T) {
        let key = TypeId::of::<T>();
        self.inner.borrow_mut().insert(key, Box::new(value));
    }

    /// Insert a boxed value by raw `TypeId`.
    pub fn insert_boxed(&self, type_id: TypeId, value: Box<dyn Any>) {
        self.inner.borrow_mut().insert(type_id, value);
    }

    /// Returns `true` if the map contains a value for the given `TypeId`.
    pub fn contains_by_type_id(&self, type_id: TypeId) -> bool {
        self.inner.borrow().contains_key(&type_id)
    }

    /// Returns `true` if the map contains a value of type `T`.
    pub fn contains<T: 'static>(&self) -> bool {
        self.inner.borrow().contains_key(&TypeId::of::<T>())
    }

    /// Returns the number of entries currently stored.
    pub(crate) fn len(&self) -> usize {
        self.inner.borrow().len()
    }

    /// Downcast the stored value to `T` and clone it.
    /// Returns `None` if the key doesn't exist or the type doesn't match.
    pub fn get_cloned<T: Clone + 'static>(&self) -> Option<T> {
        let key = TypeId::of::<T>();
        self.inner
            .borrow()
            .get(&key)
            .and_then(|boxed| boxed.downcast_ref::<T>())
            .cloned()
    }

    /// Downcast by raw `TypeId` to the given type and clone.
    pub fn get_cloned_by_type_id<T: Clone + 'static>(&self, type_id: TypeId) -> Option<T> {
        self.inner
            .borrow()
            .get(&type_id)
            .and_then(|boxed| boxed.downcast_ref::<T>())
            .cloned()
    }
}

impl Default for TypeMap {
    fn default() -> Self {
        Self::new()
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use std::rc::Rc;

    #[test]
    fn insert_then_get_cloned_returns_value() {
        let map = TypeMap::new();
        map.insert(42i32);
        assert_eq!(map.get_cloned::<i32>(), Some(42));
    }

    #[test]
    fn no_send_sync_bound_required() {
        // Rc<i32> is !Send + !Sync; if TypeMap required Send + Sync bounds,
        // this would not compile.
        let map = TypeMap::new();
        let rc = Rc::new(42);
        map.insert(rc.clone());
        assert_eq!(map.get_cloned::<Rc<i32>>(), Some(rc));
    }

    #[test]
    fn insert_boxed_and_get_by_type_id() {
        let map = TypeMap::new();
        let type_id = std::any::TypeId::of::<i32>();
        map.insert_boxed(type_id, Box::new(42i32));
        assert!(map.contains_by_type_id(type_id));
        assert_eq!(map.get_cloned_by_type_id::<i32>(type_id), Some(42));
    }

    #[test]
    fn overwrite_existing_entry() {
        let map = TypeMap::new();
        map.insert(1i32);
        map.insert(2i32);
        assert_eq!(map.get_cloned::<i32>(), Some(2));
    }

    #[test]
    fn get_cloned_returns_none_for_missing_key() {
        let map = TypeMap::new();
        assert_eq!(map.get_cloned::<i32>(), None);
    }

    #[test]
    fn contains_returns_correct_bool() {
        let map = TypeMap::new();
        assert!(!map.contains::<i32>());
        map.insert(42i32);
        assert!(map.contains::<i32>());
        assert!(!map.contains::<u64>());
    }

    #[test]
    fn len_returns_entry_count() {
        let map = TypeMap::new();
        assert_eq!(map.len(), 0);
        map.insert(1i32);
        assert_eq!(map.len(), 1);
        map.insert("a".to_string());
        assert_eq!(map.len(), 2);
    }

    #[test]
    fn default_creates_empty_map() {
        let map = TypeMap::default();
        assert_eq!(map.len(), 0);
        assert!(map.get_cloned::<i32>().is_none());
    }

    #[test]
    fn contains_by_type_id_returns_false_for_missing() {
        let map = TypeMap::new();
        let tid = std::any::TypeId::of::<i32>();
        assert!(!map.contains_by_type_id(tid));
    }

    #[test]
    fn get_cloned_by_type_id_returns_none_for_wrong_type() {
        let map = TypeMap::new();
        let i32_id = std::any::TypeId::of::<i32>();
        map.insert_boxed(i32_id, Box::new(42i32));
        // Request wrong type via a different TypeId
        let u64_id = std::any::TypeId::of::<u64>();
        assert_eq!(map.get_cloned_by_type_id::<u64>(u64_id), None);
        // Even right TypeId but wrong downcast type returns None
        assert_eq!(map.get_cloned_by_type_id::<u64>(i32_id), None);
    }
}