unagi-bloomfilter VS transient

Compare unagi-bloomfilter vs transient and see what are their differences.

unagi-bloomfilter

A fast, cache-efficient, concurrent bloom filter in Haskell (by jberryman)

transient

A full stack, reactive architecture for general purpose programming. Algebraic and monadically composable primitives for concurrency, parallelism, event handling, transactions, multithreading, Web, and distributed computing with complete de-inversion of control (No callbacks, no blocking, pure state) (by transient-haskell)
Our great sponsors
  • SonarQube - Static code analysis for 29 languages.
  • Scout APM - Less time debugging, more time building
  • OPS - Build and Run Open Source Unikernels
unagi-bloomfilter transient
0 0
12 625
- 0.2%
0.0 0.0
almost 4 years ago 11 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.

unagi-bloomfilter

Posts with mentions or reviews of unagi-bloomfilter. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning unagi-bloomfilter yet.
Tracking mentions began in Dec 2020.

transient

Posts with mentions or reviews of transient. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning transient yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing unagi-bloomfilter and transient you can also consider the following projects:

unagi-chan - A haskell library implementing fast and scalable concurrent queues for x86, with a Chan-like API

failure - A simple type class for success/failure computations.

control-monad-failure - A class of monads which can fail with an error

joint - Extremely simple effect system for Haskell

unagi-streams - Unagi-chan channels for io-streams.

ImperativeHaskell - Proof that Haskell can look and act like an imperative language.

exceptions - mtl friendly exceptions

ChannelT - Generalized stream processors

control-monad-exception - Explicitly Typed exceptions as a library

cr

control-monad-free - Free monads and monad transformers

bytestring-progress - A Haskell library for tracking the consumption of lazy ByteStrings