Strict catenable list implementation for PureScript.
The implementation is based on a queue data type that is backed by a pair of lists.
See the following references for further information.
- Simple and Efficient Purely Functional Queues and Dequeues (Okasaki 1995)
- Purely Functional Data Structures (Okasaki 1996)
bower install --save purescript-catenable-lists
Module documentation is published on Pursuit.