Just released version 1.2.0 of elm-deque.
Deque (double-ended queue) is a data structure which promises the same speed of operation wether you’re modifying or reading from the front or back of the deque. This in comparison with the builtin
List, which is only fast if reading/modifiying from the start of the list.
In this version I’ve added
range to make it easier and faster to construct a deque.
In addition, the performance of the structure is now more stable than before, and the performance of
dropRight has increased by 4-5x.
Do check it out: https://package.elm-lang.org/packages/Skinney/elm-deque/latest/