data-r-tree VS permutation

Compare data-r-tree vs permutation 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

permutation

git import of patrick perry permutations lib from darcs (by spacekitteh)
Data structures
Source Code
Suggest alternative
Edit details
InfluxDB
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
data-r-tree permutation
- -
12 8
- -
4.7 0.0
20 days ago about 6 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.

permutation

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

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

What are some alternatives?

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

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

multiset - multiset haskell package

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

Agda - Agda is a dependently typed programming language / interactive theorem prover.

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

type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)

containers - Assorted concrete container types

singletons - Fake dependent types in Haskell using singletons

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

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

monadic-arrays - MArray instances for monad transformers

psqueues - Priority Search Queues in three different flavors for Haskell

data-r-tree vs data-forest permutation vs multiset data-r-tree vs data-stringmap permutation vs Agda data-r-tree vs data-clist permutation vs type-level-sets data-r-tree vs containers permutation vs singletons data-r-tree vs tie-knot permutation vs repa-array data-r-tree vs monadic-arrays permutation vs psqueues