Hoogle Search
Within LTS Haskell 24.49 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Directed acyclic graphs. Directed acyclic graphs can be sorted topographically. Existence of topographic ordering allows writing many graph algorithms efficiently. And many graphs, e.g. most dependency graphs are acyclic! There are some algorithms built-in: dfs, transpose, transitive closure, transitive reduction... Some algorithms even become not-so-hard to implement, like a longest path!
-
Torsor Typeclass Torsor Typeclass.
-
Distributed tracing An OpenTracing-compliant, simple, and extensible distributed tracing library.
-
Monadic representation of transactions. Monadic representation of transactions. Alike List, but can be declared with `do` notations.
-
Generic applicative traversals This is a generic programming library in the spirit of "Scrap your boilerplate with class", but with several improvements — most notably, it's based on the gtraverse function instead of gfoldl. gtraverse is equivalent in power to gfoldl, but lets you more easily write non-standard views of the data type.
-
Render trees as foldable HTML and Unicode art Render trees as foldable HTML and Unicode art Example:
*Data.Tree.View> drawTree $ Node "Add" [Node "Sub" [Node "3" [], Node "Mul" [Node "1" [], Node "2" []]], Node "4" []] Add ├╴Sub │ ├╴3 │ └╴Mul │ ├╴1 │ └╴2 └╴4
-
Simple Map-based Trie A trie data structure TMap c v, to hold a mapping from list of characters ([c]) to something. In other words, a data structure isomorphic to Map [c] v. It is more efficient to query compared to Map. Also, it supports extra operations like prefix matching. This package contains TSet c too, which is isomorphic to Set [c].
-
A utility for neat multiline string trimming Please see the README on GitHub at https://github.com/gregorias/trimdent#readme
-
Convert tsv to csv Convert tab-delimited text to Excel-style comma-delimited.
-
Contention-free STM hash map A contention-free STM hash map. "Contention-free" means that the map will never cause spurious conflicts. A transaction operating on the map will only ever have to retry if another transaction is operating on the same key at the same time. This is an implementation of the transactional trie, which is basically a lock-free concurrent hash trie lifted into STM. For a detailed discussion, including an evaluation of its performance, see Chapter 4 of my master's thesis.