Hoogle Search
Within LTS Haskell 24.35 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Fast ROT13 cipher for Haskell. A fast ROT13 cipher for Haskell implemented using as few branches as possible. For more information on ROT13, see: https://en.wikipedia.org/wiki/ROT13
-
Random projection trees Random projection trees for approximate nearest neighbor search in high-dimensional vector spaces To use the library, import Data.RPTree, which also contains all documentation.
-
Sort RPM packages in dependency order The rpmbuild-order tool sorts source RPM packages by build dependencies, so that they can be built in a correct order. It does this by reading RPM package spec files and then topologically sorts them according to their build dependencies. The code evolved from cabal-sort by Henning Thielemann. It can also order the dependencies or reverse depends of one or more packages among the packages checked out in neighboring directories (which can be useful to see what packages are affected when a low-level package changes, or which packages are dependents of one of more packages). It also has support for setting RPM options for bcond etc, which can affect dependencies. It can also output dependency graphs. Since version 0.4, a library API is provided.
-
Efficient RRB-Vectors An RRB-Vector is an efficient sequence data structure. It supports fast indexing, iteration, concatenation and splitting.
Comparison with Data.Sequence
Seq a is a container with a very similar API. RRB-Vectors are generally faster for indexing and iteration, while sequences are faster for access to the front/back (amortized <math>). -
Random Variables Random number generation based on modeling random variables by an abstract type (RVar) which can be composed and manipulated monadically and sampled in either monadic or "pure" styles. The primary purpose of this library is to support defining and sampling a wide variety of high quality random variables. Quality is prioritized over speed, but performance is an important goal too. In my testing, I have found it capable of speed comparable to other Haskell libraries, but still a fair bit slower than straight C implementations of the same algorithms.
-
An experimental proof assistant for synthetic ∞-categories Please see the README on GitHub at https://github.com/rzk-lang/rzk#readme
package
safe-coloured-text-layout-gen Generators for types in safe-coloured-text-layout
-
Safe and very efficient arithmetic operations on fixed decimal point numbers Please see the README on GitHub at https://github.com/fpco/safe-decimal#readme
-
Recursive Arbitrary instances without headaches Write and derive Arbitrary instances for recursive data without worrying about termination.
-
Automatic JSON format versioning This library aims to make the updating of JSON formats or contents, while keeping backward compatibility, as painless as possible. The way this is achieved is through versioning and defined migration functions to migrate older (or newer) versions to the one used. The library mainly consists of two classes:
- SafeJSON a: Defines the version of a and if (and how) it is migratable.
- Migrate a: Defines the data type (MigrateFrom a) that can be migrated to a and how to migrate from that type.