roman-numerals VS gutenberg-fibonaccis

Compare roman-numerals vs gutenberg-fibonaccis and see what are their differences.

roman-numerals

Parsing and pretty printing of Roman numerals (by roelvandijk)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
roman-numerals gutenberg-fibonaccis
- -
5 -
- -
0.0 -
over 9 years ago -
Haskell
BSD 3-clause "New" or "Revised" License GNU General Public License v3.0 only
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.

roman-numerals

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

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

gutenberg-fibonaccis

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

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

What are some alternatives?

When comparing roman-numerals and gutenberg-fibonaccis you can also consider the following projects:

lbfgs - Haskell binding for liblbfgs

affine-invariant-ensemble-mcmc

hmatrix-nlopt - High-level hmatrix-compatible bindings to NLOPT from Haskell

hyperloglog - A constant-memory approximation of set membership

microlens-aeson - Lenses and Traversals for Aeson, based on Microlens.

nlopt-haskell - Low-level Haskell bindings to the NLOPT library

hasty-hamiltonian - Speedy gradient-based traversal through parameter space.