Trait rocket::mtls::oid::asn1_rs::nom::lib::std::ops::Index

1.0.0 · source ·
pub trait Index<Idx>
where Idx: ?Sized,
{ type Output: ?Sized; // Required method fn index(&self, index: Idx) -> &Self::Output; }
Available on crate feature mtls only.
Expand description

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§

source

type Output: ?Sized

The returned type after indexing.

Required Methods§

source

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<usize> for BStr

§

type Output = u8

§

impl Index<usize> for Bytes

§

type Output = u8

source§

impl Index<Range<usize>> for String

§

type Output = str

source§

impl Index<Range<usize>> for UninitSlice

§

impl Index<Range<usize>> for BStr

§

type Output = BStr

§

impl Index<Range<usize>> for Bytes

§

type Output = Bytes

§

impl Index<Range<usize>> for InlinableString

§

type Output = str

§

impl Index<Range<usize>> for InlineString

§

type Output = str

source§

impl Index<RangeFrom<usize>> for String

§

type Output = str

1.47.0 · source§

impl Index<RangeFrom<usize>> for CStr

§

type Output = CStr

source§

impl Index<RangeFrom<usize>> for UninitSlice

§

impl Index<RangeFrom<usize>> for BStr

§

type Output = BStr

§

impl Index<RangeFrom<usize>> for Bytes

§

type Output = Bytes

§

impl Index<RangeFrom<usize>> for InlinableString

§

type Output = str

§

impl Index<RangeFrom<usize>> for InlineString

§

type Output = str

source§

impl Index<RangeFull> for String

§

type Output = str

1.7.0 · source§

impl Index<RangeFull> for CString

§

type Output = CStr

source§

impl Index<RangeFull> for OsString

source§

impl Index<RangeFull> for UninitSlice

§

impl Index<RangeFull> for BStr

§

type Output = BStr

§

impl Index<RangeFull> for Bytes

§

type Output = Bytes

§

impl Index<RangeFull> for InlinableString

§

type Output = str

§

impl Index<RangeFull> for InlineString

§

type Output = str

1.26.0 · source§

impl Index<RangeInclusive<usize>> for String

§

type Output = str

source§

impl Index<RangeInclusive<usize>> for UninitSlice

§

impl Index<RangeInclusive<usize>> for BStr

§

type Output = BStr

§

impl Index<RangeInclusive<usize>> for Bytes

§

type Output = Bytes

source§

impl Index<RangeTo<usize>> for String

§

type Output = str

source§

impl Index<RangeTo<usize>> for UninitSlice

§

impl Index<RangeTo<usize>> for BStr

§

type Output = BStr

§

impl Index<RangeTo<usize>> for Bytes

§

type Output = Bytes

§

impl Index<RangeTo<usize>> for InlinableString

§

type Output = str

§

impl Index<RangeTo<usize>> for InlineString

§

type Output = str

1.26.0 · source§

impl Index<RangeToInclusive<usize>> for String

§

type Output = str

source§

impl Index<RangeToInclusive<usize>> for UninitSlice

§

impl Index<RangeToInclusive<usize>> for BStr

§

type Output = BStr

§

impl Index<RangeToInclusive<usize>> for Bytes

§

type Output = Bytes

§

impl<'a> Index<usize> for BerObject<'a>

§

type Output = BerObject<'a>

source§

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

§

type Output = T

§

impl<'a, K, T> Index<K> for HeaderMap<T>
where K: AsHeaderName,

§

type Output = T

source§

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

source§

impl<'a, Q> Index<&'a Q> for serde_json::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.

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

impl<'a, Q> Index<&'a 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.

§

type Output = Value

§

impl<'s> Index<&'s str> for Document

§

type Output = Item

§

impl<'s> Index<&'s str> for InlineTable

§

type Output = Value

§

impl<'s> Index<&'s str> for Table

§

type Output = Item

§

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

source§

impl<I> Index<I> for rocket::serde::json::Value
where I: Index,

source§

impl<I> Index<I> for str
where I: SliceIndex<str>,

§

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

§

impl<I> Index<I> for RawStr
where I: SliceIndex<str, Output = str>,

§

impl<I> Index<I> for UncasedStr
where I: SliceIndex<str, Output = str>,

§

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

§

type Output = Item

§

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

§

type Output = Value

source§

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

§

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

source§

impl<I: SliceIndex<str, Output = str>> Index<I> for Key

§

type Output = Key

source§

impl<I: SliceIndex<str, Output = str>> Index<I> for Name

§

type Output = Name

source§

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

source§

impl<K, Q, V, S> Index<&Q> for rocket::mtls::oid::asn1_rs::nom::lib::std::collections::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, Q: Hash + Equivalent<K> + ?Sized, S: BuildHasher, A: Allocator,

§

type Output = V

source§

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

§

type Output = Slice<K, V>

source§

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

§

type Output = V

source§

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

§

type Output = Slice<K, V>

source§

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

§

type Output = Slice<K, V>

source§

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

§

type Output = Slice<K, V>

source§

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

§

type Output = Slice<K, V>

source§

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

§

type Output = Slice<K, V>

source§

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

§

type Output = Slice<K, V>

source§

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

source§

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

§

type Output = Slice<K, V>

source§

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

source§

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

§

type Output = Slice<K, V>

source§

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

§

type Output = Slice<K, V>

source§

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

§

type Output = Slice<K, V>

source§

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

§

type Output = Slice<K, V>

source§

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

§

type Output = Slice<K, V>

source§

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

§

type Output = Slice<K, V>

source§

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

§

type Output = Slice<T>

source§

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

§

type Output = T

§

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

§

type Output = T

source§

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

§

type Output = Slice<T>

source§

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

§

type Output = Slice<T>

source§

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

§

type Output = Slice<T>

source§

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

§

type Output = Slice<T>

source§

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

§

type Output = Slice<T>

source§

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

§

type Output = Slice<T>

source§

impl<T, A> Index<usize> for VecDeque<T, A>
where A: Allocator,

§

type Output = T

source§

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

§

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

source§

impl<T, I, A> Index<I> for rocket::mtls::oid::asn1_rs::nom::lib::std::vec::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

1.50.0 · source§

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

§

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

source§

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

§

type Output = Slice<T>

source§

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

source§

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

§

type Output = Slice<T>

source§

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

§

type Output = Slice<T>

source§

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

§

type Output = Slice<T>

source§

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

§

type Output = Slice<T>

source§

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

§

type Output = Slice<T>

source§

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

§

type Output = Slice<T>