Struct Tree 

pub struct Tree {
    pub root_id: NodeId,
    pub nodes: Vector<HashMap<NodeId, Arc<Node>>>,
    pub parent_map: HashMap<NodeId, NodeId>,
    /* private fields */
}

Fields

root_id: NodeId

nodes: Vector<HashMap<NodeId, Arc<Node>>>

parent_map: HashMap<NodeId, NodeId>

Implementations

impl Tree

pub fn get_shard_index(&self, id: &NodeId) -> usize

计算分片索引 (内联，高性能)

性能优化

1. 快速路径: 缓存命中 ~20ns
2. 慢速路径: AHash 计算 ~50ns (vs DefaultHasher ~150ns)
3. 无锁设计: DashMap 分片锁，零全局竞争

实现细节

• 使用 AHash (ahash) 替代 DefaultHasher: 速度提升 3x
• 使用 DashMap 替代 RwLock: 并发性能提升 5-10x
• #[inline(always)]: 强制内联，消除函数调用开销

pub fn get_shard_indices(&self, ids: &[&NodeId]) -> Vec<usize>

批量获取分片索引

性能优化

• 预分配容量，减少重分配
• 并行友好，无全局锁

pub fn get_shard_index_batch<'a>( &self, ids: &'a [&'a NodeId], ) -> Vec<(usize, &'a NodeId)>

批量获取分片索引和ID对 (优化版本)

性能优化

旧实现: 两次锁操作 (读锁检查 + 写锁更新) 新实现: 零全局锁，DashMap 分片并发

100个ID的性能对比:

• 旧实现: ~50µs (锁竞争)
• 新实现: ~5µs (无锁)

pub fn clear_shard_cache()

清理分片缓存 (用于内存管理)

注意

这个操作会清空整个缓存，应该谨慎使用。 通常只在内存压力大或测试场景下调用。

pub fn shard_cache_stats() -> (usize, usize)

获取缓存统计信息

pub fn contains_node(&self, id: &NodeId) -> bool

pub fn get_node(&self, id: &NodeId) -> Option<Arc<Node>>

pub fn get_parent_node(&self, id: &NodeId) -> Option<Arc<Node>>

pub fn from(nodes: NodeTree) -> Self

pub fn new(root: Node) -> Self

pub fn update_attr( &mut self, id: &NodeId, new_values: HashMap<String, Value>, ) -> PoolResult<()>

pub fn update_node(&mut self, node: Node) -> PoolResult<()>

pub fn add( &mut self, parent_id: &NodeId, nodes: Vec<NodeTree>, ) -> PoolResult<()>

向树中添加新的节点及其子节点

参数

• nodes - 要添加的节点枚举，包含节点本身及其子节点

返回值

• Result<(), PoolError> - 如果添加成功返回 Ok(()), 否则返回错误

错误

• PoolError::ParentNotFound - 如果父节点不存在

pub fn add_at_index( &mut self, parent_id: &NodeId, index: usize, node: &Node, ) -> PoolResult<()>

pub fn add_node( &mut self, parent_id: &NodeId, nodes: &Vec<Node>, ) -> PoolResult<()>

pub fn node(&mut self, key: &str) -> NodeRef<'_>

pub fn mark(&mut self, key: &str) -> MarkRef<'_>

pub fn attrs(&mut self, key: &str) -> AttrsRef<'_>

pub fn children(&self, parent_id: &NodeId) -> Option<Vector<NodeId>>

pub fn children_node(&self, parent_id: &NodeId) -> Option<Vector<Arc<Node>>>

pub fn all_children( &self, parent_id: &NodeId, filter: Option<&dyn Fn(&Node) -> bool>, ) -> Option<NodeTree>

pub fn children_count(&self, parent_id: &NodeId) -> usize

pub fn remove_mark_by_name( &mut self, id: &NodeId, mark_name: &str, ) -> PoolResult<()>

pub fn get_marks(&self, id: &NodeId) -> Option<Vector<Mark>>

pub fn remove_mark( &mut self, id: &NodeId, mark_types: &[String], ) -> PoolResult<()>

pub fn add_mark(&mut self, id: &NodeId, marks: &[Mark]) -> PoolResult<()>

pub fn move_node( &mut self, source_parent_id: &NodeId, target_parent_id: &NodeId, node_id: &NodeId, position: Option<usize>, ) -> PoolResult<()>

pub fn remove_node( &mut self, parent_id: &NodeId, nodes: Vec<NodeId>, ) -> PoolResult<()>

pub fn remove_node_by_id(&mut self, node_id: &NodeId) -> PoolResult<()>

pub fn remove_node_by_index( &mut self, parent_id: &NodeId, index: usize, ) -> PoolResult<()>

根据下标删除

Trait Implementations

impl Clone for Tree

fn clone(&self) -> Tree

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Tree

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Tree

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Index<&Box<str>> for Tree

type Output = Arc<Node>

The returned type after indexing.

fn index(&self, index: &NodeId) -> &Self::Output

Performs the indexing (container[index]) operation.

impl Index<&str> for Tree

type Output = Arc<Node>

The returned type after indexing.

fn index(&self, index: &str) -> &Self::Output

Performs the indexing (container[index]) operation.

impl PartialEq for Tree

fn eq(&self, other: &Tree) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for Tree

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Tree