     1
     2
     3
     4
     5
     6
     7
     8
     9
    10
    11
    12
    13
    14
    15
    16
    17

    /// An iterator whose items are random accessible efficiently
    ///
    /// # Safety
    ///
    /// The iterator's .len() and size_hint() must be exact.
    /// `.len()` must be cheap to call.
    ///
    /// .get_unchecked() must return distinct mutable references for distinct
    /// indices (if applicable), and must return a valid reference if index is in
    /// 0..self.len().
    #[doc(hidden)]
    pub unsafe trait TrustedRandomAccess : ExactSizeIterator {
        unsafe fn get_unchecked(&mut self, i: usize) -> Self::Item;
        /// Returns `true` if getting an iterator element may have
        /// side effects. Remember to take inner iterators into account.
        fn may_have_side_effect() -> bool;
    }

# Help

## Keyboard Shortcuts

`?`
  Show this help dialog
`S`
  Focus the search field
`↑`
  Move up in search results
`↓`
  Move down in search results
`↹`
  Switch tab
`⏎`
  Go to active search result
`+`
  Expand all sections
`-`
  Collapse all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g., `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g., `vec -> usize` or `* -> vec`)

Search multiple things at once by splitting your query with comma (e.g., `str,u8` or `String,struct:Vec,test`)