# [−] [src] Struct keys::bytes::TaggedBytes

    pub struct TaggedBytes<T> { /* fields omitted */ }

Wrapper around `Vec<u8>` which represent associated type

## Methods

###

`impl<T> TaggedBytes<T>`

[src]

####

`pub fn new(bytes: Bytes) -> TaggedBytes<T>`

[src]

####
ⓘImportant traits for Bytes

### Important traits for Bytes

`impl Write for Bytes`

`pub fn into_raw(self) -> Bytes`

[src]

## Methods from Deref<Target = Vec<u8>>

####

`pub fn capacity(&self) -> usize`

1.0.0
[src]

Returns the number of elements the vector can hold without reallocating.

# Examples

    let vec: Vec<i32> = Vec::with_capacity(10);
    assert_eq!(vec.capacity(), 10);

####

`pub fn reserve(&mut self, additional: usize)`

1.0.0
[src]

Reserves capacity for at least `additional` more elements to be inserted in the given `Vec<T>`. The collection may reserve more space to avoid frequent reallocations. After calling `reserve`, capacity will be greater than or equal to `self.len() + additional`. Does nothing if capacity is already sufficient.

# Panics

Panics if the new capacity overflows `usize`.

# Examples

    let mut vec = vec![1];
    vec.reserve(10);
    assert!(vec.capacity() >= 11);

####

`pub fn reserve_exact(&mut self, additional: usize)`

1.0.0
[src]

Reserves the minimum capacity for exactly `additional` more elements to be inserted in the given `Vec<T>`. After calling `reserve_exact`, capacity will be greater than or equal to `self.len() + additional`. Does nothing if the capacity is already sufficient.

Note that the allocator may give the collection more space than it requests. Therefore capacity can not be relied upon to be precisely minimal. Prefer `reserve` if future insertions are expected.

# Panics

Panics if the new capacity overflows `usize`.

# Examples

    let mut vec = vec![1];
    vec.reserve_exact(10);
    assert!(vec.capacity() >= 11);

####

`pub fn try_reserve( &mut self, additional: usize ) -> Result<(), CollectionAllocErr>`

[src]

🔬 This is a nightly-only experimental API. (`try_reserve`)

new API

Tries to reserve capacity for at least `additional` more elements to be inserted in the given `Vec<T>`. The collection may reserve more space to avoid frequent reallocations. After calling `reserve`, capacity will be greater than or equal to `self.len() + additional`. Does nothing if capacity is already sufficient.

# Errors

If the capacity overflows, or the allocator reports a failure, then an error is returned.

# Examples

    #![feature(try_reserve)]
    use std::collections::CollectionAllocErr;

    fn process_data(data: &[u32]) -> Result<Vec<u32>, CollectionAllocErr> {
        let mut output = Vec::new();

        // Pre-reserve the memory, exiting if we can't
        output.try_reserve(data.len())?;

        // Now we know this can't OOM in the middle of our complex work
        output.extend(data.iter().map(|&val| {
            val * 2 + 5 // very complicated
        }));

        Ok(output)
    }

####

`pub fn try_reserve_exact( &mut self, additional: usize ) -> Result<(), CollectionAllocErr>`

[src]

🔬 This is a nightly-only experimental API. (`try_reserve`)

new API

Tries to reserves the minimum capacity for exactly `additional` more elements to be inserted in the given `Vec<T>`. After calling `reserve_exact`, capacity will be greater than or equal to `self.len() + additional`. Does nothing if the capacity is already sufficient.

Note that the allocator may give the collection more space than it requests. Therefore capacity can not be relied upon to be precisely minimal. Prefer `reserve` if future insertions are expected.

# Errors

If the capacity overflows, or the allocator reports a failure, then an error is returned.

# Examples

    #![feature(try_reserve)]
    use std::collections::CollectionAllocErr;

    fn process_data(data: &[u32]) -> Result<Vec<u32>, CollectionAllocErr> {
        let mut output = Vec::new();

        // Pre-reserve the memory, exiting if we can't
        output.try_reserve(data.len())?;

        // Now we know this can't OOM in the middle of our complex work
        output.extend(data.iter().map(|&val| {
            val * 2 + 5 // very complicated
        }));

        Ok(output)
    }

####

`pub fn shrink_to_fit(&mut self)`

1.0.0
[src]

Shrinks the capacity of the vector as much as possible.

It will drop down as close as possible to the length but the allocator may still inform the vector that there is space for a few more elements.

# Examples

    let mut vec = Vec::with_capacity(10);
    vec.extend([1, 2, 3].iter().cloned());
    assert_eq!(vec.capacity(), 10);
    vec.shrink_to_fit();
    assert!(vec.capacity() >= 3);

####

`pub fn shrink_to(&mut self, min_capacity: usize)`

[src]

🔬 This is a nightly-only experimental API. (`shrink_to`)

new API

Shrinks the capacity of the vector with a lower bound.

The capacity will remain at least as large as both the length and the supplied value.

Panics if the current capacity is smaller than the supplied minimum capacity.

# Examples

    #![feature(shrink_to)]
    let mut vec = Vec::with_capacity(10);
    vec.extend([1, 2, 3].iter().cloned());
    assert_eq!(vec.capacity(), 10);
    vec.shrink_to(4);
    assert!(vec.capacity() >= 4);
    vec.shrink_to(0);
    assert!(vec.capacity() >= 3);

####

`pub fn truncate(&mut self, len: usize)`

1.0.0
[src]

Shortens the vector, keeping the first `len` elements and dropping the rest.

If `len` is greater than the vector's current length, this has no effect.

The `drain` method can emulate `truncate`, but causes the excess elements to be returned instead of dropped.

Note that this method has no effect on the allocated capacity of the vector.

# Examples

Truncating a five element vector to two elements:

    let mut vec = vec![1, 2, 3, 4, 5];
    vec.truncate(2);
    assert_eq!(vec, [1, 2]);

No truncation occurs when `len` is greater than the vector's current length:

    let mut vec = vec![1, 2, 3];
    vec.truncate(8);
    assert_eq!(vec, [1, 2, 3]);

Truncating when `len == 0` is equivalent to calling the `clear` method.

    let mut vec = vec![1, 2, 3];
    vec.truncate(0);
    assert_eq!(vec, []);

####
ⓘImportant traits for &'a [ u8 ]

### Important traits for &'a [ u8 ]

`impl<'a> Read for &'a [u8]impl<'a> Write for &'a mut [u8]`

`pub fn as_slice(&self) -> &[T]`

1.7.0
[src]

Extracts a slice containing the entire vector.

Equivalent to `&s[..]`.

# Examples

    use std::io::{self, Write};
    let buffer = vec![1, 2, 3, 5, 8];
    io::sink().write(buffer.as_slice()).unwrap();

####
ⓘImportant traits for &'a [ u8 ]

### Important traits for &'a [ u8 ]

`impl<'a> Read for &'a [u8]impl<'a> Write for &'a mut [u8]`

`pub fn as_mut_slice(&mut self) -> &mut [T]`

1.7.0
[src]

Extracts a mutable slice of the entire vector.

Equivalent to `&mut s[..]`.

# Examples

    use std::io::{self, Read};
    let mut buffer = vec![0; 3];
    io::repeat(0b101).read_exact(buffer.as_mut_slice()).unwrap();

####

`pub unsafe fn set_len(&mut self, len: usize)`

1.0.0
[src]

Sets the length of a vector.

This will explicitly set the size of the vector, without actually modifying its buffers, so it is up to the caller to ensure that the vector is actually the specified size.

# Examples

    use std::ptr;

    let mut vec = vec!['r', 'u', 's', 't'];

    unsafe {
        ptr::drop_in_place(&mut vec[3]);
        vec.set_len(3);
    }
    assert_eq!(vec, ['r', 'u', 's']);

In this example, there is a memory leak since the memory locations owned by the inner vectors were not freed prior to the `set_len` call:

    let mut vec = vec![vec![1, 0, 0],
                       vec![0, 1, 0],
                       vec![0, 0, 1]];
    unsafe {
        vec.set_len(0);
    }

In this example, the vector gets expanded from zero to four items without any memory allocations occurring, resulting in vector values of unallocated memory:

    let mut vec: Vec<char> = Vec::new();

    unsafe {
        vec.set_len(4);
    }

####

`pub fn swap_remove(&mut self, index: usize) -> T`

1.0.0
[src]

Removes an element from the vector and returns it.

The removed element is replaced by the last element of the vector.

This does not preserve ordering, but is O(1).

# Panics

Panics if `index` is out of bounds.

# Examples

    let mut v = vec!["foo", "bar", "baz", "qux"];

    assert_eq!(v.swap_remove(1), "bar");
    assert_eq!(v, ["foo", "qux", "baz"]);

    assert_eq!(v.swap_remove(0), "foo");
    assert_eq!(v, ["baz", "qux"]);

####

`pub fn insert(&mut self, index: usize, element: T)`

1.0.0
[src]

Inserts an element at position `index` within the vector, shifting all elements after it to the right.

# Panics

Panics if `index > len`.

# Examples

    let mut vec = vec![1, 2, 3];
    vec.insert(1, 4);
    assert_eq!(vec, [1, 4, 2, 3]);
    vec.insert(4, 5);
    assert_eq!(vec, [1, 4, 2, 3, 5]);

####

`pub fn remove(&mut self, index: usize) -> T`

1.0.0
[src]

Removes and returns the element at position `index` within the vector, shifting all elements after it to the left.

# Panics

Panics if `index` is out of bounds.

# Examples

    let mut v = vec![1, 2, 3];
    assert_eq!(v.remove(1), 2);
    assert_eq!(v, [1, 3]);

####

`pub fn retain<F>(&mut self, f: F) where F: FnMut(&T) -> bool,`

1.0.0
[src]

Retains only the elements specified by the predicate.

In other words, remove all elements `e` such that `f(&e)` returns `false`. This method operates in place and preserves the order of the retained elements.

# Examples

    let mut vec = vec![1, 2, 3, 4];
    vec.retain(|&x| x%2 == 0);
    assert_eq!(vec, [2, 4]);

####

`pub fn dedup_by_key<F, K>(&mut self, key: F) where F: FnMut(&mut T) -> K, K: PartialEq<K>,`

1.16.0
[src]

Removes all but the first of consecutive elements in the vector that resolve to the same key.

If the vector is sorted, this removes all duplicates.

# Examples

    let mut vec = vec![10, 20, 21, 30, 20];

    vec.dedup_by_key(|i| *i / 10);

    assert_eq!(vec, [10, 20, 30, 20]);

####

`pub fn dedup_by<F>(&mut self, same_bucket: F) where F: FnMut(&mut T, &mut T) -> bool,`

1.16.0
[src]

Removes all but the first of consecutive elements in the vector satisfying a given equality relation.

The `same_bucket` function is passed references to two elements from the vector, and returns `true` if the elements compare equal, or `false` if they do not. The elements are passed in opposite order from their order in the vector, so if `same_bucket(a, b)` returns `true`, `a` is removed.

If the vector is sorted, this removes all duplicates.

# Examples

    let mut vec = vec!["foo", "bar", "Bar", "baz", "bar"];

    vec.dedup_by(|a, b| a.eq_ignore_ascii_case(b));

    assert_eq!(vec, ["foo", "bar", "baz", "bar"]);

####

`pub fn push(&mut self, value: T)`

1.0.0
[src]

Appends an element to the back of a collection.

# Panics

Panics if the number of elements in the vector overflows a `usize`.

# Examples

    let mut vec = vec![1, 2];
    vec.push(3);
    assert_eq!(vec, [1, 2, 3]);

####

`pub fn pop(&mut self) -> Option<T>`

1.0.0
[src]

Removes the last element from a vector and returns it, or `None` if it is empty.

# Examples

    let mut vec = vec![1, 2, 3];
    assert_eq!(vec.pop(), Some(3));
    assert_eq!(vec, [1, 2]);

####

`pub fn append(&mut self, other: &mut Vec<T>)`

1.4.0
[src]

Moves all the elements of `other` into `Self`, leaving `other` empty.

# Panics

Panics if the number of elements in the vector overflows a `usize`.

# Examples

    let mut vec = vec![1, 2, 3];
    let mut vec2 = vec![4, 5, 6];
    vec.append(&mut vec2);
    assert_eq!(vec, [1, 2, 3, 4, 5, 6]);
    assert_eq!(vec2, []);

####
ⓘImportant traits for Drain<'a, T>

### Important traits for Drain<'a, T>

`impl<'a, T> Iterator for Drain<'a, T> type Item = T;`

`pub fn drain<R>(&mut self, range: R) -> Drain<T> where R: RangeBounds<usize>,`

1.6.0
[src]

Creates a draining iterator that removes the specified range in the vector and yields the removed items.

Note 1: The element range is removed even if the iterator is only partially consumed or not consumed at all.

Note 2: It is unspecified how many elements are removed from the vector if the `Drain` value is leaked.

# Panics

Panics if the starting point is greater than the end point or if the end point is greater than the length of the vector.

# Examples

    let mut v = vec![1, 2, 3];
    let u: Vec<_> = v.drain(1..).collect();
    assert_eq!(v, &[1]);
    assert_eq!(u, &[2, 3]);

    // A full range clears the vector
    v.drain(..);
    assert_eq!(v, &[]);

####

`pub fn clear(&mut self)`

1.0.0
[src]

Clears the vector, removing all values.

Note that this method has no effect on the allocated capacity of the vector.

# Examples

    let mut v = vec![1, 2, 3];

    v.clear();

    assert!(v.is_empty());

####

`pub fn len(&self) -> usize`

1.0.0
[src]

Returns the number of elements in the vector, also referred to as its 'length'.

# Examples

    let a = vec![1, 2, 3];
    assert_eq!(a.len(), 3);

####

`pub fn is_empty(&self) -> bool`

1.0.0
[src]

Returns `true` if the vector contains no elements.

# Examples

    let mut v = Vec::new();
    assert!(v.is_empty());

    v.push(1);
    assert!(!v.is_empty());

####
ⓘImportant traits for Vec<u8>

### Important traits for Vec<u8>

`impl Write for Vec<u8>`

`pub fn split_off(&mut self, at: usize) -> Vec<T>`

1.4.0
[src]

Splits the collection into two at the given index.

Returns a newly allocated `Self`. `self` contains elements `[0, at)`, and the returned `Self` contains elements `[at, len)`.

Note that the capacity of `self` does not change.

# Panics

Panics if `at > len`.

# Examples

    let mut vec = vec![1,2,3];
    let vec2 = vec.split_off(1);
    assert_eq!(vec, [1]);
    assert_eq!(vec2, [2, 3]);

####

`pub fn resize_with<F>(&mut self, new_len: usize, f: F) where F: FnMut() -> T,`

[src]

🔬 This is a nightly-only experimental API. (`vec_resize_with`)

Resizes the `Vec` in-place so that `len` is equal to `new_len`.

If `new_len` is greater than `len`, the `Vec` is extended by the difference, with each additional slot filled with the result of calling the closure `f`. The return values from `f` will end up in the `Vec` in the order they have been generated.

If `new_len` is less than `len`, the `Vec` is simply truncated.

This method uses a closure to create new values on every push. If you'd rather `Clone` a given value, use `resize`. If you want to use the [`Default`] trait to generate values, you can pass [`Default::default()`] as the second argument..

# Examples

    #![feature(vec_resize_with)]

    let mut vec = vec![1, 2, 3];
    vec.resize_with(5, Default::default);
    assert_eq!(vec, [1, 2, 3, 0, 0]);

    let mut vec = vec![];
    let mut p = 1;
    vec.resize_with(4, || { p *= 2; p });
    assert_eq!(vec, [2, 4, 8, 16]);

####

`pub fn resize(&mut self, new_len: usize, value: T)`

1.5.0
[src]

Resizes the `Vec` in-place so that `len` is equal to `new_len`.

If `new_len` is greater than `len`, the `Vec` is extended by the difference, with each additional slot filled with `value`. If `new_len` is less than `len`, the `Vec` is simply truncated.

This method requires `Clone` to be able clone the passed value. If you need more flexibility (or want to rely on `Default` instead of `Clone`), use `resize_with`.

# Examples

    let mut vec = vec!["hello"];
    vec.resize(3, "world");
    assert_eq!(vec, ["hello", "world", "world"]);

    let mut vec = vec![1, 2, 3, 4];
    vec.resize(2, 0);
    assert_eq!(vec, [1, 2]);

####

`pub fn extend_from_slice(&mut self, other: &[T])`

1.6.0
[src]

Clones and appends all elements in a slice to the `Vec`.

Iterates over the slice `other`, clones each element, and then appends it to this `Vec`. The `other` vector is traversed in-order.

Note that this function is same as `extend` except that it is specialized to work with slices instead. If and when Rust gets specialization this function will likely be deprecated (but still available).

# Examples

    let mut vec = vec![1];
    vec.extend_from_slice(&[2, 3, 4]);
    assert_eq!(vec, [1, 2, 3, 4]);

####

`pub fn resize_default(&mut self, new_len: usize)`

[src]

🔬 This is a nightly-only experimental API. (`vec_resize_default`)

Resizes the `Vec` in-place so that `len` is equal to `new_len`.

If `new_len` is greater than `len`, the `Vec` is extended by the difference, with each additional slot filled with `Default::default()`. If `new_len` is less than `len`, the `Vec` is simply truncated.

This method uses `Default` to create new values on every push. If you'd rather `Clone` a given value, use `resize`.

# Examples

    #![feature(vec_resize_default)]

    let mut vec = vec![1, 2, 3];
    vec.resize_default(5);
    assert_eq!(vec, [1, 2, 3, 0, 0]);

    let mut vec = vec![1, 2, 3, 4];
    vec.resize_default(2);
    assert_eq!(vec, [1, 2]);

####

`pub fn dedup(&mut self)`

1.0.0
[src]

Removes consecutive repeated elements in the vector.

If the vector is sorted, this removes all duplicates.

# Examples

    let mut vec = vec![1, 2, 2, 3, 2];

    vec.dedup();

    assert_eq!(vec, [1, 2, 3, 2]);

####

`pub fn remove_item(&mut self, item: &T) -> Option<T>`

[src]

🔬 This is a nightly-only experimental API. (`vec_remove_item`)

recently added

Removes the first instance of `item` from the vector if the item exists.

# Examples

    let mut vec = vec![1, 2, 3, 1];

    vec.remove_item(&1);

    assert_eq!(vec, vec![2, 3, 1]);

####
ⓘImportant traits for Splice<'a, I>

### Important traits for Splice<'a, I>

`impl<'a, I> Iterator for Splice<'a, I> where
I: Iterator, type Item = <I as Iterator>::Item;`

`pub fn splice<R, I>( &mut self, range: R, replace_with: I ) -> Splice<<I as IntoIterator>::IntoIter> where I: IntoIterator<Item = T>, R: RangeBounds<usize>,`

1.21.0
[src]

Creates a splicing iterator that replaces the specified range in the vector with the given `replace_with` iterator and yields the removed items. `replace_with` does not need to be the same length as `range`.

Note 1: The element range is removed even if the iterator is not consumed until the end.

Note 2: It is unspecified how many elements are removed from the vector, if the `Splice` value is leaked.

Note 3: The input iterator `replace_with` is only consumed when the `Splice` value is dropped.

Note 4: This is optimal if:

- The tail (elements in the vector after `range`) is empty,
- or `replace_with` yields fewer elements than `range`’s length
- or the lower bound of its `size_hint()` is exact.

Otherwise, a temporary vector is allocated and the tail is moved twice.

# Panics

Panics if the starting point is greater than the end point or if the end point is greater than the length of the vector.

# Examples

    let mut v = vec![1, 2, 3];
    let new = [7, 8];
    let u: Vec<_> = v.splice(..2, new.iter().cloned()).collect();
    assert_eq!(v, &[7, 8, 3]);
    assert_eq!(u, &[1, 2]);

####
ⓘImportant traits for DrainFilter<'a, T, F>

### Important traits for DrainFilter<'a, T, F>

`impl<'a, T, F> Iterator for DrainFilter<'a, T, F> where
F: FnMut(&mut T) -> bool, type Item = T;`

`pub fn drain_filter<F>(&mut self, filter: F) -> DrainFilter<T, F> where F: FnMut(&mut T) -> bool,`

[src]

🔬 This is a nightly-only experimental API. (`drain_filter`)

recently added

Creates an iterator which uses a closure to determine if an element should be removed.

If the closure returns true, then the element is removed and yielded. If the closure returns false, the element will remain in the vector and will not be yielded by the iterator.

Using this method is equivalent to the following code:

    let mut i = 0;
    while i != vec.len() {
        if some_predicate(&mut vec[i]) {
            let val = vec.remove(i);
            // your code here
        } else {
            i += 1;
        }
    }

But `drain_filter` is easier to use. `drain_filter` is also more efficient, because it can backshift the elements of the array in bulk.

Note that `drain_filter` also lets you mutate every element in the filter closure, regardless of whether you choose to keep or remove it.

# Examples

Splitting an array into evens and odds, reusing the original allocation:

    #![feature(drain_filter)]
    let mut numbers = vec![1, 2, 3, 4, 5, 6, 8, 9, 11, 13, 14, 15];

    let evens = numbers.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
    let odds = numbers;

    assert_eq!(evens, vec![2, 4, 6, 8, 14]);
    assert_eq!(odds, vec![1, 3, 5, 9, 11, 13, 15]);

## Trait Implementations

###

`impl<T> PartialEq<TaggedBytes<T>> for TaggedBytes<T> where T: PartialEq<T>,`

[src]

####

`fn eq(&self, other: &TaggedBytes<T>) -> bool`

[src]

This method tests for `self` and `other` values to be equal, and is used by `==`. Read more

####

`fn ne(&self, other: &TaggedBytes<T>) -> bool`

[src]

This method tests for `!=`.

###

`impl<T> Deref for TaggedBytes<T>`

[src]

#### `type Target = Vec<u8>`

The resulting type after dereferencing.

####

`fn deref(&self) -> &<TaggedBytes<T> as Deref>::Target`

[src]

Dereferences the value.

###

`impl<T> AsMut<[u8]> for TaggedBytes<T>`

[src]

####
ⓘImportant traits for &'a [ u8 ]

### Important traits for &'a [ u8 ]

`impl<'a> Read for &'a [u8]impl<'a> Write for &'a mut [u8]`

`fn as_mut(&mut self) -> &mut [u8]`

[src]

Performs the conversion.

###

`impl<T> AsRef<[u8]> for TaggedBytes<T>`

[src]

####
ⓘImportant traits for &'a [ u8 ]

### Important traits for &'a [ u8 ]

`impl<'a> Read for &'a [u8]impl<'a> Write for &'a mut [u8]`

`fn as_ref(&self) -> &[u8]`

[src]

Performs the conversion.

###

`impl<T> Clone for TaggedBytes<T> where T: Clone,`

[src]

####

`fn clone(&self) -> TaggedBytes<T>`

[src]

Returns a copy of the value. Read more

####

`fn clone_from(&mut self, source: &Self)`

1.0.0
[src]

Performs copy-assignment from `source`. Read more

###

`impl<T> DerefMut for TaggedBytes<T>`

[src]

####

`fn deref_mut(&mut self) -> &mut <TaggedBytes<T> as Deref>::Target`

[src]

Mutably dereferences the value.

###

`impl<T> Default for TaggedBytes<T> where T: Default,`

[src]

####

`fn default() -> TaggedBytes<T>`

[src]

Returns the "default value" for a type. Read more

## Auto Trait Implementations

###

`impl<T> Send for TaggedBytes<T> where T: Send,`

###

`impl<T> Sync for TaggedBytes<T> where T: Sync,`

## Blanket Implementations

###

`impl<T> ToOwned for T where T: Clone,`

[src]

#### `type Owned = T`

####

`fn to_owned(&self) -> T`

[src]

Creates owned data from borrowed data, usually by cloning. Read more

####

`fn clone_into(&self, target: &mut T)`

[src]

🔬 This is a nightly-only experimental API. (`toowned_clone_into`)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

###

`impl<T> From for T`

[src]

####

`fn from(t: T) -> T`

[src]

Performs the conversion.

###

`impl<T, U> Into for T where U: From<T>,`

[src]

####

`fn into(self) -> U`

[src]

Performs the conversion.

###

`impl<T, U> TryFrom for T where T: From<U>,`

[src]

#### `type Error = !`

🔬 This is a nightly-only experimental API. (`try_from`)

The type returned in the event of a conversion error.

####

`fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>`

[src]

🔬 This is a nightly-only experimental API. (`try_from`)

Performs the conversion.

###

`impl<T> Borrow for T where T: ?Sized,`

[src]

####
ⓘImportant traits for &'a mut R

### Important traits for &'a mut R

`impl<'a, R> Read for &'a mut R where
R: Read + ?Sized, impl<'a, W> Write for &'a mut W where
W: Write + ?Sized, impl<'a, I> Iterator for &'a mut I where
I: Iterator + ?Sized, type Item = <I as Iterator>::Item;`

`fn borrow(&self) -> &T`

[src]

Immutably borrows from an owned value. Read more

###

`impl<T, U> TryInto for T where U: TryFrom<T>,`

[src]

#### `type Error = <U as TryFrom<T>>::Error`

🔬 This is a nightly-only experimental API. (`try_from`)

The type returned in the event of a conversion error.

####

`fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>`

[src]

🔬 This is a nightly-only experimental API. (`try_from`)

Performs the conversion.

###

`impl<T> BorrowMut for T where T: ?Sized,`

[src]

####
ⓘImportant traits for &'a mut R

### Important traits for &'a mut R

`impl<'a, R> Read for &'a mut R where
R: Read + ?Sized, impl<'a, W> Write for &'a mut W where
W: Write + ?Sized, impl<'a, I> Iterator for &'a mut I where
I: Iterator + ?Sized, type Item = <I as Iterator>::Item;`

`fn borrow_mut(&mut self) -> &mut T`

[src]

Mutably borrows from an owned value. Read more

###

`impl<T> Any for T where T: 'static + ?Sized,`

[src]

####

`fn get_type_id(&self) -> TypeId`

[src]

🔬 This is a nightly-only experimental API. (`get_type_id`)

this method will likely be replaced by an associated static

Gets the `TypeId` of `self`. Read more

# 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`)