Hoogle Search

Within LTS Haskell 24.57 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

package natural-sort

User-friendly text collation The built-in comparisons for textual data are based on Unicode ordinals. This does not match most every-day sorting algorithms. For example, "z10.txt" is sorted after "z2.txt" by users, but before it by naïve algorithms. This package provides an implementation of "natural sort", which more closely matches user expectations. See also: http://www.davekoelle.com/alphanum.html
package nerd-font-icons

Nerd Font Icons for use in haskell The `Graphics.Icons.NerdFont` module simplifies using Nerd Fonts Icons in your Haskell source code by providing constants for the icon code points.
package network-house

data and parsers for Ethernet, TCP, UDP, IPv4, IPv6, ICMP, DHCP, TFTP The network stack extracted from the House (https://code.google.com/p/pdxhouse/) project. Provides data structures and parsers for Ethernet, TCP, UDP, IPv4, IPv6, ICMP, DHCP and TFTP packets as well as some server implementations. This package was extracted from house due to the lack of existing network package parsing libraries.
package network-messagepack-rpc

MessagePack RPC MessagePack RPC library based on the "data-msgpack" package.
package network-simple-tls

Simple interface to TLS secured network sockets. Simple interface to TLS secured network sockets.
package nix-paths

Knowledge of Nix's installation directories. This module provides full paths to various Nix utilities, like nix-store, nix-instantiate, and nix-env.
package no-value

A type class for choosing sentinel-like values Please see the README on GitHub at https://github.com/cdornan/no-value#readme
package non-empty-sequence

Non-empty sequence Please see README.md
package nonempty-zipper

A non-empty comonadic list zipper A non-empty comonadic list zipper
package normaldistribution

Minimum fuss normally distributed random values. This purpose of this library is to have a simple API and no dependencies beyond Haskell 98 in order to let you produce normally distributed random values with a minimum of fuss. This library does not attempt to be blazingly fast nor to pass stringent tests of randomness. It attempts to be very easy to install and use while being "good enough" for many applications (simulations, games, etc.). The API builds upon and is largely analogous to that of the Haskell 98 Random module (more recently System.Random). Pure:
```
(sample,g) = normal  myRandomGen  -- using a Random.RandomGen
samples    = normals myRandomGen  -- infinite list
samples2   = mkNormals 10831452   -- infinite list using a seed
```
In the IO monad:
```
sample    <- normalIO
samples   <- normalsIO  -- infinite list
```
With custom mean and standard deviation:
```
(sample,g) = normal'    (mean,sigma) myRandomGen
samples    = normals'   (mean,sigma) myRandomGen
samples2   = mkNormals' (mean,sigma) 10831452
```
```
sample    <- normalIO'  (mean,sigma)
samples   <- normalsIO' (mean,sigma)
```
Internally the library uses the Box-Muller method to generate normally distributed values from uniformly distributed random values. If more than one sample is needed taking samples off an infinite list (created by e.g. normals) will be roughly twice as efficient as repeatedly generating individual samples with e.g. normal.

Page 312 of many | Previous | Next