nonempty-vector: Non-empty vectors

[ bsd3, data, library ] [ Propose Tags ]

Performant non-empty mutable and immutable vectors. These vectors strive to implement the common APIs seen in vector without any additional performance cost.


[Skip to Readme]
Versions [faq] 0.0.1.0, 0.0.1.1, 0.1.0.0, 0.2.0.0, 0.2.0.1
Change log CHANGELOG.md
Dependencies base (>=4.9 && <5), deepseq, primitive (>=0.6 && <0.8), semigroups (>=0.17 && <0.20), vector (==0.12.*) [details]
License BSD-3-Clause
Copyright (c) 2019 Emily Pillmore
Author Emily Pillmore
Maintainer emilypi@cohomolo.gy
Category Data
Home page https://github.com/emilypi/nonempty-vector
Bug tracker https://github.com/emilypi/nonempty-vector/issues
Source repo head: git clone https://github.com/emilypi/nonempty-vector.git
Uploaded by topos at Sun Nov 3 02:46:08 UTC 2019
Distributions NixOS:0.2.0.1
Downloads 322 total (98 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for nonempty-vector-0.2.0.1

[back to package description]

Non-empty Vectors

Build Status Hackage

This package presents thin wrappers around mutable and immutable Data.Vector types. The entire Vector API is supported for both sets of boxed vectors, with future plans to support unboxed, primitive, storable, and generic vectors.

There are no external dependencies that are not already in base.

nonempty-vector dependencies

Motivation

Every "container" in the Haskell ecosystem features a non-empty variant, including the venerable list, aside from vector. Many (including myself) use vector for its incredible performance characteristics achieved over many years by the CLC and authors of the library. But many of us also want to adhere to the principle of least power, and not have to worry about whether head or tail (for example) are safe. This package addresses both of the previous points. No new pointer indirection is exposed by this library except at construction (and even then - unsafe constructors are supplied), with as much reuse of vector's library as possible to make sure asymptotics stay the same.