alloc_no_stdlib::allocated_memory

Trait Index

1.0.0 · Source
pub trait Index<Idx>
where Idx: ?Sized,
{ type Output: ?Sized; // Required method fn index(&self, index: Idx) -> &Self::Output; }
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§

1.0.0 · Source

type Output: ?Sized

The returned type after indexing.

Required Methods§

1.0.0 · 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§

1.47.0 · Source§

impl Index<RangeFrom<usize>> for CStr

Source§

impl<'a, T> Index<usize> for AllocatedStackMemory<'a, T>

Source§

impl<'a, T> Index<Range<usize>> for AllocatedStackMemory<'a, T>

1.0.0 · Source§

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

Source§

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

1.0.0 · Source§

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

1.50.0 · Source§

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

Source§

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

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

impl Index<Span> for str

impl Index<Span> for [u8]

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

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

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

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

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

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

impl<'a, T: 'a> Index<usize> for HeapPrealloc<'a, T>

impl<T> Index<usize> for WrapBox<T>

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

impl<T, I: SliceIndex<[T]>, A: Allocator> Index<I> for Vec<T, A>

impl<B: BitBlock> Index<usize> for BitVec<B>

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

impl<AllocU32: Allocator<u32>> Index<BucketPopIndex> for EntropyBucketPopulation<AllocU32>

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

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

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

impl<'a, T: 'a> Index<usize> for MemPool<'a, T>

impl<T> Index<usize> for WrapBox<T>

impl Index<&str> for ModuleEnv

impl Index<&Path> for Env

impl Index<usize> for Color32

impl Index<usize> for Rgba

impl Index<usize> for Align2

impl Index<usize> for Pos2

impl Index<usize> for Vec2

impl Index<usize> for Vec2b

impl Index<(usize, usize)> for FontImage

impl Index<u16> for AxesInfo

impl<T> Index<(usize, usize)> for Grid<T>

impl Index<Key> for Store

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,

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

impl<T> Index<usize> for RawLinks<T>

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

impl<P, Container> Index<(u32, u32)> for ImageBuffer<P, Container>
where P: Pixel, Container: Deref<Target = [P::Subpixel]>,

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

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

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

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

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

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

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

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

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

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

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

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

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

impl<K, V, Q, S> Index<&Q> for IndexMap<K, V, S>
where Q: Hash + Equivalent<K> + ?Sized, S: BuildHasher,

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

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

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

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

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

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

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

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

impl<T> Index<(Bound<usize>, Bound<usize>)> for Slice<T>

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

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

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

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

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

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

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

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

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

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

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

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

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

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

impl<I, J> Index<J> for LazyBuffer<I>
where I: Iterator, I::Item: Sized, Vec<I::Item>: Index<J>,

impl<K, V, S> Index<&K> for LiteMap<K, V, S>
where K: Ord, S: Store<K, V>,

impl Index<Span> for str

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

impl<T> Index<Handle<T>> for UniqueArena<T>

impl<T> Index<Range<T>> for Arena<T>

impl<T, U> Index<Handle<T>> for HandleVec<T, U>

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

impl Index<usize> for F32x2

impl Index<usize> for F32x4

impl Index<usize> for I32x2

impl Index<usize> for I32x4

impl Index<usize> for U32x2

impl Index<usize> for U32x4

impl Index<usize> for F32x2

impl Index<usize> for F32x4

impl Index<usize> for I32x2

impl Index<usize> for I32x4

impl Index<usize> for U32x4

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

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

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<EdgeIndex<Ix>> for StableGraph<N, E, Ty, Ix>
where Ty: EdgeType, Ix: IndexType,

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<NodeIndex<Ix>> for StableGraph<N, E, Ty, Ix>
where Ty: EdgeType, Ix: IndexType,

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

impl<'a, K, V, T> Index<&'a T> for Map<K, V>
where T: Eq + PhfHash + ?Sized, K: PhfBorrow<T>,

impl<'a, K, V, T> Index<&'a T> for OrderedMap<K, V>
where T: Eq + PhfHash + ?Sized, K: PhfBorrow<T>,

impl<'h> Index<usize> for Captures<'h>

impl<'h> Index<usize> for Captures<'h>

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

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

impl Index<Span> for str

impl Index<Span> for [u8]

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

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

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

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

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

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

impl Index<&Value> for Map

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

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

impl<T: PortKind> Index<PortIndex<T>> for Chunk

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

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

impl<A: Array, I: SliceIndex<[A::Item]>> Index<I> for SmallVec<A>

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

impl<T> Index<usize> for Values<T>

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

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

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

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

impl Index<Range<Position>> for Url

impl Index<RangeFull> for Url

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

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

impl Index<usize> for Cursor

impl<I: Internable> Index<Handle<I>> for DataStore<I>

impl<I: Internable> Index<Handle<I>> for Interner<I>

impl<T> Index<usize> for Store<T>

impl<T> Index<Index<T>> for Storage<T>

impl<T> Index<Range<T>> for Storage<T>

impl Index<AtomName> for Atoms

impl Index<usize> for BStr

impl Index<usize> for Bytes

impl Index<Range<usize>> for BStr

impl Index<Range<usize>> for Bytes

impl Index<RangeFull> for BStr

impl Index<RangeTo<usize>> for BStr

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