Collections

Sequences

• Vec
  • sort When applicable, unstable sorting is preferred because it is generally faster than stable sorting and it doesn't allocate auxiliary memory. The current algorithm is an adaptive, iterative merge sort inspired by timsort. It is designed to be very fast in cases where the slice is nearly sorted, or consists of two or more sorted sequences concatenated one after another. Also, it allocates temporary storage half the size of self, but for short slices a non-allocating insertion sort is used instead.
  • sort_unstable The current algorithm is based on pattern-defeating quicksort by Orson Peters, which combines the fast average case of randomized quicksort with the fast worst case of heapsort, while achieving linear time on slices with certain patterns. It uses some randomization to avoid degenerate cases, but with a fixed seed to always provide deterministic behavior. It is typically faster than stable sorting, except in a few special cases, e.g., when the slice consists of several concatenated sorted sequences.
• VecDeque
• LinkedList

Maps

• HashMap
• BTreeMap

Sets

• HashSet
• BTreeSet

Misc

• BinaryHeap

Made using

• luxon
• preact
• pure.css

Luxon pros/cons?

Link to GitHub repo