between alternatives and similar packages
Based on the "Data" category.
Alternatively, view between alternatives based on common mentions on social networks and blogs.
-
lens
Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens -
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. -
unordered-containers
Efficient hashing-based container types -
cassava
A CSV parsing and encoding library optimized for ease of use and high performance -
compendium-client
Mu (μ) is a purely functional framework for building micro services. -
holmes
A reference library for constraint-solving with propagators and CDCL. -
resource-pool
A high-performance striped resource pooling implementation for Haskell -
primitive
This package provides various primitive memory-related operations. -
-
-
-
-
-
-
IORefCAS
A collection of different packages for CAS based data structures. -
discrimination
Fast linear time sorting and discrimination for a large class of data types -
-
dependent-map
Dependently-typed finite maps (partial dependent products) -
dependent-sum
Dependent sums and supporting typeclasses for comparing and displaying them -
-
streaming
An optimized general monad transformer for streaming applications, with a simple prelude of functions -
-
-
-
orgmode-parse
Attoparsec parser combinators for parsing org-mode structured text! -
reflection
Reifies arbitrary Haskell terms into types that can be reflected back into terms -
-
-
text-icu
This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text. -
scientific
Arbitrary-precision floating-point numbers represented using scientific notation
Static code analysis for 29 languages.
Do you think we are missing an alternative of between or a related project?
|
Learn any GitHub repo in 59 seconds
sponsored
getonboard.dev
|
Popular Comparisons
-
betweenvscereal
-
protobufvsCBOR
-
radiusvsnetwork-address
-
attemptvstext
-
json-autotypevsbase58string
|
Free Global Payroll designed for tech teams
sponsored
try.revelo.com
|
README
Between
Description
It turns out that this combinator
f ~@~ g = (f .) . (. g)
is a powerful thing. It was abstracted from following (commonly used)
pattern f . h . g where f and g are fixed.
This library not only defines ~@~ combinator, but also some derived
combinators that can help us to easily define a lot of things including
lenses. See lens package for details on what lenses are.
Function Data.Function.on can be implemented using ~@~ as:
on :: (b -> b -> c) -> (a -> b) -> a -> a -> c
on f g = (id ~@~ g ~@~ g) f
If function 'on3' existed in base then it could be defined as:
on3 :: (b -> b -> b -> d) -> (a -> b) -> a -> a -> a -> d
on3 f g = (id ~@~ g ~@~ g ~@~ g) f
For more examples see documentation.
Documentation
Stable releases with API documentation are available on Hackage.
Building Options
-fpedantic(disabled by default)
Pass additional warning flags to GHC.
License
The BSD 3-Clause License, see LICENSE file for details.
Contributions
Contributions, pull requests and bug reports are welcome! Please don't be
afraid to contact author using GitHub or by e-mail (see .cabal file for
that).
*Note that all licence references and agreements mentioned in the between README section above
are relevant to that project's source code only.