data-r-tree VS naperian

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

naperian

Efficient representable functors (by aaronvargo)
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 naperian
- -
12 5
- -
4.7 0.0
22 days ago over 5 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.

naperian

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

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

What are some alternatives?

When comparing data-r-tree and naperian 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

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

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

hamtmap

permutation - git import of patrick perry permutations lib from darcs

rawr - Anonymous extensible records and variant types

containers - Assorted concrete container types

DrIFT - A mirror of DrIFT.

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

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

data-r-tree vs data-forest naperian vs justified-containers data-r-tree vs data-stringmap naperian vs repa-array data-r-tree vs data-clist naperian vs hamtmap data-r-tree vs permutation naperian vs rawr data-r-tree vs containers naperian vs DrIFT data-r-tree vs tie-knot naperian vs type-level-sets