heaps alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view heaps alternatives based on common mentions on social networks and blogs.

• miso

  10.0 6.9 heaps VS miso

  :ramen: A tasty Haskell front-end framework

• Agda

  10.0 9.6 heaps VS Agda

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

Less time debugging, more time building

Scout APM allows you to find and fix performance issues with no hassle. Now with error monitoring and external services monitoring, Scout is a developer's best friend when it comes to application development.

Promo scoutapm.com



• hevm

  10.0 9.0 heaps VS hevm

  Dapp, Seth, Hevm, and more
  

• containers

  9.8 5.9 heaps VS containers

  Assorted concrete container types
  

• singletons

  9.7 5.3 heaps VS singletons

  Fake dependent types in Haskell using singletons

• vinyl

  9.7 5.3 heaps VS vinyl

  Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.
  

• fgl

  9.6 0.0 heaps VS fgl

  A Functional Graph Library for Haskell
  

• repa-scalar

  9.5 3.2 heaps VS repa-scalar

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-array

  9.5 3.2 heaps VS repa-array

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-convert

  9.5 3.2 heaps VS repa-convert

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-eval

  9.5 3.2 heaps VS repa-eval

  High performance, regular, shape polymorphic parallel arrays.
  

• cubical

  9.4 0.0 heaps VS cubical

  Implementation of Univalence in Cubical Sets

• parameterized-utils

  9.2 8.0 heaps VS parameterized-utils

  A set of utilities for using indexed types including containers, equality, and comparison.
  

• psqueues

  9.1 2.4 heaps VS psqueues

  Priority Search Queues in three different flavors for Haskell

• hoq

  9.0 0.0 heaps VS hoq

  A language based on homotopy type theory with an interval

• adjunctions

  9.0 2.7 heaps VS adjunctions

  Simple adjunctions

• ethereum-client-haskell

  9.0 0.0 heaps VS ethereum-client-haskell

  A Haskell version of an Ethereum client

• distributive

  8.9 1.0 heaps VS distributive

  Dual Traversable

• bookkeeper

  8.8 0.0 heaps VS bookkeeper

  Anonymous records and overloaded labels
  

• type-level-sets

  8.8 5.5 heaps VS type-level-sets

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

• justified-containers

  8.7 0.0 heaps VS justified-containers

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

• clafer

  8.6 0.0 heaps VS clafer

  Clafer is a lightweight modeling language
  

• EdisonAPI

  8.5 0.0 heaps VS EdisonAPI

  Edison: A Library of Efficient Data Structures

• slist

  8.3 0.0 heaps VS slist

  ♾️ Sized list
  

• bytestring-trie

  8.3 8.8 heaps VS bytestring-trie

  An efficient finite map from (byte)strings to values.

• ixset-typed

  8.2 4.4 heaps VS ixset-typed

  More strongly typed variant of the ixset Haskell package
  

• void

  8.1 0.0 heaps VS void

  Provides Data.Void, which is in base since ghc 7.8 or so

• haggle

  8.0 1.8 heaps VS haggle

  An efficient graph library for Haskell

• bitset

  7.9 0.0 heaps VS bitset

  A compact functional set data structure
  

• hamtmap

  7.9 0.0 heaps VS hamtmap

  A purely functional and persistent hash map

• knit

  7.9 0.0 heaps VS knit

  Ties the knot on data structures that reference each other by unique keys

• multiset

  7.8 0.0 heaps VS multiset

  multiset haskell package

• nonempty-containers

  7.6 2.0 heaps VS nonempty-containers

  Efficient non-empty variants of containers data types, with full API

• graphite

  7.6 0.0 heaps VS graphite

  Haskell graphs and networks library

• data-r-tree

  7.4 0.0 heaps VS data-r-tree

  Haskell implementatio of R-Trees

• algebra-checkers

  7.4 0.0 heaps VS algebra-checkers

  checkers for algebra driven design

• map-exts

  7.4 0.0 heaps VS map-exts

  Extensions to Data.Map
  

• eliminators

  7.3 2.7 heaps VS eliminators

  Dependently typed elimination functions using singletons

• helf

  7.3 3.4 heaps VS helf

  Haskell implementation of the Edinburgh Logical Framework

• rawr

  7.2 0.0 heaps VS rawr

  Anonymous extensible records and variant types

• claferIG

  7.1 0.0 heaps VS claferIG

  Support for reasoning on Clafer models by instantiation and counter example generation.
  

• ixset

  6.8 0.0 heaps VS ixset

  A Set type which supports multiple indexes
  

• representable-functors

  6.7 0.0 heaps VS representable-functors

  representable functors

• map-syntax

  6.7 0.0 heaps VS map-syntax

  Syntax sugar and explicit semantics for statically defined maps

• mtl-c

  6.6 0.0 heaps VS mtl-c

  Monad transformers in CPS

• hw-fingertree-strict

  6.6 0.0 heaps VS hw-fingertree-strict

  Generic strict finger-tree structure
  

• igraph

  6.4 0.0 heaps VS igraph

  Incomplete Haskell bindings to the igraph library (which is written in C)

• selections

  6.4 0.0 heaps VS selections

  Haskell Package for operating with selections over an underlying functor

• ethereum-analyzer

  6.4 0.0 heaps VS ethereum-analyzer

  An Ethereum contract analyzer.

• supermonad

  6.3 0.0 heaps VS supermonad

  A plugin for GHC to support super monads.

Do you think we are missing an alternative of heaps or a related project?

Clean code begins in your IDE with SonarLint sponsored www.sonarlint.org

Popular Comparisons

• pomaps
  vs
  data-clist
• naperian
  vs
  justified-containers
• ethereum-analyzer
  vs
  ethereum-client-haskell
• rawr
  vs
  graphite
• bytestring-trie
  vs
  graphite

SaaSHub - Software Alternatives and Reviews sponsored www.saashub.com