data-r-tree VS void

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

data-r-tree

Haskell implementatio of R-Trees (by sebastian-philipp)
Data structures Data r-tree Haskell
Source Code
Suggest alternative
Edit details

void

Provides Data.Void, which is in base since ghc 7.8 or so (by ekmett)
Data structures
Source Code
hackage.haskell.org
Suggest alternative
Edit details
WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
data-r-tree void
- -
12 19
- -
4.7 0.0
20 days ago about 2 years 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.

void

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

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

What are some alternatives?

When comparing data-r-tree and void you can also consider the following projects:

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

justified-containers - Standard containers, with keys that carry type-level proofs of their own presence.

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

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

data-clist - A purely functional ring data structure for Haskell.

naperian - Efficient representable functors

permutation - git import of patrick perry permutations lib from darcs

map-syntax - Syntax sugar and explicit semantics for statically defined maps

containers - Assorted concrete container types

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

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

hoq - A language based on homotopy type theory with an interval

data-r-tree vs data-forest void vs justified-containers data-r-tree vs data-stringmap void vs miso data-r-tree vs data-clist void vs naperian data-r-tree vs permutation void vs map-syntax data-r-tree vs containers void vs repa-array data-r-tree vs tie-knot void vs hoq