Hoogle Search
Within LTS Haskell 24.28 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Simple network sockets usage patterns. This module exports functions that abstract simple network socket usage patterns. See the changelog.md file in the source distribution to learn about any important changes between versions.
-
An experimental alternative hierarchy of numeric type classes The package provides an experimental alternative hierarchy of numeric type classes. The type classes are more oriented at mathematical structures and their methods come with laws that the instances must fulfill.
-
A numeric class hierarchy. This package provides alternative numeric classes over Prelude. The numeric class constellation looks somewhat like:
Usage
>>> {-# LANGUAGE GHC2024 #-} >>> {-# LANGUAGE RebindableSyntax #-} >>> import NumHask.PreludeSee NumHask for a detailed overview. -
Set- and Map-like types that remember the order elements were inserted Set- and Map-like types that remember the order elements were inserted
-
Classes and data structures for working with data-kind indexed types This package contains collection classes and type representations used for working with values that have a single parameter. It's intended for things like expression libraries where one wishes to leverage the Haskell type-checker to improve type-safety by encoding the object language type system into data kinds.
-
Parsing infrastructure for the pipes ecosystem pipes-parse builds upon the pipes library to provide shared parsing idioms and utilities:
- Leftovers: Save unused input for later consumption
- Leftover propagation: Leftovers are propagated backwards perfectly
- Connect and Resume: Use StateT to save unused input for later
- Termination Safety: Detect and recover from end of input
-
Pointed and copointed data Pointed and copointed data.
-
A zipper-like comonad which works as a list, tracking a position. A PointedList tracks the position in a non-empty list which works similarly to a zipper. A current item is always required, and therefore the list may never be empty. A circular PointedList wraps around to the other end when progressing past the actual edge.
-
Utilities for creating and waiting on ports Utilities for creating and waiting on ports. . openFreePort will create a socket bound to a random port (like warp's openFreePort). . wait will attempt to connect to given host and port repeatedly until successful. .
-
Efficient, purely functional generation of prime numbers This Haskell library provides an efficient lazy wheel sieve for prime generation inspired by Lazy wheel sieves and spirals of primes by Colin Runciman and The Genuine Sieve of Eratosthenes by Melissa O'Neil.