some alternatives and similar packages
Based on the "Data" category.
Alternatively, view some alternatives based on common mentions on social networks and blogs.
-
semantic-source
Parsing, analyzing, and comparing source code across many languages -
-
code-builder
Packages for defining APIs, running them, generating client code and documentation. -
text
Haskell library for space- and time-efficient operations over Unicode text. -
-
compendium-client
Mu (μ) is a purely functional framework for building micro services. -
cassava
A CSV parsing and encoding library optimized for ease of use and high performance -
-
primitive
This package provides various primitive memory-related operations. -
-
resource-pool
A high-performance striped resource pooling implementation for Haskell -
-
-
-
discrimination
Fast linear time sorting and discrimination for a large class of data types -
-
reflection
Reifies arbitrary Haskell terms into types that can be reflected back into terms -
dependent-sum
Dependent sums and supporting typeclasses for comparing and displaying them -
-
dependent-map
Dependently-typed finite maps (partial dependent products) -
text-icu
This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text. -
-
orgmode-parse
Attoparsec parser combinators for parsing org-mode structured text! -
-
streaming
An optimized general monad transformer for streaming applications, with a simple prelude of functions -
-
-
-
-
scientific
Arbitrary-precision floating-point numbers represented using scientific notation
Clean code begins in your IDE with SonarLint
Do you think we are missing an alternative of some or a related project?
|
Access the most powerful time series database as a service
sponsored
www.influxdata.com
|
Popular Comparisons
-
CBORvsprotobuf
-
network-addressvsradius
-
textvsattempt
-
json-autotypevsbase58string
-
boringvsbinary
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
some
This library defines several versions of an existential type 'Some', which works like this datastructure:
data Some f where
Some :: f a -> Some f
and operations to work with it.
However, due to GHC issue #1965, the direct implementation of this datastructure is less efficient than it could be. As a result, this library uses a more complex approach that implements it as a newtype, so there's no runtime overhead associated with wrapping and unwrapping Some values.
To use the recommended implementation, import Data.Some. If you need to ensure that you are definitely using the newtype implementation, import Data.Some.Newtype. By default, these are the same, but this can be changed via a Cabal flag.