Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. package OpenGL

    A binding for the OpenGL graphics system A Haskell binding for the OpenGL graphics system (GL, version 4.6) and its accompanying utility library (GLU, version 1.3). OpenGL is the industry's most widely used and supported 2D and 3D graphics application programming interface (API), incorporating a broad set of rendering, texture mapping, special effects, and other powerful visualization functions. For more information about OpenGL and its various extensions, please see http://www.opengl.org/ and http://www.opengl.org/registry/.

  2. package X11

    A binding to the X11 graphics library A Haskell binding to the X11 graphics library. The binding is a direct translation of the C binding; for documentation of these calls, refer to "The Xlib Programming Manual", available online at http://tronche.com/gui/x/xlib/.

  3. package asn1-types

    ASN.1 types ASN.1 standard types

  4. package bindings-DSL

    FFI domain specific language, on top of hsc2hs. This is a set of macros to be used when writing Haskell FFI. They were designed to be able to fully describe C interfaces, so that hsc2hs can extract from them all Haskell code needed to mimic such interfaces. All Haskell names used are automatically derived from C names, structures are mapped to Haskell instances of Storable, and there are also macros you can use with C code to help write bindings to inline functions or macro functions. Documentation is available at package homepage: https://github.com/jwiegley/bindings-dsl/wiki The extra module Bindings.Utilities will contain tools that may be convenient when working with FFI.

  5. package byteslice

    Slicing managed and unmanaged memory This library provides types that allow the user to talk about a slice of a ByteArray or a MutableByteArray. It also offers UnmanagedBytes, which is kind of like a slice into unmanaged memory. However, it is just an address and a length.

  6. package cairo

    Binding to the Cairo library. Cairo is a library to render high quality vector graphics. There exist various backends that allows rendering to Gtk windows, PDF, PS, PNG and SVG documents, amongst others.

  7. package commutative-semigroups

    Commutative semigroups A commutative semigroup is a semigroup where the order of arguments to mappend does not matter.

  8. package cryptohash-md5

    Fast, pure and practical MD5 implementation A practical incremental and one-pass, pure API to the MD5 hash algorithm (including HMAC support) with performance close to the fastest implementations available in other languages. The implementation is made in C with a haskell FFI wrapper that hides the C implementation. NOTE: This package has been forked off cryptohash-0.11.7 because the cryptohash package has been deprecated and so this package continues to satisfy the need for a lightweight package providing the MD5 hash algorithm without any dependencies on packages other than base and bytestring. Consequently, this package can be used as a drop-in replacement for cryptohash's Crypto.Hash.MD5 module, though with a clearly smaller footprint.

  9. package cryptohash-sha1

    Fast, pure and practical SHA-1 implementation A practical incremental and one-pass, pure API to the SHA-1 hash algorithm (including HMAC support) with performance close to the fastest implementations available in other languages. The implementation is made in C with a haskell FFI wrapper that hides the C implementation. NOTE: This package has been forked off cryptohash-0.11.7 because the cryptohash package has been deprecated and so this package continues to satisfy the need for a lightweight package providing the SHA1 hash algorithm without any dependencies on packages other than base and bytestring. Consequently, this package can be used as a drop-in replacement for cryptohash's Crypto.Hash.SHA1 module, though with a clearly smaller footprint.

  10. package data-fix

    Fixpoint data types Fixpoint types and recursion schemes. If you define your AST as fixpoint type, you get fold and unfold operations for free. Thanks for contribution to: Matej Kollar, Herbert Valerio Riedel

Page 40 of many | Previous | Next