nonempty-vector: Non-empty 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.
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]
Properties
| Versions | 0.0.1.0, 0.0.1.1, 0.1.0.0, 0.2.0.0, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.1.0, 0.2.2.0, 0.2.3 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.9 && <5), deepseq, primitive (>=0.6 && <0.8), semigroups (>=0.17 && <0.20), vector (>=0.12 && <0.13) [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 2019-11-01T02:00:54Z |
Modules
[Index] [Quick Jump]
Downloads
- nonempty-vector-0.2.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees
Readme for nonempty-vector-0.2.0.0
[back to package description]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.