1.0.0[−][src]Trait sp_std::ops::Index
Used for indexing operations (container[index]
) in immutable contexts.
container[index]
is actually syntactic sugar for *container.index(index)
,
but only when used as an immutable value. If a mutable value is requested,
IndexMut
is used instead. This allows nice things such as
let value = v[index]
if the type of value
implements Copy
.
Examples
The following example implements Index
on a read-only NucleotideCount
container, enabling individual counts to be retrieved with index syntax.
use std::ops::Index; enum Nucleotide { A, C, G, T, } struct NucleotideCount { a: usize, c: usize, g: usize, t: usize, } impl Index<Nucleotide> for NucleotideCount { type Output = usize; fn index(&self, nucleotide: Nucleotide) -> &Self::Output { match nucleotide { Nucleotide::A => &self.a, Nucleotide::C => &self.c, Nucleotide::G => &self.g, Nucleotide::T => &self.t, } } } let nucleotide_count = NucleotideCount {a: 14, c: 9, g: 10, t: 12}; assert_eq!(nucleotide_count[Nucleotide::A], 14); assert_eq!(nucleotide_count[Nucleotide::C], 9); assert_eq!(nucleotide_count[Nucleotide::G], 10); assert_eq!(nucleotide_count[Nucleotide::T], 12);
Associated Types
Loading content...Required methods
pub fn index(&self, index: Idx) -> &Self::Output
[src]
Performs the indexing (container[index]
) operation.
Implementations on Foreign Types
impl Index<RangeFrom<usize>> for CStr
[src]
impl<'_, K, Q, V, S> Index<&'_ Q> for HashMap<K, V, S> where
K: Eq + Hash + Borrow<Q>,
S: BuildHasher,
Q: Eq + Hash + ?Sized,
[src]
K: Eq + Hash + Borrow<Q>,
S: BuildHasher,
Q: Eq + Hash + ?Sized,
type Output = V
pub fn index(&self, key: &Q) -> &Vⓘ
[src]
Returns a reference to the value corresponding to the supplied key.
Panics
Panics if the key is not present in the HashMap
.
impl Index<RangeFull> for CString
[src]
impl Index<RangeFull> for OsString
[src]
impl<I> Index<I> for str where
I: SliceIndex<str>,
[src]
I: SliceIndex<str>,
type Output = <I as SliceIndex<str>>::Output
pub fn index(&self, index: I) -> &<I as SliceIndex<str>>::Output
[src]
impl<T, I> Index<I> for [T] where
I: SliceIndex<[T]>,
[src]
I: SliceIndex<[T]>,
type Output = <I as SliceIndex<[T]>>::Output
pub fn index(&self, index: I) -> &<I as SliceIndex<[T]>>::Output
[src]
impl<T, I, const N: usize> Index<I> for [T; N] where
[T]: Index<I>,
[src]
[T]: Index<I>,
type Output = <[T] as Index<I>>::Output
pub fn index(&self, index: I) -> &<[T; N] as Index<I>>::Output
[src]
impl Index<RangeFull> for String
[src]
impl Index<RangeInclusive<usize>> for String
[src]
impl Index<Range<usize>> for String
[src]
impl Index<RangeTo<usize>> for String
[src]
impl Index<RangeToInclusive<usize>> for String
[src]
impl Index<RangeFrom<usize>> for String
[src]
Loading content...Implementors
impl<'_, K, Q, V> Index<&'_ Q> for BTreeMap<K, V> where
K: Ord + Borrow<Q>,
Q: Ord + ?Sized,
[src]
K: Ord + Borrow<Q>,
Q: Ord + ?Sized,
type Output = V
pub fn index(&self, key: &Q) -> &Vⓘ
[src]
Returns a reference to the value corresponding to the supplied key.
Panics
Panics if the key is not present in the BTreeMap
.
impl<A> Index<usize> for VecDeque<A>
[src]
impl<T, I, A> Index<I> for Vec<T, A> where
A: Allocator,
I: SliceIndex<[T]>,
[src]
A: Allocator,
I: SliceIndex<[T]>,