graphite VS data-clist

Compare graphite vs data-clist and see what are their differences.

graphite

Haskell graphs and networks library (by alx741)

data-clist

A purely functional ring data structure for Haskell. (by sw17ch)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
graphite data-clist
0 0
31 8
- -
0.0 3.9
about 2 years ago 5 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.

graphite

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

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

data-clist

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

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

What are some alternatives?

When comparing graphite and data-clist you can also consider the following projects:

miso - :ramen: A tasty Haskell front-end framework

rawr - Anonymous extensible records and variant types

bytestring-trie - An efficient finite map from (byte)strings to values.

bookkeeper

pomaps - Haskell data structure for maps and sets with partially ordered keys

vinyl - Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.

data-forest - A simple multi-way tree data structure

adjunctions - Simple adjunctions

psqueues - Priority Search Queues in three different flavors for Haskell

containers - Assorted concrete container types

repa-array - High performance, regular, shape polymorphic parallel arrays.

data-r-tree - Haskell implementatio of R-Trees