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.
-
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.
-
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.