@hackage rrb-vector0.2.2.1

Efficient RRB-Vectors

Categories
- Data Structures
License
BSD-3-Clause
Maintainer
konsumlamm@gmail.com
Links
Versions
- 0.2.2.1 Wed, 17 Jul 2024
- 0.2.2.0 Wed, 17 Jul 2024
- 0.2.1.0 Sat, 2 Dec 2023
- 0.2.0.1 Sun, 8 Oct 2023
- 0.2.0.0 Tue, 21 Feb 2023

Installation
In your cabal file:
Tested Compilers
Dependencies (5)
- base >=4.11 && <5
- deepseq >=1.4.3 && <1.6
- primitive >=0.7.3 && <0.10
- indexed-traversable ^>=0.1
- samsort ^>=0.1
Dependents (2)
@hackage/pvector, @hackage/named-binary-tag

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)\)).

@hackage rrb-vector0.2.2.1

Categories

License

Maintainer

Links

Versions

Installation

Tested Compilers

Dependencies (5)

Dependents (2)

Comparison with Data.Sequence