Hoogle Search
Within LTS Haskell 24.41 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Cryptography Primitives sink A repository of cryptographic primitives.
- Symmetric ciphers: AES, DES, 3DES, CAST5, Blowfish, Twofish, Camellia, RC4, Salsa, XSalsa, ChaCha.
- Hash: SHA1, SHA2, SHA3, SHAKE, MD2, MD4, MD5, Keccak, Skein, Ripemd, Tiger, Whirlpool, Blake2
- MAC: HMAC, KMAC, Poly1305
- Asymmetric crypto: DSA, RSA, DH, ECDH, ECDSA, ECC, Curve25519, Curve448, Ed25519, Ed448
- Key Derivation Function: PBKDF2, Scrypt, HKDF, Argon2, BCrypt, BCryptPBKDF
- Cryptographic Random generation: System Entropy, Deterministic Random Generator
- Data related: Anti-Forensic Information Splitter (AFIS)
-
Parse source to template-haskell abstract syntax. The translation from haskell-src-exts abstract syntax to template-haskell abstract syntax isn't 100% complete yet.
-
GHC plugin to do inspection testing Some carefully crafted libraries make promises to their users beyond functionality and performance. Examples are: Fusion libraries promise intermediate data structures to be eliminated. Generic programming libraries promise that the generic implementation is identical to the hand-written one. Some libraries may promise allocation-free or branch-free code. Conventionally, the modus operandi in all these cases is that the library author manually inspects the (intermediate or final) code produced by the compiler. This is not only tedious, but makes it very likely that some change, either in the library itself or the surrounding eco-system, breaks the library’s promised without anyone noticing. This package provides a disciplined way of specifying such properties, and have them checked by the compiler. This way, this checking can be part of the ususal development cycle and regressions caught early. See the documentation in Test.Inspection or the project webpage for more examples and more information.
-
IP Routing Table IP Routing Table is a tree of IP ranges to search one of them on the longest match base. It is a kind of TRIE with one way branching removed. Both IPv4 and IPv6 are supported.
-
List-like structures with static restrictions on the number of elements We provide the data type NonEmpty that allows to store a list-like structure with at least or exactly n elements, where n is fixed in the type in a kind of Peano encoding and is usually small. The datatype is intended to increase safety by making functions total that are partial on plain lists. E.g. on a non-empty list, head and tail are always defined. There are more such data types like Optional and Empty. Together with NonEmpty you can define a list type for every finite set of admissible list lengths. The datatype can be combined with Lists, Sequences and Sets (from the containers package). The package needs only Haskell 98. Similar packages:
- semigroups, semigroupoids: restricted to lists, minimum number of elements: 1, provides more type classes tailored to the use of non-empty lists.
- NonEmptyList: restricted to lists, minimum number of elements: 1
- NonEmpty: restricted to lists, minimum number of elements: 1, designed for unqualified use of identifiers
- Cardinality:NeverEmptyList
- mono-traversable:Data.MinLen: allows to specify a minimum number of elements using type families and works also for monomorphic data structures like ByteString
- http://www.haskell.org/haskellwiki/Non-empty_list
- Stream: Lists that contain always infinitely many elements.
- fixed-length: Uses the data structure of this package and defines a closed-world class for fixed-length lists and an according index type.
- fixed-list: Uses the same data structure as this package but is intended for fixing the number of elements in a list. Requires multi-parameter type classes with functional dependencies.
-
Parallel programming library This package provides a library for parallel programming. For documentation, start from the Control.Parallel.Strategies module below. For more tutorial documentation, see the book Parallel and Concurrent Programming in Haskell. To understand the principles behind the library, see Seq no more: Better Strategies for Parallel Haskell.
-
Prevent or capture writing to stdout and other handles. Prevent or capture writing to stdout, stderr, and other handles.
-
Common lower-level functions needed by various streaming data libraries Provides low-dependency functionality commonly needed by various streaming data libraries, such as conduit and pipes.
package
tasty-expected-failure Mark tasty tests as failure expected With the function Test.Tasty.ExpectedFailure.expectFail in the provided module Test.Tasty.ExpectedFailure, you can mark that you expect test cases to fail, and not to pass. This can for example be used for test-driven development: Create the tests, mark them with Test.Tasty.ExpectedFailure.expectFail, and you can still push to the main branch, without your continuous integration branch failing. Once someone implements the feature or fixes the bug (maybe unknowingly), the test suite will tell him so, due to the now unexpectedly passing test, and he can remove the Test.Tasty.ExpectedFailure.expectFail marker. The module also provides Test.Tasty.ExpectedFailure.ignoreTest to avoid running a test. Both funtions are implemented via the more general Test.Tasty.ExpectedFailure.wrapTest, which is also provided.
-
Adjunctions and representable functors Adjunctions and representable functors.