rrb-vector

Efficient RRB-Vectors

https://github.com/konsumlamm/rrb-vector

Version on this page:0.2.1.0
LTS Haskell 22.43:0.2.1.0
Stackage Nightly 2024-11-25:0.2.2.1
Latest on Hackage:0.2.2.1

See all snapshots rrb-vector appears in

BSD-3-Clause licensed by konsumlamm
Maintained by [email protected]
This version can be pinned in stack with:rrb-vector-0.2.1.0@sha256:5dc46d0db2bf3241776138b99a43a8b42fba3c516405ecb14136d192fec003ca,2543

Module documentation for 0.2.1.0

rbb-vector

An implementation of a Relaxed Radix Balanced Vector (RRB-Vector), an efficient sequence data structure. It supports fast indexing, iteration, concatenation and splitting.

For more information, see rrb-vector on Hackage.

Changes

0.2.1.0 - December 2023

  • Add findIndexL, findIndexR, findIndicesL, findIndicesR
  • Fix bug in |> & <| (#10)

0.2.0.1 - October 2023

  • Support primitive-0.9 and deepseq-1.5

0.2.0.0 - February 2023

  • Add map' & unzipWith

  • Make zip & unzip more strict

  • Make all functions strict in the index

  • Make the FoldableWithIndex, FunctorWithIndex, TraversableWithIndex instances more efficient

  • Implement ifoldMap in the FoldableWithIndex instance

  • Implement fail in the Monad instance

  • Add Shift, Tree and unidirectional pattern synonyms for Vector and Tree to Data.RRBVector.Internal.Debug

  • Support primitive-0.8

  • Test typeclass laws

0.1.1.0 - August 2021

  • Add replicate

  • Various optimizations

  • Switch to the tasty framework for benchmarks and tests

  • Extend the test suite

    • Add properties for more functions and some typeclass instances
    • Add strictness tests

0.1.0.0 - June 2021

  • Initial release