Hoogle Search

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

package http-download

Verified downloads with retries Higher level HTTP download APIs include verification of content and retries
package http-reverse-proxy

Reverse proxy HTTP requests, either over raw sockets or with WAI Provides a simple means of reverse-proxying HTTP requests. The raw approach uses the same technique as leveraged by keter, whereas the WAI approach performs full request/response parsing via WAI and http-conduit.
package http2

HTTP/2 library HTTP/2 library including frames, priority queues, HPACK, client and server.

Configurable Knuth-Liang hyphenation Configurable Knuth-Liang hyphenation Uses the UTF8 encoded hyphenation patterns provided by hyph-utf8 from http://www.ctan.org/tex-archive/language/hyph-utf8 Usage:

>>> hyphenate english_US "supercalifragilisticexpialadocious"
["su","per","cal","ifrag","ilis","tic","ex","pi","al","ado","cious"]

>>> hyphenate english_US "hyphenation"
["hy","phen","ation"]

>>> hyphenate icelandic "va\240lahei\240avegavinnuverkf\230rageymslusk\250r"
["va\240la","hei\240a","vega","vinnu","verk","f\230ra","geymslu","sk\250r"]

package ihaskell

A Haskell backend kernel for the Jupyter project. IHaskell is a Haskell backend kernel for the Jupyter project. This allows using Haskell via a console or notebook interface. Additional packages may be installed to provide richer data visualizations.
package immortal

Spawn threads that never die (unless told to do so) A small library to create threads that never die. This is useful e.g. for writing servers.
package incipit-base

A Prelude for Polysemy – Base Reexports See https://hackage.haskell.org/package/incipit-base/docs/IncipitBase.html
package include-file

Inclusion of files in executables at compile-time. Inclusion of files in source code via Template Haskell. When distributing executables, sometimes it is required to attach some other resources in files. Using this library (together with the TemplateHaskell extension) you avoid this problem by including those files inside the executable at compile time.
package incremental-parser

Generic parser library capable of providing partial results from partial input. This package defines yet another parser combinator library. This one is implemented using the concept of Brzozowski derivatives, tweaked and optimized to work with any monoidal input type. Lists, ByteString, and Text are supported out of the box, as well as any other data type for which the monoid-subclasses package defines instances. If the parser result is also a monoid, its chunks can be extracted incrementally, before the complete input is parsed.

package indexed-list-literals

Type safe indexed list literals This is an incredibly simple library, which makes writing lists where the length is known at compile time a little bit nicer. If you write a function with the signature

vector :: ILL input length output => input -> Vector length output

then

v :: Vector 3 Int
v = vector (1,2,3)

x :: Vector 0 Double
x = vector $ ZeroTuple @Double

y :: Vector 1 Double
y = vector (Only 1)

z :: Vector 2 String
z = vector ("Hello", "World")

If want matrix literals you can write a function

matrix :: (ILL row width ty, ILL matrix height row) => matrix -> Matrix width height ty

then

a :: Matrix 0 0 Bool
a = matrix $ ZeroTuple @(ZeroTuple Bool)

b :: Matrix 1 2 String
b = matrix $ Only ("Hello","World")

c :: Matrix 4 5 Double
c = matrix ((1,2,3,0,0)
,(4,5,6,0,0)
,(7,8,9,0,0)
,(0,0,0,0,0))

The full code is in test/Docs.hs This only supports literals of length up to 20, though that can be easily extended using the code generator in src/Data/IndexedListLiterals.hs

Page 122 of many | Previous | Next