rust std sync
lock free & wait free“Lock-free” and “wait-free” are two different approaches to designing concurrent algorithms and data structures. Both aim to provide efficient and non-blocking synchron…
Read articleTopic
4 notes filed under this topic.
lock free & wait free“Lock-free” and “wait-free” are two different approaches to designing concurrent algorithms and data structures. Both aim to provide efficient and non-blocking synchron…
Read articlesmart pointerRcA single-threaded reference-counting pointer. The inherent methods of Rc are all associated functions, which means that you have to call them as e.g., Rc::get_mut(&mut value)…
Read articlecollectionsBTreeMap clear(&mut self) Clears the map, removing all elements. get(&self, key: &Q) Returns a reference to the value corresponding to the key. get_key_value(&self, k: &Q) first_…
Read articlearrayA fixed-size array, denoted [T; N], for the element type, T, and the non-negative compile-time constant size, N. sliceA dynamically-sized view into a contiguous sequence, [T]. len(): R…
Read article