nonempty-vector
Non-empty vectors
https://github.com/emilypi/nonempty-vector
| Version on this page: | 0.2.0.1@rev:1 |
| LTS Haskell 22.39: | 0.2.3@rev:2 |
| Stackage Nightly 2024-10-31: | 0.2.3@rev:2 |
| Latest on Hackage: | 0.2.3@rev:2 |
nonempty-vector-0.2.0.1@sha256:4f43152485a17009a0c2177a6a5f7a0d3627a1183fd37c3163cb38b8dc506bae,1845Module documentation for 0.2.0.1
- Data
- Data.Vector
Non-empty Vectors
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.
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.