pub struct Tokenized<A, B>(pub A, _);
Tuple Fields§
§0: A
Trait Implementations§
Source§impl<T, Token: TokenTrait> Deref for Tokenized<&Arc<TokenCell<T, Token>>, &mut Token>
impl<T, Token: TokenTrait> Deref for Tokenized<&Arc<TokenCell<T, Token>>, &mut Token>
Source§impl<T, Token: TokenTrait> Deref for Tokenized<&TokenCell<T, Token>, &mut Token>
impl<T, Token: TokenTrait> Deref for Tokenized<&TokenCell<T, Token>, &mut Token>
Source§impl<T, Token: TokenTrait> DerefMut for Tokenized<&Arc<TokenCell<T, Token>>, &mut Token>
impl<T, Token: TokenTrait> DerefMut for Tokenized<&Arc<TokenCell<T, Token>>, &mut Token>
Source§impl<T, Token: TokenTrait> DerefMut for Tokenized<&TokenCell<T, Token>, &mut Token>
impl<T, Token: TokenTrait> DerefMut for Tokenized<&TokenCell<T, Token>, &mut Token>
Source§impl<T: IKeyExprTreeNode<Weight>, Weight, Token: TokenTrait> IKeyExprTreeNode<Weight> for Tokenized<&Arc<TokenCell<T, Token>>, &Token>
impl<T: IKeyExprTreeNode<Weight>, Weight, Token: TokenTrait> IKeyExprTreeNode<Weight> for Tokenized<&Arc<TokenCell<T, Token>>, &Token>
Source§impl<T: IKeyExprTreeNode<Weight>, Weight, Token: TokenTrait> IKeyExprTreeNode<Weight> for Tokenized<&Arc<TokenCell<T, Token>>, &mut Token>
impl<T: IKeyExprTreeNode<Weight>, Weight, Token: TokenTrait> IKeyExprTreeNode<Weight> for Tokenized<&Arc<TokenCell<T, Token>>, &mut Token>
Source§impl<T: IKeyExprTreeNode<Weight>, Weight, Token: TokenTrait> IKeyExprTreeNode<Weight> for Tokenized<&TokenCell<T, Token>, &Token>
impl<T: IKeyExprTreeNode<Weight>, Weight, Token: TokenTrait> IKeyExprTreeNode<Weight> for Tokenized<&TokenCell<T, Token>, &Token>
Source§impl<T: IKeyExprTreeNode<Weight>, Weight, Token: TokenTrait> IKeyExprTreeNode<Weight> for Tokenized<&TokenCell<T, Token>, &mut Token>
impl<T: IKeyExprTreeNode<Weight>, Weight, Token: TokenTrait> IKeyExprTreeNode<Weight> for Tokenized<&TokenCell<T, Token>, &mut Token>
Source§impl<T: IKeyExprTreeNodeMut<Weight>, Weight, Token: TokenTrait> IKeyExprTreeNodeMut<Weight> for Tokenized<&Arc<TokenCell<T, Token>>, &mut Token>
impl<T: IKeyExprTreeNodeMut<Weight>, Weight, Token: TokenTrait> IKeyExprTreeNodeMut<Weight> for Tokenized<&Arc<TokenCell<T, Token>>, &mut Token>
Source§fn parent_mut(&mut self) -> Option<&mut Self::Parent>
fn parent_mut(&mut self) -> Option<&mut Self::Parent>
Mutably access the parent node if it exists (the node isn’t the first chunk of a key-expression).
Source§fn weight_mut(&mut self) -> Option<&mut Weight>
fn weight_mut(&mut self) -> Option<&mut Weight>
Mutably access the node’s weight.
Source§fn take_weight(&mut self) -> Option<Weight>
fn take_weight(&mut self) -> Option<Weight>
Remove the node’s weight.
Source§fn insert_weight(&mut self, weight: Weight) -> Option<Weight>
fn insert_weight(&mut self, weight: Weight) -> Option<Weight>
Assign a weight to the node, returning the previous weight if the node had one.
Source§fn children_mut(&mut self) -> &mut Self::Children
fn children_mut(&mut self) -> &mut Self::Children
Mutably access the node’s children.
Source§impl<T: IKeyExprTreeNodeMut<Weight>, Weight, Token: TokenTrait> IKeyExprTreeNodeMut<Weight> for Tokenized<&TokenCell<T, Token>, &mut Token>
impl<T: IKeyExprTreeNodeMut<Weight>, Weight, Token: TokenTrait> IKeyExprTreeNodeMut<Weight> for Tokenized<&TokenCell<T, Token>, &mut Token>
Source§fn parent_mut(&mut self) -> Option<&mut Self::Parent>
fn parent_mut(&mut self) -> Option<&mut Self::Parent>
Mutably access the parent node if it exists (the node isn’t the first chunk of a key-expression).
Source§fn weight_mut(&mut self) -> Option<&mut Weight>
fn weight_mut(&mut self) -> Option<&mut Weight>
Mutably access the node’s weight.
Source§fn take_weight(&mut self) -> Option<Weight>
fn take_weight(&mut self) -> Option<Weight>
Remove the node’s weight.
Source§fn insert_weight(&mut self, weight: Weight) -> Option<Weight>
fn insert_weight(&mut self, weight: Weight) -> Option<Weight>
Assign a weight to the node, returning the previous weight if the node had one.
Source§fn children_mut(&mut self) -> &mut Self::Children
fn children_mut(&mut self) -> &mut Self::Children
Mutably access the node’s children.
Auto Trait Implementations§
impl<A, B> Freeze for Tokenized<A, B>
impl<A, B> RefUnwindSafe for Tokenized<A, B>where
A: RefUnwindSafe,
B: RefUnwindSafe,
impl<A, B> Send for Tokenized<A, B>
impl<A, B> Sync for Tokenized<A, B>
impl<A, B> Unpin for Tokenized<A, B>
impl<A, B> UnwindSafe for Tokenized<A, B>where
A: UnwindSafe,
B: UnwindSafe,
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