range: An efficient and versatile range library.
The range library alows the use of performant and versatile ranges in your code. It supports bounded and unbounded ranges, ranges in a nested manner (like library versions), an efficient algebra of range computation and even a simplified interface for ranges for the common cases. This library is far more efficient than using the default Data.List functions to approximate range behaviour. Performance is the major value offering of this library. If this is your first time using this library it is highly recommended that you start with Data.Range.Range; it contains the basics of this library that meet most use cases.
|Versions [faq]||0.1.0.0, 0.1.0.1, 0.1.1.0, 0.1.1.1, 0.1.2.0, 0.2.0.0, 0.2.1.0, 0.2.1.1, 0.3.0.0, 0.3.0.1, 0.3.0.2|
|Dependencies||base (>=4.9 && <5), free (>=4.12), parsec (>=3) [details]|
|Revised||Revision 1 made by phadej at Tue Sep 11 12:09:40 UTC 2018|
|Uploaded||by RobertMassaioli at Sun Sep 9 22:09:46 UTC 2018|
|Distributions||LTSHaskell:0.2.1.1, NixOS:0.3.0.2, Stackage:0.2.1.1|
|Downloads||4045 total (357 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs available [build log]
Last success reported on 2018-09-10 [all 1 reports]
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'.
For package maintainers and hackage trustees