Trait gclient::ext::sp_core::sp_std::ops::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.

Implementors

impl Index<&str> for Params

type Output = String

impl Index<usize> for Scalar

type Output = u8

impl Index<Range<Position>> for Url

type Output = str

impl Index<Range<usize>> for UninitSlice

type Output = UninitSlice

impl Index<RangeFrom<Position>> for Url

type Output = str

impl Index<RangeFrom<usize>> for CStr

type Output = CStr

impl Index<RangeFrom<usize>> for UninitSlice

type Output = UninitSlice

impl Index<RangeFull> for CString

type Output = CStr

impl Index<RangeFull> for OsString

type Output = OsStr

impl Index<RangeFull> for Url

type Output = str

impl Index<RangeFull> for UninitSlice

type Output = UninitSlice

impl Index<RangeInclusive<usize>> for UninitSlice

type Output = UninitSlice

impl Index<RangeTo<Position>> for Url

type Output = str

impl Index<RangeTo<usize>> for UninitSlice

type Output = UninitSlice

impl Index<RangeToInclusive<usize>> for UninitSlice

type Output = UninitSlice

impl Index<SignatureIndex> for ModuleTypes

type Output = WasmFuncType

impl Index<Span> for str

type Output = str

impl Index<Span> for str

type Output = str

impl Index<Span> for [u8]

type Output = [u8]

impl Index<Span> for [u8]

type Output = [u8]

impl Index<SpecialCodeIndex> for SpecialCodes

type Output = u8

impl<'a, K, Q, V> Index<&'a Q> for IndexMap<K, V>

where K: Borrow<Q> + Ord, Q: Ord,

type Output = V

impl<'a, K, T> Index<K> for http::header::map::HeaderMap<T>

where K: AsHeaderName,

type Output = T

impl<'a, K, V> Index<usize> for Keys<'a, 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 indexes. Similarly, if Keys is obtained from [Slice::keys], indexes 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<'h> Index<usize> for 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 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 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 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<'input, Endian> Index<usize> for EndianSlice<'input, Endian>

where Endian: Endianity,

type Output = u8

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

where Endian: Endianity,

type Output = [u8]

impl<'s, T, I> Index<I> for SliceVec<'s, T>

where I: SliceIndex<[T]>,

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

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

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

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

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<A, I> Index<I> for TinyVec<A>

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

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

impl<A, O, Idx> Index<Idx> for BitArray<A, O>

where A: BitViewSized, O: BitOrder, BitSlice<<A as BitView>::Store, O>: Index<Idx>,

type Output = <BitSlice<<A as BitView>::Store, O> as Index<Idx>>::Output

impl<I> Index<I> for 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 H256

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for String

where I: SliceIndex<str>,

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

impl<I> Index<I> for H160

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for H512

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for ElligatorSwift

where [u8]: Index<I>,

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

impl<I> Index<I> for H128

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for H384

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for H768

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for Hash

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for Hash

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for Hash

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for Hash

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for Hash

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for Hash

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for Hash

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for Hash

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for Keypair

where [u8]: Index<I>,

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

impl<I> Index<I> for Message

where [u8]: Index<I>,

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

impl<I> Index<I> for Midstate

where I: SliceIndex<[u8]>,

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

impl<I> Index<I> for PublicKey

where [u8]: Index<I>,

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

impl<I> Index<I> for RecoverableSignature

where [u8]: Index<I>,

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

impl<I> Index<I> for Scalar

where [u8]: Index<I>,

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

impl<I> Index<I> for SecretKey

where [u8]: Index<I>,

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

impl<I> Index<I> for Signature

where [u8]: Index<I>,

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

impl<I> Index<I> for Signature

where [u8]: Index<I>,

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

impl<I> Index<I> for XOnlyPublicKey

where [u8]: Index<I>,

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

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

where I: SliceIndex<[u8]>, T: Tag,

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

impl<I, T> Index<I> for StoreContext<'_, T>

where StoreData: Index<I>,

type Output = <StoreData as Index<I>>::Output

impl<I, T> Index<I> for StoreContextMut<'_, T>

where StoreData: Index<I>,

type Output = <StoreData as Index<I>>::Output

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

where T: SimdElement, LaneCount<N>: SupportedLaneCount, 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> Index<&Q> for std::collections::hash::map::HashMap<K, V, S>

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

type Output = V

impl<K, Q, V, S> Index<&Q> for AHashMap<K, V, S>

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

type Output = V

impl<K, Q, V, S, A> Index<&Q> for 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 HashMap<K, V, S, A>

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

type Output = V

impl<K, Q, V, S, A> Index<&Q> for 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 HashMap<K, V, S, A>

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

type Output = V

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

where K: AsHeaderName,

type Output = T

impl<K, V> Index<(Bound<usize>, Bound<usize>)> for Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<usize> for IndexMap<K, V>

type Output = V

impl<K, V> Index<usize> for Slice<K, V>

type Output = V

impl<K, V> Index<Range<usize>> for Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<RangeFrom<usize>> for Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<RangeFull> for Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<RangeInclusive<usize>> for Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<RangeTo<usize>> for Slice<K, V>

type Output = Slice<K, V>

impl<K, V> Index<RangeToInclusive<usize>> for Slice<K, V>

type Output = Slice<K, V>

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

where K: EntityRef,

Immutable indexing into a BoxedSlice. The indexed value must be in the map.

type Output = V

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

where K: EntityRef,

Immutable indexing into an PrimaryMap. The indexed value must be in the map.

type Output = V

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

where K: EntityRef, V: Clone,

Immutable indexing into an SecondaryMap.

All keys are permitted. Untouched entries have the default value.

type Output = V

impl<K, V, Q, S> Index<&Q> for indexmap::map::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, Q, S> Index<&Q> for 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, S> Index<(Bound<usize>, Bound<usize>)> for IndexMap<K, V, S>

type Output = Slice<K, V>

impl<K, V, S> Index<usize> for indexmap::map::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<usize> for 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<Range<usize>> for IndexMap<K, V, S>

type Output = Slice<K, V>

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

type Output = Slice<K, V>

impl<K, V, S> Index<RangeFull> for IndexMap<K, V, S>

type Output = Slice<K, V>

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

type Output = Slice<K, V>

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

type Output = Slice<K, V>

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

type Output = Slice<K, V>

impl<Q> Index<&Q> for 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<T> Index<(Bound<usize>, Bound<usize>)> for Slice<T>

type Output = Slice<T>

impl<T> Index<usize> for Hmac<T>

where T: Hash,

type Output = u8

impl<T> Index<usize> for IndexSet<T>

type Output = T

impl<T> Index<usize> for NonEmpty<T>

type Output = T

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

type Output = T

impl<T> Index<usize> for Slice<T>

type Output = T

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

where T: Hash,

type Output = [u8]

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

type Output = Slice<T>

impl<T> Index<RangeFrom<usize>> for Hmac<T>

where T: Hash,

type Output = [u8]

impl<T> Index<RangeFrom<usize>> for Slice<T>

type Output = Slice<T>

impl<T> Index<RangeFull> for Hmac<T>

where T: Hash,

type Output = [u8]

impl<T> Index<RangeFull> for Slice<T>

type Output = Slice<T>

impl<T> Index<RangeInclusive<usize>> for Slice<T>

type Output = Slice<T>

impl<T> Index<RangeTo<usize>> for Hmac<T>

where T: Hash,

type Output = [u8]

impl<T> Index<RangeTo<usize>> for Slice<T>

type Output = Slice<T>

impl<T> Index<RangeToInclusive<usize>> for Slice<T>

type Output = Slice<T>

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

type Output = T

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

type Output = T

impl<T> Index<PatternID> for gclient::ext::sp_runtime::app_crypto::Vec<T>

type Output = T

impl<T> Index<PatternID> for gclient::ext::sp_runtime::app_crypto::Vec<T>

type Output = T

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

type Output = T

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

type Output = T

impl<T> Index<SmallIndex> for gclient::ext::sp_runtime::app_crypto::Vec<T>

type Output = T

impl<T> Index<SmallIndex> for gclient::ext::sp_runtime::app_crypto::Vec<T>

type Output = T

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

type Output = T

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

type Output = T

impl<T> Index<StateID> for gclient::ext::sp_runtime::app_crypto::Vec<T>

type Output = T

impl<T> Index<StateID> for gclient::ext::sp_runtime::app_crypto::Vec<T>

type Output = T

impl<T> Index<T> for ModuleTypesBuilder

where ModuleTypes: Index<T>,

type Output = <ModuleTypes as Index<T>>::Output

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

where A: Allocator,

type Output = T

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

where I: SliceIndex<[T]>,

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

impl<T, I, A> Index<I> for gclient::ext::sp_runtime::app_crypto::Vec<T, A>

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

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

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, O> Index<usize> for BitSlice<T, O>

where T: BitStore, O: BitOrder,

type Output = bool

impl<T, O> Index<Range<usize>> for BitSlice<T, O>

where O: BitOrder, T: BitStore,

type Output = BitSlice<T, O>

impl<T, O> Index<RangeFrom<usize>> for BitSlice<T, O>

where O: BitOrder, T: BitStore,

type Output = BitSlice<T, O>

impl<T, O> Index<RangeFull> for BitSlice<T, O>

where O: BitOrder, T: BitStore,

type Output = BitSlice<T, O>

impl<T, O> Index<RangeInclusive<usize>> for BitSlice<T, O>

where O: BitOrder, T: BitStore,

type Output = BitSlice<T, O>

impl<T, O> Index<RangeTo<usize>> for BitSlice<T, O>

where O: BitOrder, T: BitStore,

type Output = BitSlice<T, O>

impl<T, O> Index<RangeToInclusive<usize>> for BitSlice<T, O>

where O: BitOrder, T: BitStore,

type Output = BitSlice<T, O>

impl<T, O, Idx> Index<Idx> for BitBox<T, O>

where T: BitStore, O: BitOrder, BitSlice<T, O>: Index<Idx>,

type Output = <BitSlice<T, O> as Index<Idx>>::Output

impl<T, O, Idx> Index<Idx> for BitVec<T, O>

where T: BitStore, O: BitOrder, BitSlice<T, O>: Index<Idx>,

type Output = <BitSlice<T, O> as Index<Idx>>::Output

impl<T, S> Index<(Bound<usize>, Bound<usize>)> for 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 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 IndexSet<T, S>

type Output = Slice<T>

impl<T, S> Index<RangeFrom<usize>> for IndexSet<T, S>

type Output = Slice<T>

impl<T, S> Index<RangeFull> for IndexSet<T, S>

type Output = Slice<T>

impl<T, S> Index<RangeInclusive<usize>> for IndexSet<T, S>

type Output = Slice<T>

impl<T, S> Index<RangeTo<usize>> for IndexSet<T, S>

type Output = Slice<T>

impl<T, S> Index<RangeToInclusive<usize>> for IndexSet<T, S>

type Output = Slice<T>

impl<T, S, I> Index<I> for BoundedVec<T, S>

where I: SliceIndex<[T]>,

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

impl<T, S, I> Index<I> for WeakBoundedVec<T, S>

where I: SliceIndex<[T]>,

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