ralist: Random access list with a list compatible interface.
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.
|Versions [faq]||0.1.0.0, 0.2.0.0, 0.2.1.0, 0.2.1.1 (info)|
|Dependencies||base (>=4.8 && <6), fail (==4.9.*), semigroups (==0.18.*) [details]|
|Author||Lennart Augustsson, Carter Schonwald|
|Revised||Revision 1 made by CarterSchonwald at Wed May 1 21:22:28 UTC 2019|
|Source repo||head: git clone https://github.com/cartazio/ralist.git|
|Uploaded||by CarterSchonwald at Thu Nov 22 19:06:56 UTC 2018|
|Downloads||1570 total (57 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2018-11-22 [all 1 reports]
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'.
For package maintainers and hackage trustees