funsat VS aeson-diff

Compare funsat vs aeson-diff and see what are their differences.

funsat

An efficient, embeddable DPLL SAT solver in Haskell (by dbueno)

aeson-diff

Generate and apply diffs between JSON documents. (by thsutton)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
funsat aeson-diff
0 0
35 39
- -
0.0 0.0
almost 9 years ago over 1 year ago
Groff 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.

funsat

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

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

aeson-diff

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

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

What are some alternatives?

When comparing funsat and aeson-diff you can also consider the following projects:

twentyseven - Rubik's cube solver in Haskell

incremental-sat-solver - Simple, Incremental SAT Solving as a Haskell Library

graph-generators - A Haskell library for creating random Data.Graph instances using several pop

ADPfusionSet - dynamic programming for set data structures

Ritt-Wu

iproute - IP Routing Table in Haskell

text-metrics - Calculate various string metrics efficiently in Haskell

binary-search - Binary and exponential searches

lca - Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing

spacefill - Space-filling curves