Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Improved library to deal with rhythmicity of short sequences The improved library that deals with the model similar to the one given at the work https://oleksandrzhabenko.github.io/uk/rhythmicity/PhLADiPreLiO.Eng.21.pdf and https://hackage.haskell.org/package/phonetic-languages-simplified-examples-array
-
Rich environment variable setup for Haskell This package exposes a type that captures a set of rules to modify an existing environment variable set, be it a provided list of key-value pairs (list of duples) or the system's environment variable set itself. Each rule can be either a prefix, a mapping or a value. See README.md for more details.
-
RNG within an IORef for convenient concurrent use rng-utils aims to make it easy to generate an RNG and safely use it concurrently.
-
Implementation of the ROC (Taiwan) National ID standard. This package provides an implementation of the ROC (Taiwan) National Identification Number (中華民國身分證號碼) standard. In particular, it provides functions for parsing and validating identification numbers from textual input. See the ROC.ID module to get started. For more details of the standard on which this package is based, see:
-
Haskell bindings to RocksDB From http://rocksdb.org: RocksDB is an embeddable persistent key-value store for fast storage. RocksDB can also be the foundation for a client-server database but our current focus is on embedded workloads. RocksDB builds on LevelDB to be scalable to run on servers with many CPU cores, to efficiently use fast storage, to support IO-bound, in-memory and write-once workloads, and to be flexible to allow for innovation.
-
RocksDB database querying library for Haskell Please see the README on GitHub at https://github.com/jprupp/rocksdb-query#readme
-
Composable class-based roles Composable class-based roles
-
Ropes optimised for updating using UTF-16 code units and row/column pairs. Ropes optimised for updating using UTF-16 code units and row/column pairs. This implementation uses splay trees instead of the usual finger trees. According to my benchmarks, splay trees are faster in most situations.
-
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.