deferred_map/

lib.rs

use std::fmt;
use std::mem::ManuallyDrop;

mod error;
mod utils;
#[cfg(test)]
mod tests {
    // Test modules for DeferredMap
    // DeferredMap 的测试模块
    mod handle;
    mod insertion;
    mod removal;
    mod edge_cases;

}

pub use error::DeferredMapError;
use utils::{likely, unlikely};

/// Handle is a one-time token for inserting values into DeferredMap
/// 
/// Handle does not implement the Clone trait, ensuring it can only be used once
/// through Rust's move semantics.
/// 
/// Handle 是一次性令牌，用于向 DeferredMap 插入值
/// 
/// Handle 不实现 Clone trait，通过 Rust 的 move semantics 确保只能使用一次
/// 
/// # Examples (示例)
/// 
/// ```
/// use deferred_map::DeferredMap;
/// 
/// let mut map = DeferredMap::new();
/// let handle = map.allocate_handle();
/// let key = map.insert(handle, 42).unwrap();
/// assert_eq!(map.get(key), Some(&42));
/// ```
#[derive(Debug, PartialEq, Eq)]
pub struct Handle {
    raw: u64,
}

impl Handle {
    /// Create a new Handle (internal use)
    /// 
    /// 创建一个新的 Handle（内部使用）
    #[inline]
    fn new(raw: u64) -> Self {
        Self { raw }
    }

    /// Get the internal u64 value
    /// 
    /// 获取内部的 u64 值
    #[inline]
    pub fn raw_value(&self) -> u64 {
        self.raw
    }

    /// Extract index (lower 32 bits)
    /// 
    /// 提取 index（低 32 位）
    #[inline]
    pub fn index(&self) -> u32 {
        self.raw as u32
    }

    /// Extract version (upper 32 bits, includes state bits)
    /// 
    /// 提取 version（高 32 位，包含状态位）
    #[inline]
    fn version(&self) -> u32 {
        (self.raw >> 32) as u32
    }

    /// Extract generation (upper 30 bits, excludes state bits)
    /// 
    /// 提取 generation（高 30 位，不包含状态位）
    #[inline]
    pub fn generation(&self) -> u32 {
        self.version() >> 2
    }
}

/// Internal slot storage using union for memory optimization
/// 
/// When occupied, stores the value; when vacant, stores the next free slot index.
/// 
/// Slot 内部存储，使用 union 优化内存
/// 
/// 占用时存储值，空闲时存储下一个空闲 slot 的索引
union SlotUnion<T> {
    value: ManuallyDrop<T>,
    next_free: u32,
}

/// Slot stores the actual value and version information
/// 
/// Even version indicates vacant, odd version indicates occupied.
/// 
/// Slot 存储实际的值和 version 信息
/// 
/// version 为偶数表示空闲，奇数表示占用
struct Slot<T> {
    u: SlotUnion<T>,
    version: u32, // Even = vacant, odd = occupied | 偶数 = 空闲, 奇数 = 占用
}

/// Safe API to read slot content
/// 
/// 安全的 API 来读取 slot
enum SlotContent<'a, T: 'a> {
    /// Occupied slot with value
    /// 
    /// 占用 slot 的值
    Occupied(&'a T),
    
    /// Vacant slot with next free index
    /// 
    /// 空闲 slot 的索引
    Vacant(&'a u32),
}

/// Safe API to read mutable slot content
/// 
/// 安全的 API 来读取可变 slot
enum SlotContentMut<'a, T: 'a> {
    /// Occupied slot with mutable reference
    /// 
    /// 占用 slot 的可变引用
    OccupiedMut(&'a mut T),
    
    /// Vacant slot with mutable reference to next free index
    /// 
    /// 空闲 slot 的索引可变引用
    VacantMut(&'a mut u32),
}

use self::SlotContent::{Occupied, Vacant};
use self::SlotContentMut::{OccupiedMut, VacantMut};

impl<T> Slot<T> {
    /// Get the state bits (lowest 2 bits of version)
    /// 
    /// 获取状态位（version 的最低 2 位）
    #[inline(always)]
    fn state_bits(&self) -> u32 {
        self.version & 0b11
    }

    /// Check if slot is vacant (state bits == 0b00)
    /// 
    /// 检查 slot 是否空闲（状态位 == 0b00）
    #[inline(always)]
    #[allow(unused)]
    fn is_vacant(&self) -> bool {
        self.state_bits() == 0b00
    }

    /// Check if slot is reserved (state bits == 0b01)
    /// 
    /// 检查 slot 是否已预留（状态位 == 0b01）
    #[inline(always)]
    fn is_reserved(&self) -> bool {
        self.state_bits() == 0b01
    }

    /// Check if slot is occupied (state bits == 0b11)
    /// 
    /// 检查 slot 是否被占用（状态位 == 0b11）
    #[inline(always)]
    fn is_occupied(&self) -> bool {
        self.state_bits() == 0b11
    }

    /// Get the generation (upper 30 bits)
    /// 
    /// 获取代数（高 30 位）
    #[inline(always)]
    #[allow(unused)]
    fn generation(&self) -> u32 {
        self.version >> 2
    }

    /// Safely get slot content
    /// 
    /// Only returns content for Vacant (next_free) or Occupied (value) states.
    /// Reserved state is treated as vacant for safety.
    /// 
    /// 安全地获取 slot 内容
    /// 
    /// 只返回 Vacant (next_free) 或 Occupied (value) 状态的内容
    /// Reserved 状态出于安全考虑视为 vacant
    #[inline]
    fn get<'a>(&'a self) -> SlotContent<'a, T> {
        unsafe {
            if self.is_occupied() {
                Occupied(&*self.u.value)
            } else {
                // For vacant or reserved, return next_free (for reserved it's undefined but safe to read)
                // 对于 vacant 或 reserved，返回 next_free（对于 reserved 它是未定义的但安全读取）
                Vacant(&self.u.next_free)
            }
        }
    }

    /// Safely get mutable slot content
    /// 
    /// Only returns content for Vacant (next_free) or Occupied (value) states.
    /// Reserved state is treated as vacant for safety.
    /// 
    /// 安全地获取 slot 可变内容
    /// 
    /// 只返回 Vacant (next_free) 或 Occupied (value) 状态的内容
    /// Reserved 状态出于安全考虑视为 vacant
    #[inline]
    fn get_mut<'a>(&'a mut self) -> SlotContentMut<'a, T> {
        unsafe {
            if self.is_occupied() {
                OccupiedMut(&mut *self.u.value)
            } else {
                // For vacant or reserved, return next_free (for reserved it's undefined but safe to read)
                // 对于 vacant 或 reserved，返回 next_free（对于 reserved 它是未定义的但安全读取）
                VacantMut(&mut self.u.next_free)
            }
        }
    }
}

impl<T> Drop for Slot<T> {
    #[inline]
    fn drop(&mut self) {
        if std::mem::needs_drop::<T>() && self.is_occupied() {
            // Only drop value when occupied
            // 只有在占用状态时才 drop 值
            unsafe {
                ManuallyDrop::drop(&mut self.u.value);
            }
        }
    }
}

impl<T: Clone> Clone for Slot<T> {
    #[inline]
    fn clone(&self) -> Self {
        Self {
            u: match self.get() {
                Occupied(value) => SlotUnion {
                    value: ManuallyDrop::new(value.clone()),
                },
                Vacant(&next_free) => SlotUnion { next_free },
            },
            version: self.version,
        }
    }

    #[inline]
    fn clone_from(&mut self, source: &Self) {
        match (self.get_mut(), source.get()) {
            (OccupiedMut(self_val), Occupied(source_val)) => self_val.clone_from(source_val),
            (VacantMut(self_next_free), Vacant(&source_next_free)) => {
                *self_next_free = source_next_free
            },
            (_, Occupied(value)) => {
                self.u = SlotUnion {
                    value: ManuallyDrop::new(value.clone()),
                }
            },
            (_, Vacant(&next_free)) => self.u = SlotUnion { next_free },
        }
        self.version = source.version;
    }
}

impl<T: fmt::Debug> fmt::Debug for Slot<T> {
    fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
        let mut builder = fmt.debug_struct("Slot");
        builder.field("version", &self.version);
        match self.get() {
            Occupied(value) => builder.field("value", value).finish(),
            Vacant(next_free) => builder.field("next_free", next_free).finish(),
        }
    }
}

/// DeferredMap is a high-performance map based on slotmap
/// 
/// Usage requires first obtaining a Handle via `allocate_handle`, 
/// then using the Handle to insert.
/// 
/// DeferredMap 是一个基于 slotmap 的高性能映射表
/// 
/// 使用前需要先通过 `allocate_handle` 获取 Handle，然后使用 Handle 进行插入
/// 
/// # Features (特性)
/// 
/// - O(1) insertion, lookup, and removal | O(1) 插入、查找和删除
/// - Generational indices prevent use-after-free | 代数索引防止释放后使用
/// - Handle-based deferred insertion | 基于 Handle 的延迟插入
/// - Memory efficient with union-based slots | 使用 union 的内存高效 slot
/// 
/// # Examples (示例)
/// 
/// ```
/// use deferred_map::DeferredMap;
/// 
/// let mut map = DeferredMap::new();
/// 
/// // Allocate handle first | 先分配 handle
/// let handle = map.allocate_handle();
/// 
/// // Insert value later | 之后插入值
/// let key = map.insert(handle, 42).unwrap();
/// 
/// // Access value | 访问值
/// assert_eq!(map.get(key), Some(&42));
/// 
/// // Remove value | 删除值
/// assert_eq!(map.remove(key), Some(42));
/// ```
pub struct DeferredMap<T> {
    slots: Vec<Slot<T>>,
    free_head: u32,     // Head of free list | 空闲列表的头部索引
    num_elems: u32,     // Current element count | 当前元素数量
}

impl<T> DeferredMap<T> {
    /// Create a new empty DeferredMap
    /// 
    /// 创建一个新的空 DeferredMap
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let map: DeferredMap<i32> = DeferredMap::new();
    /// assert!(map.is_empty());
    /// ```
    #[inline]
    pub fn new() -> Self {
        Self::with_capacity(0)
    }

    /// Create a DeferredMap with specified capacity
    /// 
    /// 创建一个指定容量的 DeferredMap
    /// 
    /// # Parameters
    /// - `capacity`: Initial capacity (number of slots to pre-allocate)
    /// 
    /// # 参数
    /// - `capacity`: 初始容量（预分配的 slot 数量）
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let map: DeferredMap<i32> = DeferredMap::with_capacity(100);
    /// assert_eq!(map.capacity(), 0);
    /// ```
    #[inline]
    pub fn with_capacity(capacity: usize) -> Self {
        // Create slots with sentinel at index 0
        // Sentinel is not used but maintains index consistency
        // 创建 slots，在索引 0 处添加 sentinel
        // sentinel 不实际使用，但保持索引一致性
        let mut slots = Vec::with_capacity(capacity + 1);
        slots.push(Slot {
            u: SlotUnion { next_free: 0 },
            version: 0,
        });

        Self {
            slots,
            free_head: 1,  // Start allocation from index 1 | 从索引 1 开始分配
            num_elems: 0,
        }
    }

    /// Encode index and generation into u64
    /// 
    /// 从 index 和 generation 编码为 u64
    #[inline]
    fn encode_key(index: u32, generation: u32) -> u64 {
        ((generation as u64) << 32) | (index as u64)
    }

    /// Decode u64 into index and generation
    /// 
    /// 从 u64 解码为 index 和 generation
    #[inline]
    fn decode_key(key: u64) -> (u32, u32) {
        let index = key as u32;
        let generation = (key >> 32) as u32;
        (index, generation)
    }

    /// Pre-allocate a Handle
    /// 
    /// This Handle can be used later to insert a value.
    /// The slot is immediately created in Reserved state.
    /// 
    /// 预分配一个 Handle
    /// 
    /// 这个 Handle 可以在之后用于插入值
    /// slot 立即创建为 Reserved 状态
    /// 
    /// # Returns
    /// A unique Handle for later insertion
    /// 
    /// # 返回值
    /// 用于后续插入的唯一 Handle
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let mut map = DeferredMap::new();
    /// let handle = map.allocate_handle();
    /// let key = map.insert(handle, "value").unwrap();
    /// assert_eq!(map.get(key), Some(&"value"));
    /// ```
    pub fn allocate_handle(&mut self) -> Handle {
        if let Some(slot) = self.slots.get_mut(self.free_head as usize) {
            // Reuse existing vacant slot from free list
            // 从空闲列表中复用已有的空闲 slot
            let index = self.free_head;
            
            // Update free_head to next free slot before changing state
            // 在改变状态前更新 free_head 到下一个空闲 slot
            unsafe {
                self.free_head = slot.u.next_free;
            }
            
            // Transition: vacant(0bXX00) -> reserved(0bXX01)
            // 状态转换：vacant(0bXX00) -> reserved(0bXX01)
            slot.version += 1;
            
            let raw = Self::encode_key(index, slot.version);
            Handle::new(raw)
        } else {
            // Need to extend Vec, allocate new slot
            // 需要扩展 Vec，分配新 slot
            let index = self.slots.len() as u32;
            let version = 0b01; // New slot starts in reserved state | 新 slot 从 reserved 状态开始
            
            // Create reserved slot
            // 创建 reserved slot
            self.slots.push(Slot {
                u: SlotUnion { next_free: 0 }, // Value doesn't matter for reserved | 对于 reserved 状态该值不重要
                version,
            });
            
            // Update free_head
            // 更新 free_head
            self.free_head = index + 1;
            
            let raw = Self::encode_key(index, version);
            Handle::new(raw)
        }
    }

    /// Insert value using Handle
    /// 
    /// The Handle is consumed (moved), ensuring it can only be used once.
    /// The slot must be in Reserved state.
    /// 
    /// 使用 Handle 插入值
    /// 
    /// Handle 会被消耗（move），确保只能使用一次
    /// slot 必须处于 Reserved 状态
    /// 
    /// # Parameters
    /// - `handle`: The Handle obtained from `allocate_handle`
    /// - `value`: The value to insert
    /// 
    /// # Returns
    /// - `Ok(u64)`: The key for accessing the inserted value
    /// - `Err(DeferredMapError)`: Error if the Handle is invalid or already used
    /// 
    /// # 参数
    /// - `handle`: 从 `allocate_handle` 获取的 Handle
    /// - `value`: 要插入的值
    /// 
    /// # 返回值
    /// - `Ok(u64)`: 用于访问插入值的 key
    /// - `Err(DeferredMapError)`: 如果 Handle 无效或已被使用则返回错误
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let mut map = DeferredMap::new();
    /// let handle = map.allocate_handle();
    /// let key = map.insert(handle, 42).unwrap();
    /// assert_eq!(map.get(key), Some(&42));
    /// ```
    pub fn insert(&mut self, handle: Handle, value: T) -> Result<u64, DeferredMapError> {
        let index = handle.index();
        let handle_version = handle.version();

        // Validate index (skip sentinel)
        // 验证 index 有效（跳过 sentinel）
        if unlikely(index == 0) {
            return Err(DeferredMapError::InvalidHandle);
        }

        // Slot must exist (allocate_handle should have created it)
        // slot 必须存在（allocate_handle 应该已经创建了它）
        if unlikely(index as usize >= self.slots.len()) {
            return Err(DeferredMapError::InvalidHandle);
        }

        let slot = &mut self.slots[index as usize];

        // Validate version match (handle should have reserved version)
        // 验证 version 匹配（handle 应该有 reserved version）
        if unlikely(slot.version != handle_version) {
            return Err(DeferredMapError::GenerationMismatch);
        }

        // Validate slot is in Reserved state
        // 验证 slot 处于 Reserved 状态
        if unlikely(!slot.is_reserved()) {
            if slot.is_occupied() {
                return Err(DeferredMapError::HandleAlreadyUsed);
            } else {
                return Err(DeferredMapError::GenerationMismatch);
            }
        }

        // Insert value and transition: reserved(0bXX01) -> occupied(0bXX11)
        // 插入值并状态转换：reserved(0bXX01) -> occupied(0bXX11)
        slot.u.value = ManuallyDrop::new(value);
        slot.version += 2; // 0bXX01 -> 0bXX11
        
        self.num_elems += 1;
        
        // Return key with the new occupied version
        // 返回带有新的 occupied version 的 key
        Ok(Self::encode_key(index, slot.version))
    }

    /// Get immutable reference to value by u64 key
    /// 
    /// 通过 u64 key 获取值的不可变引用
    /// 
    /// # Parameters
    /// - `key`: The key returned from `insert`
    /// 
    /// # Returns
    /// - `Some(&T)`: Reference to the value if key is valid
    /// - `None`: If key is invalid or value has been removed
    /// 
    /// # 参数
    /// - `key`: 从 `insert` 返回的 key
    /// 
    /// # 返回值
    /// - `Some(&T)`: 如果 key 有效则返回值的引用
    /// - `None`: 如果 key 无效或值已被删除
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let mut map = DeferredMap::new();
    /// let handle = map.allocate_handle();
    /// let key = map.insert(handle, 42).unwrap();
    /// assert_eq!(map.get(key), Some(&42));
    /// ```
    #[inline]
    pub fn get(&self, key: u64) -> Option<&T> {
        let (index, generation) = Self::decode_key(key);
        
        // Bounds check
        // 边界检查
        if unlikely(index as usize >= self.slots.len()) {
            return None;
        }
        
        // SAFETY: We've checked that index < slots.len()
        let slot = unsafe { self.slots.get_unchecked(index as usize) };
        
        // Fast path: check version match and return value
        // 快速路径：检查 version 匹配并返回值
        if likely(slot.version == generation && slot.is_occupied()) {
            // SAFETY: We've checked that slot is occupied
            Some(unsafe { &*slot.u.value })
        } else {
            None
        }
    }

    /// Get mutable reference to value by u64 key
    /// 
    /// 通过 u64 key 获取值的可变引用
    /// 
    /// # Parameters
    /// - `key`: The key returned from `insert`
    /// 
    /// # Returns
    /// - `Some(&mut T)`: Mutable reference to the value if key is valid
    /// - `None`: If key is invalid or value has been removed
    /// 
    /// # 参数
    /// - `key`: 从 `insert` 返回的 key
    /// 
    /// # 返回值
    /// - `Some(&mut T)`: 如果 key 有效则返回值的可变引用
    /// - `None`: 如果 key 无效或值已被删除
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let mut map = DeferredMap::new();
    /// let handle = map.allocate_handle();
    /// let key = map.insert(handle, 42).unwrap();
    /// 
    /// if let Some(value) = map.get_mut(key) {
    ///     *value = 100;
    /// }
    /// assert_eq!(map.get(key), Some(&100));
    /// ```
    #[inline]
    pub fn get_mut(&mut self, key: u64) -> Option<&mut T> {
        let (index, generation) = Self::decode_key(key);
        
        // Bounds check
        // 边界检查
        if unlikely(index as usize >= self.slots.len()) {
            return None;
        }
        
        // SAFETY: We've checked that index < slots.len()
        let slot = unsafe { self.slots.get_unchecked_mut(index as usize) };
        
        // Fast path: check version match and return mutable reference
        // 快速路径：检查 version 匹配并返回可变引用
        if likely(slot.version == generation && slot.is_occupied()) {
            // SAFETY: We've checked that slot is occupied
            Some(unsafe { &mut *slot.u.value })
        } else {
            None
        }
    }

    /// Remove value by u64 key
    /// 
    /// If successful, returns the removed value and adds the slot to the free list.
    /// 
    /// 通过 u64 key 移除值
    /// 
    /// 如果成功移除，返回被移除的值，并将该 slot 加入空闲列表
    /// 
    /// # Parameters
    /// - `key`: The key returned from `insert`
    /// 
    /// # Returns
    /// - `Some(T)`: The removed value if key is valid
    /// - `None`: If key is invalid or value has already been removed
    /// 
    /// # 参数
    /// - `key`: 从 `insert` 返回的 key
    /// 
    /// # 返回值
    /// - `Some(T)`: 如果 key 有效则返回被移除的值
    /// - `None`: 如果 key 无效或值已被删除
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let mut map = DeferredMap::new();
    /// let handle = map.allocate_handle();
    /// let key = map.insert(handle, 42).unwrap();
    /// 
    /// assert_eq!(map.remove(key), Some(42));
    /// assert_eq!(map.get(key), None);
    /// ```
    #[inline]
    pub fn remove(&mut self, key: u64) -> Option<T> {
        let (index, generation) = Self::decode_key(key);
        
        // Bounds check
        // 边界检查
        if unlikely(index as usize >= self.slots.len()) {
            return None;
        }

        // SAFETY: We've checked that index < slots.len()
        let slot = unsafe { self.slots.get_unchecked_mut(index as usize) };
        
        // Fast path: check version and occupied state
        // 快速路径：检查 version 和占用状态
        if likely(slot.version == generation && slot.is_occupied()) {
            // Take value from slot
            // 从 slot 中取出值
            let value = unsafe { ManuallyDrop::take(&mut slot.u.value) };
            
            // Add this slot to free list head
            // 将此 slot 加入空闲列表头部
            slot.u.next_free = self.free_head;
            self.free_head = index;
            
            // Transition: occupied(0bXX11) -> vacant(0bYY00, next generation)
            // 状态转换：occupied(0bXX11) -> vacant(0bYY00，下一代）
            slot.version = slot.version.wrapping_add(1); // 0bXX11 -> 0bYY00
            
            self.num_elems -= 1;
            Some(value)
        } else {
            None
        }
    }

    /// Release an unused Handle
    /// 
    /// Returns the reserved slot back to the free list.
    /// This is useful when you allocated a handle but decided not to use it.
    /// 
    /// 释放未使用的 Handle
    /// 
    /// 将预留的 slot 返回到空闲列表
    /// 当你分配了 handle 但决定不使用时很有用
    /// 
    /// # Parameters
    /// - `handle`: The Handle to release
    /// 
    /// # Returns
    /// - `Ok(())`: Handle successfully released
    /// - `Err(DeferredMapError)`: Error if handle is invalid or already used
    /// 
    /// # 参数
    /// - `handle`: 要释放的 Handle
    /// 
    /// # 返回值
    /// - `Ok(())`: Handle 成功释放
    /// - `Err(DeferredMapError)`: 如果 handle 无效或已被使用则返回错误
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let mut map = DeferredMap::<i32>::new();
    /// let handle = map.allocate_handle();
    /// 
    /// // Decided not to use it
    /// // 决定不使用它
    /// map.release_handle(handle).unwrap();
    /// ```
    pub fn release_handle(&mut self, handle: Handle) -> Result<(), DeferredMapError> {
        let index = handle.index();
        let handle_version = handle.version();

        // Validate index (skip sentinel)
        // 验证 index 有效（跳过 sentinel）
        if unlikely(index == 0) {
            return Err(DeferredMapError::InvalidHandle);
        }

        // Slot must exist
        // slot 必须存在
        if unlikely(index as usize >= self.slots.len()) {
            return Err(DeferredMapError::InvalidHandle);
        }

        let slot = &mut self.slots[index as usize];

        // Validate version match (handle should have reserved version)
        // 验证 version 匹配（handle 应该有 reserved version）
        if unlikely(slot.version != handle_version) {
            return Err(DeferredMapError::GenerationMismatch);
        }

        // Validate slot is in Reserved state
        // 验证 slot 处于 Reserved 状态
        if unlikely(!slot.is_reserved()) {
            if slot.is_occupied() {
                return Err(DeferredMapError::HandleAlreadyUsed);
            } else {
                return Err(DeferredMapError::GenerationMismatch);
            }
        }

        // Add this slot to free list head
        // 将此 slot 加入空闲列表头部
        slot.u.next_free = self.free_head;
        self.free_head = index;

        // Transition: reserved(0bXX01) -> vacant(0bYY00, next generation)
        // 状态转换：reserved(0bXX01) -> vacant(0bYY00，下一代）
        slot.version = slot.version.wrapping_add(3); // 0bXX01 + 3 = 0bYY00

        Ok(())
    }

    /// Check if key exists
    /// 
    /// 检查 key 是否存在
    /// 
    /// # Parameters
    /// - `key`: The key to check
    /// 
    /// # Returns
    /// `true` if the key exists, `false` otherwise
    /// 
    /// # 参数
    /// - `key`: 要检查的 key
    /// 
    /// # 返回值
    /// 如果 key 存在则返回 `true`，否则返回 `false`
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let mut map = DeferredMap::new();
    /// let handle = map.allocate_handle();
    /// let key = map.insert(handle, 42).unwrap();
    /// 
    /// assert!(map.contains_key(key));
    /// map.remove(key);
    /// assert!(!map.contains_key(key));
    /// ```
    #[inline]
    pub fn contains_key(&self, key: u64) -> bool {
        self.get(key).is_some()
    }

    /// Return the number of valid elements
    /// 
    /// 返回有效元素的数量
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let mut map = DeferredMap::new();
    /// assert_eq!(map.len(), 0);
    /// 
    /// let handle = map.allocate_handle();
    /// map.insert(handle, 42).unwrap();
    /// assert_eq!(map.len(), 1);
    /// ```
    #[inline]
    pub fn len(&self) -> usize {
        self.num_elems as usize
    }

    /// Check if the map is empty
    /// 
    /// 检查是否为空
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let map: DeferredMap<i32> = DeferredMap::new();
    /// assert!(map.is_empty());
    /// ```
    #[inline]
    pub fn is_empty(&self) -> bool {
        self.num_elems == 0
    }

    /// Return capacity (number of allocated slots, excluding sentinel)
    /// 
    /// 返回容量（已分配的 slot 数量，不包括 sentinel）
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let map: DeferredMap<i32> = DeferredMap::with_capacity(10);
    /// assert_eq!(map.capacity(), 0);
    /// ```
    #[inline]
    pub fn capacity(&self) -> usize {
        // Subtract sentinel slot
        // 减去 sentinel slot
        self.slots.len().saturating_sub(1)
    }

    /// Clear all elements
    /// 
    /// 清空所有元素
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let mut map = DeferredMap::new();
    /// let handle = map.allocate_handle();
    /// map.insert(handle, 42).unwrap();
    /// 
    /// map.clear();
    /// assert!(map.is_empty());
    /// ```
    #[inline]
    pub fn clear(&mut self) {
        self.slots.clear();
        // Re-add sentinel
        // 重新添加 sentinel
        self.slots.push(Slot {
            u: SlotUnion { next_free: 0 },
            version: 0,
        });
        self.free_head = 1;
        self.num_elems = 0;
    }

    /// Return an iterator over all (key, value) pairs
    /// 
    /// 返回一个迭代器，遍历所有 (key, value) 对
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let mut map = DeferredMap::new();
    /// 
    /// let h1 = map.allocate_handle();
    /// map.insert(h1, 1).unwrap();
    /// 
    /// let h2 = map.allocate_handle();
    /// map.insert(h2, 2).unwrap();
    /// 
    /// let sum: i32 = map.iter().map(|(_, v)| v).sum();
    /// assert_eq!(sum, 3);
    /// ```
    #[inline]
    pub fn iter(&self) -> impl Iterator<Item = (u64, &T)> {
        self.slots.iter().enumerate().skip(1).filter_map(|(index, slot)| {
            if let Occupied(value) = slot.get() {
                let key = Self::encode_key(index as u32, slot.version);
                Some((key, value))
            } else {
                None
            }
        })
    }

    /// Return a mutable iterator over all (key, value) pairs
    /// 
    /// 返回一个可变迭代器，遍历所有 (key, value) 对
    /// 
    /// # Examples (示例)
    /// 
    /// ```
    /// use deferred_map::DeferredMap;
    /// 
    /// let mut map = DeferredMap::new();
    /// 
    /// let h1 = map.allocate_handle();
    /// map.insert(h1, 1).unwrap();
    /// 
    /// let h2 = map.allocate_handle();
    /// map.insert(h2, 2).unwrap();
    /// 
    /// for (_, value) in map.iter_mut() {
    ///     *value *= 2;
    /// }
    /// 
    /// let sum: i32 = map.iter().map(|(_, v)| v).sum();
    /// assert_eq!(sum, 6);
    /// ```
    #[inline]
    pub fn iter_mut(&mut self) -> impl Iterator<Item = (u64, &mut T)> {
        self.slots.iter_mut().enumerate().skip(1).filter_map(|(index, slot)| {
            let version = slot.version;
            if let OccupiedMut(value) = slot.get_mut() {
                let key = Self::encode_key(index as u32, version);
                Some((key, value))
            } else {
                None
            }
        })
    }
}

impl<T: Clone> Clone for DeferredMap<T> {
    #[inline]
    fn clone(&self) -> Self {
        Self {
            slots: self.slots.clone(),
            free_head: self.free_head,
            num_elems: self.num_elems,
        }
    }

    #[inline]
    fn clone_from(&mut self, source: &Self) {
        self.slots.clone_from(&source.slots);
        self.free_head = source.free_head;
        self.num_elems = source.num_elems;
    }
}

impl<T> Default for DeferredMap<T> {
    #[inline]
    fn default() -> Self {
        Self::new()
    }
}

#[cfg(test)]
mod basic_tests {
    use super::*;

    #[test]
    fn test_basic_insert_and_get() {
        let mut map = DeferredMap::new();
        
        let handle = map.allocate_handle();
        let key = map.insert(handle, 42).unwrap();
        
        assert_eq!(map.get(key), Some(&42));
    }

    #[test]
    fn test_handle_cannot_be_used_twice() {
        let mut map = DeferredMap::new();
        
        let handle = map.allocate_handle();
        let key = map.insert(handle, 42).unwrap();
        
        // Attempting to insert again with the same key should fail
        // 尝试使用相同的 key 再次插入应该失败
        let handle2 = Handle::new(key);
        let result = map.insert(handle2, 100);
        
        assert_eq!(result, Err(DeferredMapError::HandleAlreadyUsed));
        assert_eq!(map.get(key), Some(&42)); // Original value unchanged | 原值不变
    }

    #[test]
    fn test_remove_and_reuse() {
        let mut map = DeferredMap::new();
        
        let handle1 = map.allocate_handle();
        let key1 = map.insert(handle1, 42).unwrap();
        
        assert_eq!(map.len(), 1);
        assert_eq!(map.remove(key1), Some(42));
        assert_eq!(map.len(), 0);
        assert_eq!(map.get(key1), None);
        
        // Allocating new handle should reuse previous slot
        // 分配新的 handle 应该复用之前的 slot
        let handle2 = map.allocate_handle();
        let key2 = map.insert(handle2, 100).unwrap();
        
        // key2 should have different generation
        // key2 应该有不同的 generation
        assert_ne!(key1, key2);
        assert_eq!(map.get(key2), Some(&100));
        assert_eq!(map.get(key1), None); // Old key should be invalid | 旧 key 应该无效
    }

    #[test]
    fn test_generation_mismatch() {
        let mut map = DeferredMap::new();
        
        let handle = map.allocate_handle();
        let old_key = handle.raw_value();
        map.insert(handle, 42).unwrap();
        
        map.remove(old_key);
        
        // Attempting to use old key should fail
        // 尝试使用旧的 key 对应的 handle 应该失败
        let old_handle = Handle::new(old_key);
        let result = map.insert(old_handle, 100);
        
        assert_eq!(result, Err(DeferredMapError::GenerationMismatch));
    }

    #[test]
    fn test_multiple_inserts() {
        let mut map = DeferredMap::new();
        
        let mut keys = Vec::new();
        for i in 0..10 {
            let handle = map.allocate_handle();
            let key = map.insert(handle, i * 10).unwrap();
            keys.push(key);
        }
        
        assert_eq!(map.len(), 10);
        
        for (i, &key) in keys.iter().enumerate() {
            assert_eq!(map.get(key), Some(&(i * 10)));
        }
    }

    #[test]
    fn test_get_mut() {
        let mut map = DeferredMap::new();
        
        let handle = map.allocate_handle();
        let key = map.insert(handle, 42).unwrap();
        
        if let Some(value) = map.get_mut(key) {
            *value = 100;
        }
        
        assert_eq!(map.get(key), Some(&100));
    }

    #[test]
    fn test_contains_key() {
        let mut map = DeferredMap::new();
        
        let handle = map.allocate_handle();
        let key = map.insert(handle, 42).unwrap();
        
        assert!(map.contains_key(key));
        
        map.remove(key);
        assert!(!map.contains_key(key));
    }

    #[test]
    fn test_is_empty() {
        let mut map: DeferredMap<i32> = DeferredMap::new();
        
        assert!(map.is_empty());
        
        let handle = map.allocate_handle();
        let key = map.insert(handle, 42).unwrap();
        
        assert!(!map.is_empty());
        
        map.remove(key);
        assert!(map.is_empty());
    }

    #[test]
    fn test_capacity() {
        let mut map: DeferredMap<i32> = DeferredMap::with_capacity(10);
        
        for _ in 0..5 {
            let handle = map.allocate_handle();
            map.insert(handle, 42).unwrap();
        }
        
        assert_eq!(map.len(), 5);
        assert_eq!(map.capacity(), 5);
    }

    #[test]
    fn test_clear() {
        let mut map = DeferredMap::new();
        
        for i in 0..5 {
            let handle = map.allocate_handle();
            map.insert(handle, i).unwrap();
        }
        
        assert_eq!(map.len(), 5);
        
        map.clear();
        
        assert_eq!(map.len(), 0);
        assert_eq!(map.capacity(), 0);
        assert!(map.is_empty());
    }

    #[test]
    fn test_iter() {
        let mut map = DeferredMap::new();
        
        let mut keys = Vec::new();
        for i in 0..5 {
            let handle = map.allocate_handle();
            let key = map.insert(handle, i * 10).unwrap();
            keys.push(key);
        }
        
        let collected: Vec<_> = map.iter().collect();
        assert_eq!(collected.len(), 5);
        
        for (key, &value) in map.iter() {
            assert!(keys.contains(&key));
            let index = keys.iter().position(|&k| k == key).unwrap();
            assert_eq!(value, index * 10);
        }
    }

    #[test]
    fn test_iter_mut() {
        let mut map = DeferredMap::new();
        
        for i in 0..5 {
            let handle = map.allocate_handle();
            map.insert(handle, i).unwrap();
        }
        
        for (_, value) in map.iter_mut() {
            *value *= 2;
        }
        
        for (_, &value) in map.iter() {
            assert_eq!(value % 2, 0);
        }
    }

    #[test]
    fn test_handle_encoding_decoding() {
        let mut map: DeferredMap<i32> = DeferredMap::new();
        let handle = map.allocate_handle();
        
        let raw = handle.raw_value();
        let index = handle.index();
        let version = (raw >> 32) as u32; // Full version including state bits
        
        // encode_key uses version (32 bits), not generation (30 bits)
        // encode_key 使用 version（32 位），而不是 generation（30 位）
        assert_eq!(DeferredMap::<i32>::encode_key(index, version), raw);
        assert_eq!(DeferredMap::<i32>::decode_key(raw), (index, version));
    }

    #[test]
    fn test_stress_test() {
        let mut map = DeferredMap::new();
        let mut keys = Vec::new();
        
        // Insert 100 elements | 插入 100 个元素
        for i in 0..100 {
            let handle = map.allocate_handle();
            let key = map.insert(handle, i).unwrap();
            keys.push(key);
        }
        
        assert_eq!(map.len(), 100);
        
        // Remove elements at even indices | 删除偶数索引的元素
        for i in (0..100).step_by(2) {
            map.remove(keys[i]);
        }
        
        assert_eq!(map.len(), 50);
        
        // Re-insert 50 elements (should reuse previously deleted slots)
        // 重新插入 50 个元素（应该复用之前删除的 slot）
        for i in 0..50 {
            let handle = map.allocate_handle();
            let key = map.insert(handle, i + 1000).unwrap();
            keys[i * 2] = key; // Update key | 更新 key
        }
        
        assert_eq!(map.len(), 100);
        
        // Verify all elements | 验证所有元素
        let mut count = 0;
        for (_, _) in map.iter() {
            count += 1;
        }
        assert_eq!(count, 100);
    }

    #[test]
    fn test_generation_wrapping() {
        let mut map = DeferredMap::new();
        
        // Test generation wrapping
        // Through many insertions and deletions to increment version
        // 测试 generation wrapping
        // 通过大量的插入和删除来增加 version
        let mut keys = Vec::new();
        for i in 0..10 {
            let handle = map.allocate_handle();
            let key = map.insert(handle, i).unwrap();
            keys.push(key);
        }
        
        // Remove all, test version increment
        // 删除所有，测试 version 递增
        for key in &keys {
            map.remove(*key);
        }
        
        // Re-insert, version should increment
        // 重新插入，version 应该递增
        let handle = map.allocate_handle();
        let new_key = map.insert(handle, 100).unwrap();
        
        // Old key should be invalid | 旧 key 应该无效
        assert_eq!(map.get(keys[0]), None);
        // New key is valid | 新 key 有效
        assert_eq!(map.get(new_key), Some(&100));
    }
}