Description
Provides a generic finger-tree data structure with example instances. Finger trees are useful for building sequences and priority-like structures that need efficient access near the ends and flexible measurements.
This is intended for Haskell developers implementing data structures, parsers, editors, or performance-sensitive libraries. It is a code library and not a standalone utility.