data-r-tree alternatives and similar packages

Based on the "data" category.
Alternatively, view data-r-tree alternatives based on common mentions on social networks and blogs.

data-clist

6.2 0.0 data-r-tree VS data-clist

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

5.2 0.0 data-r-tree VS data-stringmap

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

Clean code begins in your IDE with SonarLint

Up your coding game and discover issues early. SonarLint is a free plugin that helps you find & fix bugs and security issues from the moment you start writing code. Install from your favorite IDE marketplace today.

Promo www.sonarlint.org

data-forest

2.5 0.0 data-r-tree VS data-forest

A simple multi-way tree data structure

Do you think we are missing an alternative of data-r-tree or a related project?

Add another 'data' Package

README

R-Trees (and in the future also R*-Trees)

R-Tree is a spatial data structure similar to Quadtrees or B-Trees.

An R-Tree is a balanced tree and optimized for lookups. This implemetation useses an R-Tree to privide a map to arbitrary values.

Some function names clash with "Prelude" names, therefore this module is usually imported qualified, e.g.:

> import           Data.RTree (RTree)
> import qualified Data.RTree as RT

this implemetation is incomplete at the moment. Feel free to send comments, patches or merge requests.

data-r-tree

Haskell implementatio of R-Trees

data-r-tree alternatives and similar packages

data-clist

data-stringmap

Clean code begins in your IDE with SonarLint

data-forest

README

R-Trees (and in the future also R*-Trees)