rust_key_paths/

lib.rs

// pub type KpType<R, V, Root, Value, MutRoot, MutValue, G, S>
// where
//     Root: ,
//     Value:    Borrow<V>,
//     MutRoot:  BorrowMut<R>,
//     MutValue: std::borrow::BorrowMut<V>,
//     G:        Fn(Root) -> Option<Value>,
//     S:        Fn(MutRoot) -> Option<MutValue> = Kp<R, V, Root, Value, MutRoot, MutValue, G, S>;

// type Getter<R, V, Root, Value> where Root: std::borrow::Borrow<R>, Value: std::borrow::Borrow<V> = fn(Root) -> Option<Value>;
// type Setter<R, V> = fn(&'r mut R) -> Option<&'r mut V>;

use std::sync::{Arc, Mutex};

// Export the lock module
pub mod lock;
pub mod prelude;

pub use lock::{
    ArcMutexAccess, ArcRwLockAccess, LockAccess, LockKp, LockKpType, RcRefCellAccess,
    StdMutexAccess, StdRwLockAccess,
};

#[cfg(feature = "parking_lot")]
pub use lock::{
    DirectParkingLotMutexAccess, DirectParkingLotRwLockAccess, ParkingLotMutexAccess,
    ParkingLotRwLockAccess,
};

// Export the async_lock module
pub mod async_lock;

// pub struct KpStatic<R, V> {
//     pub get: fn(&R) -> Option<&V>,
//     pub set: fn(&mut R) -> Option<&mut V>,
// }
//
// // KpStatic holds only fn pointers; it is a functional component with no owned data.
// unsafe impl<R, V> Send for KpStatic<R, V> {}
// unsafe impl<R, V> Sync for KpStatic<R, V> {}
//
// impl<R, V> KpStatic<R, V> {
//     pub const fn new(
//         get: fn(&R) -> Option<&V>,
//         set: fn(&mut R) -> Option<&mut V>,
//     ) -> Self {
//         Self { get, set }
//     }
//
//     #[inline(always)]
//     pub fn get<'a>(&self, root: &'a R) -> Option<&'a V> {
//         (self.get)(root)
//     }
//
//     #[inline(always)]
//     pub fn set<'a>(&self, root: &'a mut R) -> Option<&'a mut V> {
//         (self.set)(root)
//     }
// }

// // Macro generates:
// #[inline(always)]
// fn __get_static_str_field(x: &AllContainersTest) -> Option<&'static str> {
//     Some(&x.static_str_field)
// }
//
// #[inline(always)]
// fn __set_static_str_field(x: &mut AllContainersTest) -> Option<&mut &'static str> {
//     Some(&mut x.static_str_field)
// }
//
// pub static STATIC_STR_FIELD_KP: KpStatic<AllContainersTest, &'static str> =
//     KpStatic::new(__get_static_str_field, __set_static_str_field);

#[cfg(feature = "pin_project")]
pub mod pin;

/// Used so that `then_async` can infer `V2` from `AsyncKp::Value` without ambiguity
/// (e.g. `&i32` has both `Borrow<i32>` and `Borrow<&i32>`; this picks the referent).
/// Implemented only for reference types so there is no overlap with the blanket impl.
pub trait KeyPathValueTarget {
    type Target: Sized;
}
impl<T> KeyPathValueTarget for &T {
    type Target = T;
}
impl<T> KeyPathValueTarget for &mut T {
    type Target = T;
}

/// Build a keypath from `Type.field` segments. Use with types that have keypath accessors (e.g. `#[derive(Kp)]` from key-paths-derive).
#[macro_export]
macro_rules! keypath {
    { $root:ident . $field:ident } => { $root::$field() };
    { $root:ident . $field:ident . $($ty:ident . $f:ident).+ } => {
        $root::$field() $(.then($ty::$f()))+
    };
    ($root:ident . $field:ident) => { $root::$field() };
    ($root:ident . $field:ident . $($ty:ident . $f:ident).+) => {
        $root::$field() $(.then($ty::$f()))+
    };
}

/// Get value through a keypath or a default reference when the path returns `None`.
/// Use with `KpType`: `get_or!(User::name(), &user, &default)` where `default` is `&T` (same type as the path value). Returns `&T`.
/// Path syntax: `get_or!(&user => User.name, &default)`.
#[macro_export]
macro_rules! get_or {
    ($kp:expr, $root:expr, $default:expr) => {
        $kp.get($root).unwrap_or($default)
    };
    ($root:expr => $($path:tt)*, $default:expr) => {
        $crate::get_or!($crate::keypath!($($path)*), $root, $default)
    };
}

/// Get value through a keypath, or compute an owned fallback when the path returns `None`.
/// Use with `KpType`: `get_or_else!(User::name(), &user, || "default".to_string())`.
/// Returns `T` (owned). The keypath's value type must be `Clone`. The closure is only called when the path is `None`.
/// Path syntax: `get_or_else!(&user => (User.name), || "default".to_string())` — path in parentheses.
#[macro_export]
macro_rules! get_or_else {
    ($kp:expr, $root:expr, $closure:expr) => {
        $kp.get($root).map(|r| r.clone()).unwrap_or_else($closure)
    };
    ($root:expr => ($($path:tt)*), $closure:expr) => {
        $crate::get_or_else!($crate::keypath!($($path)*), $root, $closure)
    };
}

/// Zip multiple keypaths on the same root and apply a closure to the tuple of values.
/// Returns `Some(closure((v1, v2, ...)))` when all keypaths succeed, else `None`.
///
/// # Example
/// ```
/// use rust_key_paths::{Kp, KpType, zip_with_kp};
/// struct User { name: String, age: u32, city: String }
/// let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
/// let age_kp = KpType::new(|u: &User| Some(&u.age), |u: &mut User| Some(&mut u.age));
/// let city_kp = KpType::new(|u: &User| Some(&u.city), |u: &mut User| Some(&mut u.city));
/// let user = User { name: "Akash".into(), age: 30, city: "NYC".into() };
/// let summary = zip_with_kp!(
///     &user,
///     |(name, age, city)| format!("{}, {} from {}", name, age, city) =>
///     name_kp,
///     age_kp,
///     city_kp
/// );
/// assert_eq!(summary, Some("Akash, 30 from NYC".to_string()));
/// ```
#[macro_export]
macro_rules! zip_with_kp {
    ($root:expr, $closure:expr => $kp1:expr, $kp2:expr) => {
        match ($kp1.get($root), $kp2.get($root)) {
            (Some(__a), Some(__b)) => Some($closure((__a, __b))),
            _ => None,
        }
    };
    ($root:expr, $closure:expr => $kp1:expr, $kp2:expr, $kp3:expr) => {
        match ($kp1.get($root), $kp2.get($root), $kp3.get($root)) {
            (Some(__a), Some(__b), Some(__c)) => Some($closure((__a, __b, __c))),
            _ => None,
        }
    };
    ($root:expr, $closure:expr => $kp1:expr, $kp2:expr, $kp3:expr, $kp4:expr) => {
        match (
            $kp1.get($root),
            $kp2.get($root),
            $kp3.get($root),
            $kp4.get($root),
        ) {
            (Some(__a), Some(__b), Some(__c), Some(__d)) => Some($closure((__a, __b, __c, __d))),
            _ => None,
        }
    };
    ($root:expr, $closure:expr => $kp1:expr, $kp2:expr, $kp3:expr, $kp4:expr, $kp5:expr) => {
        match (
            $kp1.get($root),
            $kp2.get($root),
            $kp3.get($root),
            $kp4.get($root),
            $kp5.get($root),
        ) {
            (Some(__a), Some(__b), Some(__c), Some(__d), Some(__e)) => {
                Some($closure((__a, __b, __c, __d, __e)))
            }
            _ => None,
        }
    };
    ($root:expr, $closure:expr => $kp1:expr, $kp2:expr, $kp3:expr, $kp4:expr, $kp5:expr, $kp6:expr) => {
        match (
            $kp1.get($root),
            $kp2.get($root),
            $kp3.get($root),
            $kp4.get($root),
            $kp5.get($root),
            $kp6.get($root),
        ) {
            (Some(__a), Some(__b), Some(__c), Some(__d), Some(__e), Some(__f)) => {
                Some($closure((__a, __b, __c, __d, __e, __f)))
            }
            _ => None,
        }
    };
}

/// Kp will force dev to create get and set while value will be owned
pub type KpValue<'a, R, V> = Kp<
    R,
    V,
    &'a R,
    V, // Returns owned V, not &V
    &'a mut R,
    V, // Returns owned V, not &mut V
    for<'b> fn(&'b R) -> Option<V>,
    for<'b> fn(&'b mut R) -> Option<V>,
>;

/// Kp will force dev to create get and set while root and value both will be owned
pub type KpOwned<R, V> = Kp<
    R,
    V,
    R,
    V, // Returns owned V, not &V
    R,
    V, // Returns owned V, not &mut V
    fn(R) -> Option<V>,
    fn(R) -> Option<V>,
>;

/// Kp will force dev to create get and set while taking full ownership of the Root while returning Root as value.
pub type KpRoot<R> = Kp<
    R,
    R,
    R,
    R, // Returns owned V, not &V
    R,
    R, // Returns owned V, not &mut V
    fn(R) -> Option<R>,
    fn(R) -> Option<R>,
>;

/// Kp for void - experimental
pub type KpVoid = Kp<(), (), (), (), (), (), fn() -> Option<()>, fn() -> Option<()>>;

pub type KpDynamic<R, V> = Kp<
    R,
    V,
    &'static R,
    &'static V,
    &'static mut R,
    &'static mut V,
    Box<dyn for<'a> Fn(&'a R) -> Option<&'a V> + Send + Sync>,
    Box<dyn for<'a> Fn(&'a mut R) -> Option<&'a mut V> + Send + Sync>,
>;

pub type KpBox<'a, R, V> = Kp<
    R,
    V,
    &'a R,
    &'a V,
    &'a mut R,
    &'a mut V,
    Box<dyn Fn(&'a R) -> Option<&'a V> + 'a>,
    Box<dyn Fn(&'a mut R) -> Option<&'a mut V> + 'a>,
>;

pub type KpArc<'a, R, V> = Kp<
    R,
    V,
    &'a R,
    &'a V,
    &'a mut R,
    &'a mut V,
    Arc<dyn Fn(&'a R) -> Option<&'a V> + Send + Sync + 'a>,
    Arc<dyn Fn(&'a mut R) -> Option<&'a mut V> + Send + Sync + 'a>,
>;

pub type KpType<'a, R, V> = Kp<
    R,
    V,
    &'a R,
    &'a V,
    &'a mut R,
    &'a mut V,
    for<'b> fn(&'b R) -> Option<&'b V>,
    for<'b> fn(&'b mut R) -> Option<&'b mut V>,
>;

pub type KpTraitType<'a, R, V> = dyn KpTrait<
        R,
        V,
        &'a R,
        &'a V,
        &'a mut R,
        &'a mut V,
        for<'b> fn(&'b R) -> Option<&'b V>,
        for<'b> fn(&'b mut R) -> Option<&'b mut V>,
    >;

/// Keypath for `Option<RefCell<T>>`: `get` returns `Option<Ref<V>>` so the caller holds the guard.
/// Use `.get(root).as_ref().map(std::cell::Ref::deref)` to get `Option<&V>` while the `Ref` is in scope.
pub type KpOptionRefCellType<'a, R, V> = Kp<
    R,
    V,
    &'a R,
    std::cell::Ref<'a, V>,
    &'a mut R,
    std::cell::RefMut<'a, V>,
    for<'b> fn(&'b R) -> Option<std::cell::Ref<'b, V>>,
    for<'b> fn(&'b mut R) -> Option<std::cell::RefMut<'b, V>>,
>;

impl<'a, R, V> KpType<'a, R, V>
where
    'a: 'static,
{
    /// Converts this keypath (KpType) to [KpDynamic] for dynamic dispatch and storage.
    /// Requires `'a: 'static` so the boxed getter/setter closures can be `'static`.
    #[inline]
    pub fn to_dynamic(self) -> KpDynamic<R, V> {
        self.into()
    }
}

impl<'a, R, V> From<KpType<'a, R, V>> for KpDynamic<R, V>
where
    'a: 'static,
    R: 'static,
    V: 'static,
{
    #[inline]
    fn from(kp: KpType<'a, R, V>) -> Self {
        let get_fn = kp.get;
        let set_fn = kp.set;
        Kp::new(
            Box::new(move |t: &R| get_fn(t)),
            Box::new(move |t: &mut R| set_fn(t)),
        )
    }
}

// pub type KpType<R, V> = Kp<
//     R,
//     V,
//     &'static R,
//     &'static V,
//     &'static mut R,
//     &'static mut V,
//     for<'a> fn(&'a R) -> Option<&'a V>,
//     for<'a> fn(&'a mut R) -> Option<&'a mut V>,
// >;

// struct A{
//     b: std::sync::Arc<std::sync::Mutex<B>>,
// }
// struct B{
//     c: C
// }
// struct C{
//     d: String
// }

// pub struct LockKp {
//     first: KpType<'static, A, B>,
//     mid: KpType<'static, std::sync::Mutex<B>, B>,
//     second: KpType<'static, B, C>,
// }
//
// impl LockKp {
//     fn then(&self, kp: KpType<'static, B, String>) {
//
//     }
//     fn then_lock() {}
// }

// New type alias for composed/transformed keypaths
pub type KpComposed<R, V> = Kp<
    R,
    V,
    &'static R,
    &'static V,
    &'static mut R,
    &'static mut V,
    Box<dyn for<'b> Fn(&'b R) -> Option<&'b V> + Send + Sync>,
    Box<dyn for<'b> Fn(&'b mut R) -> Option<&'b mut V> + Send + Sync>,
>;

impl<R, V>
    Kp<
        R,
        V,
        &'static R,
        &'static V,
        &'static mut R,
        &'static mut V,
        Box<dyn for<'b> Fn(&'b R) -> Option<&'b V> + Send + Sync>,
        Box<dyn for<'b> Fn(&'b mut R) -> Option<&'b mut V> + Send + Sync>,
    >
{
    /// Build a keypath from two closures (e.g. when they capture a variable like an index).
    /// Same pattern as `Kp::new` in lock.rs; use this when the keypath captures variables.
    pub fn from_closures<G, S>(get: G, set: S) -> Self
    where
        G: for<'b> Fn(&'b R) -> Option<&'b V> + Send + Sync + 'static,
        S: for<'b> Fn(&'b mut R) -> Option<&'b mut V> + Send + Sync + 'static,
    {
        Self::new(Box::new(get), Box::new(set))
    }
}

pub struct AKp {
    getter: Rc<dyn for<'r> Fn(&'r dyn Any) -> Option<&'r dyn Any>>,
    root_type_id: TypeId,
    value_type_id: TypeId,
}

impl AKp {
    /// Create a new AKp from a KpType (the common reference-based keypath)
    pub fn new<'a, R, V>(keypath: KpType<'a, R, V>) -> Self
    where
        R: Any + 'static,
        V: Any + 'static,
    {
        let root_type_id = TypeId::of::<R>();
        let value_type_id = TypeId::of::<V>();
        let getter_fn = keypath.get;

        Self {
            getter: Rc::new(move |any: &dyn Any| {
                if let Some(root) = any.downcast_ref::<R>() {
                    getter_fn(root).map(|value: &V| value as &dyn Any)
                } else {
                    None
                }
            }),
            root_type_id,
            value_type_id,
        }
    }

    /// Create an AKp from a KpType (alias for `new()`)
    pub fn from<'a, R, V>(keypath: KpType<'a, R, V>) -> Self
    where
        R: Any + 'static,
        V: Any + 'static,
    {
        Self::new(keypath)
    }

    /// Get the value as a trait object (with root type checking)
    pub fn get<'r>(&self, root: &'r dyn Any) -> Option<&'r dyn Any> {
        (self.getter)(root)
    }

    /// Get the TypeId of the Root type
    pub fn root_type_id(&self) -> TypeId {
        self.root_type_id
    }

    /// Get the TypeId of the Value type
    pub fn value_type_id(&self) -> TypeId {
        self.value_type_id
    }

    /// Try to get the value with full type checking
    pub fn get_as<'a, Root: Any, Value: Any>(&self, root: &'a Root) -> Option<Option<&'a Value>> {
        if self.root_type_id == TypeId::of::<Root>() && self.value_type_id == TypeId::of::<Value>()
        {
            Some(
                self.get(root as &dyn Any)
                    .and_then(|any| any.downcast_ref::<Value>()),
            )
        } else {
            None
        }
    }

    /// Get a human-readable name for the value type
    pub fn kind_name(&self) -> String {
        format!("{:?}", self.value_type_id)
    }

    /// Get a human-readable name for the root type
    pub fn root_kind_name(&self) -> String {
        format!("{:?}", self.root_type_id)
    }

    /// Adapt this keypath to work with Arc<Root> instead of Root
    pub fn for_arc<Root>(&self) -> AKp
    where
        Root: Any + 'static,
    {
        let value_type_id = self.value_type_id;
        let getter = self.getter.clone();

        AKp {
            getter: Rc::new(move |any: &dyn Any| {
                if let Some(arc) = any.downcast_ref::<Arc<Root>>() {
                    getter(arc.as_ref() as &dyn Any)
                } else {
                    None
                }
            }),
            root_type_id: TypeId::of::<Arc<Root>>(),
            value_type_id,
        }
    }

    /// Adapt this keypath to work with Box<Root> instead of Root
    pub fn for_box<Root>(&self) -> AKp
    where
        Root: Any + 'static,
    {
        let value_type_id = self.value_type_id;
        let getter = self.getter.clone();

        AKp {
            getter: Rc::new(move |any: &dyn Any| {
                if let Some(boxed) = any.downcast_ref::<Box<Root>>() {
                    getter(boxed.as_ref() as &dyn Any)
                } else {
                    None
                }
            }),
            root_type_id: TypeId::of::<Box<Root>>(),
            value_type_id,
        }
    }

    /// Adapt this keypath to work with Rc<Root> instead of Root
    pub fn for_rc<Root>(&self) -> AKp
    where
        Root: Any + 'static,
    {
        let value_type_id = self.value_type_id;
        let getter = self.getter.clone();

        AKp {
            getter: Rc::new(move |any: &dyn Any| {
                if let Some(rc) = any.downcast_ref::<Rc<Root>>() {
                    getter(rc.as_ref() as &dyn Any)
                } else {
                    None
                }
            }),
            root_type_id: TypeId::of::<Rc<Root>>(),
            value_type_id,
        }
    }

    /// Adapt this keypath to work with Option<Root> instead of Root
    pub fn for_option<Root>(&self) -> AKp
    where
        Root: Any + 'static,
    {
        let value_type_id = self.value_type_id;
        let getter = self.getter.clone();

        AKp {
            getter: Rc::new(move |any: &dyn Any| {
                if let Some(opt) = any.downcast_ref::<Option<Root>>() {
                    opt.as_ref().and_then(|root| getter(root as &dyn Any))
                } else {
                    None
                }
            }),
            root_type_id: TypeId::of::<Option<Root>>(),
            value_type_id,
        }
    }

    /// Adapt this keypath to work with Result<Root, E> instead of Root
    pub fn for_result<Root, E>(&self) -> AKp
    where
        Root: Any + 'static,
        E: Any + 'static,
    {
        let value_type_id = self.value_type_id;
        let getter = self.getter.clone();

        AKp {
            getter: Rc::new(move |any: &dyn Any| {
                if let Some(result) = any.downcast_ref::<Result<Root, E>>() {
                    result
                        .as_ref()
                        .ok()
                        .and_then(|root| getter(root as &dyn Any))
                } else {
                    None
                }
            }),
            root_type_id: TypeId::of::<Result<Root, E>>(),
            value_type_id,
        }
    }

    /// Map the value through a transformation function with type checking
    /// Both original and mapped values must implement Any
    ///
    /// # Example
    /// ```
    /// use rust_key_paths::{AKp, Kp, KpType};
    /// struct User { name: String }
    /// let user = User { name: "Akash".to_string() };
    /// let name_kp = KpType::new(|u: &User| Some(&u.name), |_| None);
    /// let name_akp = AKp::new(name_kp);
    /// let len_akp = name_akp.map::<User, String, _, _>(|s| s.len());
    /// ```
    pub fn map<Root, OrigValue, MappedValue, F>(&self, mapper: F) -> AKp
    where
        Root: Any + 'static,
        OrigValue: Any + 'static,
        MappedValue: Any + 'static,
        F: Fn(&OrigValue) -> MappedValue + 'static,
    {
        let orig_root_type_id = self.root_type_id;
        let orig_value_type_id = self.value_type_id;
        let getter = self.getter.clone();
        let mapped_type_id = TypeId::of::<MappedValue>();

        AKp {
            getter: Rc::new(move |any_root: &dyn Any| {
                // Check root type matches
                if any_root.type_id() == orig_root_type_id {
                    getter(any_root).and_then(|any_value| {
                        // Verify the original value type matches
                        if orig_value_type_id == TypeId::of::<OrigValue>() {
                            any_value.downcast_ref::<OrigValue>().map(|orig_val| {
                                let mapped = mapper(orig_val);
                                // Box the mapped value and return as &dyn Any
                                Box::leak(Box::new(mapped)) as &dyn Any
                            })
                        } else {
                            None
                        }
                    })
                } else {
                    None
                }
            }),
            root_type_id: orig_root_type_id,
            value_type_id: mapped_type_id,
        }
    }

    /// Filter the value based on a predicate with full type checking
    /// Returns None if types don't match or predicate fails
    ///
    /// # Example
    /// ```
    /// use rust_key_paths::{AKp, Kp, KpType};
    /// struct User { age: i32 }
    /// let user = User { age: 30 };
    /// let age_kp = KpType::new(|u: &User| Some(&u.age), |_| None);
    /// let age_akp = AKp::new(age_kp);
    /// let adult_akp = age_akp.filter::<User, i32, _>(|age| *age >= 18);
    /// ```
    pub fn filter<Root, Value, F>(&self, predicate: F) -> AKp
    where
        Root: Any + 'static,
        Value: Any + 'static,
        F: Fn(&Value) -> bool + 'static,
    {
        let orig_root_type_id = self.root_type_id;
        let orig_value_type_id = self.value_type_id;
        let getter = self.getter.clone();

        AKp {
            getter: Rc::new(move |any_root: &dyn Any| {
                // Check root type matches
                if any_root.type_id() == orig_root_type_id {
                    getter(any_root).filter(|any_value| {
                        // Type check value and apply predicate
                        if orig_value_type_id == TypeId::of::<Value>() {
                            any_value
                                .downcast_ref::<Value>()
                                .map(|val| predicate(val))
                                .unwrap_or(false)
                        } else {
                            false
                        }
                    })
                } else {
                    None
                }
            }),
            root_type_id: orig_root_type_id,
            value_type_id: orig_value_type_id,
        }
    }
}
pub struct PKp<Root> {
    getter: Rc<dyn for<'r> Fn(&'r Root) -> Option<&'r dyn Any>>,
    value_type_id: TypeId,
    _phantom: std::marker::PhantomData<Root>,
}

impl<Root> PKp<Root>
where
    Root: 'static,
{
    /// Create a new PKp from a KpType (the common reference-based keypath)
    pub fn new<'a, V>(keypath: KpType<'a, Root, V>) -> Self
    where
        V: Any + 'static,
    {
        let value_type_id = TypeId::of::<V>();
        let getter_fn = keypath.get;

        Self {
            getter: Rc::new(move |root: &Root| getter_fn(root).map(|val: &V| val as &dyn Any)),
            value_type_id,
            _phantom: std::marker::PhantomData,
        }
    }

    /// Create a PKp from a KpType (alias for `new()`)
    pub fn from<'a, V>(keypath: KpType<'a, Root, V>) -> Self
    where
        V: Any + 'static,
    {
        Self::new(keypath)
    }

    /// Get the value as a trait object
    pub fn get<'r>(&self, root: &'r Root) -> Option<&'r dyn Any> {
        (self.getter)(root)
    }

    /// Get the TypeId of the Value type
    pub fn value_type_id(&self) -> TypeId {
        self.value_type_id
    }

    /// Try to downcast the result to a specific type
    pub fn get_as<'a, Value: Any>(&self, root: &'a Root) -> Option<&'a Value> {
        if self.value_type_id == TypeId::of::<Value>() {
            self.get(root).and_then(|any| any.downcast_ref::<Value>())
        } else {
            None
        }
    }

    /// Get a human-readable name for the value type
    pub fn kind_name(&self) -> String {
        format!("{:?}", self.value_type_id)
    }

    /// Adapt this keypath to work with Arc<Root> instead of Root
    pub fn for_arc(&self) -> PKp<Arc<Root>> {
        let getter = self.getter.clone();
        let value_type_id = self.value_type_id;

        PKp {
            getter: Rc::new(move |arc: &Arc<Root>| getter(arc.as_ref())),
            value_type_id,
            _phantom: std::marker::PhantomData,
        }
    }

    /// Adapt this keypath to work with Box<Root> instead of Root
    pub fn for_box(&self) -> PKp<Box<Root>> {
        let getter = self.getter.clone();
        let value_type_id = self.value_type_id;

        PKp {
            getter: Rc::new(move |boxed: &Box<Root>| getter(boxed.as_ref())),
            value_type_id,
            _phantom: std::marker::PhantomData,
        }
    }

    /// Adapt this keypath to work with Rc<Root> instead of Root
    pub fn for_rc(&self) -> PKp<Rc<Root>> {
        let getter = self.getter.clone();
        let value_type_id = self.value_type_id;

        PKp {
            getter: Rc::new(move |rc: &Rc<Root>| getter(rc.as_ref())),
            value_type_id,
            _phantom: std::marker::PhantomData,
        }
    }

    /// Adapt this keypath to work with Option<Root> instead of Root
    pub fn for_option(&self) -> PKp<Option<Root>> {
        let getter = self.getter.clone();
        let value_type_id = self.value_type_id;

        PKp {
            getter: Rc::new(move |opt: &Option<Root>| opt.as_ref().and_then(|root| getter(root))),
            value_type_id,
            _phantom: std::marker::PhantomData,
        }
    }

    /// Adapt this keypath to work with Result<Root, E> instead of Root
    pub fn for_result<E>(&self) -> PKp<Result<Root, E>>
    where
        E: 'static,
    {
        let getter = self.getter.clone();
        let value_type_id = self.value_type_id;

        PKp {
            getter: Rc::new(move |result: &Result<Root, E>| {
                result.as_ref().ok().and_then(|root| getter(root))
            }),
            value_type_id,
            _phantom: std::marker::PhantomData,
        }
    }

    /// Map the value through a transformation function
    /// The mapped value must also implement Any for type erasure
    ///
    /// # Example
    /// ```
    /// use rust_key_paths::{Kp, KpType, PKp};
    /// struct User { name: String }
    /// let user = User { name: "Akash".to_string() };
    /// let name_kp = KpType::new(|u: &User| Some(&u.name), |_| None);
    /// let name_pkp = PKp::new(name_kp);
    /// let len_pkp = name_pkp.map::<String, _, _>(|s| s.len());
    /// assert_eq!(len_pkp.get_as::<usize>(&user), Some(&5));
    /// ```
    pub fn map<OrigValue, MappedValue, F>(&self, mapper: F) -> PKp<Root>
    where
        OrigValue: Any + 'static,
        MappedValue: Any + 'static,
        F: Fn(&OrigValue) -> MappedValue + 'static,
    {
        let orig_type_id = self.value_type_id;
        let getter = self.getter.clone();
        let mapped_type_id = TypeId::of::<MappedValue>();

        PKp {
            getter: Rc::new(move |root: &Root| {
                getter(root).and_then(|any_value| {
                    // Verify the original type matches
                    if orig_type_id == TypeId::of::<OrigValue>() {
                        any_value.downcast_ref::<OrigValue>().map(|orig_val| {
                            let mapped = mapper(orig_val);
                            // Box the mapped value and return as &dyn Any
                            // Note: This creates a new allocation
                            Box::leak(Box::new(mapped)) as &dyn Any
                        })
                    } else {
                        None
                    }
                })
            }),
            value_type_id: mapped_type_id,
            _phantom: std::marker::PhantomData,
        }
    }

    /// Filter the value based on a predicate with type checking
    /// Returns None if the type doesn't match or predicate fails
    ///
    /// # Example
    /// ```
    /// use rust_key_paths::{Kp, KpType, PKp};
    /// struct User { age: i32 }
    /// let user = User { age: 30 };
    /// let age_kp = KpType::new(|u: &User| Some(&u.age), |_| None);
    /// let age_pkp = PKp::new(age_kp);
    /// let adult_pkp = age_pkp.filter::<i32, _>(|age| *age >= 18);
    /// assert_eq!(adult_pkp.get_as::<i32>(&user), Some(&30));
    /// ```
    pub fn filter<Value, F>(&self, predicate: F) -> PKp<Root>
    where
        Value: Any + 'static,
        F: Fn(&Value) -> bool + 'static,
    {
        let orig_type_id = self.value_type_id;
        let getter = self.getter.clone();

        PKp {
            getter: Rc::new(move |root: &Root| {
                getter(root).filter(|any_value| {
                    // Type check and apply predicate
                    if orig_type_id == TypeId::of::<Value>() {
                        any_value
                            .downcast_ref::<Value>()
                            .map(|val| predicate(val))
                            .unwrap_or(false)
                    } else {
                        false
                    }
                })
            }),
            value_type_id: orig_type_id,
            _phantom: std::marker::PhantomData,
        }
    }
}

// ========== ANY KEYPATHS (Hide Both Root and Value Types) ==========

pub trait KpTrait<R, V, Root, Value, MutRoot, MutValue, G, S> {
    fn type_id_of_root() -> TypeId
    where
        R: 'static,
    {
        std::any::TypeId::of::<R>()
    }
    fn type_id_of_value() -> TypeId
    where
        V: 'static,
    {
        std::any::TypeId::of::<V>()
    }
    fn get(&self, root: Root) -> Option<Value>;
    fn get_mut(&self, root: MutRoot) -> Option<MutValue>;
    fn then<SV, SubValue, MutSubValue, G2, S2>(
        self,
        next: Kp<V, SV, Value, SubValue, MutValue, MutSubValue, G2, S2>,
    ) -> Kp<
        R,
        SV,
        Root,
        SubValue,
        MutRoot,
        MutSubValue,
        impl Fn(Root) -> Option<SubValue>,
        impl Fn(MutRoot) -> Option<MutSubValue>,
    >
    where
        Self: Sized,
        Root: std::borrow::Borrow<R>,
        Value: std::borrow::Borrow<V>,
        MutRoot: std::borrow::BorrowMut<R>,
        MutValue: std::borrow::BorrowMut<V>,
        SubValue: std::borrow::Borrow<SV>,
        MutSubValue: std::borrow::BorrowMut<SV>,
        G2: Fn(Value) -> Option<SubValue>,
        S2: Fn(MutValue) -> Option<MutSubValue>,
        V: 'static;
}

pub trait ChainExt<R, V, Root, Value, MutRoot, MutValue> {
    /// Chain with a sync [crate::lock::LockKp]. Use `.get(root)` / `.get_mut(root)` on the returned keypath.
    fn then_lock<
        Lock,
        Mid,
        V2,
        LockValue,
        MidValue,
        Value2,
        MutLock,
        MutMid,
        MutValue2,
        G1,
        S1,
        L,
        G2,
        S2,
    >(
        self,
        lock_kp: crate::lock::LockKp<
            V,
            Lock,
            Mid,
            V2,
            Value,
            LockValue,
            MidValue,
            Value2,
            MutValue,
            MutLock,
            MutMid,
            MutValue2,
            G1,
            S1,
            L,
            G2,
            S2,
        >,
    ) -> crate::lock::KpThenLockKp<
        R,
        V,
        V2,
        Root,
        Value,
        Value2,
        MutRoot,
        MutValue,
        MutValue2,
        Self,
        crate::lock::LockKp<
            V,
            Lock,
            Mid,
            V2,
            Value,
            LockValue,
            MidValue,
            Value2,
            MutValue,
            MutLock,
            MutMid,
            MutValue2,
            G1,
            S1,
            L,
            G2,
            S2,
        >,
    >
    where
        V: 'static + Clone,
        V2: 'static,
        Value: std::borrow::Borrow<V>,
        Value2: std::borrow::Borrow<V2>,
        MutValue: std::borrow::BorrowMut<V>,
        MutValue2: std::borrow::BorrowMut<V2>,
        LockValue: std::borrow::Borrow<Lock>,
        MidValue: std::borrow::Borrow<Mid>,
        MutLock: std::borrow::BorrowMut<Lock>,
        MutMid: std::borrow::BorrowMut<Mid>,
        G1: Fn(Value) -> Option<LockValue>,
        S1: Fn(MutValue) -> Option<MutLock>,
        L: crate::lock::LockAccess<Lock, MidValue> + crate::lock::LockAccess<Lock, MutMid>,
        G2: Fn(MidValue) -> Option<Value2>,
        S2: Fn(MutMid) -> Option<MutValue2>,
        Self: Sized;

    /// Chain with a #[pin] Future field await (pin_project pattern). Use `.get_mut(&mut root).await` on the returned keypath.
    #[cfg(feature = "pin_project")]
    fn then_pin_future<Struct, Output, L>(
        self,
        pin_fut: L,
    ) -> crate::pin::KpThenPinFuture<R, Struct, Output, Root, MutRoot, Value, MutValue, Self, L>
    where
        V: 'static,
        Struct: Unpin + 'static,
        Output: 'static,
        Value: std::borrow::Borrow<Struct>,
        MutValue: std::borrow::BorrowMut<Struct>,
        L: crate::pin::PinFutureAwaitLike<Struct, Output> + Sync,
        Self: Sized;

    /// Chain with an async keypath (e.g. [crate::async_lock::AsyncLockKp]). Use `.get(&root).await` on the returned keypath.
    fn then_async<AsyncKp>(
        self,
        async_kp: AsyncKp,
    ) -> crate::async_lock::KpThenAsyncKeyPath<
        R,
        V,
        <AsyncKp::Value as KeyPathValueTarget>::Target,
        Root,
        Value,
        AsyncKp::Value,
        MutRoot,
        MutValue,
        AsyncKp::MutValue,
        Self,
        AsyncKp,
    >
    where
        V: 'static,
        Value: std::borrow::Borrow<V>,
        MutValue: std::borrow::BorrowMut<V>,
        AsyncKp: crate::async_lock::AsyncKeyPathLike<Value, MutValue>,
        AsyncKp::Value: KeyPathValueTarget
            + std::borrow::Borrow<<AsyncKp::Value as KeyPathValueTarget>::Target>,
        AsyncKp::MutValue: std::borrow::BorrowMut<<AsyncKp::Value as KeyPathValueTarget>::Target>,
        <AsyncKp::Value as KeyPathValueTarget>::Target: 'static,
        Self: Sized;
}

impl<R, V, Root, Value, MutRoot, MutValue, G, S> ChainExt<R, V, Root, Value, MutRoot, MutValue>
    for Kp<R, V, Root, Value, MutRoot, MutValue, G, S>
where
    Root: std::borrow::Borrow<R>,
    Value: std::borrow::Borrow<V>,
    MutRoot: std::borrow::BorrowMut<R>,
    MutValue: std::borrow::BorrowMut<V>,
    G: Fn(Root) -> Option<Value>,
    S: Fn(MutRoot) -> Option<MutValue>,
{
    fn then_lock<
        Lock,
        Mid,
        V2,
        LockValue,
        MidValue,
        Value2,
        MutLock,
        MutMid,
        MutValue2,
        G1,
        S1,
        L,
        G2,
        S2,
    >(
        self,
        lock_kp: crate::lock::LockKp<
            V,
            Lock,
            Mid,
            V2,
            Value,
            LockValue,
            MidValue,
            Value2,
            MutValue,
            MutLock,
            MutMid,
            MutValue2,
            G1,
            S1,
            L,
            G2,
            S2,
        >,
    ) -> crate::lock::KpThenLockKp<
        R,
        V,
        V2,
        Root,
        Value,
        Value2,
        MutRoot,
        MutValue,
        MutValue2,
        Self,
        crate::lock::LockKp<
            V,
            Lock,
            Mid,
            V2,
            Value,
            LockValue,
            MidValue,
            Value2,
            MutValue,
            MutLock,
            MutMid,
            MutValue2,
            G1,
            S1,
            L,
            G2,
            S2,
        >,
    >
    where
        V: 'static + Clone,
        V2: 'static,
        Value: std::borrow::Borrow<V>,
        Value2: std::borrow::Borrow<V2>,
        MutValue: std::borrow::BorrowMut<V>,
        MutValue2: std::borrow::BorrowMut<V2>,
        LockValue: std::borrow::Borrow<Lock>,
        MidValue: std::borrow::Borrow<Mid>,
        MutLock: std::borrow::BorrowMut<Lock>,
        MutMid: std::borrow::BorrowMut<Mid>,
        G1: Fn(Value) -> Option<LockValue>,
        S1: Fn(MutValue) -> Option<MutLock>,
        L: crate::lock::LockAccess<Lock, MidValue> + crate::lock::LockAccess<Lock, MutMid>,
        G2: Fn(MidValue) -> Option<Value2>,
        S2: Fn(MutMid) -> Option<MutValue2>,
    {
        crate::lock::KpThenLockKp {
            first: self,
            second: lock_kp,
            _p: std::marker::PhantomData,
        }
    }

    #[cfg(feature = "pin_project")]
    fn then_pin_future<Struct, Output, L>(
        self,
        pin_fut: L,
    ) -> crate::pin::KpThenPinFuture<R, Struct, Output, Root, MutRoot, Value, MutValue, Self, L>
    where
        V: 'static,
        Struct: Unpin + 'static,
        Output: 'static,
        Value: std::borrow::Borrow<Struct>,
        MutValue: std::borrow::BorrowMut<Struct>,
        L: crate::pin::PinFutureAwaitLike<Struct, Output> + Sync,
    {
        crate::pin::KpThenPinFuture {
            first: self,
            second: pin_fut,
            _p: std::marker::PhantomData,
        }
    }

    fn then_async<AsyncKp>(
        self,
        async_kp: AsyncKp,
    ) -> crate::async_lock::KpThenAsyncKeyPath<
        R,
        V,
        <AsyncKp::Value as KeyPathValueTarget>::Target,
        Root,
        Value,
        AsyncKp::Value,
        MutRoot,
        MutValue,
        AsyncKp::MutValue,
        Self,
        AsyncKp,
    >
    where
        V: 'static,
        Value: std::borrow::Borrow<V>,
        MutValue: std::borrow::BorrowMut<V>,
        AsyncKp: crate::async_lock::AsyncKeyPathLike<Value, MutValue>,
        AsyncKp::Value: KeyPathValueTarget
            + std::borrow::Borrow<<AsyncKp::Value as KeyPathValueTarget>::Target>,
        AsyncKp::MutValue: std::borrow::BorrowMut<<AsyncKp::Value as KeyPathValueTarget>::Target>,
        <AsyncKp::Value as KeyPathValueTarget>::Target: 'static,
    {
        crate::async_lock::KpThenAsyncKeyPath {
            first: self,
            second: async_kp,
            _p: std::marker::PhantomData,
        }
    }
}

pub trait AccessorTrait<R, V, Root, Value, MutRoot, MutValue, G, S>:
    KpTrait<R, V, Root, Value, MutRoot, MutValue, G, S>
{
    /// Like [get](Kp::get), but takes an optional root: returns `None` if `root` is `None`, otherwise the result of the getter.
    #[inline]
    fn get_optional(&self, root: Option<Root>) -> Option<Value> {
        root.and_then(|r| self.get(r))
    }

    /// Like [get_mut](Kp::get_mut), but takes an optional root: returns `None` if `root` is `None`, otherwise the result of the setter.
    #[inline]
    fn get_mut_optional(&self, root: Option<MutRoot>) -> Option<MutValue> {
        root.and_then(|r| self.get_mut(r))
    }

    /// Returns the value if the keypath succeeds, otherwise calls `f` and returns its result.
    #[inline]
    fn get_or_else<F>(&self, root: Root, f: F) -> Value
    where
        F: FnOnce() -> Value,
    {
        self.get(root).unwrap_or_else(f)
    }

    /// Returns the mutable value if the keypath succeeds, otherwise calls `f` and returns its result.
    #[inline]
    fn get_mut_or_else<F>(&self, root: MutRoot, f: F) -> MutValue
    where
        F: FnOnce() -> MutValue,
    {
        self.get_mut(root).unwrap_or_else(f)
    }
}

pub trait CoercionTrait<R, V, Root, Value, MutRoot, MutValue, G, S>:
    KpTrait<R, V, Root, Value, MutRoot, MutValue, G, S>
where
    Root: std::borrow::Borrow<R>,
    Value: std::borrow::Borrow<V>,
    MutRoot: std::borrow::BorrowMut<R>,
    MutValue: std::borrow::BorrowMut<V>,
    G: Fn(Root) -> Option<Value>,
    S: Fn(MutRoot) -> Option<MutValue>,
{
    fn for_arc<'b>(
        &self,
    ) -> Kp<
        std::sync::Arc<R>,
        V,
        std::sync::Arc<R>,
        Value,
        std::sync::Arc<R>,
        MutValue,
        impl Fn(std::sync::Arc<R>) -> Option<Value>,
        impl Fn(std::sync::Arc<R>) -> Option<MutValue>,
    >
    where
        R: 'b,
        V: 'b,
        Root: for<'a> From<&'a R>,
        MutRoot: for<'a> From<&'a mut R>,
    {
        Kp::new(
            move |arc_root: std::sync::Arc<R>| {
                let r_ref: &R = &*arc_root;
                self.get(Root::from(r_ref))
            },
            move |mut arc_root: std::sync::Arc<R>| {
                // Get mutable reference only if we have exclusive ownership
                std::sync::Arc::get_mut(&mut arc_root)
                    .and_then(|r_mut| self.get_mut(MutRoot::from(r_mut)))
            },
        )
    }

    fn for_box<'a>(
        &self,
    ) -> Kp<
        Box<R>,
        V,
        Box<R>,
        Value,
        Box<R>,
        MutValue,
        impl Fn(Box<R>) -> Option<Value>,
        impl Fn(Box<R>) -> Option<MutValue>,
    >
    where
        R: 'a,
        V: 'a,
        Root: for<'b> From<&'b R>,
        MutRoot: for<'b> From<&'b mut R>,
    {
        Kp::new(
            move |r: Box<R>| {
                let r_ref: &R = r.as_ref();
                self.get(Root::from(r_ref))
            },
            move |mut r: Box<R>| {
                // Get mutable reference only if we have exclusive ownership
                self.get_mut(MutRoot::from(r.as_mut()))
            },
        )
    }
}

pub trait HOFTrait<R, V, Root, Value, MutRoot, MutValue, G, S>:
    KpTrait<R, V, Root, Value, MutRoot, MutValue, G, S>
where
    Root: std::borrow::Borrow<R>,
    Value: std::borrow::Borrow<V>,
    MutRoot: std::borrow::BorrowMut<R>,
    MutValue: std::borrow::BorrowMut<V>,
    G: Fn(Root) -> Option<Value>,
    S: Fn(MutRoot) -> Option<MutValue>,
{
    // /// Map the value through a transformation function
    // /// Returns a new keypath that transforms the value when accessed
    // ///
    // /// # Example
    // /// ```
    // /// use rust_key_paths::{Kp, KpType};
    // /// struct User { name: String }
    // /// let user = User { name: "Akash".to_string() };
    // /// let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
    // /// let len_kp = name_kp.map(|name: &String| name.len());
    // /// assert_eq!(len_kp.get(&user), Some(5));
    // /// ```
    // fn map<MappedValue, F>(
    //     &self,
    //     mapper: F,
    // ) -> Kp<
    //     R,
    //     MappedValue,
    //     Root,
    //     MappedValue,
    //     MutRoot,
    //     MappedValue,
    //     impl Fn(Root) -> Option<MappedValue>,
    //     impl Fn(MutRoot) -> Option<MappedValue>,
    // >
    // where
    //     // Copy: Required because mapper is used in both getter and setter closures
    //     // 'static: Required because the returned Kp must own its closures
    //     F: Fn(&V) -> MappedValue + Copy + 'static,
    //     V: 'static,
    //     MappedValue: 'static,
    // {
    //     Kp::new(
    //         move |root: Root| {
    //             &self.get(root).map(|value| {
    //                 let v: &V = value.borrow();
    //                 mapper(v)
    //             })
    //         },
    //         move |root: MutRoot| {
    //             &self.get_mut(root).map(|value| {
    //                 let v: &V = value.borrow();
    //                 mapper(v)
    //             })
    //         },
    //     )
    // }

    /// Map the value through a transformation function.
    fn map<MappedValue, F>(
        &self,
        mapper: F,
    ) -> Kp<
        R,
        MappedValue,
        Root,
        MappedValue,
        MutRoot,
        MappedValue,
        impl Fn(Root) -> Option<MappedValue> + '_,
        impl Fn(MutRoot) -> Option<MappedValue> + '_,
    >
    where
        F: Fn(&V) -> MappedValue + Copy + 'static,
        V: 'static,
        MappedValue: 'static,
    {
        Kp::new(
            move |root: Root| {
                self.get(root).map(|value| {
                    let v: &V = value.borrow();
                    mapper(v)
                })
            },
            move |root: MutRoot| {
                self.get_mut(root).map(|value| {
                    let v: &V = value.borrow();
                    mapper(v)
                })
            },
        )
    }

    /// Filter the value based on a predicate.
    fn filter<F>(
        &self,
        predicate: F,
    ) -> Kp<
        R,
        V,
        Root,
        Value,
        MutRoot,
        MutValue,
        impl Fn(Root) -> Option<Value> + '_,
        impl Fn(MutRoot) -> Option<MutValue> + '_,
    >
    where
        F: Fn(&V) -> bool + Copy + 'static,
        V: 'static,
    {
        Kp::new(
            move |root: Root| {
                self.get(root).filter(|value| {
                    let v: &V = value.borrow();
                    predicate(v)
                })
            },
            move |root: MutRoot| {
                self.get_mut(root).filter(|value| {
                    let v: &V = value.borrow();
                    predicate(v)
                })
            },
        )
    }

    /// Map and flatten when mapper returns an Option.
    fn filter_map<MappedValue, F>(
        &self,
        mapper: F,
    ) -> Kp<
        R,
        MappedValue,
        Root,
        MappedValue,
        MutRoot,
        MappedValue,
        impl Fn(Root) -> Option<MappedValue> + '_,
        impl Fn(MutRoot) -> Option<MappedValue> + '_,
    >
    where
        F: Fn(&V) -> Option<MappedValue> + Copy + 'static,
        V: 'static,
        MappedValue: 'static,
    {
        Kp::new(
            move |root: Root| {
                self.get(root).and_then(|value| {
                    let v: &V = value.borrow();
                    mapper(v)
                })
            },
            move |root: MutRoot| {
                self.get_mut(root).and_then(|value| {
                    let v: &V = value.borrow();
                    mapper(v)
                })
            },
        )
    }

    /// Apply a function for its side effects and return the value.
    fn inspect<F>(
        &self,
        inspector: F,
    ) -> Kp<
        R,
        V,
        Root,
        Value,
        MutRoot,
        MutValue,
        impl Fn(Root) -> Option<Value> + '_,
        impl Fn(MutRoot) -> Option<MutValue> + '_,
    >
    where
        F: Fn(&V) + Copy + 'static,
        V: 'static,
    {
        Kp::new(
            move |root: Root| {
                self.get(root).map(|value| {
                    let v: &V = value.borrow();
                    inspector(v);
                    value
                })
            },
            move |root: MutRoot| {
                self.get_mut(root).map(|value| {
                    let v: &V = value.borrow();
                    inspector(v);
                    value
                })
            },
        )
    }

    /// Flat map - maps to an iterator and flattens.
    fn flat_map<I, Item, F>(&self, mapper: F) -> impl Fn(Root) -> Vec<Item> + '_
    where
        F: Fn(&V) -> I + 'static,
        V: 'static,
        I: IntoIterator<Item = Item>,
        Item: 'static,
    {
        move |root: Root| {
            self.get(root)
                .map(|value| {
                    let v: &V = value.borrow();
                    mapper(v).into_iter().collect()
                })
                .unwrap_or_else(Vec::new)
        }
    }

    /// Fold/reduce the value using an accumulator function.
    fn fold_value<Acc, F>(&self, init: Acc, folder: F) -> impl Fn(Root) -> Acc + '_
    where
        F: Fn(Acc, &V) -> Acc + 'static,
        V: 'static,
        Acc: Copy + 'static,
    {
        move |root: Root| {
            self.get(root)
                .map(|value| {
                    let v: &V = value.borrow();
                    folder(init, v)
                })
                .unwrap_or(init)
        }
    }

    /// Check if any element satisfies a predicate.
    fn any<F>(&self, predicate: F) -> impl Fn(Root) -> bool + '_
    where
        F: Fn(&V) -> bool + 'static,
        V: 'static,
    {
        move |root: Root| {
            self.get(root)
                .map(|value| {
                    let v: &V = value.borrow();
                    predicate(v)
                })
                .unwrap_or(false)
        }
    }

    /// Check if all elements satisfy a predicate.
    fn all<F>(&self, predicate: F) -> impl Fn(Root) -> bool + '_
    where
        F: Fn(&V) -> bool + 'static,
        V: 'static,
    {
        move |root: Root| {
            self.get(root)
                .map(|value| {
                    let v: &V = value.borrow();
                    predicate(v)
                })
                .unwrap_or(true)
        }
    }

    /// Count elements in a collection value.
    fn count_items<F>(&self, counter: F) -> impl Fn(Root) -> Option<usize> + '_
    where
        F: Fn(&V) -> usize + 'static,
        V: 'static,
    {
        move |root: Root| {
            self.get(root).map(|value| {
                let v: &V = value.borrow();
                counter(v)
            })
        }
    }

    /// Find first element matching predicate in a collection value.
    fn find_in<Item, F>(&self, finder: F) -> impl Fn(Root) -> Option<Item> + '_
    where
        F: Fn(&V) -> Option<Item> + 'static,
        V: 'static,
        Item: 'static,
    {
        move |root: Root| {
            self.get(root).and_then(|value| {
                let v: &V = value.borrow();
                finder(v)
            })
        }
    }

    /// Take first N elements from a collection value.
    fn take<Output, F>(&self, n: usize, taker: F) -> impl Fn(Root) -> Option<Output> + '_
    where
        F: Fn(&V, usize) -> Output + 'static,
        V: 'static,
        Output: 'static,
    {
        move |root: Root| {
            self.get(root).map(|value| {
                let v: &V = value.borrow();
                taker(v, n)
            })
        }
    }

    /// Skip first N elements from a collection value.
    fn skip<Output, F>(&self, n: usize, skipper: F) -> impl Fn(Root) -> Option<Output> + '_
    where
        F: Fn(&V, usize) -> Output + 'static,
        V: 'static,
        Output: 'static,
    {
        move |root: Root| {
            self.get(root).map(|value| {
                let v: &V = value.borrow();
                skipper(v, n)
            })
        }
    }

    /// Partition a collection value into two groups based on predicate.
    fn partition_value<Output, F>(&self, partitioner: F) -> impl Fn(Root) -> Option<Output> + '_
    where
        F: Fn(&V) -> Output + 'static,
        V: 'static,
        Output: 'static,
    {
        move |root: Root| {
            self.get(root).map(|value| {
                let v: &V = value.borrow();
                partitioner(v)
            })
        }
    }

    /// Get min value from a collection.
    fn min_value<Item, F>(&self, min_fn: F) -> impl Fn(Root) -> Option<Item> + '_
    where
        F: Fn(&V) -> Option<Item> + 'static,
        V: 'static,
        Item: 'static,
    {
        move |root: Root| {
            self.get(root).and_then(|value| {
                let v: &V = value.borrow();
                min_fn(v)
            })
        }
    }

    /// Get max value from a collection.
    fn max_value<Item, F>(&self, max_fn: F) -> impl Fn(Root) -> Option<Item> + '_
    where
        F: Fn(&V) -> Option<Item> + 'static,
        V: 'static,
        Item: 'static,
    {
        move |root: Root| {
            self.get(root).and_then(|value| {
                let v: &V = value.borrow();
                max_fn(v)
            })
        }
    }

    /// Sum numeric values in a collection.
    fn sum_value<Sum, F>(&self, sum_fn: F) -> impl Fn(Root) -> Option<Sum> + '_
    where
        F: Fn(&V) -> Sum + 'static,
        V: 'static,
        Sum: 'static,
    {
        move |root: Root| {
            self.get(root).map(|value| {
                let v: &V = value.borrow();
                sum_fn(v)
            })
        }
    }

    // /// Zip two keypaths on the same root; get_mut returns None.
    // fn zip<V2, Value2, MutValue2, G2, S2>(
    //     self,
    //     other: Kp<R, V2, Root, Value2, MutRoot, MutValue2, G2, S2>,
    // ) -> Kp<
    //     R,
    //     (Value, Value2),
    //     Root,
    //     (Value, Value2),
    //     MutRoot,
    //     (Value, Value2),
    //     impl Fn(Root) -> Option<(Value, Value2)>,
    //     impl Fn(MutRoot) -> Option<(Value, Value2)>,
    // >
    // where
    //     Root: Copy,
    //     Value2: std::borrow::Borrow<V2>,
    //     MutValue2: std::borrow::BorrowMut<V2>,
    //     G2: Fn(Root) -> Option<Value2>,
    //     S2: Fn(MutRoot) -> Option<MutValue2>,
    //     V2: 'static {
    //         todo!()
    //     }

    // /// Zip two keypaths and transform the pair with a function; get_mut returns None.
    // fn zip_with<V2, Value2, MutValue2, Z, G2, S2, F>(
    //     &self,
    //     other: Kp<R, V2, Root, Value2, MutRoot, MutValue2, G2, S2>,
    //     transform: F,
    // ) -> Kp<
    //     R,
    //     Z,
    //     Root,
    //     Z,
    //     MutRoot,
    //     Z,
    //     impl Fn(Root) -> Option<Z>,
    //     impl Fn(MutRoot) -> Option<Z>,
    // >
    // where
    //     Root: Copy,
    //     Value2: std::borrow::Borrow<V2>,
    //     MutValue2: std::borrow::BorrowMut<V2>,
    //     G2: Fn(Root) -> Option<Value2>,
    //     S2: Fn(MutRoot) -> Option<MutValue2>,
    //     F: Fn(Value, Value2) -> Z + Copy + 'static,
    //     V2: 'static,
    //     Z: 'static {
    //         todo!()
    //     }
}

impl<R, V, Root, Value, MutRoot, MutValue, G, S> KpTrait<R, V, Root, Value, MutRoot, MutValue, G, S>
    for Kp<R, V, Root, Value, MutRoot, MutValue, G, S>
where
    Root: std::borrow::Borrow<R>,
    Value: std::borrow::Borrow<V>,
    MutRoot: std::borrow::BorrowMut<R>,
    MutValue: std::borrow::BorrowMut<V>,
    G: Fn(Root) -> Option<Value>,
    S: Fn(MutRoot) -> Option<MutValue>,
{
    #[inline]
    fn get(&self, root: Root) -> Option<Value> {
        (self.get)(root)
    }

    #[inline]
    fn get_mut(&self, root: MutRoot) -> Option<MutValue> {
        (self.set)(root)
    }

    fn then<SV, SubValue, MutSubValue, G2, S2>(
        self,
        next: Kp<V, SV, Value, SubValue, MutValue, MutSubValue, G2, S2>,
    ) -> Kp<
        R,
        SV,
        Root,
        SubValue,
        MutRoot,
        MutSubValue,
        impl Fn(Root) -> Option<SubValue>,
        impl Fn(MutRoot) -> Option<MutSubValue>,
    >
    where
        SubValue: std::borrow::Borrow<SV>,
        MutSubValue: std::borrow::BorrowMut<SV>,
        G2: Fn(Value) -> Option<SubValue>,
        S2: Fn(MutValue) -> Option<MutSubValue>,
        V: 'static,
    {
        Kp::new(
            move |root: Root| (self.get)(root).and_then(|value| (next.get)(value)),
            move |root: MutRoot| (self.set)(root).and_then(|value| (next.set)(value)),
        )
    }
}

impl<R, V, Root, Value, MutRoot, MutValue, G, S>
    CoercionTrait<R, V, Root, Value, MutRoot, MutValue, G, S>
    for Kp<R, V, Root, Value, MutRoot, MutValue, G, S>
where
    Root: std::borrow::Borrow<R>,
    Value: std::borrow::Borrow<V>,
    MutRoot: std::borrow::BorrowMut<R>,
    MutValue: std::borrow::BorrowMut<V>,
    G: Fn(Root) -> Option<Value>,
    S: Fn(MutRoot) -> Option<MutValue>,
{
}

impl<R, V, Root, Value, MutRoot, MutValue, G, S>
    HOFTrait<R, V, Root, Value, MutRoot, MutValue, G, S>
    for Kp<R, V, Root, Value, MutRoot, MutValue, G, S>
where
    Root: std::borrow::Borrow<R>,
    Value: std::borrow::Borrow<V>,
    MutRoot: std::borrow::BorrowMut<R>,
    MutValue: std::borrow::BorrowMut<V>,
    G: Fn(Root) -> Option<Value>,
    S: Fn(MutRoot) -> Option<MutValue>,
{
}
/// AKp (AnyKeyPath) - Hides both Root and Value types
/// Most flexible keypath type for heterogeneous collections
/// Uses dynamic dispatch and type checking at runtime
///
/// # Mutation: get vs get_mut (setter path)
///
/// - **[get](Kp::get)** uses the `get` closure (getter): `Fn(Root) -> Option<Value>`
/// - **[get_mut](Kp::get_mut)** uses the `set` closure (setter): `Fn(MutRoot) -> Option<MutValue>`
///
/// When mutating through a Kp, the **setter path** is used—`get_mut` invokes the `set` closure,
/// not the `get` closure. The getter is for read-only access only.
#[derive(Clone)]
pub struct Kp<R, V, Root, Value, MutRoot, MutValue, G, S>
where
    Root: std::borrow::Borrow<R>,
    MutRoot: std::borrow::BorrowMut<R>,
    MutValue: std::borrow::BorrowMut<V>,
    G: Fn(Root) -> Option<Value>,
    S: Fn(MutRoot) -> Option<MutValue>,
{
    /// Getter closure: used by [Kp::get] for read-only access.
    pub(crate) get: G,
    /// Setter closure: used by [Kp::get_mut] for mutation.
    pub(crate) set: S,
    _p: std::marker::PhantomData<(R, V, Root, Value, MutRoot, MutValue)>,
}

// Kp is a functional component (get/set) with no owned data; Send/Sync follow from G and S.
unsafe impl<R, V, Root, Value, MutRoot, MutValue, G, S> Send
    for Kp<R, V, Root, Value, MutRoot, MutValue, G, S>
where
    Root: std::borrow::Borrow<R>,
    MutRoot: std::borrow::BorrowMut<R>,
    MutValue: std::borrow::BorrowMut<V>,
    G: Fn(Root) -> Option<Value> + Send,
    S: Fn(MutRoot) -> Option<MutValue> + Send,
{
}
unsafe impl<R, V, Root, Value, MutRoot, MutValue, G, S> Sync
    for Kp<R, V, Root, Value, MutRoot, MutValue, G, S>
where
    Root: std::borrow::Borrow<R>,
    MutRoot: std::borrow::BorrowMut<R>,
    MutValue: std::borrow::BorrowMut<V>,
    G: Fn(Root) -> Option<Value> + Sync,
    S: Fn(MutRoot) -> Option<MutValue> + Sync,
{
}

impl<R, V, Root, Value, MutRoot, MutValue, G, S> Kp<R, V, Root, Value, MutRoot, MutValue, G, S>
where
    Root: std::borrow::Borrow<R>,
    Value: std::borrow::Borrow<V>,
    MutRoot: std::borrow::BorrowMut<R>,
    MutValue: std::borrow::BorrowMut<V>,
    G: Fn(Root) -> Option<Value>,
    S: Fn(MutRoot) -> Option<MutValue>,
{
    pub fn new(get: G, set: S) -> Self {
        Self {
            get: get,
            set: set,
            _p: std::marker::PhantomData,
        }
    }

    #[inline]
    pub fn get(&self, root: Root) -> Option<Value> {
        (self.get)(root)
    }

    #[inline]
    pub fn get_mut(&self, root: MutRoot) -> Option<MutValue> {
        (self.set)(root)
    }

    #[inline]
    pub fn then<SV, SubValue, MutSubValue, G2, S2>(
        self,
        next: Kp<V, SV, Value, SubValue, MutValue, MutSubValue, G2, S2>,
    ) -> Kp<
        R,
        SV,
        Root,
        SubValue,
        MutRoot,
        MutSubValue,
        impl Fn(Root) -> Option<SubValue>,
        impl Fn(MutRoot) -> Option<MutSubValue>,
    >
    where
        SubValue: std::borrow::Borrow<SV>,
        MutSubValue: std::borrow::BorrowMut<SV>,
        G2: Fn(Value) -> Option<SubValue>,
        S2: Fn(MutValue) -> Option<MutSubValue>,
        V: 'static,
    {
        Kp::new(
            move |root: Root| (self.get)(root).and_then(|value| (next.get)(value)),
            move |root: MutRoot| (self.set)(root).and_then(|value| (next.set)(value)),
        )
    }

}
/// Zip two keypaths together to create a tuple
/// Works only with KpType (reference-based keypaths)
///
/// # Example
/// ```
/// use rust_key_paths::{KpType, zip_kps};
/// struct User { name: String, age: i32 }
/// let user = User { name: "Akash".to_string(), age: 30 };
/// let name_kp = KpType::new(|u: &User| Some(&u.name), |_| None);
/// let age_kp = KpType::new(|u: &User| Some(&u.age), |_| None);
/// let zipped_fn = zip_kps(&name_kp, &age_kp);
/// assert_eq!(zipped_fn(&user), Some((&"Akash".to_string(), &30)));
/// ```
pub fn zip_kps<'a, RootType, Value1, Value2>(
    kp1: &'a KpType<'a, RootType, Value1>,
    kp2: &'a KpType<'a, RootType, Value2>,
) -> impl Fn(&'a RootType) -> Option<(&'a Value1, &'a Value2)> + 'a
where
    RootType: 'a,
    Value1: 'a,
    Value2: 'a,
{
    move |root: &'a RootType| {
        let val1 = (kp1.get)(root)?;
        let val2 = (kp2.get)(root)?;
        Some((val1, val2))
    }
}

impl<R, Root, MutRoot, G, S> Kp<R, R, Root, Root, MutRoot, MutRoot, G, S>
where
    Root: std::borrow::Borrow<R>,
    MutRoot: std::borrow::BorrowMut<R>,
    G: Fn(Root) -> Option<Root>,
    S: Fn(MutRoot) -> Option<MutRoot>,
{
    pub fn identity_typed() -> Kp<
        R,
        R,
        Root,
        Root,
        MutRoot,
        MutRoot,
        fn(Root) -> Option<Root>,
        fn(MutRoot) -> Option<MutRoot>,
    > {
        Kp::new(|r: Root| Some(r), |r: MutRoot| Some(r))
    }

    pub fn identity<'a>() -> KpType<'a, R, R> {
        KpType::new(|r| Some(r), |r| Some(r))
    }
}

// ========== ENUM KEYPATHS ==========

/// EnumKp - A keypath for enum variants that supports both extraction and embedding
/// Leverages the existing Kp architecture where optionals are built-in via Option<Value>
///
/// This struct serves dual purposes:
/// 1. As a concrete keypath instance for extracting and embedding enum variants
/// 2. As a namespace for static factory methods: `EnumKp::for_ok()`, `EnumKp::for_some()`, etc.
pub struct EnumKp<Enum, Variant, Root, Value, MutRoot, MutValue, G, S, E>
where
    Root: std::borrow::Borrow<Enum>,
    Value: std::borrow::Borrow<Variant>,
    MutRoot: std::borrow::BorrowMut<Enum>,
    MutValue: std::borrow::BorrowMut<Variant>,
    G: Fn(Root) -> Option<Value>,
    S: Fn(MutRoot) -> Option<MutValue>,
    E: Fn(Variant) -> Enum,
{
    extractor: Kp<Enum, Variant, Root, Value, MutRoot, MutValue, G, S>,
    embedder: E,
}

// EnumKp is a functional component; Send/Sync follow from extractor and embedder.
unsafe impl<Enum, Variant, Root, Value, MutRoot, MutValue, G, S, E> Send
    for EnumKp<Enum, Variant, Root, Value, MutRoot, MutValue, G, S, E>
where
    Root: std::borrow::Borrow<Enum>,
    Value: std::borrow::Borrow<Variant>,
    MutRoot: std::borrow::BorrowMut<Enum>,
    MutValue: std::borrow::BorrowMut<Variant>,
    G: Fn(Root) -> Option<Value> + Send,
    S: Fn(MutRoot) -> Option<MutValue> + Send,
    E: Fn(Variant) -> Enum + Send,
{
}
unsafe impl<Enum, Variant, Root, Value, MutRoot, MutValue, G, S, E> Sync
    for EnumKp<Enum, Variant, Root, Value, MutRoot, MutValue, G, S, E>
where
    Root: std::borrow::Borrow<Enum>,
    Value: std::borrow::Borrow<Variant>,
    MutRoot: std::borrow::BorrowMut<Enum>,
    MutValue: std::borrow::BorrowMut<Variant>,
    G: Fn(Root) -> Option<Value> + Sync,
    S: Fn(MutRoot) -> Option<MutValue> + Sync,
    E: Fn(Variant) -> Enum + Sync,
{
}

impl<Enum, Variant, Root, Value, MutRoot, MutValue, G, S, E>
    EnumKp<Enum, Variant, Root, Value, MutRoot, MutValue, G, S, E>
where
    Root: std::borrow::Borrow<Enum>,
    Value: std::borrow::Borrow<Variant>,
    MutRoot: std::borrow::BorrowMut<Enum>,
    MutValue: std::borrow::BorrowMut<Variant>,
    G: Fn(Root) -> Option<Value>,
    S: Fn(MutRoot) -> Option<MutValue>,
    E: Fn(Variant) -> Enum,
{
    /// Create a new EnumKp with extractor and embedder functions
    pub fn new(
        extractor: Kp<Enum, Variant, Root, Value, MutRoot, MutValue, G, S>,
        embedder: E,
    ) -> Self {
        Self {
            extractor,
            embedder,
        }
    }

    /// Extract the variant from an enum (returns None if wrong variant)
    pub fn get(&self, enum_value: Root) -> Option<Value> {
        self.extractor.get(enum_value)
    }

    /// Extract the variant mutably from an enum (returns None if wrong variant)
    pub fn get_mut(&self, enum_value: MutRoot) -> Option<MutValue> {
        self.extractor.get_mut(enum_value)
    }

    /// Embed a value into the enum variant
    pub fn embed(&self, value: Variant) -> Enum {
        (self.embedder)(value)
    }

    /// Get the underlying Kp for composition with other keypaths
    pub fn as_kp(&self) -> &Kp<Enum, Variant, Root, Value, MutRoot, MutValue, G, S> {
        &self.extractor
    }

    /// Convert to Kp (loses embedding capability but gains composition)
    pub fn into_kp(self) -> Kp<Enum, Variant, Root, Value, MutRoot, MutValue, G, S> {
        self.extractor
    }

    /// Map the variant value through a transformation function
    ///
    /// # Example
    /// ```
    /// use rust_key_paths::enum_ok;
    /// let result: Result<String, i32> = Ok("hello".to_string());
    /// let ok_kp = enum_ok();
    /// let len_kp = ok_kp.map(|s: &String| s.len());
    /// assert_eq!(len_kp.get(&result), Some(5));
    /// ```
    pub fn map<MappedValue, F>(
        &self,
        mapper: F,
    ) -> EnumKp<
        Enum,
        MappedValue,
        Root,
        MappedValue,
        MutRoot,
        MappedValue,
        impl Fn(Root) -> Option<MappedValue>,
        impl Fn(MutRoot) -> Option<MappedValue>,
        impl Fn(MappedValue) -> Enum,
    >
    where
        // Copy: Required because mapper is used via extractor.map() which needs it
        // 'static: Required because the returned EnumKp must own its closures
        F: Fn(&Variant) -> MappedValue + Copy + 'static,
        Variant: 'static,
        MappedValue: 'static,
        // Copy: Required for embedder to be captured in the panic closure
        E: Fn(Variant) -> Enum + Copy + 'static,
    {
        let mapped_extractor = self.extractor.map(mapper);

        // Create a new embedder that maps back
        // Note: This is a limitation - we can't reverse the map for embedding
        // So we create a placeholder that panics
        let new_embedder = move |_value: MappedValue| -> Enum {
            panic!(
                "Cannot embed mapped values back into enum. Use the original EnumKp for embedding."
            )
        };

        EnumKp::new(mapped_extractor, new_embedder)
    }

    /// Filter the variant value based on a predicate
    /// Returns None if the predicate fails or if wrong variant
    ///
    /// # Example
    /// ```
    /// use rust_key_paths::enum_ok;
    /// let result: Result<i32, String> = Ok(42);
    /// let ok_kp = enum_ok();
    /// let positive_kp = ok_kp.filter(|x: &i32| *x > 0);
    /// assert_eq!(positive_kp.get(&result), Some(&42));
    /// ```
    pub fn filter<F>(
        &self,
        predicate: F,
    ) -> EnumKp<
        Enum,
        Variant,
        Root,
        Value,
        MutRoot,
        MutValue,
        impl Fn(Root) -> Option<Value>,
        impl Fn(MutRoot) -> Option<MutValue>,
        E,
    >
    where
        // Copy: Required because predicate is used via extractor.filter() which needs it
        // 'static: Required because the returned EnumKp must own its closures
        F: Fn(&Variant) -> bool + Copy + 'static,
        Variant: 'static,
        // Copy: Required to clone embedder into the new EnumKp
        E: Copy,
    {
        let filtered_extractor = self.extractor.filter(predicate);
        EnumKp::new(filtered_extractor, self.embedder)
    }
}

// Type alias for the common case with references
pub type EnumKpType<'a, Enum, Variant> = EnumKp<
    Enum,
    Variant,
    &'a Enum,
    &'a Variant,
    &'a mut Enum,
    &'a mut Variant,
    for<'b> fn(&'b Enum) -> Option<&'b Variant>,
    for<'b> fn(&'b mut Enum) -> Option<&'b mut Variant>,
    fn(Variant) -> Enum,
>;

// Static factory functions for creating EnumKp instances
/// Create an enum keypath with both extraction and embedding for a specific variant
///
/// # Example
/// ```
/// use rust_key_paths::enum_variant;
/// enum MyEnum {
///     A(String),
///     B(i32),
/// }
///
/// let kp = enum_variant(
///     |e: &MyEnum| match e { MyEnum::A(s) => Some(s), _ => None },
///     |e: &mut MyEnum| match e { MyEnum::A(s) => Some(s), _ => None },
///     |s: String| MyEnum::A(s)
/// );
/// ```
pub fn enum_variant<'a, Enum, Variant>(
    getter: for<'b> fn(&'b Enum) -> Option<&'b Variant>,
    setter: for<'b> fn(&'b mut Enum) -> Option<&'b mut Variant>,
    embedder: fn(Variant) -> Enum,
) -> EnumKpType<'a, Enum, Variant> {
    EnumKp::new(Kp::new(getter, setter), embedder)
}

/// Extract from Result<T, E> - Ok variant
///
/// # Example
/// ```
/// use rust_key_paths::enum_ok;
/// let result: Result<String, i32> = Ok("success".to_string());
/// let ok_kp = enum_ok();
/// assert_eq!(ok_kp.get(&result), Some(&"success".to_string()));
/// ```
pub fn enum_ok<'a, T, E>() -> EnumKpType<'a, Result<T, E>, T> {
    EnumKp::new(
        Kp::new(
            |r: &Result<T, E>| r.as_ref().ok(),
            |r: &mut Result<T, E>| r.as_mut().ok(),
        ),
        |t: T| Ok(t),
    )
}

/// Extract from Result<T, E> - Err variant
///
/// # Example
/// ```
/// use rust_key_paths::enum_err;
/// let result: Result<String, i32> = Err(42);
/// let err_kp = enum_err();
/// assert_eq!(err_kp.get(&result), Some(&42));
/// ```
pub fn enum_err<'a, T, E>() -> EnumKpType<'a, Result<T, E>, E> {
    EnumKp::new(
        Kp::new(
            |r: &Result<T, E>| r.as_ref().err(),
            |r: &mut Result<T, E>| r.as_mut().err(),
        ),
        |e: E| Err(e),
    )
}

/// Extract from Option<T> - Some variant
///
/// # Example
/// ```
/// use rust_key_paths::enum_some;
/// let opt = Some("value".to_string());
/// let some_kp = enum_some();
/// assert_eq!(some_kp.get(&opt), Some(&"value".to_string()));
/// ```
pub fn enum_some<'a, T>() -> EnumKpType<'a, Option<T>, T> {
    EnumKp::new(
        Kp::new(|o: &Option<T>| o.as_ref(), |o: &mut Option<T>| o.as_mut()),
        |t: T| Some(t),
    )
}

// Helper functions for creating enum keypaths with type inference
/// Create an enum keypath for a specific variant with type inference
///
/// # Example
/// ```
/// use rust_key_paths::variant_of;
/// enum MyEnum {
///     A(String),
///     B(i32),
/// }
///
/// let kp_a = variant_of(
///     |e: &MyEnum| match e { MyEnum::A(s) => Some(s), _ => None },
///     |e: &mut MyEnum| match e { MyEnum::A(s) => Some(s), _ => None },
///     |s: String| MyEnum::A(s)
/// );
/// ```
pub fn variant_of<'a, Enum, Variant>(
    getter: for<'b> fn(&'b Enum) -> Option<&'b Variant>,
    setter: for<'b> fn(&'b mut Enum) -> Option<&'b mut Variant>,
    embedder: fn(Variant) -> Enum,
) -> EnumKpType<'a, Enum, Variant> {
    enum_variant(getter, setter, embedder)
}

// ========== CONTAINER KEYPATHS ==========

// Helper functions for working with standard containers (Box, Arc, Rc)
/// Create a keypath for unwrapping Box<T> -> T
///
/// # Example
/// ```
/// use rust_key_paths::kp_box;
/// let boxed = Box::new("value".to_string());
/// let kp = kp_box();
/// assert_eq!(kp.get(&boxed), Some(&"value".to_string()));
/// ```
pub fn kp_box<'a, T>() -> KpType<'a, Box<T>, T> {
    Kp::new(
        |b: &Box<T>| Some(b.as_ref()),
        |b: &mut Box<T>| Some(b.as_mut()),
    )
}

/// Create a keypath for unwrapping Arc<T> -> T (read-only)
///
/// # Example
/// ```
/// use std::sync::Arc;
/// use rust_key_paths::kp_arc;
/// let arc = Arc::new("value".to_string());
/// let kp = kp_arc();
/// assert_eq!(kp.get(&arc), Some(&"value".to_string()));
/// ```
pub fn kp_arc<'a, T>() -> Kp<
    Arc<T>,
    T,
    &'a Arc<T>,
    &'a T,
    &'a mut Arc<T>,
    &'a mut T,
    for<'b> fn(&'b Arc<T>) -> Option<&'b T>,
    for<'b> fn(&'b mut Arc<T>) -> Option<&'b mut T>,
> {
    Kp::new(
        |arc: &Arc<T>| Some(arc.as_ref()),
        |arc: &mut Arc<T>| Arc::get_mut(arc),
    )
}

/// Create a keypath for unwrapping Rc<T> -> T (read-only)
///
/// # Example
/// ```
/// use std::rc::Rc;
/// use rust_key_paths::kp_rc;
/// let rc = Rc::new("value".to_string());
/// let kp = kp_rc();
/// assert_eq!(kp.get(&rc), Some(&"value".to_string()));
/// ```
pub fn kp_rc<'a, T>() -> Kp<
    std::rc::Rc<T>,
    T,
    &'a std::rc::Rc<T>,
    &'a T,
    &'a mut std::rc::Rc<T>,
    &'a mut T,
    for<'b> fn(&'b std::rc::Rc<T>) -> Option<&'b T>,
    for<'b> fn(&'b mut std::rc::Rc<T>) -> Option<&'b mut T>,
> {
    Kp::new(
        |rc: &std::rc::Rc<T>| Some(rc.as_ref()),
        |rc: &mut std::rc::Rc<T>| std::rc::Rc::get_mut(rc),
    )
}

// ========== PARTIAL KEYPATHS (Hide Value Type) ==========

use std::any::{Any, TypeId};
use std::rc::Rc;

/// PKp (PartialKeyPath) - Hides the Value type but keeps Root visible
/// Useful for storing keypaths in collections without knowing the exact Value type
///
/// # Why PhantomData<Root>?
///
/// `PhantomData<Root>` is needed because:
/// 1. The `Root` type parameter is not actually stored in the struct (only used in the closure)
/// 2. Rust needs to know the generic type parameter for:
///    - Type checking at compile time
///    - Ensuring correct usage (e.g., `PKp<User>` can only be used with `&User`)
///    - Preventing mixing different Root types
/// 3. Without `PhantomData`, Rust would complain that `Root` is unused
/// 4. `PhantomData` is zero-sized - it adds no runtime overhead

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

    fn kp_adaptable<T, Root, Value, MutRoot, MutValue, G, S>(kp: T)
    where
        T: KpTrait<TestKP, String, Root, Value, MutRoot, MutValue, G, S>,
    {
        // kp.get
        // .get_mut
    }
    fn test_kp_trait() {}

    #[derive(Debug)]
    struct TestKP {
        a: String,
        b: String,
        c: std::sync::Arc<String>,
        d: std::sync::Mutex<String>,
        e: std::sync::Arc<std::sync::Mutex<TestKP2>>,
        f: Option<TestKP2>,
        g: HashMap<i32, TestKP2>,
    }

    impl TestKP {
        fn new() -> Self {
            Self {
                a: String::from("a"),
                b: String::from("b"),
                c: std::sync::Arc::new(String::from("c")),
                d: std::sync::Mutex::new(String::from("d")),
                e: std::sync::Arc::new(std::sync::Mutex::new(TestKP2::new())),
                f: Some(TestKP2 {
                    a: String::from("a3"),
                    b: std::sync::Arc::new(std::sync::Mutex::new(TestKP3::new())),
                }),
                g: HashMap::new(),
            }
        }

        fn g(index: i32) -> KpComposed<TestKP, TestKP2> {
            KpComposed::from_closures(
                move |r: &TestKP| r.g.get(&index),
                move |r: &mut TestKP| r.g.get_mut(&index),
            )
        }

        // Example for - Clone ref sharing
        // Keypath for field 'a' (String)
        fn a_typed<Root, MutRoot, Value, MutValue>() -> Kp<
            TestKP2,
            String,
            Root,
            Value,
            MutRoot,
            MutValue,
            impl Fn(Root) -> Option<Value>,
            impl Fn(MutRoot) -> Option<MutValue>,
        >
        where
            Root: std::borrow::Borrow<TestKP2>,
            MutRoot: std::borrow::BorrowMut<TestKP2>,
            Value: std::borrow::Borrow<String> + From<String>,
            MutValue: std::borrow::BorrowMut<String> + From<String>,
        {
            Kp::new(
                |r: Root| Some(Value::from(r.borrow().a.clone())),
                |mut r: MutRoot| Some(MutValue::from(r.borrow_mut().a.clone())),
            )
        }

        // Example for taking ref

        fn c<'a>() -> KpType<'a, TestKP, String> {
            KpType::new(
                |r: &TestKP| Some(r.c.as_ref()),
                |r: &mut TestKP| match std::sync::Arc::get_mut(&mut r.c) {
                    Some(arc_str) => Some(arc_str),
                    None => None,
                },
            )
        }

        fn a<'a>() -> KpType<'a, TestKP, String> {
            KpType::new(|r: &TestKP| Some(&r.a), |r: &mut TestKP| Some(&mut r.a))
        }

        fn f<'a>() -> KpType<'a, TestKP, TestKP2> {
            KpType::new(|r: &TestKP| r.f.as_ref(), |r: &mut TestKP| r.f.as_mut())
        }

        fn identity<'a>() -> KpType<'a, TestKP, TestKP> {
            KpType::identity()
        }
    }

    #[derive(Debug)]
    struct TestKP2 {
        a: String,
        b: std::sync::Arc<std::sync::Mutex<TestKP3>>,
    }

    impl TestKP2 {
        fn new() -> Self {
            TestKP2 {
                a: String::from("a2"),
                b: std::sync::Arc::new(std::sync::Mutex::new(TestKP3::new())),
            }
        }

        fn identity_typed<Root, MutRoot, G, S>() -> Kp<
            TestKP2, // R
            TestKP2, // V
            Root,    // Root
            Root,    // Value
            MutRoot, // MutRoot
            MutRoot, // MutValue
            fn(Root) -> Option<Root>,
            fn(MutRoot) -> Option<MutRoot>,
        >
        where
            Root: std::borrow::Borrow<TestKP2>,
            MutRoot: std::borrow::BorrowMut<TestKP2>,
            G: Fn(Root) -> Option<Root>,
            S: Fn(MutRoot) -> Option<MutRoot>,
        {
            Kp::<TestKP2, TestKP2, Root, Root, MutRoot, MutRoot, G, S>::identity_typed()
        }

        fn a<'a>() -> KpType<'a, TestKP2, String> {
            KpType::new(|r: &TestKP2| Some(&r.a), |r: &mut TestKP2| Some(&mut r.a))
        }

        fn b<'a>() -> KpType<'a, TestKP2, std::sync::Arc<std::sync::Mutex<TestKP3>>> {
            KpType::new(|r: &TestKP2| Some(&r.b), |r: &mut TestKP2| Some(&mut r.b))
        }

        // fn b_lock<'a, V>(kp: KpType<'a, TestKP2, V>) -> KpType<'a, TestKP2, std::sync::MutexGuard<'a, TestKP3>> {
        //     KpType::new(|r: &TestKP2| Some(r.b.lock().unwrap()), |r: &mut TestKP2| Some(r.b.lock().unwrap()))
        // }

        fn identity<'a>() -> KpType<'a, TestKP2, TestKP2> {
            KpType::identity()
        }
    }

    #[derive(Debug)]
    struct TestKP3 {
        a: String,
        b: std::sync::Arc<std::sync::Mutex<String>>,
    }

    impl TestKP3 {
        fn new() -> Self {
            TestKP3 {
                a: String::from("a2"),
                b: std::sync::Arc::new(std::sync::Mutex::new(String::from("b2"))),
            }
        }

        fn identity_typed<Root, MutRoot, G, S>() -> Kp<
            TestKP3, // R
            TestKP3, // V
            Root,    // Root
            Root,    // Value
            MutRoot, // MutRoot
            MutRoot, // MutValue
            fn(Root) -> Option<Root>,
            fn(MutRoot) -> Option<MutRoot>,
        >
        where
            Root: std::borrow::Borrow<TestKP3>,
            MutRoot: std::borrow::BorrowMut<TestKP3>,
            G: Fn(Root) -> Option<Root>,
            S: Fn(MutRoot) -> Option<MutRoot>,
        {
            Kp::<TestKP3, TestKP3, Root, Root, MutRoot, MutRoot, G, S>::identity_typed()
        }

        fn identity<'a>() -> KpType<'a, TestKP3, TestKP3> {
            KpType::identity()
        }
    }

    impl TestKP3 {}

    impl TestKP {}
    #[test]
    fn test_a() {
        let instance2 = TestKP2::new();
        let mut instance = TestKP::new();
        let kp = TestKP::identity();
        let kp_a = TestKP::a();
        // TestKP::a().for_arc();
        let wres = TestKP::f()
            .then(TestKP2::a())
            .get_mut(&mut instance)
            .unwrap();
        *wres = String::from("a3 changed successfully");
        let res = TestKP::f().then(TestKP2::a()).get(&instance);
        println!("{:?}", res);
        let res = TestKP::f().then(TestKP2::identity()).get(&instance);
        println!("{:?}", res);
        let res = kp.get(&instance);
        println!("{:?}", res);

        let new_kp_from_hashmap = TestKP::g(0).then(TestKP2::a());
        println!("{:?}", new_kp_from_hashmap.get(&instance));
    }

    // #[test]
    // fn test_get_or_and_get_or_else() {
    //     struct User {
    //         name: String,
    //     }
    //     impl User {
    //         fn name() -> KpType<'static, User, String> {
    //             KpType::new(
    //                 |u: &User| Some(&u.name),
    //                 |u: &mut User| Some(&mut u.name),
    //             )
    //         }
    //     }
    //     let user = User {
    //         name: "Akash".to_string(),
    //     };
    //     let default_ref: String = "default".to_string();
    //     // get_or with kp form
    //     let r = get_or!(User::name(), &user, &default_ref);
    //     assert_eq!(*r, "Akash");
    //     // get_or_else with kp form (returns owned)
    //     let owned = get_or_else!(User::name(), &user, || "fallback".to_string());
    //     assert_eq!(owned, "Akash");

    //     // When path returns None, fallback is used
    //     struct WithOption {
    //         opt: Option<String>,
    //     }
    //     impl WithOption {
    //         fn opt() -> KpType<'static, WithOption, String> {
    //             KpType::new(
    //                 |w: &WithOption| w.opt.as_ref(),
    //                 |_w: &mut WithOption| None,
    //             )
    //         }
    //     }
    //     let with_none = WithOption { opt: None };
    //     let r = get_or!(WithOption::opt(), &with_none, &default_ref);
    //     assert_eq!(*r, "default");
    //     let owned = get_or_else!(&with_none => (WithOption.opt), || "computed".to_string());
    //     assert_eq!(owned, "computed");
    // }

    // #[test]
    // fn test_lock() {
    //     let lock_kp = LockKp::new(A::b(), kp_arc_mutex::<B>(), B::c());
    //
    //     let mut a = A {
    //         b: Arc::new(Mutex::new(B {
    //             c: C {
    //                 d: String::from("hello"),
    //             },
    //         })),
    //     };
    //
    //     // Get value
    //     if let Some(value) = lock_kp.get(&a) {
    //         println!("Got: {:?}", value);
    //         assert_eq!(value.d, "hello");
    //     } else {
    //         panic!("Value not found");
    //     }
    //
    //     // Set value using closure
    //     let result = lock_kp.set(&a, |d| {
    //         d.d.push_str(" world");
    //     });
    //
    //     if result.is_ok() {
    //         if let Some(value) = lock_kp.get(&a) {
    //             println!("After set: {:?}", value);
    //             assert_eq!(value.d, "hello");
    //         } else {
    //             panic!("Value not found");
    //         }
    //     }
    // }

    #[test]
    fn test_enum_kp_result_ok() {
        let ok_result: Result<String, i32> = Ok("success".to_string());
        let mut err_result: Result<String, i32> = Err(42);

        let ok_kp = enum_ok();

        // Test extraction
        assert_eq!(ok_kp.get(&ok_result), Some(&"success".to_string()));
        assert_eq!(ok_kp.get(&err_result), None);

        // Test embedding
        let embedded = ok_kp.embed("embedded".to_string());
        assert_eq!(embedded, Ok("embedded".to_string()));

        // Test mutable access
        if let Some(val) = ok_kp.get_mut(&mut err_result) {
            *val = "modified".to_string();
        }
        assert_eq!(err_result, Err(42)); // Should still be Err

        let mut ok_result2 = Ok("original".to_string());
        if let Some(val) = ok_kp.get_mut(&mut ok_result2) {
            *val = "modified".to_string();
        }
        assert_eq!(ok_result2, Ok("modified".to_string()));
    }

    #[test]
    fn test_enum_kp_result_err() {
        let ok_result: Result<String, i32> = Ok("success".to_string());
        let mut err_result: Result<String, i32> = Err(42);

        let err_kp = enum_err();

        // Test extraction
        assert_eq!(err_kp.get(&err_result), Some(&42));
        assert_eq!(err_kp.get(&ok_result), None);

        // Test embedding
        let embedded = err_kp.embed(99);
        assert_eq!(embedded, Err(99));

        // Test mutable access
        if let Some(val) = err_kp.get_mut(&mut err_result) {
            *val = 100;
        }
        assert_eq!(err_result, Err(100));
    }

    #[test]
    fn test_enum_kp_option_some() {
        let some_opt = Some("value".to_string());
        let mut none_opt: Option<String> = None;

        let some_kp = enum_some();

        // Test extraction
        assert_eq!(some_kp.get(&some_opt), Some(&"value".to_string()));
        assert_eq!(some_kp.get(&none_opt), None);

        // Test embedding
        let embedded = some_kp.embed("embedded".to_string());
        assert_eq!(embedded, Some("embedded".to_string()));

        // Test mutable access
        let mut some_opt2 = Some("original".to_string());
        if let Some(val) = some_kp.get_mut(&mut some_opt2) {
            *val = "modified".to_string();
        }
        assert_eq!(some_opt2, Some("modified".to_string()));
    }

    #[test]
    fn test_enum_kp_custom_enum() {
        #[derive(Debug, PartialEq)]
        enum MyEnum {
            A(String),
            B(i32),
            C,
        }

        let mut enum_a = MyEnum::A("hello".to_string());
        let enum_b = MyEnum::B(42);
        let enum_c = MyEnum::C;

        // Create keypath for variant A
        let kp_a = enum_variant(
            |e: &MyEnum| match e {
                MyEnum::A(s) => Some(s),
                _ => None,
            },
            |e: &mut MyEnum| match e {
                MyEnum::A(s) => Some(s),
                _ => None,
            },
            |s: String| MyEnum::A(s),
        );

        // Test extraction
        assert_eq!(kp_a.get(&enum_a), Some(&"hello".to_string()));
        assert_eq!(kp_a.get(&enum_b), None);
        assert_eq!(kp_a.get(&enum_c), None);

        // Test embedding
        let embedded = kp_a.embed("world".to_string());
        assert_eq!(embedded, MyEnum::A("world".to_string()));

        // Test mutable access
        if let Some(val) = kp_a.get_mut(&mut enum_a) {
            *val = "modified".to_string();
        }
        assert_eq!(enum_a, MyEnum::A("modified".to_string()));
    }

    #[test]
    fn test_container_kp_box() {
        let boxed = Box::new("value".to_string());
        let mut boxed_mut = Box::new("original".to_string());

        let box_kp = kp_box();

        // Test get
        assert_eq!(box_kp.get(&boxed), Some(&"value".to_string()));

        // Test get_mut
        if let Some(val) = box_kp.get_mut(&mut boxed_mut) {
            *val = "modified".to_string();
        }
        assert_eq!(*boxed_mut, "modified".to_string());
    }

    #[test]
    fn test_container_kp_arc() {
        let arc = Arc::new("value".to_string());
        let mut arc_mut = Arc::new("original".to_string());

        let arc_kp = kp_arc();

        // Test get
        assert_eq!(arc_kp.get(&arc), Some(&"value".to_string()));

        // Test get_mut (only works if Arc has no other references)
        if let Some(val) = arc_kp.get_mut(&mut arc_mut) {
            *val = "modified".to_string();
        }
        assert_eq!(*arc_mut, "modified".to_string());

        // Test with multiple references (should return None for mutable access)
        let arc_shared = Arc::new("shared".to_string());
        let arc_shared2 = Arc::clone(&arc_shared);
        let mut arc_shared_mut = arc_shared;
        assert_eq!(arc_kp.get_mut(&mut arc_shared_mut), None);
    }

    #[test]
    fn test_enum_kp_composition() {
        // Test composing enum keypath with other keypaths
        #[derive(Debug, PartialEq)]
        struct Inner {
            value: String,
        }

        let result: Result<Inner, i32> = Ok(Inner {
            value: "nested".to_string(),
        });

        // Create keypath to Inner.value
        let inner_kp = KpType::new(
            |i: &Inner| Some(&i.value),
            |i: &mut Inner| Some(&mut i.value),
        );

        // Get the Ok keypath and convert to Kp for composition
        let ok_kp = enum_ok::<Inner, i32>();
        let ok_kp_base = ok_kp.into_kp();
        let composed = ok_kp_base.then(inner_kp);

        assert_eq!(composed.get(&result), Some(&"nested".to_string()));
    }

    #[test]
    fn test_pkp_basic() {
        #[derive(Debug)]
        struct User {
            name: String,
            age: i32,
        }

        let user = User {
            name: "Akash".to_string(),
            age: 30,
        };

        // Create regular keypaths
        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let age_kp = KpType::new(|u: &User| Some(&u.age), |u: &mut User| Some(&mut u.age));

        // Convert to partial keypaths
        let name_pkp = PKp::new(name_kp);
        let age_pkp = PKp::new(age_kp);

        // Test get_as with correct type
        assert_eq!(name_pkp.get_as::<String>(&user), Some(&"Akash".to_string()));
        assert_eq!(age_pkp.get_as::<i32>(&user), Some(&30));

        // Test get_as with wrong type returns None
        assert_eq!(name_pkp.get_as::<i32>(&user), None);
        assert_eq!(age_pkp.get_as::<String>(&user), None);

        // Test value_type_id
        assert_eq!(name_pkp.value_type_id(), TypeId::of::<String>());
        assert_eq!(age_pkp.value_type_id(), TypeId::of::<i32>());
    }

    #[test]
    fn test_pkp_collection() {
        #[derive(Debug)]
        struct User {
            name: String,
            age: i32,
        }

        let user = User {
            name: "Bob".to_string(),
            age: 25,
        };

        // Create a collection of partial keypaths
        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let age_kp = KpType::new(|u: &User| Some(&u.age), |u: &mut User| Some(&mut u.age));

        let keypaths: Vec<PKp<User>> = vec![PKp::new(name_kp), PKp::new(age_kp)];

        // Access values through the collection
        let name_value = keypaths[0].get_as::<String>(&user);
        let age_value = keypaths[1].get_as::<i32>(&user);

        assert_eq!(name_value, Some(&"Bob".to_string()));
        assert_eq!(age_value, Some(&25));
    }

    #[test]
    fn test_pkp_for_arc() {
        #[derive(Debug)]
        struct User {
            name: String,
        }

        let user = Arc::new(User {
            name: "Charlie".to_string(),
        });

        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let name_pkp = PKp::new(name_kp);

        // Adapt for Arc
        let arc_pkp = name_pkp.for_arc();

        assert_eq!(
            arc_pkp.get_as::<String>(&user),
            Some(&"Charlie".to_string())
        );
    }

    #[test]
    fn test_pkp_for_option() {
        #[derive(Debug)]
        struct User {
            name: String,
        }

        let some_user = Some(User {
            name: "Diana".to_string(),
        });
        let none_user: Option<User> = None;

        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let name_pkp = PKp::new(name_kp);

        // Adapt for Option
        let opt_pkp = name_pkp.for_option();

        assert_eq!(
            opt_pkp.get_as::<String>(&some_user),
            Some(&"Diana".to_string())
        );
        assert_eq!(opt_pkp.get_as::<String>(&none_user), None);
    }

    #[test]
    fn test_akp_basic() {
        #[derive(Debug)]
        struct User {
            name: String,
            age: i32,
        }

        #[derive(Debug)]
        struct Product {
            title: String,
            price: f64,
        }

        let user = User {
            name: "Eve".to_string(),
            age: 28,
        };

        let product = Product {
            title: "Book".to_string(),
            price: 19.99,
        };

        // Create AnyKeypaths
        let user_name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let user_name_akp = AKp::new(user_name_kp);

        let product_title_kp = KpType::new(
            |p: &Product| Some(&p.title),
            |p: &mut Product| Some(&mut p.title),
        );
        let product_title_akp = AKp::new(product_title_kp);

        // Test get_as with correct types
        assert_eq!(
            user_name_akp.get_as::<User, String>(&user),
            Some(Some(&"Eve".to_string()))
        );
        assert_eq!(
            product_title_akp.get_as::<Product, String>(&product),
            Some(Some(&"Book".to_string()))
        );

        // Test get_as with wrong root type
        assert_eq!(user_name_akp.get_as::<Product, String>(&product), None);
        assert_eq!(product_title_akp.get_as::<User, String>(&user), None);

        // Test TypeIds
        assert_eq!(user_name_akp.root_type_id(), TypeId::of::<User>());
        assert_eq!(user_name_akp.value_type_id(), TypeId::of::<String>());
        assert_eq!(product_title_akp.root_type_id(), TypeId::of::<Product>());
        assert_eq!(product_title_akp.value_type_id(), TypeId::of::<String>());
    }

    #[test]
    fn test_akp_heterogeneous_collection() {
        #[derive(Debug)]
        struct User {
            name: String,
        }

        #[derive(Debug)]
        struct Product {
            title: String,
        }

        let user = User {
            name: "Frank".to_string(),
        };
        let product = Product {
            title: "Laptop".to_string(),
        };

        // Create a heterogeneous collection of AnyKeypaths
        let user_name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let product_title_kp = KpType::new(
            |p: &Product| Some(&p.title),
            |p: &mut Product| Some(&mut p.title),
        );

        let keypaths: Vec<AKp> = vec![AKp::new(user_name_kp), AKp::new(product_title_kp)];

        // Access through trait objects
        let user_any: &dyn Any = &user;
        let product_any: &dyn Any = &product;

        let user_value = keypaths[0].get(user_any);
        let product_value = keypaths[1].get(product_any);

        assert!(user_value.is_some());
        assert!(product_value.is_some());

        // Downcast to concrete types
        assert_eq!(
            user_value.and_then(|v| v.downcast_ref::<String>()),
            Some(&"Frank".to_string())
        );
        assert_eq!(
            product_value.and_then(|v| v.downcast_ref::<String>()),
            Some(&"Laptop".to_string())
        );
    }

    #[test]
    fn test_akp_for_option() {
        #[derive(Debug)]
        struct User {
            name: String,
        }

        let some_user = Some(User {
            name: "Grace".to_string(),
        });
        let none_user: Option<User> = None;

        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let name_akp = AKp::new(name_kp);

        // Adapt for Option
        let opt_akp = name_akp.for_option::<User>();

        assert_eq!(
            opt_akp.get_as::<Option<User>, String>(&some_user),
            Some(Some(&"Grace".to_string()))
        );
        assert_eq!(
            opt_akp.get_as::<Option<User>, String>(&none_user),
            Some(None)
        );
    }

    #[test]
    fn test_akp_for_result() {
        #[derive(Debug)]
        struct User {
            name: String,
        }

        let ok_user: Result<User, String> = Ok(User {
            name: "Henry".to_string(),
        });
        let err_user: Result<User, String> = Err("Not found".to_string());

        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let name_akp = AKp::new(name_kp);

        // Adapt for Result
        let result_akp = name_akp.for_result::<User, String>();

        assert_eq!(
            result_akp.get_as::<Result<User, String>, String>(&ok_user),
            Some(Some(&"Henry".to_string()))
        );
        assert_eq!(
            result_akp.get_as::<Result<User, String>, String>(&err_user),
            Some(None)
        );
    }

    // ========== MAP TESTS ==========

    #[test]
    fn test_kp_map() {
        #[derive(Debug)]
        struct User {
            name: String,
            age: i32,
        }

        let user = User {
            name: "Akash".to_string(),
            age: 30,
        };

        // Map string to its length
        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let len_kp = name_kp.map(|name: &String| name.len());

        assert_eq!(len_kp.get(&user), Some(5));

        // Map age to double
        let age_kp = KpType::new(|u: &User| Some(&u.age), |u: &mut User| Some(&mut u.age));
        let double_age_kp = age_kp.map(|age: &i32| age * 2);

        assert_eq!(double_age_kp.get(&user), Some(60));

        // Map to boolean
        let is_adult_kp = age_kp.map(|age: &i32| *age >= 18);
        assert_eq!(is_adult_kp.get(&user), Some(true));
    }

    #[test]
    fn test_kp_filter() {
        #[derive(Debug)]
        struct User {
            name: String,
            age: i32,
        }

        let adult = User {
            name: "Akash".to_string(),
            age: 30,
        };

        let minor = User {
            name: "Bob".to_string(),
            age: 15,
        };

        let age_kp = KpType::new(|u: &User| Some(&u.age), |u: &mut User| Some(&mut u.age));
        let adult_age_kp = age_kp.filter(|age: &i32| *age >= 18);

        assert_eq!(adult_age_kp.get(&adult), Some(&30));
        assert_eq!(adult_age_kp.get(&minor), None);

        // Filter names by length
        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let short_name_kp = name_kp.filter(|name: &String| name.len() <= 4);

        assert_eq!(short_name_kp.get(&minor), Some(&"Bob".to_string()));
        assert_eq!(short_name_kp.get(&adult), None);
    }

    #[test]
    fn test_kp_map_and_filter() {
        #[derive(Debug)]
        struct User {
            scores: Vec<i32>,
        }

        let user = User {
            scores: vec![85, 92, 78, 95],
        };

        let scores_kp = KpType::new(
            |u: &User| Some(&u.scores),
            |u: &mut User| Some(&mut u.scores),
        );

        // Map to average score
        let avg_kp =
            scores_kp.map(|scores: &Vec<i32>| scores.iter().sum::<i32>() / scores.len() as i32);

        // Filter for high averages
        let high_avg_kp = avg_kp.filter(|avg: &i32| *avg >= 85);

        assert_eq!(high_avg_kp.get(&user), Some(87)); // (85+92+78+95)/4 = 87.5 -> 87
    }

    #[test]
    fn test_enum_kp_map() {
        let ok_result: Result<String, i32> = Ok("hello".to_string());
        let err_result: Result<String, i32> = Err(42);

        let ok_kp = enum_ok::<String, i32>();
        let len_kp = ok_kp.map(|s: &String| s.len());

        assert_eq!(len_kp.get(&ok_result), Some(5));
        assert_eq!(len_kp.get(&err_result), None);

        // Map Option
        let some_opt = Some(vec![1, 2, 3, 4, 5]);
        let none_opt: Option<Vec<i32>> = None;

        let some_kp = enum_some::<Vec<i32>>();
        let count_kp = some_kp.map(|vec: &Vec<i32>| vec.len());

        assert_eq!(count_kp.get(&some_opt), Some(5));
        assert_eq!(count_kp.get(&none_opt), None);
    }

    #[test]
    fn test_enum_kp_filter() {
        let ok_result1: Result<i32, String> = Ok(42);
        let ok_result2: Result<i32, String> = Ok(-5);
        let err_result: Result<i32, String> = Err("error".to_string());

        let ok_kp = enum_ok::<i32, String>();
        let positive_kp = ok_kp.filter(|x: &i32| *x > 0);

        assert_eq!(positive_kp.get(&ok_result1), Some(&42));
        assert_eq!(positive_kp.get(&ok_result2), None); // Negative number filtered out
        assert_eq!(positive_kp.get(&err_result), None); // Err variant

        // Filter Option strings by length
        let long_str = Some("hello world".to_string());
        let short_str = Some("hi".to_string());

        let some_kp = enum_some::<String>();
        let long_kp = some_kp.filter(|s: &String| s.len() > 5);

        assert_eq!(long_kp.get(&long_str), Some(&"hello world".to_string()));
        assert_eq!(long_kp.get(&short_str), None);
    }

    #[test]
    fn test_pkp_filter() {
        #[derive(Debug)]
        struct User {
            name: String,
            age: i32,
        }

        let adult = User {
            name: "Akash".to_string(),
            age: 30,
        };

        let minor = User {
            name: "Bob".to_string(),
            age: 15,
        };

        let age_kp = KpType::new(|u: &User| Some(&u.age), |u: &mut User| Some(&mut u.age));
        let age_pkp = PKp::new(age_kp);

        // Filter for adults
        let adult_pkp = age_pkp.filter::<i32, _>(|age| *age >= 18);

        assert_eq!(adult_pkp.get_as::<i32>(&adult), Some(&30));
        assert_eq!(adult_pkp.get_as::<i32>(&minor), None);

        // Filter names
        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let name_pkp = PKp::new(name_kp);
        let short_name_pkp = name_pkp.filter::<String, _>(|name| name.len() <= 4);

        assert_eq!(
            short_name_pkp.get_as::<String>(&minor),
            Some(&"Bob".to_string())
        );
        assert_eq!(short_name_pkp.get_as::<String>(&adult), None);
    }

    #[test]
    fn test_akp_filter() {
        #[derive(Debug)]
        struct User {
            age: i32,
        }

        #[derive(Debug)]
        struct Product {
            price: f64,
        }

        let adult = User { age: 30 };
        let minor = User { age: 15 };
        let expensive = Product { price: 99.99 };
        let cheap = Product { price: 5.0 };

        // Filter user ages
        let age_kp = KpType::new(|u: &User| Some(&u.age), |u: &mut User| Some(&mut u.age));
        let age_akp = AKp::new(age_kp);
        let adult_akp = age_akp.filter::<User, i32, _>(|age| *age >= 18);

        assert_eq!(adult_akp.get_as::<User, i32>(&adult), Some(Some(&30)));
        assert_eq!(adult_akp.get_as::<User, i32>(&minor), Some(None));

        // Filter product prices
        let price_kp = KpType::new(
            |p: &Product| Some(&p.price),
            |p: &mut Product| Some(&mut p.price),
        );
        let price_akp = AKp::new(price_kp);
        let expensive_akp = price_akp.filter::<Product, f64, _>(|price| *price > 50.0);

        assert_eq!(
            expensive_akp.get_as::<Product, f64>(&expensive),
            Some(Some(&99.99))
        );
        assert_eq!(expensive_akp.get_as::<Product, f64>(&cheap), Some(None));
    }

    // ========== ITERATOR-RELATED HOF TESTS ==========

    #[test]
    fn test_kp_filter_map() {
        #[derive(Debug)]
        struct User {
            middle_name: Option<String>,
        }

        let user_with = User {
            middle_name: Some("Marie".to_string()),
        };
        let user_without = User { middle_name: None };

        let middle_kp = KpType::new(
            |u: &User| Some(&u.middle_name),
            |u: &mut User| Some(&mut u.middle_name),
        );

        let first_char_kp = middle_kp
            .filter_map(|opt: &Option<String>| opt.as_ref().and_then(|s| s.chars().next()));

        assert_eq!(first_char_kp.get(&user_with), Some('M'));
        assert_eq!(first_char_kp.get(&user_without), None);
    }

    #[test]
    fn test_kp_inspect() {
        #[derive(Debug)]
        struct User {
            name: String,
        }

        let user = User {
            name: "Akash".to_string(),
        };

        // Simple test - just verify that inspect returns the correct value
        // and can perform side effects

        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));

        // We can't easily test side effects with Copy constraint,
        // so we'll just test that inspect passes through the value
        let result = name_kp.get(&user);
        assert_eq!(result, Some(&"Akash".to_string()));

        // The inspect method works, it just requires Copy closures
        // which limits its usefulness for complex side effects
    }

    #[test]
    fn test_kp_fold_value() {
        #[derive(Debug)]
        struct User {
            scores: Vec<i32>,
        }

        let user = User {
            scores: vec![85, 92, 78, 95],
        };

        let scores_kp = KpType::new(
            |u: &User| Some(&u.scores),
            |u: &mut User| Some(&mut u.scores),
        );

        // Sum all scores
        let sum_fn =
            scores_kp.fold_value(0, |acc, scores: &Vec<i32>| scores.iter().sum::<i32>() + acc);

        assert_eq!(sum_fn(&user), 350);
    }

    #[test]
    fn test_kp_any_all() {
        #[derive(Debug)]
        struct User {
            scores: Vec<i32>,
        }

        let user_high = User {
            scores: vec![85, 92, 88],
        };
        let user_mixed = User {
            scores: vec![65, 92, 78],
        };

        let scores_kp = KpType::new(
            |u: &User| Some(&u.scores),
            |u: &mut User| Some(&mut u.scores),
        );

        // Test any
        let has_high_fn = scores_kp.any(|scores: &Vec<i32>| scores.iter().any(|&s| s > 90));
        assert!(has_high_fn(&user_high));
        assert!(has_high_fn(&user_mixed));

        // Test all
        let all_passing_fn = scores_kp.all(|scores: &Vec<i32>| scores.iter().all(|&s| s >= 80));
        assert!(all_passing_fn(&user_high));
        assert!(!all_passing_fn(&user_mixed));
    }

    #[test]
    fn test_kp_count_items() {
        #[derive(Debug)]
        struct User {
            tags: Vec<String>,
        }

        let user = User {
            tags: vec!["rust".to_string(), "web".to_string(), "backend".to_string()],
        };

        let tags_kp = KpType::new(|u: &User| Some(&u.tags), |u: &mut User| Some(&mut u.tags));
        let count_fn = tags_kp.count_items(|tags: &Vec<String>| tags.len());

        assert_eq!(count_fn(&user), Some(3));
    }

    #[test]
    fn test_kp_find_in() {
        #[derive(Debug)]
        struct User {
            scores: Vec<i32>,
        }

        let user = User {
            scores: vec![85, 92, 78, 95, 88],
        };

        let scores_kp = KpType::new(
            |u: &User| Some(&u.scores),
            |u: &mut User| Some(&mut u.scores),
        );

        // Find first score > 90
        let first_high_fn =
            scores_kp.find_in(|scores: &Vec<i32>| scores.iter().find(|&&s| s > 90).copied());

        assert_eq!(first_high_fn(&user), Some(92));

        // Find score > 100 (doesn't exist)
        let perfect_fn =
            scores_kp.find_in(|scores: &Vec<i32>| scores.iter().find(|&&s| s > 100).copied());

        assert_eq!(perfect_fn(&user), None);
    }

    #[test]
    fn test_kp_take_skip() {
        #[derive(Debug)]
        struct User {
            tags: Vec<String>,
        }

        let user = User {
            tags: vec![
                "a".to_string(),
                "b".to_string(),
                "c".to_string(),
                "d".to_string(),
            ],
        };

        let tags_kp = KpType::new(|u: &User| Some(&u.tags), |u: &mut User| Some(&mut u.tags));

        // Take first 2
        let take_fn = tags_kp.take(2, |tags: &Vec<String>, n| {
            tags.iter().take(n).cloned().collect::<Vec<_>>()
        });

        let taken = take_fn(&user).unwrap();
        assert_eq!(taken, vec!["a".to_string(), "b".to_string()]);

        // Skip first 2
        let skip_fn = tags_kp.skip(2, |tags: &Vec<String>, n| {
            tags.iter().skip(n).cloned().collect::<Vec<_>>()
        });

        let skipped = skip_fn(&user).unwrap();
        assert_eq!(skipped, vec!["c".to_string(), "d".to_string()]);
    }

    #[test]
    fn test_kp_partition() {
        #[derive(Debug)]
        struct User {
            scores: Vec<i32>,
        }

        let user = User {
            scores: vec![85, 92, 65, 95, 72, 58],
        };

        let scores_kp = KpType::new(
            |u: &User| Some(&u.scores),
            |u: &mut User| Some(&mut u.scores),
        );

        let partition_fn = scores_kp.partition_value(|scores: &Vec<i32>| -> (Vec<i32>, Vec<i32>) {
            scores.iter().copied().partition(|&s| s >= 70)
        });

        let (passing, failing) = partition_fn(&user).unwrap();
        assert_eq!(passing, vec![85, 92, 95, 72]);
        assert_eq!(failing, vec![65, 58]);
    }

    #[test]
    fn test_kp_min_max() {
        #[derive(Debug)]
        struct User {
            scores: Vec<i32>,
        }

        let user = User {
            scores: vec![85, 92, 78, 95, 88],
        };

        let scores_kp = KpType::new(
            |u: &User| Some(&u.scores),
            |u: &mut User| Some(&mut u.scores),
        );

        // Min
        let min_fn = scores_kp.min_value(|scores: &Vec<i32>| scores.iter().min().copied());
        assert_eq!(min_fn(&user), Some(78));

        // Max
        let max_fn = scores_kp.max_value(|scores: &Vec<i32>| scores.iter().max().copied());
        assert_eq!(max_fn(&user), Some(95));
    }

    #[test]
    fn test_kp_sum() {
        #[derive(Debug)]
        struct User {
            scores: Vec<i32>,
        }

        let user = User {
            scores: vec![85, 92, 78],
        };

        let scores_kp = KpType::new(
            |u: &User| Some(&u.scores),
            |u: &mut User| Some(&mut u.scores),
        );

        let sum_fn = scores_kp.sum_value(|scores: &Vec<i32>| scores.iter().sum::<i32>());
        assert_eq!(sum_fn(&user), Some(255));

        // Average
        let avg_fn =
            scores_kp.map(|scores: &Vec<i32>| scores.iter().sum::<i32>() / scores.len() as i32);
        assert_eq!(avg_fn.get(&user), Some(85));
    }

    #[test]
    fn test_kp_chain() {
        #[derive(Debug)]
        struct User {
            profile: Profile,
        }

        #[derive(Debug)]
        struct Profile {
            settings: Settings,
        }

        #[derive(Debug)]
        struct Settings {
            theme: String,
        }

        let user = User {
            profile: Profile {
                settings: Settings {
                    theme: "dark".to_string(),
                },
            },
        };

        let profile_kp = KpType::new(
            |u: &User| Some(&u.profile),
            |u: &mut User| Some(&mut u.profile),
        );
        let settings_kp = KpType::new(
            |p: &Profile| Some(&p.settings),
            |p: &mut Profile| Some(&mut p.settings),
        );
        let theme_kp = KpType::new(
            |s: &Settings| Some(&s.theme),
            |s: &mut Settings| Some(&mut s.theme),
        );

        // Chain all together - store intermediate result
        let profile_settings = profile_kp.then(settings_kp);
        let theme_path = profile_settings.then(theme_kp);
        assert_eq!(theme_path.get(&user), Some(&"dark".to_string()));
    }

    #[test]
    fn test_kp_zip() {
        #[derive(Debug)]
        struct User {
            name: String,
            age: i32,
        }

        let user = User {
            name: "Akash".to_string(),
            age: 30,
        };

        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let age_kp = KpType::new(|u: &User| Some(&u.age), |u: &mut User| Some(&mut u.age));

        let zipped_fn = zip_kps(&name_kp, &age_kp);
        let result = zipped_fn(&user);

        assert_eq!(result, Some((&"Akash".to_string(), &30)));
    }

    #[test]
    fn test_kp_complex_pipeline() {
        #[derive(Debug)]
        struct User {
            transactions: Vec<Transaction>,
        }

        #[derive(Debug)]
        struct Transaction {
            amount: f64,
            category: String,
        }

        let user = User {
            transactions: vec![
                Transaction {
                    amount: 50.0,
                    category: "food".to_string(),
                },
                Transaction {
                    amount: 100.0,
                    category: "transport".to_string(),
                },
                Transaction {
                    amount: 25.0,
                    category: "food".to_string(),
                },
                Transaction {
                    amount: 200.0,
                    category: "shopping".to_string(),
                },
            ],
        };

        let txns_kp = KpType::new(
            |u: &User| Some(&u.transactions),
            |u: &mut User| Some(&mut u.transactions),
        );

        // Calculate total food expenses
        let food_total = txns_kp.map(|txns: &Vec<Transaction>| {
            txns.iter()
                .filter(|t| t.category == "food")
                .map(|t| t.amount)
                .sum::<f64>()
        });

        assert_eq!(food_total.get(&user), Some(75.0));

        // Check if any transaction is over 150
        let has_large =
            txns_kp.any(|txns: &Vec<Transaction>| txns.iter().any(|t| t.amount > 150.0));

        assert!(has_large(&user));

        // Count transactions
        let count = txns_kp.count_items(|txns: &Vec<Transaction>| txns.len());
        assert_eq!(count(&user), Some(4));
    }

    // ========== COPY AND 'STATIC TRAIT BOUND TESTS ==========
    // These tests verify that Copy and 'static bounds don't cause cloning or memory leaks

    #[test]
    fn test_no_clone_required_for_root() {
        use std::sync::Arc;
        use std::sync::atomic::{AtomicUsize, Ordering};

        // Create a type that is NOT Clone and NOT Copy
        // If operations clone unnecessarily, this will fail to compile
        struct NonCloneableRoot {
            data: Arc<AtomicUsize>,
            cached_value: usize,
        }

        impl NonCloneableRoot {
            fn new() -> Self {
                Self {
                    data: Arc::new(AtomicUsize::new(42)),
                    cached_value: 42,
                }
            }

            fn increment(&mut self) {
                self.data.fetch_add(1, Ordering::SeqCst);
                self.cached_value = self.data.load(Ordering::SeqCst);
            }

            fn get_value(&self) -> &usize {
                &self.cached_value
            }

            fn get_value_mut(&mut self) -> &mut usize {
                &mut self.cached_value
            }
        }

        let mut root = NonCloneableRoot::new();

        // Create a keypath - this works because we only need &Root, not Clone
        let data_kp = KpType::new(
            |r: &NonCloneableRoot| Some(r.get_value()),
            |r: &mut NonCloneableRoot| {
                r.increment();
                Some(r.get_value_mut())
            },
        );

        // Test that we can use the keypath without cloning
        assert_eq!(data_kp.get(&root), Some(&42));

        {
            // Test map - no cloning of root happens
            let doubled = data_kp.map(|val: &usize| val * 2);
            assert_eq!(doubled.get(&root), Some(84));

            // Test filter - no cloning of root happens
            let filtered = data_kp.filter(|val: &usize| *val > 0);
            assert_eq!(filtered.get(&root), Some(&42));
        } // Drop derived keypaths

        // Test mutable access - no cloning happens
        let value_ref = data_kp.get_mut(&mut root);
        assert!(value_ref.is_some());
    }

    #[test]
    fn test_no_clone_required_for_value() {
        use std::sync::Arc;
        use std::sync::atomic::{AtomicUsize, Ordering};

        // Value type that is NOT Clone and NOT Copy
        struct NonCloneableValue {
            counter: Arc<AtomicUsize>,
        }

        impl NonCloneableValue {
            fn new(val: usize) -> Self {
                Self {
                    counter: Arc::new(AtomicUsize::new(val)),
                }
            }

            fn get(&self) -> usize {
                self.counter.load(Ordering::SeqCst)
            }
        }

        struct Root {
            value: NonCloneableValue,
        }

        let root = Root {
            value: NonCloneableValue::new(100),
        };

        // Keypath that returns reference to non-cloneable value
        let value_kp = KpType::new(|r: &Root| Some(&r.value), |r: &mut Root| Some(&mut r.value));

        // Map to extract the counter value - no cloning happens
        let counter_kp = value_kp.map(|v: &NonCloneableValue| v.get());
        assert_eq!(counter_kp.get(&root), Some(100));

        // Filter non-cloneable values - no cloning happens
        let filtered = value_kp.filter(|v: &NonCloneableValue| v.get() >= 50);
        assert!(filtered.get(&root).is_some());
    }

    #[test]
    fn test_static_does_not_leak_memory() {
        use std::sync::Arc;
        use std::sync::atomic::{AtomicUsize, Ordering};

        // Track number of instances created and dropped
        static CREATED: AtomicUsize = AtomicUsize::new(0);
        static DROPPED: AtomicUsize = AtomicUsize::new(0);

        struct Tracked {
            id: usize,
        }

        impl Tracked {
            fn new() -> Self {
                let id = CREATED.fetch_add(1, Ordering::SeqCst);
                Self { id }
            }
        }

        impl Drop for Tracked {
            fn drop(&mut self) {
                DROPPED.fetch_add(1, Ordering::SeqCst);
            }
        }

        struct Root {
            data: Tracked,
        }

        // Reset counters
        CREATED.store(0, Ordering::SeqCst);
        DROPPED.store(0, Ordering::SeqCst);

        {
            let root = Root {
                data: Tracked::new(),
            };

            let data_kp = KpType::new(|r: &Root| Some(&r.data), |r: &mut Root| Some(&mut r.data));

            // Use map multiple times
            let mapped1 = data_kp.map(|t: &Tracked| t.id);
            let mapped2 = data_kp.map(|t: &Tracked| t.id + 1);
            let mapped3 = data_kp.map(|t: &Tracked| t.id + 2);

            assert_eq!(mapped1.get(&root), Some(0));
            assert_eq!(mapped2.get(&root), Some(1));
            assert_eq!(mapped3.get(&root), Some(2));

            // Only 1 instance should be created (the one in root)
            assert_eq!(CREATED.load(Ordering::SeqCst), 1);
            assert_eq!(DROPPED.load(Ordering::SeqCst), 0);
        }

        // After root is dropped, exactly 1 drop should happen
        assert_eq!(CREATED.load(Ordering::SeqCst), 1);
        assert_eq!(DROPPED.load(Ordering::SeqCst), 1);

        // No memory leaks - created == dropped
    }

    #[test]
    fn test_references_not_cloned() {
        use std::sync::Arc;

        // Large data structure that would be expensive to clone
        struct ExpensiveData {
            large_vec: Vec<u8>,
        }

        impl ExpensiveData {
            fn new(size: usize) -> Self {
                Self {
                    large_vec: vec![0u8; size],
                }
            }

            fn size(&self) -> usize {
                self.large_vec.len()
            }
        }

        struct Root {
            expensive: ExpensiveData,
        }

        let root = Root {
            expensive: ExpensiveData::new(1_000_000), // 1MB
        };

        let expensive_kp = KpType::new(
            |r: &Root| Some(&r.expensive),
            |r: &mut Root| Some(&mut r.expensive),
        );

        // Map operations work with references - no cloning of ExpensiveData
        let size_kp = expensive_kp.map(|e: &ExpensiveData| e.size());
        assert_eq!(size_kp.get(&root), Some(1_000_000));

        // Filter also works with references - no cloning
        let large_filter = expensive_kp.filter(|e: &ExpensiveData| e.size() > 500_000);
        assert!(large_filter.get(&root).is_some());

        // All operations work through references - no expensive clones happen
    }

    #[test]
    fn test_hof_with_arc_no_extra_clones() {
        use std::sync::Arc;

        #[derive(Debug)]
        struct SharedData {
            value: String,
        }

        struct Root {
            shared: Arc<SharedData>,
        }

        let shared = Arc::new(SharedData {
            value: "shared".to_string(),
        });

        // Check initial reference count
        assert_eq!(Arc::strong_count(&shared), 1);

        {
            let root = Root {
                shared: Arc::clone(&shared),
            };

            // Reference count is now 2
            assert_eq!(Arc::strong_count(&shared), 2);

            let shared_kp = KpType::new(
                |r: &Root| Some(&r.shared),
                |r: &mut Root| Some(&mut r.shared),
            );

            // Map operation - should not increase Arc refcount
            let value_kp = shared_kp.map(|arc: &Arc<SharedData>| arc.value.len());

            // Using the keypath doesn't increase refcount
            assert_eq!(value_kp.get(&root), Some(6));
            assert_eq!(Arc::strong_count(&shared), 2); // Still just 2

            // Filter operation - should not increase Arc refcount
            let filtered = shared_kp.filter(|arc: &Arc<SharedData>| !arc.value.is_empty());
            assert!(filtered.get(&root).is_some());
            assert_eq!(Arc::strong_count(&shared), 2); // Still just 2
        } // root is dropped here

        assert_eq!(Arc::strong_count(&shared), 1); // Back to 1
    }

    #[test]
    fn test_closure_captures_not_root_values() {
        use std::sync::Arc;
        use std::sync::atomic::{AtomicUsize, Ordering};

        // Track how many times the closure is called
        let call_count = Arc::new(AtomicUsize::new(0));
        let call_count_clone = Arc::clone(&call_count);

        struct Root {
            value: i32,
        }

        let root = Root { value: 42 };

        let value_kp = KpType::new(|r: &Root| Some(&r.value), |r: &mut Root| Some(&mut r.value));

        // Use fold_value which doesn't require Copy (optimized HOF)
        // The closure captures call_count (via move), not the root or value
        let doubled = value_kp.fold_value(0, move |_acc, v: &i32| {
            call_count_clone.fetch_add(1, Ordering::SeqCst);
            v * 2
        });

        // Call multiple times
        assert_eq!(doubled(&root), 84);
        assert_eq!(doubled(&root), 84);
        assert_eq!(doubled(&root), 84);

        // Closure was called 3 times
        assert_eq!(call_count.load(Ordering::SeqCst), 3);

        // The Root and value were NOT cloned - only references were passed
    }

    #[test]
    fn test_static_with_borrowed_data() {
        // 'static doesn't mean the data lives forever
        // It means the TYPE doesn't contain non-'static references

        struct Root {
            data: String,
        }

        {
            let root = Root {
                data: "temporary".to_string(),
            };

            let data_kp = KpType::new(|r: &Root| Some(&r.data), |r: &mut Root| Some(&mut r.data));

            // Map with 'static bound - but root is NOT static
            let len_kp = data_kp.map(|s: &String| s.len());
            assert_eq!(len_kp.get(&root), Some(9));

            // When root goes out of scope here, everything is properly dropped
        } // root is dropped here along with len_kp

        // No memory leak - root was dropped normally
    }

    #[test]
    fn test_multiple_hof_operations_no_accumulation() {
        use std::sync::Arc;
        use std::sync::atomic::{AtomicUsize, Ordering};

        static DROP_COUNT: AtomicUsize = AtomicUsize::new(0);

        struct Tracked {
            id: usize,
        }

        impl Drop for Tracked {
            fn drop(&mut self) {
                DROP_COUNT.fetch_add(1, Ordering::SeqCst);
            }
        }

        struct Root {
            values: Vec<Tracked>,
        }

        DROP_COUNT.store(0, Ordering::SeqCst);

        {
            let root = Root {
                values: vec![Tracked { id: 1 }, Tracked { id: 2 }, Tracked { id: 3 }],
            };

            let values_kp = KpType::new(
                |r: &Root| Some(&r.values),
                |r: &mut Root| Some(&mut r.values),
            );

            // Multiple HOF operations - should not clone the Vec<Tracked>
            let count = values_kp.count_items(|v| v.len());
            let sum = values_kp.sum_value(|v| v.iter().map(|t| t.id).sum::<usize>());
            let has_2 = values_kp.any(|v| v.iter().any(|t| t.id == 2));
            let all_positive = values_kp.all(|v| v.iter().all(|t| t.id > 0));

            assert_eq!(count(&root), Some(3));
            assert_eq!(sum(&root), Some(6));
            assert!(has_2(&root));
            assert!(all_positive(&root));

            // No drops yet - values are still in root
            assert_eq!(DROP_COUNT.load(Ordering::SeqCst), 0);
        }

        // Now exactly 3 Tracked instances should be dropped
        assert_eq!(DROP_COUNT.load(Ordering::SeqCst), 3);
    }

    #[test]
    fn test_copy_bound_only_for_function_not_data() {
        // This test verifies that F: Copy means the FUNCTION must be Copy,
        // not the data being processed

        #[derive(Debug)]
        struct NonCopyData {
            value: String,
        }

        struct Root {
            data: NonCopyData,
        }

        let root = Root {
            data: NonCopyData {
                value: "test".to_string(),
            },
        };

        let data_kp = KpType::new(|r: &Root| Some(&r.data), |r: &mut Root| Some(&mut r.data));

        // Map works even though NonCopyData is not Copy
        // The function pointer IS Copy, but the data is not
        let len_kp = data_kp.map(|d: &NonCopyData| d.value.len());
        assert_eq!(len_kp.get(&root), Some(4));

        // Filter also works with non-Copy data
        let filtered = data_kp.filter(|d: &NonCopyData| !d.value.is_empty());
        assert!(filtered.get(&root).is_some());
    }

    #[test]
    fn test_no_memory_leak_with_cyclic_references() {
        use std::sync::atomic::{AtomicUsize, Ordering};
        use std::sync::{Arc, Weak};

        static DROP_COUNT: AtomicUsize = AtomicUsize::new(0);

        struct Node {
            id: usize,
            parent: Option<Weak<Node>>,
        }

        impl Drop for Node {
            fn drop(&mut self) {
                DROP_COUNT.fetch_add(1, Ordering::SeqCst);
            }
        }

        struct Root {
            node: Arc<Node>,
        }

        DROP_COUNT.store(0, Ordering::SeqCst);

        {
            let root = Root {
                node: Arc::new(Node {
                    id: 1,
                    parent: None,
                }),
            };

            let node_kp = KpType::new(|r: &Root| Some(&r.node), |r: &mut Root| Some(&mut r.node));

            // Map operations don't create extra Arc clones
            let id_kp = node_kp.map(|n: &Arc<Node>| n.id);
            assert_eq!(id_kp.get(&root), Some(1));

            // Strong count should still be 1 (only in root)
            assert_eq!(Arc::strong_count(&root.node), 1);

            // No drops yet
            assert_eq!(DROP_COUNT.load(Ordering::SeqCst), 0);
        }

        // Exactly 1 Node should be dropped
        assert_eq!(DROP_COUNT.load(Ordering::SeqCst), 1);
    }

    #[test]
    fn test_hof_operations_are_zero_cost_abstractions() {
        // This test verifies that HOF operations don't add overhead
        // by checking that the same number of operations occur

        struct Root {
            value: i32,
        }

        let root = Root { value: 10 };

        let value_kp = KpType::new(|r: &Root| Some(&r.value), |r: &mut Root| Some(&mut r.value));

        // Direct access
        let direct_result = value_kp.get(&root).map(|v| v * 2);
        assert_eq!(direct_result, Some(20));

        // Through map HOF
        let mapped_kp = value_kp.map(|v: &i32| v * 2);
        let hof_result = mapped_kp.get(&root);
        assert_eq!(hof_result, Some(20));

        // Results are identical - no extra allocations or operations
        assert_eq!(direct_result, hof_result);
    }

    #[test]
    fn test_complex_closure_captures_allowed() {
        use std::sync::Arc;

        // With Copy removed from many HOFs, we can now capture complex state
        struct Root {
            scores: Vec<i32>,
        }

        let root = Root {
            scores: vec![85, 92, 78, 95, 88],
        };

        let scores_kp = KpType::new(
            |r: &Root| Some(&r.scores),
            |r: &mut Root| Some(&mut r.scores),
        );

        // Capture external state in HOF (only works because Copy was removed)
        let threshold = 90;
        let multiplier = Arc::new(2);

        // These closures capture state but don't need Copy
        let high_scores_doubled = scores_kp.fold_value(0, move |acc, scores| {
            let high: i32 = scores
                .iter()
                .filter(|&&s| s >= threshold)
                .map(|&s| s * *multiplier)
                .sum();
            acc + high
        });

        // (92 * 2) + (95 * 2) = 184 + 190 = 374
        assert_eq!(high_scores_doubled(&root), 374);
    }

    // ========== TYPE FILTERING TESTS FOR PKP AND AKP ==========
    // These tests demonstrate filtering collections by TypeId

    #[test]
    fn test_pkp_filter_by_value_type() {
        use std::any::TypeId;

        #[derive(Debug)]
        struct User {
            name: String,
            age: i32,
            score: f64,
            active: bool,
        }

        let user = User {
            name: "Akash".to_string(),
            age: 30,
            score: 95.5,
            active: true,
        };

        // Create keypaths for different fields with different types
        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let age_kp = KpType::new(|u: &User| Some(&u.age), |u: &mut User| Some(&mut u.age));
        let score_kp = KpType::new(|u: &User| Some(&u.score), |u: &mut User| Some(&mut u.score));
        let active_kp = KpType::new(
            |u: &User| Some(&u.active),
            |u: &mut User| Some(&mut u.active),
        );

        // Convert to partial keypaths and store in a heterogeneous collection
        let all_keypaths: Vec<PKp<User>> = vec![
            PKp::new(name_kp),
            PKp::new(age_kp),
            PKp::new(score_kp),
            PKp::new(active_kp),
        ];

        // Filter for String types
        let string_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|pkp| pkp.value_type_id() == TypeId::of::<String>())
            .collect();

        assert_eq!(string_kps.len(), 1);
        assert_eq!(
            string_kps[0].get_as::<String>(&user),
            Some(&"Akash".to_string())
        );

        // Filter for i32 types
        let i32_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|pkp| pkp.value_type_id() == TypeId::of::<i32>())
            .collect();

        assert_eq!(i32_kps.len(), 1);
        assert_eq!(i32_kps[0].get_as::<i32>(&user), Some(&30));

        // Filter for f64 types
        let f64_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|pkp| pkp.value_type_id() == TypeId::of::<f64>())
            .collect();

        assert_eq!(f64_kps.len(), 1);
        assert_eq!(f64_kps[0].get_as::<f64>(&user), Some(&95.5));

        // Filter for bool types
        let bool_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|pkp| pkp.value_type_id() == TypeId::of::<bool>())
            .collect();

        assert_eq!(bool_kps.len(), 1);
        assert_eq!(bool_kps[0].get_as::<bool>(&user), Some(&true));
    }

    #[test]
    fn test_pkp_filter_by_struct_type() {
        use std::any::TypeId;

        #[derive(Debug, PartialEq)]
        struct Address {
            street: String,
            city: String,
        }

        #[derive(Debug)]
        struct User {
            name: String,
            age: i32,
            address: Address,
        }

        let user = User {
            name: "Bob".to_string(),
            age: 25,
            address: Address {
                street: "123 Main St".to_string(),
                city: "NYC".to_string(),
            },
        };

        // Create keypaths for different types
        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let age_kp = KpType::new(|u: &User| Some(&u.age), |u: &mut User| Some(&mut u.age));
        let address_kp = KpType::new(
            |u: &User| Some(&u.address),
            |u: &mut User| Some(&mut u.address),
        );

        let all_keypaths: Vec<PKp<User>> =
            vec![PKp::new(name_kp), PKp::new(age_kp), PKp::new(address_kp)];

        // Filter for custom struct type (Address)
        let struct_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|pkp| pkp.value_type_id() == TypeId::of::<Address>())
            .collect();

        assert_eq!(struct_kps.len(), 1);
        assert_eq!(
            struct_kps[0].get_as::<Address>(&user),
            Some(&Address {
                street: "123 Main St".to_string(),
                city: "NYC".to_string(),
            })
        );

        // Filter for primitive types (non-struct)
        let primitive_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|pkp| {
                pkp.value_type_id() == TypeId::of::<String>()
                    || pkp.value_type_id() == TypeId::of::<i32>()
            })
            .collect();

        assert_eq!(primitive_kps.len(), 2);
    }

    #[test]
    fn test_pkp_filter_by_arc_type() {
        use std::any::TypeId;
        use std::sync::Arc;

        #[derive(Debug)]
        struct User {
            name: String,
            shared_data: Arc<String>,
            shared_number: Arc<i32>,
        }

        let user = User {
            name: "Charlie".to_string(),
            shared_data: Arc::new("shared".to_string()),
            shared_number: Arc::new(42),
        };

        // Create keypaths for different types including Arc
        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let shared_data_kp = KpType::new(
            |u: &User| Some(&u.shared_data),
            |u: &mut User| Some(&mut u.shared_data),
        );
        let shared_number_kp = KpType::new(
            |u: &User| Some(&u.shared_number),
            |u: &mut User| Some(&mut u.shared_number),
        );

        let all_keypaths: Vec<PKp<User>> = vec![
            PKp::new(name_kp),
            PKp::new(shared_data_kp),
            PKp::new(shared_number_kp),
        ];

        // Filter for Arc<String> types
        let arc_string_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|pkp| pkp.value_type_id() == TypeId::of::<Arc<String>>())
            .collect();

        assert_eq!(arc_string_kps.len(), 1);
        assert_eq!(
            arc_string_kps[0]
                .get_as::<Arc<String>>(&user)
                .map(|arc| arc.as_str()),
            Some("shared")
        );

        // Filter for Arc<i32> types
        let arc_i32_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|pkp| pkp.value_type_id() == TypeId::of::<Arc<i32>>())
            .collect();

        assert_eq!(arc_i32_kps.len(), 1);
        assert_eq!(
            arc_i32_kps[0].get_as::<Arc<i32>>(&user).map(|arc| **arc),
            Some(42)
        );

        // Filter for all Arc types (any T)
        let all_arc_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|pkp| {
                pkp.value_type_id() == TypeId::of::<Arc<String>>()
                    || pkp.value_type_id() == TypeId::of::<Arc<i32>>()
            })
            .collect();

        assert_eq!(all_arc_kps.len(), 2);
    }

    #[test]
    fn test_pkp_filter_by_box_type() {
        use std::any::TypeId;

        #[derive(Debug)]
        struct User {
            name: String,
            boxed_value: Box<i32>,
            boxed_string: Box<String>,
        }

        let user = User {
            name: "Diana".to_string(),
            boxed_value: Box::new(100),
            boxed_string: Box::new("boxed".to_string()),
        };

        // Create keypaths
        let name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let boxed_value_kp = KpType::new(
            |u: &User| Some(&u.boxed_value),
            |u: &mut User| Some(&mut u.boxed_value),
        );
        let boxed_string_kp = KpType::new(
            |u: &User| Some(&u.boxed_string),
            |u: &mut User| Some(&mut u.boxed_string),
        );

        let all_keypaths: Vec<PKp<User>> = vec![
            PKp::new(name_kp),
            PKp::new(boxed_value_kp),
            PKp::new(boxed_string_kp),
        ];

        // Filter for Box<i32>
        let box_i32_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|pkp| pkp.value_type_id() == TypeId::of::<Box<i32>>())
            .collect();

        assert_eq!(box_i32_kps.len(), 1);
        assert_eq!(
            box_i32_kps[0].get_as::<Box<i32>>(&user).map(|b| **b),
            Some(100)
        );

        // Filter for Box<String>
        let box_string_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|pkp| pkp.value_type_id() == TypeId::of::<Box<String>>())
            .collect();

        assert_eq!(box_string_kps.len(), 1);
        assert_eq!(
            box_string_kps[0]
                .get_as::<Box<String>>(&user)
                .map(|b| b.as_str()),
            Some("boxed")
        );
    }

    #[test]
    fn test_akp_filter_by_root_and_value_type() {
        use std::any::TypeId;

        #[derive(Debug)]
        struct User {
            name: String,
            age: i32,
        }

        #[derive(Debug)]
        struct Product {
            title: String,
            price: f64,
        }

        let user = User {
            name: "Eve".to_string(),
            age: 28,
        };

        let product = Product {
            title: "Book".to_string(),
            price: 19.99,
        };

        // Create AnyKeypaths for different root/value type combinations
        let user_name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let user_age_kp = KpType::new(|u: &User| Some(&u.age), |u: &mut User| Some(&mut u.age));
        let product_title_kp = KpType::new(
            |p: &Product| Some(&p.title),
            |p: &mut Product| Some(&mut p.title),
        );
        let product_price_kp = KpType::new(
            |p: &Product| Some(&p.price),
            |p: &mut Product| Some(&mut p.price),
        );

        let all_keypaths: Vec<AKp> = vec![
            AKp::new(user_name_kp),
            AKp::new(user_age_kp),
            AKp::new(product_title_kp),
            AKp::new(product_price_kp),
        ];

        // Filter for User root type
        let user_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| akp.root_type_id() == TypeId::of::<User>())
            .collect();

        assert_eq!(user_kps.len(), 2);

        // Filter for Product root type
        let product_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| akp.root_type_id() == TypeId::of::<Product>())
            .collect();

        assert_eq!(product_kps.len(), 2);

        // Filter for String value type
        let string_value_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| akp.value_type_id() == TypeId::of::<String>())
            .collect();

        assert_eq!(string_value_kps.len(), 2);

        // Filter for both User root AND String value
        let user_string_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| {
                akp.root_type_id() == TypeId::of::<User>()
                    && akp.value_type_id() == TypeId::of::<String>()
            })
            .collect();

        assert_eq!(user_string_kps.len(), 1);
        assert_eq!(
            user_string_kps[0].get_as::<User, String>(&user),
            Some(Some(&"Eve".to_string()))
        );

        // Filter for Product root AND f64 value
        let product_f64_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| {
                akp.root_type_id() == TypeId::of::<Product>()
                    && akp.value_type_id() == TypeId::of::<f64>()
            })
            .collect();

        assert_eq!(product_f64_kps.len(), 1);
        assert_eq!(
            product_f64_kps[0].get_as::<Product, f64>(&product),
            Some(Some(&19.99))
        );
    }

    #[test]
    fn test_akp_filter_by_arc_root_type() {
        use std::any::TypeId;
        use std::sync::Arc;

        #[derive(Debug)]
        struct User {
            name: String,
        }

        #[derive(Debug)]
        struct Product {
            title: String,
        }

        let user = User {
            name: "Frank".to_string(),
        };
        let product = Product {
            title: "Laptop".to_string(),
        };

        // Create keypaths
        let user_name_kp = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let product_title_kp = KpType::new(
            |p: &Product| Some(&p.title),
            |p: &mut Product| Some(&mut p.title),
        );

        // Create AKp and adapt for Arc
        let user_akp = AKp::new(user_name_kp).for_arc::<User>();
        let product_akp = AKp::new(product_title_kp).for_arc::<Product>();

        let all_keypaths: Vec<AKp> = vec![user_akp, product_akp];

        // Filter for Arc<User> root type
        let arc_user_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| akp.root_type_id() == TypeId::of::<Arc<User>>())
            .collect();

        assert_eq!(arc_user_kps.len(), 1);

        // Verify it works with Arc<User>
        let arc_user = Arc::new(user);
        assert_eq!(
            arc_user_kps[0].get_as::<Arc<User>, String>(&arc_user),
            Some(Some(&"Frank".to_string()))
        );

        // Filter for Arc<Product> root type
        let arc_product_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| akp.root_type_id() == TypeId::of::<Arc<Product>>())
            .collect();

        assert_eq!(arc_product_kps.len(), 1);

        // Verify it works with Arc<Product>
        let arc_product = Arc::new(product);
        assert_eq!(
            arc_product_kps[0].get_as::<Arc<Product>, String>(&arc_product),
            Some(Some(&"Laptop".to_string()))
        );
    }

    #[test]
    fn test_akp_filter_by_box_root_type() {
        use std::any::TypeId;

        #[derive(Debug)]
        struct Config {
            setting: String,
        }

        let config = Config {
            setting: "enabled".to_string(),
        };

        // Create keypath for regular Config
        let config_kp1 = KpType::new(
            |c: &Config| Some(&c.setting),
            |c: &mut Config| Some(&mut c.setting),
        );
        let config_kp2 = KpType::new(
            |c: &Config| Some(&c.setting),
            |c: &mut Config| Some(&mut c.setting),
        );

        // Create both regular and Box-adapted AKp
        let regular_akp = AKp::new(config_kp1);
        let box_akp = AKp::new(config_kp2).for_box::<Config>();

        let all_keypaths: Vec<AKp> = vec![regular_akp, box_akp];

        // Filter for Config root type
        let config_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| akp.root_type_id() == TypeId::of::<Config>())
            .collect();

        assert_eq!(config_kps.len(), 1);
        assert_eq!(
            config_kps[0].get_as::<Config, String>(&config),
            Some(Some(&"enabled".to_string()))
        );

        // Filter for Box<Config> root type
        let box_config_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| akp.root_type_id() == TypeId::of::<Box<Config>>())
            .collect();

        assert_eq!(box_config_kps.len(), 1);

        // Verify it works with Box<Config>
        let box_config = Box::new(Config {
            setting: "enabled".to_string(),
        });
        assert_eq!(
            box_config_kps[0].get_as::<Box<Config>, String>(&box_config),
            Some(Some(&"enabled".to_string()))
        );
    }

    #[test]
    fn test_mixed_collection_type_filtering() {
        use std::any::TypeId;
        use std::sync::Arc;

        #[derive(Debug)]
        struct User {
            name: String,
            email: String,
        }

        #[derive(Debug)]
        struct Product {
            title: String,
            sku: String,
        }

        let user = User {
            name: "Grace".to_string(),
            email: "grace@example.com".to_string(),
        };

        let product = Product {
            title: "Widget".to_string(),
            sku: "WID-001".to_string(),
        };

        // Create a complex heterogeneous collection
        let user_name_kp1 = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let user_name_kp2 = KpType::new(|u: &User| Some(&u.name), |u: &mut User| Some(&mut u.name));
        let user_email_kp1 =
            KpType::new(|u: &User| Some(&u.email), |u: &mut User| Some(&mut u.email));
        let user_email_kp2 =
            KpType::new(|u: &User| Some(&u.email), |u: &mut User| Some(&mut u.email));
        let product_title_kp = KpType::new(
            |p: &Product| Some(&p.title),
            |p: &mut Product| Some(&mut p.title),
        );
        let product_sku_kp = KpType::new(
            |p: &Product| Some(&p.sku),
            |p: &mut Product| Some(&mut p.sku),
        );

        let all_keypaths: Vec<AKp> = vec![
            AKp::new(user_name_kp1),
            AKp::new(user_email_kp1),
            AKp::new(product_title_kp),
            AKp::new(product_sku_kp),
            AKp::new(user_name_kp2).for_arc::<User>(),
            AKp::new(user_email_kp2).for_box::<User>(),
        ];

        // Test 1: Find all keypaths with String values
        let string_value_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| akp.value_type_id() == TypeId::of::<String>())
            .collect();

        assert_eq!(string_value_kps.len(), 6); // All return String

        // Test 2: Find keypaths with User root (excluding Arc<User> and Box<User>)
        let user_root_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| akp.root_type_id() == TypeId::of::<User>())
            .collect();

        assert_eq!(user_root_kps.len(), 2);

        // Test 3: Find keypaths with Arc<User> root
        let arc_user_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| akp.root_type_id() == TypeId::of::<Arc<User>>())
            .collect();

        assert_eq!(arc_user_kps.len(), 1);

        // Test 4: Find keypaths with Box<User> root
        let box_user_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| akp.root_type_id() == TypeId::of::<Box<User>>())
            .collect();

        assert_eq!(box_user_kps.len(), 1);

        // Test 5: Find Product keypaths (non-wrapped)
        let product_kps: Vec<_> = all_keypaths
            .iter()
            .filter(|akp| akp.root_type_id() == TypeId::of::<Product>())
            .collect();

        assert_eq!(product_kps.len(), 2);

        // Test 6: Verify we can use the filtered keypaths
        let user_value = user_root_kps[0].get_as::<User, String>(&user);
        assert!(user_value.is_some());
        assert!(user_value.unwrap().is_some());
    }

    // ========================================================================
    // Advanced Type Examples: Pin, MaybeUninit, Weak
    // ========================================================================

    #[test]
    fn test_kp_with_pin() {
        use std::pin::Pin;

        // Pin ensures a value won't be moved in memory
        // Useful for self-referential structs and async

        #[derive(Debug)]
        struct SelfReferential {
            value: String,
            ptr_to_value: *const String, // Points to value field
        }

        impl SelfReferential {
            fn new(s: String) -> Self {
                let mut sr = Self {
                    value: s,
                    ptr_to_value: std::ptr::null(),
                };
                // Make it self-referential
                sr.ptr_to_value = &sr.value as *const String;
                sr
            }

            fn get_value(&self) -> &str {
                &self.value
            }
        }

        // Create a pinned value
        let boxed = Box::new(SelfReferential::new("pinned_data".to_string()));
        let pinned: Pin<Box<SelfReferential>> = Box::into_pin(boxed);

        // Keypath to access the value field through Pin
        let kp: KpType<Pin<Box<SelfReferential>>, String> = Kp::new(
            |p: &Pin<Box<SelfReferential>>| {
                // Pin::as_ref() gives us &SelfReferential
                Some(&p.as_ref().get_ref().value)
            },
            |p: &mut Pin<Box<SelfReferential>>| {
                // For mutable access, we need to use unsafe get_unchecked_mut
                // In practice, you'd use Pin::get_mut if T: Unpin
                unsafe {
                    let sr = Pin::get_unchecked_mut(p.as_mut());
                    Some(&mut sr.value)
                }
            },
        );

        // Access through keypath
        let result = kp.get(&pinned);
        assert_eq!(result, Some(&"pinned_data".to_string()));

        // The value is still pinned and hasn't moved
        assert_eq!(pinned.get_value(), "pinned_data");
    }

    #[test]
    fn test_kp_with_pin_arc() {
        use std::pin::Pin;
        use std::sync::Arc;

        struct AsyncState {
            status: String,
            data: Vec<i32>,
        }

        // Pin<Arc<T>> is common in async Rust
        let state = AsyncState {
            status: "ready".to_string(),
            data: vec![1, 2, 3, 4, 5],
        };

        let pinned_arc: Pin<Arc<AsyncState>> = Arc::pin(state);

        // Keypath to status through Pin<Arc<T>>
        let status_kp: KpType<Pin<Arc<AsyncState>>, String> = Kp::new(
            |p: &Pin<Arc<AsyncState>>| Some(&p.as_ref().get_ref().status),
            |_: &mut Pin<Arc<AsyncState>>| {
                // Arc is immutable, so mutable access returns None
                None::<&mut String>
            },
        );

        // Keypath to data through Pin<Arc<T>>
        let data_kp: KpType<Pin<Arc<AsyncState>>, Vec<i32>> = Kp::new(
            |p: &Pin<Arc<AsyncState>>| Some(&p.as_ref().get_ref().data),
            |_: &mut Pin<Arc<AsyncState>>| None::<&mut Vec<i32>>,
        );

        let status = status_kp.get(&pinned_arc);
        assert_eq!(status, Some(&"ready".to_string()));

        let data = data_kp.get(&pinned_arc);
        assert_eq!(data, Some(&vec![1, 2, 3, 4, 5]));
    }

    #[test]
    fn test_kp_with_maybe_uninit() {
        use std::mem::MaybeUninit;

        // MaybeUninit<T> represents potentially uninitialized memory
        // Useful for optimizing initialization or working with FFI

        struct Config {
            name: MaybeUninit<String>,
            value: MaybeUninit<i32>,
            initialized: bool,
        }

        impl Config {
            fn new_uninit() -> Self {
                Self {
                    name: MaybeUninit::uninit(),
                    value: MaybeUninit::uninit(),
                    initialized: false,
                }
            }

            fn init(&mut self, name: String, value: i32) {
                self.name.write(name);
                self.value.write(value);
                self.initialized = true;
            }

            fn get_name(&self) -> Option<&String> {
                if self.initialized {
                    unsafe { Some(self.name.assume_init_ref()) }
                } else {
                    None
                }
            }

            fn get_value(&self) -> Option<&i32> {
                if self.initialized {
                    unsafe { Some(self.value.assume_init_ref()) }
                } else {
                    None
                }
            }
        }

        // Create keypath that safely accesses potentially uninitialized data
        let name_kp: KpType<Config, String> = Kp::new(
            |c: &Config| c.get_name(),
            |c: &mut Config| {
                if c.initialized {
                    unsafe { Some(c.name.assume_init_mut()) }
                } else {
                    None
                }
            },
        );

        let value_kp: KpType<Config, i32> = Kp::new(
            |c: &Config| c.get_value(),
            |c: &mut Config| {
                if c.initialized {
                    unsafe { Some(c.value.assume_init_mut()) }
                } else {
                    None
                }
            },
        );

        // Test with uninitialized config
        let uninit_config = Config::new_uninit();
        assert_eq!(name_kp.get(&uninit_config), None);
        assert_eq!(value_kp.get(&uninit_config), None);

        // Test with initialized config
        let mut init_config = Config::new_uninit();
        init_config.init("test_config".to_string(), 42);

        assert_eq!(name_kp.get(&init_config), Some(&"test_config".to_string()));
        assert_eq!(value_kp.get(&init_config), Some(&42));

        // Modify through keypath
        if let Some(val) = value_kp.get_mut(&mut init_config) {
            *val = 100;
        }

        assert_eq!(value_kp.get(&init_config), Some(&100));
    }

    #[test]
    fn test_kp_with_weak() {
        use std::sync::{Arc, Weak};

        // Weak references don't prevent deallocation
        // For keypaths with Weak, we need to store the strong reference

        #[derive(Debug, Clone)]
        struct Node {
            value: i32,
        }

        struct NodeWithParent {
            value: i32,
            parent: Option<Arc<Node>>, // Strong reference for demonstration
        }

        let parent = Arc::new(Node { value: 100 });

        let child = NodeWithParent {
            value: 42,
            parent: Some(parent.clone()),
        };

        // Keypath to access parent value
        let parent_value_kp: KpType<NodeWithParent, i32> = Kp::new(
            |n: &NodeWithParent| n.parent.as_ref().map(|arc| &arc.value),
            |_: &mut NodeWithParent| None::<&mut i32>,
        );

        // Access parent value
        let parent_val = parent_value_kp.get(&child);
        assert_eq!(parent_val, Some(&100));
    }

    #[test]
    fn test_kp_with_rc_weak() {
        use std::rc::Rc;

        // Single-threaded version with Rc

        struct TreeNode {
            value: String,
            parent: Option<Rc<TreeNode>>, // Strong ref for keypath access
        }

        let root = Rc::new(TreeNode {
            value: "root".to_string(),
            parent: None,
        });

        let child1 = TreeNode {
            value: "child1".to_string(),
            parent: Some(root.clone()),
        };

        let child2 = TreeNode {
            value: "child2".to_string(),
            parent: Some(root.clone()),
        };

        // Keypath to access parent's value
        let parent_name_kp: KpType<TreeNode, String> = Kp::new(
            |node: &TreeNode| node.parent.as_ref().map(|rc| &rc.value),
            |_: &mut TreeNode| None::<&mut String>,
        );

        // Access parent
        assert_eq!(parent_name_kp.get(&child1), Some(&"root".to_string()));
        assert_eq!(parent_name_kp.get(&child2), Some(&"root".to_string()));

        // Root has no parent
        assert_eq!(parent_name_kp.get(&root), None);
    }

    #[test]
    fn test_kp_with_complex_weak_structure() {
        use std::sync::Arc;

        // Complex structure demonstrating Arc reference patterns

        struct Cache {
            data: String,
            backup: Option<Arc<Cache>>, // Strong reference
        }

        let primary = Arc::new(Cache {
            data: "primary_data".to_string(),
            backup: None,
        });

        let backup = Arc::new(Cache {
            data: "backup_data".to_string(),
            backup: Some(primary.clone()),
        });

        // Keypath to access backup's data
        let backup_data_kp: KpType<Arc<Cache>, String> = Kp::new(
            |cache_arc: &Arc<Cache>| cache_arc.backup.as_ref().map(|arc| &arc.data),
            |_: &mut Arc<Cache>| None::<&mut String>,
        );

        // Access primary data through backup's reference
        let data = backup_data_kp.get(&backup);
        assert_eq!(data, Some(&"primary_data".to_string()));

        // Primary has no backup
        let no_backup = backup_data_kp.get(&primary);
        assert_eq!(no_backup, None);
    }

    #[test]
    fn test_kp_chain_with_pin_and_arc() {
        use std::pin::Pin;
        use std::sync::Arc;

        // Demonstrate chaining keypaths through Pin and Arc

        struct Outer {
            inner: Arc<Inner>,
        }

        struct Inner {
            value: String,
        }

        let outer = Outer {
            inner: Arc::new(Inner {
                value: "nested_value".to_string(),
            }),
        };

        let pinned_outer = Box::pin(outer);

        // First keypath: Pin<Box<Outer>> -> Arc<Inner>
        let to_inner: KpType<Pin<Box<Outer>>, Arc<Inner>> = Kp::new(
            |p: &Pin<Box<Outer>>| Some(&p.as_ref().get_ref().inner),
            |_: &mut Pin<Box<Outer>>| None::<&mut Arc<Inner>>,
        );

        // Second keypath: Arc<Inner> -> String
        let to_value: KpType<Arc<Inner>, String> = Kp::new(
            |a: &Arc<Inner>| Some(&a.value),
            |_: &mut Arc<Inner>| None::<&mut String>,
        );

        // Chain them together
        let chained = to_inner.then(to_value);

        let result = chained.get(&pinned_outer);
        assert_eq!(result, Some(&"nested_value".to_string()));
    }

    #[test]
    fn test_kp_with_maybe_uninit_array() {
        use std::mem::MaybeUninit;

        // Working with arrays of MaybeUninit - common pattern for
        // efficient array initialization

        struct Buffer {
            data: [MaybeUninit<u8>; 10],
            len: usize,
        }

        impl Buffer {
            fn new() -> Self {
                Self {
                    data: unsafe { MaybeUninit::uninit().assume_init() },
                    len: 0,
                }
            }

            fn push(&mut self, byte: u8) -> Result<(), &'static str> {
                if self.len >= self.data.len() {
                    return Err("Buffer full");
                }
                self.data[self.len].write(byte);
                self.len += 1;
                Ok(())
            }

            fn get(&self, idx: usize) -> Option<&u8> {
                if idx < self.len {
                    unsafe { Some(self.data[idx].assume_init_ref()) }
                } else {
                    None
                }
            }

            fn get_mut(&mut self, idx: usize) -> Option<&mut u8> {
                if idx < self.len {
                    unsafe { Some(self.data[idx].assume_init_mut()) }
                } else {
                    None
                }
            }
        }

        // Keypath to access length of initialized data
        let len_kp: KpType<Buffer, usize> =
            Kp::new(|b: &Buffer| Some(&b.len), |b: &mut Buffer| Some(&mut b.len));

        let mut buffer = Buffer::new();

        // Empty buffer
        assert_eq!(len_kp.get(&buffer), Some(&0));

        // Add some data
        buffer.push(1).unwrap();
        buffer.push(2).unwrap();
        buffer.push(3).unwrap();

        // Access through keypath
        assert_eq!(len_kp.get(&buffer), Some(&3));

        // Access elements directly (not through keypath factory due to type complexity)
        assert_eq!(buffer.get(0), Some(&1));
        assert_eq!(buffer.get(1), Some(&2));
        assert_eq!(buffer.get(2), Some(&3));
        assert_eq!(buffer.get(10), None); // Out of bounds

        // Modify through buffer's API
        if let Some(elem) = buffer.get_mut(1) {
            *elem = 20;
        }
        assert_eq!(buffer.get(1), Some(&20));
    }

    #[test]
    fn test_kp_then_lock_deep_structs() {
        use std::sync::{Arc, Mutex};

        #[derive(Clone)]
        struct Root {
            guard: Arc<Mutex<Level1>>,
        }
        #[derive(Clone)]
        struct Level1 {
            name: String,
            nested: Level2,
        }
        #[derive(Clone)]
        struct Level2 {
            count: i32,
        }

        let root = Root {
            guard: Arc::new(Mutex::new(Level1 {
                name: "deep".to_string(),
                nested: Level2 { count: 42 },
            })),
        };

        let kp_to_guard: KpType<Root, Arc<Mutex<Level1>>> =
            Kp::new(|r: &Root| Some(&r.guard), |r: &mut Root| Some(&mut r.guard));

        let lock_kp = {
            let prev: KpType<Arc<Mutex<Level1>>, Arc<Mutex<Level1>>> = Kp::new(
                |g: &Arc<Mutex<Level1>>| Some(g),
                |g: &mut Arc<Mutex<Level1>>| Some(g),
            );
            let next: KpType<Level1, Level1> =
                Kp::new(|l: &Level1| Some(l), |l: &mut Level1| Some(l));
            crate::lock::LockKp::new(prev, crate::lock::ArcMutexAccess::new(), next)
        };

        let chained = kp_to_guard.then_lock(lock_kp);
        let level1 = chained.get(&root);
        assert!(level1.is_some());
        assert_eq!(level1.unwrap().name, "deep");
        assert_eq!(level1.unwrap().nested.count, 42);

        let mut_root = &mut root.clone();
        let mut_level1 = chained.get_mut(mut_root);
        assert!(mut_level1.is_some());
        mut_level1.unwrap().nested.count = 99;
        assert_eq!(chained.get(&root).unwrap().nested.count, 99);
    }

    #[test]
    fn test_kp_then_lock_with_enum() {
        use std::sync::{Arc, Mutex};

        #[derive(Clone)]
        enum Message {
            Request(LevelA),
            Response(i32),
        }
        #[derive(Clone)]
        struct LevelA {
            data: Arc<Mutex<i32>>,
        }

        struct RootWithEnum {
            msg: Arc<Mutex<Message>>,
        }

        let root = RootWithEnum {
            msg: Arc::new(Mutex::new(Message::Request(LevelA {
                data: Arc::new(Mutex::new(100)),
            }))),
        };

        let kp_msg: KpType<RootWithEnum, Arc<Mutex<Message>>> = Kp::new(
            |r: &RootWithEnum| Some(&r.msg),
            |r: &mut RootWithEnum| Some(&mut r.msg),
        );

        let lock_kp_msg = {
            let prev: KpType<Arc<Mutex<Message>>, Arc<Mutex<Message>>> = Kp::new(
                |m: &Arc<Mutex<Message>>| Some(m),
                |m: &mut Arc<Mutex<Message>>| Some(m),
            );
            let next: KpType<Message, Message> =
                Kp::new(|m: &Message| Some(m), |m: &mut Message| Some(m));
            crate::lock::LockKp::new(prev, crate::lock::ArcMutexAccess::new(), next)
        };

        let chained = kp_msg.then_lock(lock_kp_msg);
        let msg = chained.get(&root);
        assert!(msg.is_some());
        match msg.unwrap() {
            Message::Request(a) => assert_eq!(*a.data.lock().unwrap(), 100),
            Message::Response(_) => panic!("expected Request"),
        }
    }

    #[cfg(all(feature = "tokio", feature = "parking_lot"))]
    #[tokio::test]
    async fn test_kp_then_async_deep_chain() {
        use crate::async_lock::{AsyncLockKp, TokioMutexAccess};
        use std::sync::Arc;

        #[derive(Clone)]
        struct Root {
            tokio_guard: Arc<tokio::sync::Mutex<Level1>>,
        }
        #[derive(Clone)]
        struct Level1 {
            value: i32,
        }

        let root = Root {
            tokio_guard: Arc::new(tokio::sync::Mutex::new(Level1 { value: 7 })),
        };

        let kp_to_guard: KpType<Root, Arc<tokio::sync::Mutex<Level1>>> = Kp::new(
            |r: &Root| Some(&r.tokio_guard),
            |r: &mut Root| Some(&mut r.tokio_guard),
        );

        let async_kp = {
            let prev: KpType<Arc<tokio::sync::Mutex<Level1>>, Arc<tokio::sync::Mutex<Level1>>> =
                Kp::new(
                    |g: &Arc<tokio::sync::Mutex<Level1>>| Some(g),
                    |g: &mut Arc<tokio::sync::Mutex<Level1>>| Some(g),
                );
            let next: KpType<Level1, Level1> =
                Kp::new(|l: &Level1| Some(l), |l: &mut Level1| Some(l));
            AsyncLockKp::new(prev, TokioMutexAccess::new(), next)
        };

        let chained = kp_to_guard.then_async(async_kp);
        let level1 = chained.get(&root).await;
        assert!(level1.is_some());
        assert_eq!(level1.unwrap().value, 7);
    }

    /// Deeply nested struct: Root -> sync lock -> L1 -> L2 -> tokio lock -> L3 -> leaf i32.
    /// Chain: LockKp(Root->L1) . then(L1->L2) . then(L2->tokio) . then_async(tokio->L3) . then(L3->leaf)
    #[cfg(all(feature = "tokio", feature = "parking_lot"))]
    #[tokio::test]
    async fn test_deep_nested_chain_kp_lock_async_lock_kp() {
        use crate::async_lock::{AsyncLockKp, TokioMutexAccess};
        use crate::lock::{ArcMutexAccess, LockKp};
        use std::sync::{Arc, Mutex};

        // Root -> Arc<Mutex<L1>>
        #[derive(Clone)]
        struct Root {
            sync_mutex: Arc<Mutex<Level1>>,
        }
        // L1 -> Level2 (plain)
        #[derive(Clone)]
        struct Level1 {
            inner: Level2,
        }
        // L2 -> Arc<TokioMutex<Level3>>
        #[derive(Clone)]
        struct Level2 {
            tokio_mutex: Arc<tokio::sync::Mutex<Level3>>,
        }
        // L3 -> leaf i32
        #[derive(Clone)]
        struct Level3 {
            leaf: i32,
        }

        let mut root = Root {
            sync_mutex: Arc::new(Mutex::new(Level1 {
                inner: Level2 {
                    tokio_mutex: Arc::new(tokio::sync::Mutex::new(Level3 { leaf: 42 })),
                },
            })),
        };

        // LockKp from Root -> Level1
        let identity_l1: KpType<Level1, Level1> =
            Kp::new(|l: &Level1| Some(l), |l: &mut Level1| Some(l));
        let kp_sync: KpType<Root, Arc<Mutex<Level1>>> = Kp::new(
            |r: &Root| Some(&r.sync_mutex),
            |r: &mut Root| Some(&mut r.sync_mutex),
        );
        let lock_root_to_l1 = LockKp::new(kp_sync, ArcMutexAccess::new(), identity_l1);

        // Kp: Level1 -> Level2
        let kp_l1_inner: KpType<Level1, Level2> = Kp::new(
            |l: &Level1| Some(&l.inner),
            |l: &mut Level1| Some(&mut l.inner),
        );

        // Kp: Level2 -> Arc<TokioMutex<Level3>>
        let kp_l2_tokio: KpType<Level2, Arc<tokio::sync::Mutex<Level3>>> = Kp::new(
            |l: &Level2| Some(&l.tokio_mutex),
            |l: &mut Level2| Some(&mut l.tokio_mutex),
        );

        // AsyncKp: Arc<TokioMutex<Level3>> -> Level3
        let async_l3 = {
            let prev: KpType<Arc<tokio::sync::Mutex<Level3>>, Arc<tokio::sync::Mutex<Level3>>> =
                Kp::new(|t: &_| Some(t), |t: &mut _| Some(t));
            let next: KpType<Level3, Level3> =
                Kp::new(|l: &Level3| Some(l), |l: &mut Level3| Some(l));
            AsyncLockKp::new(prev, TokioMutexAccess::new(), next)
        };

        // Kp: Level3 -> i32
        let kp_l3_leaf: KpType<Level3, i32> = Kp::new(
            |l: &Level3| Some(&l.leaf),
            |l: &mut Level3| Some(&mut l.leaf),
        );

        // Build chain: LockKp(Root->L1) . then(L1->L2) . then(L2->tokio) . then_async(tokio->L3) . then(L3->leaf)
        let step1 = lock_root_to_l1.then(kp_l1_inner);
        let step2 = step1.then(kp_l2_tokio);
        let step3 = step2.then_async(async_l3);
        let deep_chain = step3.then(kp_l3_leaf);

        // Read leaf through full chain (async)
        let leaf = deep_chain.get(&root).await;
        deep_chain.get_mut(&mut root).await.map(|l| *l = 100);
        assert_eq!(leaf, Some(&100));

        // Mutate leaf through full chain
        let mut root_mut = root.clone();
        let leaf_mut = deep_chain.get_mut(&mut root_mut).await;
        assert!(leaf_mut.is_some());
        *leaf_mut.unwrap() = 99;

        // Read back
        let leaf_after = deep_chain.get(&root_mut).await;
        assert_eq!(leaf_after, Some(&99));
    }
}