ralist: Random access list with a list compatible interface.

[ bsd3, data-structures, library ] [ Propose Tags ]

Random access list with a list compatible interface. Random access list have same complexity as lists with some exceptions, the notable one being that (!!) is O(log n) instead of O(n). RALists have to be finite.

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.1.0.0, 0.2.0.0, 0.2.1.0, 0.2.1.1, 0.3.0.0, 0.4.0.0 (info)
Change log changelog.md
Dependencies base (>=4.12 && <6), deepseq (>=1.4.4.0 && <1.5), indexed-traversable (>=0.1 && <0.2), transformers (>=0.5 && <0.7) [details]
License BSD-3-Clause
Author Lennart Augustsson, Carter Schonwald
Maintainer Carter Schonwald
Revised Revision 1 made by CarterSchonwald at 2023-08-11T02:30:00Z
Category Data Structures
Home page http://github.com/cartazio/ralist
Source repo head: git clone https://github.com/cartazio/ralist.git
Uploaded by CarterSchonwald at 2021-10-08T14:55:52Z
Distributions
Reverse Dependencies 2 direct, 0 indirect [details]
Downloads 3042 total (24 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2021-10-08 [all 1 reports]