fastsum: A fast open-union type suitable for 100+ contained alternatives
This package provides Data.Sum, an open-union type, similar to the Union type that powers the implementation of Oleg Kiselyov's extensible-effects library.
Unlike most open-union implementations, this type is very fast to compile, even when the type-level list of alternatives contains hundreds of entries. Membership queries are constant-time, compiling to a single type-level natural lookup in a closed type family, unlike the traditional encoding of Union, which relies on recursive typeclass lookups. As such, this type lends itself to representing abstract syntax trees or other rich data structures.
This project is safe to use in production. Any performance problems at compile-time or runtime should be filed as bugs.
[Skip to Readme]
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
- fastsum-0.1.1.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
|Versions [RSS]||0.1.0.0, 0.1.1.0, 0.1.1.1, 0.2.0.0|
|Dependencies||base (>=4.7 && <5), deepseq (>=1.4 && <2), fastsum, ghc-prim (>=0.5 && <1), hashable (>=1.2 && <2), template-haskell (>=2.12 && <2.15) [details]|
|Copyright||Rob Rix, Josh Vera, Allele Dev, Patrick Thomson 2016-2018|
|Author||Rob Rix, Josh Vera, Allele Dev, Patrick Thomson|
|Revised||Revision 1 made by patrick_thomson at 2019-10-28T16:23:02Z|
|Source repo||head: git clone https://github.com/patrickt/fastsum|
|Uploaded||by patrick_thomson at 2019-05-13T18:14:14Z|
|Reverse Dependencies||2 direct, 0 indirect [details]|
|Downloads||3305 total (20 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]