The persistent-vector package

[Tags: bsd3, library]

This package provides persistent vectors based on array mapped tries. The implementation is based on the persistent vectors used in clojure, but in a Haskell-style API. The API is modeled after Data.Sequence from the containers library.

Technically, the element-wise operations are O(log(n)), but the underlying tree cannot be more than 7 or 8 levels deep so this is effectively constant time.

One change from the clojure implementation is that this version supports O(1) slicing, though it does cheat a little. Slices retain references to elements that cannot be indexed. These extra references (and the space they occupy) can be reclaimed by shrinking the slice. This seems like a reasonable tradeoff, and, I believe, mirrors the behavior of the vector library.

Highlights:


Properties

Versions0.1.0.0, 0.1.0.1
Dependenciesbase (==4.*), deepseq
LicenseBSD3
AuthorTristan Ravitch
Maintainertravitch@cs.wisc.edu
CategoryData
Home pagehttps://github.com/travitch/persistent-vector
Bug trackerhttps://github.com/travitch/persistent-vector/issues
Source repositoryhead: git clone git://github.com/travitch/persistent-vector.git
UploadedWed Aug 29 04:31:20 UTC 2012 by TristanRavitch
Downloads231 total (19 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees