Package0.2.2DataDependent TypesSingletons
ral
Random access lists
- Version0.2.2
- CategoryData, Dependent Types, Singletons
- LicenceGPL-2.0-or-later
- AuthorOleg Grenrus <oleg.grenrus@iki.fi>
- MaintainerOleg.Grenrus <oleg.grenrus@iki.fi>
- Homepagegithub.com/phadej/vec
- Pinned byhackage ral 0.2.2
- Sourcehackage.haskell.org/package/ral-0.2.2
Modules
7 modules- Data.RAList18Random access list. This module is designed to imported qualifed.
- Data.RAList.NonEmpty26Non-empty random access list. This module is designed to imported qualifed.
- Data.RAList.Tree3
- Data.RAVec33Length-indexed random access list. See http://www.staff.science.uu.nl/~swier004/publications/2019-jfp-submission.pdf
- Data.RAVec.NonEmpty63Non-empty length-indexed random access list.
- Data.RAVec.Tree35Depth indexed perfect binary tree.
- Data.RAVec.Tree.DF38Depth indexed perfect tree as data family.
Description
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.
These packages don't provide length-indexed variants, and their RAList has opaque structure.
https://hackage.haskell.org/package/ralist https://hackage.haskell.org/package/random-access-list
Depends on
11 packages- QuickCheck-2.18.0.0in this set
- adjunctions-4.4.4in this set
- base-4.22.0.0with GHC
- bin-0.1.4.1in this set
- boring-0.2.2.1in this set
- deepseq-1.5.1.0with GHC
- distributive-0.6.3in this set
- fin-0.3.2in this set
- hashable-1.5.1.0in this set
- indexed-traversable-0.1.5in this set
- semigroupoids-6.0.2in this set
Used by in this set · 0
Nothing in this set depends on it.