Description
A Haskell library implementing a generic finger-tree structure with example instances. Finger trees support efficient access and updates near both ends and can be adapted to sequences, priority queues, and measured structures.
Developers use it for advanced data structures that need good asymptotic behavior and flexible annotations. The measure used by a finger tree should match the operations the application needs.