Add biterator method that treats an integer as a set, iterating over each element where
the respective bit is set. For example 1101 would return 0, 2 and 3.
Provides fast HashSet and HashMap implementations based on a simplified implementation of
the fast Rust C hash algorithm also used by
Firefox.
By default, Rust’s HashMap and HashSet use a DDoS
resistant but slower hashing algorithm. FxHasher is much faster (between 2x to 5x from my testing).
Min heap more suitable for algorithms such as Dijkstra and A* than Rust’s default
max heap. Splits the sorting key and value, so that you can order items without having
to implement Ord on the value type.
Utility methods to spawn a number of
scoped
threads equals to the number of cores on the machine. Unlike normal threads, scoped threads
can borrow data from their environment.