Struct VecWithPositionsAllDifferent 

pub struct VecWithPositionsAllDifferent<T> { /* private fields */ }

Example: Several threads use a pool of network nodes to download from. From the pool we “view” a range of currently used nodes, one by thread. If a note is invalidated, it is removed from the list and the lacking thread is moved to the end of the list receiving a new node. Nodes later than it in the range decrease their positions. Despite of the name, positions can be the same, if shortage of the pool.

Implementations

impl<T> VecWithPositionsAllDifferent<T>

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

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

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

pub fn clear(&mut self)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn new_position(&mut self) -> Position

pub fn get(&self, index: usize) -> Option<&T>

pub fn get_mut(&mut self, index: usize) -> Option<&mut T>

pub fn set(&mut self, index: usize, value: T)

pub fn get_by_position(&self, pos: Position) -> Option<&T>

pub fn get_mut_by_position(&mut self, pos: Position) -> Option<&mut T>

pub fn set_by_position(&mut self, pos: Position, value: T)