ral

Random access lists

https://github.com/phadej/vec

Version on this page:0.2.1@rev:3
LTS Haskell 24.24:0.2.2@rev:2
Stackage Nightly 2025-07-18:0.2.2@rev:2
Latest on Hackage:0.2.2@rev:2

See all snapshots ral appears in

GPL-2.0-or-later licensed by Oleg Grenrus
Maintained by Oleg.Grenrus
This version can be pinned in stack with:ral-0.2.1@sha256:5ceef547fa19313c5f8567db1f435d7f2ff773d515d64b93b37e04f1d71808a9,3687

Module documentation for 0.2.1

  • Data
    • Data.RAList
      • Data.RAList.NonEmpty
      • Data.RAList.Tree
    • Data.RAVec
      • Data.RAVec.NonEmpty
      • Data.RAVec.Tree
        • Data.RAVec.Tree.DF

This package provides ordinary random access list, RAList, and also a length indexed variant, RAVec.

The data structure allows fast cons-operation (like ordinary list) but also fast random access (like non-functional arrays).

For lens or optics support see ral-lens and ral-optics packages respectively.

Similar packages

These packages don't provide length-indexed variants, and their RAList has opaque structure.

Changes

Version history for ral

0.2.1

  • Add boring instances

0.2

  • fin-0.2 support
  • Add indexed-traversable instances
  • Explicitly mark all modules as Safe or Trustworthy.

0.1.1

  • Add reverse and itraverse_ to Data.RAVec.Tree
  • Add Data.RAVec.Tree.DF

0.1

  • First version. Released on an unsuspecting world.