murmur-hash
bifunctors
| murmur-hash | bifunctors | |
|---|---|---|
| - | 1 | |
| 8 | 56 | |
| - | - | |
| 3.0 | 5.6 | |
| 5 months ago | about 1 month ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
murmur-hash
We haven't tracked posts mentioning murmur-hash yet.
Tracking mentions began in Dec 2020.
bifunctors
-
Why is the maybe monad transformer defined as MaybeT { runMaybeT :: m (Maybe a) } instead of MaybeT { runMaybeT :: Maybe (m a) } ?
But it is possible to derive using a newtype of a tuple with its arguments reversed: Flip (,) s. If we get the (Biapplicative bi, Monoid b) => Applicative (Flip bi b) instance (issue). It will require a constraint to restrict m to have a representational argument because otherwise we cannot coerce through it.
What are some alternatives?
b-tree - Haskell on-disk B* tree implementation
size-based
massiv - Efficient Haskell Arrays featuring Parallel computation
hnix - A Haskell re-implementation of the Nix expression language
holmes - A reference library for constraint-solving with propagators and CDCL.
frontmatter - Attoparsec parsers for YAML frontmatter as used in Jekyll
combobuffer - Several pure buffer implementations
hebrew-time - Hebrew dates and prayer times.
hierarchy
gps2htmlReport - Generates a HTML page report detailing a GPS journey, with charts, statistics and an OpenStreetMap graphic.
charset - fast utf-8 character sets
llrbtree - Left-leaning red-black trees