rrb-vector: Efficient RRB-Vectors

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]


An RRB-Vector is an efficient sequence data structure. It supports fast indexing, iteration, concatenation and splitting.

Comparison with Data.Sequence

Seq a is a container with a very similar API. RRB-Vectors are generally faster for indexing and iteration, while sequences are faster for access to the front/back (amortized \(O(1)\)).

[Skip to Readme]


Change log None available
Dependencies base (>=4.11 && <5), deepseq (>=1.4.3 && <1.5), indexed-traversable (>=0.1 && <0.2), primitive (>=0.7.1 && <0.8) [details]
License BSD-3-Clause
Copyright 2021 konsumlamm
Author konsumlamm
Maintainer konsumlamm@gmail.com
Category Data Structures
Home page https://github.com/konsumlamm/rrb-vector
Bug tracker https://github.com/konsumlamm/rrb-vector/issues
Source repo head: git clone https://github.com/konsumlamm/rbb-vector
Uploaded by konsumlamm at 2021-06-13T11:29:01Z


[Index] [Quick Jump]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Readme for rrb-vector-

[back to package description]


An implementation of a Relaxed Radix Balanced Vector (RRB-Vector).

For more information, see rrb-vector on Hackage.