Several simple implements of functional queue data structures in Elixir.
FList a functional list implement using the efficient data structure of fingertree. Any operation in the front and the back is amortized O(1) and the operations involved randomly visiting are O(log n).
This is the functional implement of van Emde Boas Tree, which can maintain the information of Integers efficiently.
Vebmap combines RS-vEB and Map together, making it easy to use.