1.0.0[−][src]Trait nom::lib::std::ops::Index

#[lang = "index"]pub trait Index<Idx> where
    Idx: ?Sized, {
    type Output: ?Sized;
    fn index(&self, index: Idx) -> &Self::Output;
}
[−]

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

type Output: ?Sized[−]

The returned type after indexing.

Required methods

fn index(&self, index: Idx) -> &Self::Output[−]

Performs the indexing (container[index]) operation.

Implementations on Foreign Types

impl Index<RangeFull> for CString[src][−]

type Output = CStr

impl Index<RangeFull> for OsString[src][−]

type Output = OsStr

impl Index<RangeFrom<usize>> for CStr[src][−]

type Output = CStr

impl<I> Index<I> for str where
    I: SliceIndex<str>, [src][−]

type Output = <I as SliceIndex<str>>::Output

impl<T, I> Index<I> for [T] where
    I: SliceIndex<[T]>, [src][−]

type Output = <I as SliceIndex<[T]>>::Output

Implementors

impl Index<Range<usize>> for String[src][+]

type Output = str

impl Index<RangeFrom<usize>> for String[src][+]

type Output = str

impl Index<RangeFull> for String[src][+]

type Output = str

impl Index<RangeInclusive<usize>> for String[src][+]

type Output = str

impl Index<RangeTo<usize>> for String[src][+]

type Output = str

impl Index<RangeToInclusive<usize>> for String[src][+]

type Output = str

impl<'_, K, Q, V> Index<&'_ Q> for BTreeMap<K, V> where
    K: Ord + Borrow<Q>,
    Q: Ord + ?Sized, [src][+]

type Output = V

fn index(&self, key: &Q) -> &Vⓘ

Notable traits for &'_ mut I

impl<'_, I> Iterator for &'_ mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;
[src][−]

Returns a reference to the value corresponding to the supplied key.

Panics

Panics if the key is not present in the BTreeMap.

impl<'_, K, Q, V, S> Index<&'_ Q> for HashMap<K, V, S> where
    K: Eq + Hash + Borrow<Q>,
    Q: Eq + Hash + ?Sized,
    S: BuildHasher, [src][+]

type Output = V

fn index(&self, key: &Q) -> &Vⓘ

Notable traits for &'_ mut I

impl<'_, I> Iterator for &'_ mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;
[src][−]

Returns a reference to the value corresponding to the supplied key.

Panics

Panics if the key is not present in the HashMap.

impl<A> Index<usize> for VecDeque<A>[src][+]

type Output = A

impl<T, I> Index<I> for Vec<T> where
    I: SliceIndex<[T]>, [src][+]

type Output = <I as SliceIndex<[T]>>::Output

impl Index<NodeIndex<u32>> for Graph

impl Index<EdgeIndex<u32>> for Graph

impl Index<MouseButton> for ButtonMap

impl<N, E, Ix> Index<NodeIndex<Ix>> for Dag<N, E, Ix> where
    Ix: IndexType, 

impl<N, E, Ix> Index<EdgeIndex<Ix>> for Dag<N, E, Ix> where
    Ix: IndexType, 

impl Index<usize> for FixedBitSet

impl<'input, Endian> Index<usize> for EndianSlice<'input, Endian> where
    Endian: Endianity, 

impl<'input, Endian> Index<RangeFrom<usize>> for EndianSlice<'input, Endian> where
    Endian: Endianity, 

impl<'a, K, V, S, Q: ?Sized> Index<&'a Q> for LinkedHashMap<K, V, S> where
    K: Hash + Eq + Borrow<Q>,
    S: BuildHasher,
    Q: Eq + Hash, 

impl<T> Index<Handle<T>> for Arena<T>

impl<'a, K, V, Q: ?Sized, S> Index<&'a Q> for OrderMap<K, V, S> where
    Q: Hash + Equivalent<K>,
    K: Hash + Eq,
    S: BuildHasher, 

impl<N, E, Ty> Index<(N, N)> for GraphMap<N, E, Ty> where
    N: NodeTrait,
    Ty: EdgeType, 

impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for Graph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, 

impl<N, E, Ty, Ix> Index<EdgeIndex<Ix>> for Graph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, 

impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for StableGraph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, 

impl<N, E, Ty, Ix> Index<EdgeIndex<Ix>> for StableGraph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, 

impl<'a, G, I> Index<I> for Frozen<'a, G> where
    G: Index<I>, 

impl<N, E, Ty, Ix> Index<Ix> for Csr<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, 

impl<S> Index<QueueId> for Schedule<S>

impl<S> Index<SubmissionId> for Schedule<S>

impl<'a, B> Index<usize> for NextImages<'a, B> where
    B: Backend, 

impl<'a, Q: ?Sized> Index<&'a Q> for Map<String, Value> where
    String: Borrow<Q>,
    Q: Ord + Eq + Hash, 

impl<I> Index<I> for Value where
    I: Index, 

impl<T> Index<usize> for Slab<T>

impl<A: Array> Index<usize> for SmallVec<A>

impl<A: Array> Index<Range<usize>> for SmallVec<A>

impl<A: Array> Index<RangeFrom<usize>> for SmallVec<A>

impl<A: Array> Index<RangeTo<usize>> for SmallVec<A>

impl<A: Array> Index<RangeFull> for SmallVec<A>

impl<T, P> Index<usize> for Punctuated<T, P>

impl Index<usize> for Cursor