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…

rust std smart pointer & interior mutability

smart 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)…

cryptography (1) group & field

Groupa group is a set of elements \( G \) together with an operation \( \circ \). a group has the following properties the group operation \( \circ \) is closed. that is, for all \( a,b, \i…

rust concurrency

Send and Sync A type is Send if it is safe to send it to another thread. A type is Sync if it is safe to share between threads (T is Sync if and only if &T is Send). raw pointers are neithe…

rust std data structure (2D)

collectionsBTreeMap 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_…

rust std data structure (1D)

arrayA 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…

rust functional programming

iterator iter() Returns an iterator over the slice into_iter() Creates a consuming iterator, that is, one that moves each value out of the vector iter_mut() Returns an iterator that allows …

rust crate serde

geth state prune

NOTE: Offline pruning is only for the hash-based state scheme. In future release, geth will have a path-based state scheme which enables the pruning by default. Once the hash-based state sc…