1.0.0[−][src]Trait nom::lib::std::ops::IndexMut
Used for indexing operations (container[index]
) in mutable contexts.
container[index]
is actually syntactic sugar for
*container.index_mut(index)
, but only when used as a mutable value. If
an immutable value is requested, the Index
trait is used instead. This
allows nice things such as v[index] = value
.
Examples
A very simple implementation of a Balance
struct that has two sides, where
each can be indexed mutably and immutably.
use std::ops::{Index,IndexMut}; #[derive(Debug)] enum Side { Left, Right, } #[derive(Debug, PartialEq)] enum Weight { Kilogram(f32), Pound(f32), } struct Balance { pub left: Weight, pub right: Weight, } impl Index<Side> for Balance { type Output = Weight; fn index(&self, index: Side) -> &Self::Output { println!("Accessing {:?}-side of balance immutably", index); match index { Side::Left => &self.left, Side::Right => &self.right, } } } impl IndexMut<Side> for Balance { fn index_mut(&mut self, index: Side) -> &mut Self::Output { println!("Accessing {:?}-side of balance mutably", index); match index { Side::Left => &mut self.left, Side::Right => &mut self.right, } } } let mut balance = Balance { right: Weight::Kilogram(2.5), left: Weight::Pound(1.5), }; // In this case, `balance[Side::Right]` is sugar for // `*balance.index(Side::Right)`, since we are only *reading* // `balance[Side::Right]`, not writing it. assert_eq!(balance[Side::Right], Weight::Kilogram(2.5)); // However, in this case `balance[Side::Left]` is sugar for // `*balance.index_mut(Side::Left)`, since we are writing // `balance[Side::Left]`. balance[Side::Left] = Weight::Kilogram(3.0);
Required methods
fn index_mut(&mut self, index: Idx) -> &mut Self::Output
[−]
Performs the mutable indexing (container[index]
) operation.
Implementations on Foreign Types
impl IndexMut<RangeFull> for OsString
[src][−]
impl<T, I> IndexMut<I> for [T] where
I: SliceIndex<[T]>,
[src][−]
I: SliceIndex<[T]>,
impl<I> IndexMut<I> for str where
I: SliceIndex<str>,
[src][−]
I: SliceIndex<str>,
fn index_mut(&mut self, index: I) -> &mut <I as SliceIndex<str>>::Output
[src]
Implementors
impl IndexMut<Range<usize>> for String
[src][+]
impl IndexMut<RangeFrom<usize>> for String
[src][+]
impl IndexMut<RangeFull> for String
[src][+]
impl IndexMut<RangeInclusive<usize>> for String
[src][+]
impl IndexMut<RangeTo<usize>> for String
[src][+]
impl IndexMut<RangeToInclusive<usize>> for String
[src][+]
impl<A> IndexMut<usize> for VecDeque<A>
[src][+]
impl<T, I> IndexMut<I> for Vec<T> where
I: SliceIndex<[T]>,
[src][+]
I: SliceIndex<[T]>,
impl IndexMut<NodeIndex<u32>> for Graph
impl IndexMut<NodeIndex<u32>> for Graph
impl IndexMut<EdgeIndex<u32>> for Graph
impl IndexMut<EdgeIndex<u32>> for Graph
impl<N, E, Ix> IndexMut<NodeIndex<Ix>> for Dag<N, E, Ix> where
Ix: IndexType,
impl<N, E, Ix> IndexMut<NodeIndex<Ix>> for Dag<N, E, Ix> where
Ix: IndexType,
impl<N, E, Ix> IndexMut<EdgeIndex<Ix>> for Dag<N, E, Ix> where
Ix: IndexType,
impl<N, E, Ix> IndexMut<EdgeIndex<Ix>> for Dag<N, E, Ix> where
Ix: IndexType,
impl<'a, K, V, S, Q: ?Sized> IndexMut<&'a Q> for LinkedHashMap<K, V, S> where
K: Hash + Eq + Borrow<Q>,
S: BuildHasher,
Q: Eq + Hash,
impl<'a, K, V, S, Q: ?Sized> IndexMut<&'a Q> for LinkedHashMap<K, V, S> where
K: Hash + Eq + Borrow<Q>,
S: BuildHasher,
Q: Eq + Hash,
impl<'a, K, V, Q: ?Sized, S> IndexMut<&'a Q> for OrderMap<K, V, S> where
Q: Hash + Equivalent<K>,
K: Hash + Eq,
S: BuildHasher,
impl<'a, K, V, Q: ?Sized, S> IndexMut<&'a Q> for OrderMap<K, V, S> where
Q: Hash + Equivalent<K>,
K: Hash + Eq,
S: BuildHasher,
impl<N, E, Ty> IndexMut<(N, N)> for GraphMap<N, E, Ty> where
N: NodeTrait,
Ty: EdgeType,
impl<N, E, Ty> IndexMut<(N, N)> for GraphMap<N, E, Ty> where
N: NodeTrait,
Ty: EdgeType,
impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<N, E, Ty, Ix> IndexMut<EdgeIndex<Ix>> for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<N, E, Ty, Ix> IndexMut<EdgeIndex<Ix>> for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<N, E, Ty, Ix> IndexMut<EdgeIndex<Ix>> for StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<N, E, Ty, Ix> IndexMut<EdgeIndex<Ix>> for StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<'a, G, I> IndexMut<I> for Frozen<'a, G> where
G: IndexMut<I>,
impl<'a, G, I> IndexMut<I> for Frozen<'a, G> where
G: IndexMut<I>,
impl<N, E, Ty, Ix> IndexMut<Ix> for Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<N, E, Ty, Ix> IndexMut<Ix> for Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<S> IndexMut<QueueId> for Schedule<S>
impl<S> IndexMut<QueueId> for Schedule<S>
impl<S> IndexMut<SubmissionId> for Schedule<S>
impl<S> IndexMut<SubmissionId> for Schedule<S>
impl<'a, Q: ?Sized> IndexMut<&'a Q> for Map<String, Value> where
String: Borrow<Q>,
Q: Ord + Eq + Hash,
impl<'a, Q: ?Sized> IndexMut<&'a Q> for Map<String, Value> where
String: Borrow<Q>,
Q: Ord + Eq + Hash,
impl<I> IndexMut<I> for Value where
I: Index,
impl<I> IndexMut<I> for Value where
I: Index,
impl<T> IndexMut<usize> for Slab<T>
impl<T> IndexMut<usize> for Slab<T>
impl<A: Array> IndexMut<usize> for SmallVec<A>
impl<A: Array> IndexMut<usize> for SmallVec<A>
impl<A: Array> IndexMut<Range<usize>> for SmallVec<A>
impl<A: Array> IndexMut<Range<usize>> for SmallVec<A>
impl<A: Array> IndexMut<RangeFrom<usize>> for SmallVec<A>
impl<A: Array> IndexMut<RangeFrom<usize>> for SmallVec<A>
impl<A: Array> IndexMut<RangeTo<usize>> for SmallVec<A>
impl<A: Array> IndexMut<RangeTo<usize>> for SmallVec<A>
impl<A: Array> IndexMut<RangeFull> for SmallVec<A>
impl<A: Array> IndexMut<RangeFull> for SmallVec<A>
impl<T, P> IndexMut<usize> for Punctuated<T, P>
impl<T, P> IndexMut<usize> for Punctuated<T, P>