| cereal | iproute | |
|---|---|---|
| 1 | 1 | |
| 78 | 46 | |
| - | - | |
| 0.0 | 4.5 | |
| over 1 year ago | 3 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" 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.
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.
cereal
Posts with mentions or reviews of cereal.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-11-13.
iproute
Posts with mentions or reviews of iproute.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-11-13.
What are some alternatives?
When comparing cereal and iproute you can also consider the following projects:
between - Function combinator "between" and derived combinators.
binary-search - Binary and exponential searches
encode-string - String encoding and decoding in Haskell
graph-generators - A Haskell library for creating random Data.Graph instances using several pop
cereal-time - Serialize instances for types from `time` package.
arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences
CTRex - Open records for Haskell
lca - Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing
convert
twentyseven - Rubik's cube solver in Haskell
cereal-io-streams
aeson-diff - Generate and apply diffs between JSON documents.