Trait Index 

pub trait Index<Idx>
where
    Idx: ?Sized,
{
    type Output: ?Sized;

    // Required method
    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);

Required 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.

Panics

May panic if the index is out of bounds.

Dyn Compatibility

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementors

impl Index<usize> for ByteString

type Output = u8

impl Index<usize> for BStr

type Output = u8

impl Index<Span> for str

type Output = str

impl Index<Span> for [u8]

type Output = [u8]

impl Index<Span> for str

type Output = str

impl Index<Span> for [u8]

type Output = [u8]

impl Index<Range<Position>> for Url

type Output = str

impl Index<Range<usize>> for ByteString

type Output = ByteStr

impl Index<Range<usize>> for BStr

type Output = BStr

impl Index<Range<usize>> for UninitSlice

type Output = UninitSlice

impl Index<RangeFrom<Position>> for Url

type Output = str

impl Index<RangeFrom<usize>> for ByteString

type Output = ByteStr

impl Index<RangeFrom<usize>> for BStr

type Output = BStr

impl Index<RangeFrom<usize>> for UninitSlice

type Output = UninitSlice

impl Index<RangeFrom<usize>> for CStr

type Output = CStr

impl Index<RangeFull> for ByteString

type Output = ByteStr

impl Index<RangeFull> for CString

type Output = CStr

impl Index<RangeFull> for OsString

type Output = OsStr

impl Index<RangeFull> for BStr

type Output = BStr

impl Index<RangeFull> for UninitSlice

type Output = UninitSlice

impl Index<RangeFull> for Url

type Output = str

impl Index<RangeInclusive<usize>> for ByteString

type Output = ByteStr

impl Index<RangeInclusive<usize>> for BStr

type Output = BStr

impl Index<RangeInclusive<usize>> for UninitSlice

type Output = UninitSlice

impl Index<RangeTo<Position>> for Url

type Output = str

impl Index<RangeTo<usize>> for ByteString

type Output = ByteStr

impl Index<RangeTo<usize>> for BStr

type Output = BStr

impl Index<RangeTo<usize>> for UninitSlice

type Output = UninitSlice

impl Index<RangeToInclusive<usize>> for ByteString

type Output = ByteStr

impl Index<RangeToInclusive<usize>> for BStr

type Output = BStr

impl Index<RangeToInclusive<usize>> for UninitSlice

type Output = UninitSlice

impl Index<RangeFrom<usize>> for CStr

type Output = CStr

impl<'a, K, T> Index<K> for HeaderMap<T>

where K: AsHeaderName,

type Output = T

impl<'a, K, V, T> Index<&'a T> for phf::map::Map<K, V>

where T: Eq + PhfHash + ?Sized, K: PhfBorrow<T>,

type Output = V

impl<'a, K, V, T> Index<&'a T> for OrderedMap<K, V>

where T: Eq + PhfHash + ?Sized, K: PhfBorrow<T>,

type Output = V

impl<'a, Q> Index<&'a Q> for otter_nodejs_tests::toml::map::Map<String, Value>

where String: Borrow<Q>, Q: Ord + Eq + Hash + ?Sized,

Access an element of this map. Panics if the given key is not present in the map.

type Output = Value

impl<'a, V> Index<&'a usize> for VecMap<V>

type Output = V

impl<'h> Index<usize> for otter_nodejs_tests::regex::bytes::Captures<'h>

Get a matching capture group’s haystack substring by index.

The haystack substring returned can’t outlive the Captures object if this method is used, because of how Index is defined (normally a[i] is part of a and can’t outlive it). To work around this limitation, do that, use Captures::get instead.

'h is the lifetime of the matched haystack, but the lifetime of the &str returned by this implementation is the lifetime of the Captures value itself.

Panics

If there is no matching group at the given index.

type Output = [u8]

impl<'h> Index<usize> for otter_nodejs_tests::regex::Captures<'h>

Get a matching capture group’s haystack substring by index.

The haystack substring returned can’t outlive the Captures object if this method is used, because of how Index is defined (normally a[i] is part of a and can’t outlive it). To work around this limitation, do that, use Captures::get instead.

'h is the lifetime of the matched haystack, but the lifetime of the &str returned by this implementation is the lifetime of the Captures value itself.

Panics

If there is no matching group at the given index.

type Output = str

impl<'h, 'n> Index<&'n str> for otter_nodejs_tests::regex::bytes::Captures<'h>

Get a matching capture group’s haystack substring by name.

The haystack substring returned can’t outlive the Captures object if this method is used, because of how Index is defined (normally a[i] is part of a and can’t outlive it). To work around this limitation, do that, use Captures::name instead.

'h is the lifetime of the matched haystack, but the lifetime of the &str returned by this implementation is the lifetime of the Captures value itself.

'n is the lifetime of the group name used to index the Captures value.

Panics

If there is no matching group at the given name.

type Output = [u8]

impl<'h, 'n> Index<&'n str> for otter_nodejs_tests::regex::Captures<'h>

Get a matching capture group’s haystack substring by name.

The haystack substring returned can’t outlive the Captures object if this method is used, because of how Index is defined (normally a[i] is part of a and can’t outlive it). To work around this limitation, do that, use Captures::name instead.

'h is the lifetime of the matched haystack, but the lifetime of the &str returned by this implementation is the lifetime of the Captures value itself.

'n is the lifetime of the group name used to index the Captures value.

Panics

If there is no matching group at the given name.

type Output = str

impl<A, I> Index<I> for SmallVec<A>

where A: Array, I: SliceIndex<[<A as Array>::Item]>,

type Output = <I as SliceIndex<[<A as Array>::Item]>>::Output

impl<Buffer> Index<(u8, u32, u32)> for FlatSamples<Buffer>

where Buffer: Index<usize>,

type Output = <Buffer as Index<usize>>::Output

impl<EntryData> Index<Index<EntryData>> for VecList<EntryData>

type Output = EntryData

impl<I> Index<I> for otter_nodejs_tests::tera::Value

where I: Index,

type Output = Value

impl<I> Index<I> for otter_nodejs_tests::toml::Value

where I: Index,

type Output = Value

impl<I> Index<I> for str

where I: SliceIndex<str>,

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

impl<I> Index<I> for String

where I: SliceIndex<str>,

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

impl<I> Index<I> for UncasedStr

where I: SliceIndex<str, Output = str>,

type Output = UncasedStr

impl<I> Index<I> for ByteStr

where I: SliceIndex<ByteStr>,

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

impl<I, R, T> Index<R> for IndexSlice<I, [T]>

where I: Idx, R: IdxSliceIndex<I, T>,

type Output = <R as IdxSliceIndex<I, T>>::Output

impl<I, T, const N: usize> Index<I> for Simd<T, N>

where T: SimdElement, I: SliceIndex<[T]>,

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

impl<K, Q, V, A> Index<&Q> for BTreeMap<K, V, A>

where A: Allocator + Clone, K: Borrow<Q> + Ord, Q: Ord + ?Sized,

type Output = V

impl<K, Q, V, S, A> Index<&Q> for hashbrown::map::HashMap<K, V, S, A>

where K: Eq + Hash + Borrow<Q>, Q: Eq + Hash + ?Sized, S: BuildHasher, A: Allocator + Clone,

type Output = V

impl<K, Q, V, S, A> Index<&Q> for hashbrown::map::HashMap<K, V, S, A>

where K: Eq + Hash, Q: Hash + Equivalent<K> + ?Sized, S: BuildHasher, A: Allocator,

type Output = V

impl<K, Q, V, S, A> Index<&Q> for otter_nodejs_tests::HashMap<K, V, S, A>

where K: Eq + Hash + Borrow<Q>, Q: Eq + Hash + ?Sized, S: BuildHasher, A: Allocator,

type Output = V

impl<K, V> Index<(Bound<usize>, Bound<usize>)> for indexmap::map::slice::Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<usize> for Keys<'_, K, V>

Access IndexMap keys at indexed positions.

While Index<usize> for IndexMap accesses a map’s values, indexing through IndexMap::keys offers an alternative to access a map’s keys instead.

Since Keys is also an iterator, consuming items from the iterator will offset the effective indices. Similarly, if Keys is obtained from Slice::keys, indices will be interpreted relative to the position of that slice.

Examples

use indexmap::IndexMap;

let mut map = IndexMap::new();
for word in "Lorem ipsum dolor sit amet".split_whitespace() {
    map.insert(word.to_lowercase(), word.to_uppercase());
}

assert_eq!(map[0], "LOREM");
assert_eq!(map.keys()[0], "lorem");
assert_eq!(map[1], "IPSUM");
assert_eq!(map.keys()[1], "ipsum");

map.reverse();
assert_eq!(map.keys()[0], "amet");
assert_eq!(map.keys()[1], "sit");

map.sort_keys();
assert_eq!(map.keys()[0], "amet");
assert_eq!(map.keys()[1], "dolor");

// Advancing the iterator will offset the indexing
let mut keys = map.keys();
assert_eq!(keys[0], "amet");
assert_eq!(keys.next().map(|s| &**s), Some("amet"));
assert_eq!(keys[0], "dolor");
assert_eq!(keys[1], "ipsum");

// Slices may have an offset as well
let slice = &map[2..];
assert_eq!(slice[0], "IPSUM");
assert_eq!(slice.keys()[0], "ipsum");

use indexmap::IndexMap;

let mut map = IndexMap::new();
map.insert("foo", 1);
println!("{:?}", map.keys()[10]); // panics!

type Output = K

impl<K, V> Index<usize> for indexmap::map::slice::Slice<K, V>

type Output = V

impl<K, V> Index<Range<usize>> for indexmap::map::slice::Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<RangeFrom<usize>> for indexmap::map::slice::Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<RangeFull> for indexmap::map::slice::Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<RangeInclusive<usize>> for indexmap::map::slice::Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<RangeTo<usize>> for indexmap::map::slice::Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<RangeToInclusive<usize>> for indexmap::map::slice::Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<K> for HopSlotMap<K, V>

where K: Key,

type Output = V

impl<K, V> Index<K> for SecondaryMap<K, V>

where K: Key,

type Output = V

impl<K, V> Index<K> for SlotMap<K, V>

where K: Key,

type Output = V

impl<K, V> Index<K> for DenseSlotMap<K, V>

where K: Key,

type Output = V

impl<K, V> Index<K> for EnumMap<K, V>

where K: EnumArray<V>,

type Output = V

impl<K, V, Q, S> Index<&Q> for indexmap::map::IndexMap<K, V, S>

where Q: Hash + Equivalent<K> + ?Sized, S: BuildHasher,

Access IndexMap values corresponding to a key.

Examples

use indexmap::IndexMap;

let mut map = IndexMap::new();
for word in "Lorem ipsum dolor sit amet".split_whitespace() {
    map.insert(word.to_lowercase(), word.to_uppercase());
}
assert_eq!(map["lorem"], "LOREM");
assert_eq!(map["ipsum"], "IPSUM");

use indexmap::IndexMap;

let mut map = IndexMap::new();
map.insert("foo", 1);
println!("{:?}", map["bar"]); // panics!

type Output = V

impl<K, V, Q, S> Index<&Q> for otter_nodejs_tests::IndexMap<K, V, S>

where Q: Hash + Equivalent<K> + ?Sized, K: Hash + Eq, S: BuildHasher,

Access IndexMap values corresponding to a key.

Examples

use indexmap::IndexMap;

let mut map = IndexMap::new();
for word in "Lorem ipsum dolor sit amet".split_whitespace() {
    map.insert(word.to_lowercase(), word.to_uppercase());
}
assert_eq!(map["lorem"], "LOREM");
assert_eq!(map["ipsum"], "IPSUM");

use indexmap::IndexMap;

let mut map = IndexMap::new();
map.insert("foo", 1);
println!("{:?}", map["bar"]); // panics!

type Output = V

impl<K, V, S> Index<(Bound<usize>, Bound<usize>)> for indexmap::map::IndexMap<K, V, S>

type Output = Slice<K, V>

impl<K, V, S> Index<&K> for LiteMap<K, V, S>

where K: Ord, S: Store<K, V>,

type Output = V

impl<K, V, S> Index<usize> for indexmap::map::IndexMap<K, V, S>

Access IndexMap values at indexed positions.

See Index<usize> for Keys to access a map’s keys instead.

Examples

use indexmap::IndexMap;

let mut map = IndexMap::new();
for word in "Lorem ipsum dolor sit amet".split_whitespace() {
    map.insert(word.to_lowercase(), word.to_uppercase());
}
assert_eq!(map[0], "LOREM");
assert_eq!(map[1], "IPSUM");
map.reverse();
assert_eq!(map[0], "AMET");
assert_eq!(map[1], "SIT");
map.sort_keys();
assert_eq!(map[0], "AMET");
assert_eq!(map[1], "DOLOR");

use indexmap::IndexMap;

let mut map = IndexMap::new();
map.insert("foo", 1);
println!("{:?}", map[10]); // panics!

type Output = V

impl<K, V, S> Index<usize> for otter_nodejs_tests::IndexMap<K, V, S>

Access IndexMap values at indexed positions.

Examples

use indexmap::IndexMap;

let mut map = IndexMap::new();
for word in "Lorem ipsum dolor sit amet".split_whitespace() {
    map.insert(word.to_lowercase(), word.to_uppercase());
}
assert_eq!(map[0], "LOREM");
assert_eq!(map[1], "IPSUM");
map.reverse();
assert_eq!(map[0], "AMET");
assert_eq!(map[1], "SIT");
map.sort_keys();
assert_eq!(map[0], "AMET");
assert_eq!(map[1], "DOLOR");

use indexmap::IndexMap;

let mut map = IndexMap::new();
map.insert("foo", 1);
println!("{:?}", map[10]); // panics!

type Output = V

impl<K, V, S> Index<Range<usize>> for indexmap::map::IndexMap<K, V, S>

type Output = Slice<K, V>

impl<K, V, S> Index<RangeFrom<usize>> for indexmap::map::IndexMap<K, V, S>

type Output = Slice<K, V>

impl<K, V, S> Index<RangeFull> for indexmap::map::IndexMap<K, V, S>

type Output = Slice<K, V>

impl<K, V, S> Index<RangeInclusive<usize>> for indexmap::map::IndexMap<K, V, S>

type Output = Slice<K, V>

impl<K, V, S> Index<RangeTo<usize>> for indexmap::map::IndexMap<K, V, S>

type Output = Slice<K, V>

impl<K, V, S> Index<RangeToInclusive<usize>> for indexmap::map::IndexMap<K, V, S>

type Output = Slice<K, V>

impl<K, V, S> Index<K> for SparseSecondaryMap<K, V, S>

where K: Key, S: BuildHasher,

type Output = V

impl<P, Container> Index<(u32, u32)> for ImageBuffer<P, Container>

where P: Pixel, Container: Deref<Target = [<P as Pixel>::Subpixel]>,

type Output = P

impl<Q> Index<&Q> for otter_nodejs_tests::tera::Map<String, Value>

where String: Borrow<Q>, Q: Ord + Eq + Hash + ?Sized,

Access an element of this map. Panics if the given key is not present in the map.

match val {
    Value::String(s) => Some(s.as_str()),
    Value::Array(arr) => arr[0].as_str(),
    Value::Object(map) => map["type"].as_str(),
    _ => None,
}

type Output = Value

impl<T0> Index<UTerm> for (T0,)

type Output = T0

impl<T0, T1> Index<UInt<UTerm, B1>> for (T0, T1)

type Output = T1

impl<T0, T1> Index<UTerm> for (T0, T1)

type Output = T0

impl<T0, T1, T2> Index<UInt<UInt<UTerm, B1>, B0>> for (T0, T1, T2)

type Output = T2

impl<T0, T1, T2> Index<UInt<UTerm, B1>> for (T0, T1, T2)

type Output = T1

impl<T0, T1, T2> Index<UTerm> for (T0, T1, T2)

type Output = T0

impl<T0, T1, T2, T3> Index<UInt<UInt<UTerm, B1>, B0>> for (T0, T1, T2, T3)

type Output = T2

impl<T0, T1, T2, T3> Index<UInt<UInt<UTerm, B1>, B1>> for (T0, T1, T2, T3)

type Output = T3

impl<T0, T1, T2, T3> Index<UInt<UTerm, B1>> for (T0, T1, T2, T3)

type Output = T1

impl<T0, T1, T2, T3> Index<UTerm> for (T0, T1, T2, T3)

type Output = T0

impl<T0, T1, T2, T3, T4> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B0>> for (T0, T1, T2, T3, T4)

type Output = T4

impl<T0, T1, T2, T3, T4> Index<UInt<UInt<UTerm, B1>, B0>> for (T0, T1, T2, T3, T4)

type Output = T2

impl<T0, T1, T2, T3, T4> Index<UInt<UInt<UTerm, B1>, B1>> for (T0, T1, T2, T3, T4)

type Output = T3

impl<T0, T1, T2, T3, T4> Index<UInt<UTerm, B1>> for (T0, T1, T2, T3, T4)

type Output = T1

impl<T0, T1, T2, T3, T4> Index<UTerm> for (T0, T1, T2, T3, T4)

type Output = T0

impl<T0, T1, T2, T3, T4, T5> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B0>> for (T0, T1, T2, T3, T4, T5)

type Output = T4

impl<T0, T1, T2, T3, T4, T5> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B1>> for (T0, T1, T2, T3, T4, T5)

type Output = T5

impl<T0, T1, T2, T3, T4, T5> Index<UInt<UInt<UTerm, B1>, B0>> for (T0, T1, T2, T3, T4, T5)

type Output = T2

impl<T0, T1, T2, T3, T4, T5> Index<UInt<UInt<UTerm, B1>, B1>> for (T0, T1, T2, T3, T4, T5)

type Output = T3

impl<T0, T1, T2, T3, T4, T5> Index<UInt<UTerm, B1>> for (T0, T1, T2, T3, T4, T5)

type Output = T1

impl<T0, T1, T2, T3, T4, T5> Index<UTerm> for (T0, T1, T2, T3, T4, T5)

type Output = T0

impl<T0, T1, T2, T3, T4, T5, T6> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B0>> for (T0, T1, T2, T3, T4, T5, T6)

type Output = T4

impl<T0, T1, T2, T3, T4, T5, T6> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B1>> for (T0, T1, T2, T3, T4, T5, T6)

type Output = T5

impl<T0, T1, T2, T3, T4, T5, T6> Index<UInt<UInt<UInt<UTerm, B1>, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6)

type Output = T6

impl<T0, T1, T2, T3, T4, T5, T6> Index<UInt<UInt<UTerm, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6)

type Output = T2

impl<T0, T1, T2, T3, T4, T5, T6> Index<UInt<UInt<UTerm, B1>, B1>> for (T0, T1, T2, T3, T4, T5, T6)

type Output = T3

impl<T0, T1, T2, T3, T4, T5, T6> Index<UInt<UTerm, B1>> for (T0, T1, T2, T3, T4, T5, T6)

type Output = T1

impl<T0, T1, T2, T3, T4, T5, T6> Index<UTerm> for (T0, T1, T2, T3, T4, T5, T6)

type Output = T0

impl<T0, T1, T2, T3, T4, T5, T6, T7> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7)

type Output = T4

impl<T0, T1, T2, T3, T4, T5, T6, T7> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7)

type Output = T5

impl<T0, T1, T2, T3, T4, T5, T6, T7> Index<UInt<UInt<UInt<UTerm, B1>, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7)

type Output = T6

impl<T0, T1, T2, T3, T4, T5, T6, T7> Index<UInt<UInt<UInt<UTerm, B1>, B1>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7)

type Output = T7

impl<T0, T1, T2, T3, T4, T5, T6, T7> Index<UInt<UInt<UTerm, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7)

type Output = T2

impl<T0, T1, T2, T3, T4, T5, T6, T7> Index<UInt<UInt<UTerm, B1>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7)

type Output = T3

impl<T0, T1, T2, T3, T4, T5, T6, T7> Index<UInt<UTerm, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7)

type Output = T1

impl<T0, T1, T2, T3, T4, T5, T6, T7> Index<UTerm> for (T0, T1, T2, T3, T4, T5, T6, T7)

type Output = T0

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Index<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

type Output = T8

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

type Output = T4

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

type Output = T5

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Index<UInt<UInt<UInt<UTerm, B1>, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

type Output = T6

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Index<UInt<UInt<UInt<UTerm, B1>, B1>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

type Output = T7

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Index<UInt<UInt<UTerm, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

type Output = T2

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Index<UInt<UInt<UTerm, B1>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

type Output = T3

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Index<UInt<UTerm, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

type Output = T1

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Index<UTerm> for (T0, T1, T2, T3, T4, T5, T6, T7, T8)

type Output = T0

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Index<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

type Output = T8

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Index<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

type Output = T9

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

type Output = T4

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

type Output = T5

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Index<UInt<UInt<UInt<UTerm, B1>, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

type Output = T6

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Index<UInt<UInt<UInt<UTerm, B1>, B1>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

type Output = T7

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Index<UInt<UInt<UTerm, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

type Output = T2

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Index<UInt<UInt<UTerm, B1>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

type Output = T3

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Index<UInt<UTerm, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

type Output = T1

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Index<UTerm> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)

type Output = T0

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Index<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

type Output = T8

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Index<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

type Output = T9

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Index<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

type Output = T10

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

type Output = T4

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

type Output = T5

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Index<UInt<UInt<UInt<UTerm, B1>, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

type Output = T6

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Index<UInt<UInt<UInt<UTerm, B1>, B1>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

type Output = T7

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Index<UInt<UInt<UTerm, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

type Output = T2

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Index<UInt<UInt<UTerm, B1>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

type Output = T3

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Index<UInt<UTerm, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

type Output = T1

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Index<UTerm> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)

type Output = T0

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Index<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

type Output = T8

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Index<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

type Output = T9

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Index<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

type Output = T10

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Index<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

type Output = T11

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

type Output = T4

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Index<UInt<UInt<UInt<UTerm, B1>, B0>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

type Output = T5

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Index<UInt<UInt<UInt<UTerm, B1>, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

type Output = T6

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Index<UInt<UInt<UInt<UTerm, B1>, B1>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

type Output = T7

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Index<UInt<UInt<UTerm, B1>, B0>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

type Output = T2

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Index<UInt<UInt<UTerm, B1>, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

type Output = T3

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Index<UInt<UTerm, B1>> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

type Output = T1

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Index<UTerm> for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11)

type Output = T0

impl<T> Index<(Bound<usize>, Bound<usize>)> for indexmap::set::slice::Slice<T>

type Output = Slice<T>

impl<T> Index<OldNewIndex> for OldNew<T>

type Output = T

impl<T> Index<usize> for Luma<T>

type Output = T

impl<T> Index<usize> for LumaA<T>

type Output = T

impl<T> Index<usize> for Rgb<T>

type Output = T

impl<T> Index<usize> for Rgba<T>

type Output = T

impl<T> Index<usize> for indexmap::set::slice::Slice<T>

type Output = T

impl<T> Index<usize> for StackRef<T>

where T: Stackable,

type Output = <T as ForeignType>::Ref

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

type Output = T

impl<T> Index<PatternID> for [T]

type Output = T

impl<T> Index<PatternID> for Vec<T>

type Output = T

impl<T> Index<StateID> for [T]

type Output = T

impl<T> Index<StateID> for Vec<T>

type Output = T

impl<T> Index<PatternID> for [T]

type Output = T

impl<T> Index<PatternID> for Vec<T>

Available on crate feature alloc only.

type Output = T

impl<T> Index<SmallIndex> for [T]

type Output = T

impl<T> Index<SmallIndex> for Vec<T>

Available on crate feature alloc only.

type Output = T

impl<T> Index<StateID> for [T]

type Output = T

impl<T> Index<StateID> for Vec<T>

Available on crate feature alloc only.

type Output = T

impl<T> Index<Range<usize>> for indexmap::set::slice::Slice<T>

type Output = Slice<T>

impl<T> Index<Range<usize>> for Stack<T>

where T: Clone,

type Output = [T]

impl<T> Index<RangeFrom<usize>> for indexmap::set::slice::Slice<T>

type Output = Slice<T>

impl<T> Index<RangeFull> for indexmap::set::slice::Slice<T>

type Output = Slice<T>

impl<T> Index<RangeInclusive<usize>> for indexmap::set::slice::Slice<T>

type Output = Slice<T>

impl<T> Index<RangeTo<usize>> for indexmap::set::slice::Slice<T>

type Output = Slice<T>

impl<T> Index<RangeToInclusive<usize>> for indexmap::set::slice::Slice<T>

type Output = Slice<T>

impl<T> Index<SmallIndex> for [T]

type Output = T

impl<T> Index<SmallIndex> for Vec<T>

type Output = T

impl<T> Index<User> for [T; 2]

type Output = T

impl<T, A> Index<usize> for VecDeque<T, A>

where A: Allocator,

type Output = T

impl<T, F> Index<usize> for VarZeroSlice<T, F>

where T: VarULE + ?Sized, F: VarZeroVecFormat,

type Output = T

impl<T, I> Index<I> for [T]

where I: SliceIndex<[T]>,

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

impl<T, I> Index<I> for Deque<T, I>

where I: Offset,

type Output = T

impl<T, I, A> Index<I> for Vec<T, A>

where I: SliceIndex<[T]>, A: Allocator,

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

impl<T, I, const N: usize> Index<I> for [T; N]

where [T]: Index<I>,

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

impl<T, S> Index<(Bound<usize>, Bound<usize>)> for indexmap::set::IndexSet<T, S>

type Output = Slice<T>

impl<T, S> Index<usize> for indexmap::set::IndexSet<T, S>

Access IndexSet values at indexed positions.

Examples

use indexmap::IndexSet;

let mut set = IndexSet::new();
for word in "Lorem ipsum dolor sit amet".split_whitespace() {
    set.insert(word.to_string());
}
assert_eq!(set[0], "Lorem");
assert_eq!(set[1], "ipsum");
set.reverse();
assert_eq!(set[0], "amet");
assert_eq!(set[1], "sit");
set.sort();
assert_eq!(set[0], "Lorem");
assert_eq!(set[1], "amet");

use indexmap::IndexSet;

let mut set = IndexSet::new();
set.insert("foo");
println!("{:?}", set[10]); // panics!

type Output = T

impl<T, S> Index<usize> for otter_nodejs_tests::IndexSet<T, S>

Access IndexSet values at indexed positions.

Examples

use indexmap::IndexSet;

let mut set = IndexSet::new();
for word in "Lorem ipsum dolor sit amet".split_whitespace() {
    set.insert(word.to_string());
}
assert_eq!(set[0], "Lorem");
assert_eq!(set[1], "ipsum");
set.reverse();
assert_eq!(set[0], "amet");
assert_eq!(set[1], "sit");
set.sort();
assert_eq!(set[0], "Lorem");
assert_eq!(set[1], "amet");

use indexmap::IndexSet;

let mut set = IndexSet::new();
set.insert("foo");
println!("{:?}", set[10]); // panics!

type Output = T

impl<T, S> Index<Range<usize>> for indexmap::set::IndexSet<T, S>

type Output = Slice<T>

impl<T, S> Index<RangeFrom<usize>> for indexmap::set::IndexSet<T, S>

type Output = Slice<T>

impl<T, S> Index<RangeFull> for indexmap::set::IndexSet<T, S>

type Output = Slice<T>

impl<T, S> Index<RangeInclusive<usize>> for indexmap::set::IndexSet<T, S>

type Output = Slice<T>

impl<T, S> Index<RangeTo<usize>> for indexmap::set::IndexSet<T, S>

type Output = Slice<T>

impl<T, S> Index<RangeToInclusive<usize>> for indexmap::set::IndexSet<T, S>

type Output = Slice<T>

impl<V> Index<usize> for VecMap<V>

type Output = V