100 Data Structures packages and projects
-
Agda
10.0 9.8 HaskellAgda is a dependently typed programming language / interactive theorem prover. -
vinyl
9.7 0.0 HaskellExtensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode. -
parameterized-utils
9.1 3.1 HaskellA set of utilities for using indexed types including containers, equality, and comparison. -
type-level-sets
8.8 0.0 HaskellType-level sets for Haskell (with value-level counterparts and various operations) -
justified-containers
8.6 0.0 HaskellStandard containers, with keys that carry type-level proofs of their own presence. -
nonempty-containers
7.5 0.0 HaskellEfficient non-empty variants of containers data types, with full API -
claferIG
7.0 0.0 HaskellSupport for reasoning on Clafer models by instantiation and counter example generation. -
heap
5.8 0.0 HaskellA flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps. -
extended-containers
5.7 0.0 HaskellA Haskell library for containers to extend the containers and unordered-containers packages. -
repa-devil
5.4 0.0 HaskellImage library based on the DevIL open source image library for the repa array library. -
data-stringmap
5.2 0.0 HaskellHaskell Project to convert the PrefixTree of the Holumbus into it's own Hackage Packet -
colorful-monoids
4.7 0.0 Haskellcolorful-monoids: Styled console text output using ANSI escape sequences -
agda-snippets
4.2 0.0 HaskellLibrary and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched. -
graph-wrapper
3.7 0.0 HaskellA wrapper around the standard Data.Graph with a less awkward interface -
bk-tree
3.7 0.0 HaskellHaskell library meant to be a set of tools to correct spelling mistakes, homophones, and OCR errors -
tie-knot
3.4 0.0 Haskell"Ties the knot" on a given set of structures that reference each other by keys - replaces the keys with their respective values. -
array-memoize
3.1 0.0 HaskellMemoize discrete functions (restricted to a finite domain) using arrays -
invertible
2.5 0.0 HaskellHaskell bidirectional arrows, bijective functions, and invariant functors
TestGPT | Generating meaningful tests for busy devs
Get non-trivial tests (and trivial, too!) suggested right inside your IDE, so you can code smart, create more value, and stay confident when you push.
Promo
codium.ai