pub struct Gain<T> {
pub value: [Leaf<T>; 5],
/* private fields */
}
Expand description
Named gains
Fields§
§value: [Leaf<T>; 5]
Gain values
See Action
for indices.
Trait Implementations§
Source§impl<T> TreeAny for Gain<T>where
Leaf<T>: TreeAny,
impl<T> TreeAny for Gain<T>where
Leaf<T>: TreeAny,
Source§fn ref_any_by_key<K>(&self, keys: K) -> Result<&dyn Any, Traversal>where
K: Keys,
fn ref_any_by_key<K>(&self, keys: K) -> Result<&dyn Any, Traversal>where
K: Keys,
Obtain a reference to a
dyn Any
trait object for a leaf node.Source§fn mut_any_by_key<K>(&mut self, keys: K) -> Result<&mut dyn Any, Traversal>where
K: Keys,
fn mut_any_by_key<K>(&mut self, keys: K) -> Result<&mut dyn Any, Traversal>where
K: Keys,
Obtain a mutable reference to a
dyn Any
trait object for a leaf node.§fn ref_by_key<T, K>(&self, keys: K) -> Result<&T, Traversal>where
T: Any,
K: IntoKeys,
fn ref_by_key<T, K>(&self, keys: K) -> Result<&T, Traversal>where
T: Any,
K: IntoKeys,
Obtain a reference to a leaf of known type by key.
§fn mut_by_key<T, K>(&mut self, keys: K) -> Result<&mut T, Traversal>where
T: Any,
K: IntoKeys,
fn mut_by_key<T, K>(&mut self, keys: K) -> Result<&mut T, Traversal>where
T: Any,
K: IntoKeys,
Obtain a mutable reference to a leaf of known type by key.
Source§impl<'de, T> TreeDeserialize<'de> for Gain<T>where
Leaf<T>: TreeDeserialize<'de>,
impl<'de, T> TreeDeserialize<'de> for Gain<T>where
Leaf<T>: TreeDeserialize<'de>,
Source§fn deserialize_by_key<K, D>(
&mut self,
keys: K,
de: D,
) -> Result<usize, Error<D::Error>>where
K: Keys,
D: Deserializer<'de>,
fn deserialize_by_key<K, D>(
&mut self,
keys: K,
de: D,
) -> Result<usize, Error<D::Error>>where
K: Keys,
D: Deserializer<'de>,
Deserialize a leaf node by its keys. Read more
Source§impl<T> TreeKey for Gain<T>where
Leaf<T>: TreeKey,
impl<T> TreeKey for Gain<T>where
Leaf<T>: TreeKey,
Source§fn traverse_all<W: Walk>() -> Result<W, W::Error>
fn traverse_all<W: Walk>() -> Result<W, W::Error>
Walk metadata about all paths. Read more
Source§fn traverse_by_key<K, F, E>(keys: K, func: F) -> Result<usize, Error<E>>
fn traverse_by_key<K, F, E>(keys: K, func: F) -> Result<usize, Error<E>>
Traverse from the root to a leaf and call a function for each node. Read more
Auto Trait Implementations§
impl<T> Freeze for Gain<T>where
T: Freeze,
impl<T> RefUnwindSafe for Gain<T>where
T: RefUnwindSafe,
impl<T> Send for Gain<T>where
T: Send,
impl<T> Sync for Gain<T>where
T: Sync,
impl<T> Unpin for Gain<T>where
T: Unpin,
impl<T> UnwindSafe for Gain<T>where
T: 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