data-r-tree VS data-clist

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

data-r-tree

Haskell implementatio of R-Trees (by sebastian-philipp)

data-clist

A purely functional ring data structure for Haskell. (by sw17ch)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
data-r-tree data-clist
- -
12 8
- -
4.7 3.9
17 days ago 5 months ago
Haskell Haskell
MIT 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.

data-r-tree

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

We haven't tracked posts mentioning data-r-tree 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 data-r-tree and data-clist you can also consider the following projects:

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

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

data-stringmap - Haskell Project to convert the PrefixTree of the Holumbus into it's own Hackage Packet

permutation - git import of patrick perry permutations lib from darcs

graphite - Haskell graphs and networks library

containers - Assorted concrete container types

tie-knot - "Ties the knot" on a given set of structures that reference each other by keys - replaces the keys with their respective values.

dlist - Difference lists in Haskell

monadic-arrays - MArray instances for monad transformers

naperian - Efficient representable functors