pub struct AttrsRef<'a> { /* private fields */ }
Implementations§
Methods from Deref<Target = Tree>§
pub fn get_shard_index(&self, id: &NodeId) -> usize
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)>
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 update_attr( &mut self, id: &NodeId, new_values: HashMap<String, Value>, ) -> PoolResult<()>
pub fn update_node(&mut self, node: Node) -> PoolResult<()>
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<NodeEnum>
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: &Vec<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<()>
Sourcepub fn remove_node_by_index(
&mut self,
parent_id: &NodeId,
index: usize,
) -> PoolResult<()>
pub fn remove_node_by_index( &mut self, parent_id: &NodeId, index: usize, ) -> PoolResult<()>
根据下标删除
Trait Implementations§
Source§impl<'a> Add<HashMap<String, Value>> for AttrsRef<'a>
为 AttrsRef 实现自定义的 + 运算符,用于直接添加属性映射
当使用 + 运算符时,会直接使用提供的属性映射更新当前节点的属性
impl<'a> Add<HashMap<String, Value>> for AttrsRef<'a>
为 AttrsRef 实现自定义的 + 运算符,用于直接添加属性映射 当使用 + 运算符时,会直接使用提供的属性映射更新当前节点的属性
Auto Trait Implementations§
impl<'a> Freeze for AttrsRef<'a>
impl<'a> RefUnwindSafe for AttrsRef<'a>
impl<'a> Send for AttrsRef<'a>
impl<'a> Sync for AttrsRef<'a>
impl<'a> Unpin for AttrsRef<'a>
impl<'a> !UnwindSafe for AttrsRef<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more