Hoogle Search

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

package primecount

Bindings to the primecount library Please see the README on Github at https://github.com/pgujjula/primecount-haskell#readme
package primitive-offset

Types for offsets into unboxed arrays Pair a typed or untyped primitive array with an offset. This is useful for providing meaningful type signatures when working with the foreign function interface.
package print-console-colors

Print all ANSI console colors Print all ANSI console colors. This is convenient when you are trying to set your console colors, for example when configuring Termonad. For installation and usage instructions, see the README.
package probability-polynomial

Probability distributions via piecewise polynomials Package for manipulating finite probability distributions. Both discrete, continuous and mixed probability distributions are supported. Continuous probability distributions are represented in terms of piecewise polynomials. Also includes an implementation of polynomials in one variable.
package project-template

Specify Haskell project templates and generate files See initial blog post for explanation: http://www.yesodweb.com/blog/2012/09/project-templates
package projectroot

Bindings to the projectroot C logic Simple way of finding the root of a project given an entry-point. This module provides bindings to the projectroot C library

Prometheus Haskell Client

Prometheus Haskell Client

A simple and modern, type safe, performance focused, idiomatic Haskell client for Prometheus monitoring. Specifically there is no use of unsafe IO or manual ByteString construction from lists of bytes. Batteries-included web server. A key design element of this library is that the RegistryT monad transformer is only required for registering new time series. Once the time series is registered, new data samples may just be added in the IO monad. Note: Version 0.* supports Prometheus v1.0 and version 2.* supports Prometheus v2.0.

Usage Example

module Example where

import           Control.Monad.IO.Class                         (liftIO)
import           System.Metrics.Prometheus.Http.Scrape          (serveMetricsT)
import           System.Metrics.Prometheus.Concurrent.RegistryT
import           System.Metrics.Prometheus.Metric.Counter       (inc)
import           System.Metrics.Prometheus.MetricId

main :: IO ()
main = runRegistryT $ do
-- Labels can be defined as lists or added to an empty label set
connectSuccessGauge <- registerGauge "example_connections" (fromList [("login", "success")])
connectFailureGauge <- registerGauge "example_connections" (addLabel "login" "failure" mempty)
connectCounter <- registerCounter "example_connection_total" mempty
latencyHistogram <- registerHistogram "example_round_trip_latency_ms" mempty [10, 20..100]

liftIO $ inc connectCounter -- increment a counter

-- [...] pass metric handles to the rest of the app

serveMetricsT 8080 ["metrics"] -- http://localhost:8080/metric server

Advanced Usage

A Registry and StateT-based RegistryT are available for unit testing or generating lists of `[IO a]` actions that can be sequenced and returned from pure code to be applied.

package promises

Lazy demand-driven promises Lazy demand-driven promises
package prospect

Explore continuations with trepidation Please see the README on GitHub at https://github.com/isovector/prospect#readme
package protobuf

Google Protocol Buffers via GHC.Generics Google Protocol Buffers via GHC.Generics. Protocol Buffers are a way of encoding structured data in an efficient yet extensible format. Google uses Protocol Buffers for almost all of its internal RPC protocols and file formats. This library supports a useful subset of Google Protocol Buffers message specifications in a Haskell. No preprocessor or additional build steps are required for message encoding and decoding. Record specifications are built by defining records with specially defined fields that capture most of the Protocol Buffers specification language.

Page 232 of many | Previous | Next