The ralist package
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.
|Dependencies||base (>=3 && <6) [details]|
|Uploaded||Thu May 17 21:06:46 UTC 2012 by LennartAugustsson|
|Downloads||344 total (6 in the last 30 days)|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees