[−][src]Struct safe_index::examples::clients::idx::Files

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

Map from files to something.

Implementations

`impl<T> Files<T>`[src]

`pub fn of(vec: Vec<T>) -> Self`[src]

Creates an empty map from an existing one.

`pub fn new() -> Self`[src]

Creates an empty map.

`pub fn with_capacity(capacity: usize) -> Self`[src]

Creates an empty map with some capacity.

`pub fn reserve(&mut self, capa: usize)`[src]

Reserves some space for the map.

`pub fn get(&self, uid: File) -> Option<&T>`[src]

Retrieves an entry in the map.

`pub fn get_mut(&mut self, uid: File) -> Option<&mut T>`[src]

Retrieves an entry in the map.

`pub fn last(&self) -> Option<&T>`[src]

Retrieves the last entry in the map.

`pub fn last_mut(&self) -> Option<&T>`[src]

Retrieves the last entry in the map.

`pub fn len(&self) -> usize`[src]

Number of elements in the map.

`pub fn capacity(&self) -> usize`[src]

Capacity of the map.

`pub fn next_index(&self) -> File`[src]

The next free index (wrapped self.len()).

`pub fn last_index(&self) -> Option<File>`[src]

The last index in the map.

`pub fn push(&mut self, elem: T) -> File`[src]

Pushes an element.

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

Pops an element.

This function is unsafe for the logics of safe indices. This function voids indices previously created (indices for the last element on entry) and should be used with great care.

`pub fn clear(&mut self)`[src]

Clears a map.

`pub fn iter(&self) -> Iter<'_, T>`[src]

Iterates over the elements.

`pub fn index_iter<'a>(&'a self) -> FileIter<&'a Files<T>>ⓘNotable traits for FileIter<&'a Files<T>> impl<'a, T: 'a> Iterator for FileIter<&'a Files<T>> type Item = (File, &'a T);impl<'a, T: 'a> Iterator for FileIter<IterMut<'a, T>> type Item = (File, &'a mut T);impl<T> Iterator for FileIter<Files<T>> type Item = (File, T); where T: 'a,` [src]

Iterates over the elements with the index.

`pub fn index_iter_mut<'a>(&'a mut self) -> FileIter<IterMut<'a, T>>ⓘNotable traits for FileIter<&'a Files<T>> impl<'a, T: 'a> Iterator for FileIter<&'a Files<T>> type Item = (File, &'a T);impl<'a, T: 'a> Iterator for FileIter<IterMut<'a, T>> type Item = (File, &'a mut T);impl<T> Iterator for FileIter<Files<T>> type Item = (File, T); where T: 'a,` [src]

Iterates over the elements with the index, mutable version.

`pub fn into_index_iter(self) -> FileIter<Files<T>>ⓘNotable traits for FileIter<&'a Files<T>> impl<'a, T: 'a> Iterator for FileIter<&'a Files<T>> type Item = (File, &'a T);impl<'a, T: 'a> Iterator for FileIter<IterMut<'a, T>> type Item = (File, &'a mut T);impl<T> Iterator for FileIter<Files<T>> type Item = (File, T);`[src]

Iterates over the elements with the index.

`pub fn iter_mut(&mut self) -> IterMut<'_, T>`[src]

Iterates over the elements (mutable version).

`pub fn shrink_to_fit(&mut self)`[src]

Shrinks the capacity as much as possible.

`pub fn swap(&mut self, a: File, b: File)`[src]

Swap from Vec.

`pub fn swap_remove(&mut self, idx: File) -> T`[src]

Swap remove from Vec.

This function is unsafe for the logics of safe indices. This function voids indices previously created (indices for the last element on entry) and should be used with great care.

`pub fn split( &self, idx: File ) -> (impl Iterator<Item = &T>, &T, impl Iterator<Item = &T>)`[src]

Splits the map into the elements before and after some index.

More precisely, returns a tuple of

an iterator over the elements before idx,
the element at position idx, and
an iterator over the elements after idx.

`impl<T: Clone> Files<T>`[src]

`pub fn of_elems(elem: T, size: usize) -> Self`[src]

Creates an empty vector with some capacity.

Methods from Deref<Target = Vec<T>>

`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 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();

`pub fn as_ptr(&self) -> *const T`1.37.0[src]

Returns a raw pointer to the vector's buffer.

The caller must ensure that the vector outlives the pointer this function returns, or else it will end up pointing to garbage. Modifying the vector may cause its buffer to be reallocated, which would also make any pointers to it invalid.

The caller must also ensure that the memory the pointer (non-transitively) points to is never written to (except inside an UnsafeCell) using this pointer or any pointer derived from it. If you need to mutate the contents of the slice, use as_mut_ptr.

Examples

let x = vec![1, 2, 4];
let x_ptr = x.as_ptr();

unsafe {
    for i in 0..x.len() {
        assert_eq!(*x_ptr.add(i), 1 << i);
    }
}

`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());

Trait Implementations

`impl<T: Clone> Clone for Files<T>`[src]

`fn clone(&self) -> Self`[src]

`fn clone_from(&mut self, source: &Self)`1.0.0[src]

`impl<T: Debug> Debug for Files<T>`[src]

`fn fmt(&self, f: &mut Formatter<'_>) -> Result`[src]

`impl<T> Default for Files<T>`[src]

`fn default() -> Self`[src]

`impl<T> Deref for Files<T>`[src]

`type Target = Vec<T>`

The resulting type after dereferencing.

`fn deref(&self) -> &Vec<T>`[src]

`impl<T: Eq> Eq for Files<T>`[src]

`impl<T> From<Vec<T>> for Files<T>`[src]

`fn from(vec: Vec<T>) -> Self`[src]