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.
-
Fully-featured JSON-RPC 2.0 library Please see the README on GitHub at https://github.com/jprupp/json-rpc#readme
-
Generated elm code for servant APIs. Generate Elm encoders, decoders, and API requests for an Servant API, where the shape of the data going over the API is described using `json-spec`. See the `testtest.hs` and `testApi.hs` for an example.
-
json-spec-openapi This package provides a way to produce openapi3 documentation from a json-spec specification.
Example
Given this data type:data User = User { name :: Text , lastLogin :: Maybe UTCTime } deriving ToSchema via (EncodingSchema User) -- <-- ToSchema instance defined here instance HasJsonEncodingSpec User where type EncodingSpec User = JsonObject '[ Required "name" JsonString , Optional "last-login" JsonDateTime ] toJSONStructure user = (Field @"name" (name user), (fmap (Field @"last-login") (lastLogin user), ()))Calling `Data.Aeson.encode (Data.OpenApi3.toSchema (Proxy :: Proxy User))` will produce the following Schema:{ "additionalProperties": false, "properties": { "last-login": { "format": "date-time", "type": "string" }, "name": { "type": "string" } }, "required": [ "name" ], "type": "object" } -
Producing JUnit-style XML test reports. Please see the README at https://github.com/jwoudenberg/junit-xml.
-
Keyed container types with type-checked proofs of key presence. This package contains wrappers around standard container types, that provide guarantees about the presence of keys within the container.
-
A JavaScript push mechanism based on the comet idiom A transport-level remote JavaScript RESTful push mechanism.
-
WAI middleware for logging request and response info through katip. WAI middleware for logging request and response info through katip. Please see the README on GitHub at https://github.com/Disco-Dave/katip-wai#readme
-
Fast concurrent queues much inspired by unagi-chan "kazura-queue" provides an implementation of FIFO queue. It is faster than Chan, TQueue or TChan by the benefit of fetch-and-add instruction. Main motivation of this package is to solve some difficulty of "unagi-chan" package.
- In "unagi-chan", the item in the queue/chan can be lost when async exception is throwed to the read thread while waiting for read. (Although it has handler to recover lost item, it is difficult to keep FIFO in such case)
- In "unagi-chan", garbage items of the queue cannot be collected immediately. Since the buffer in the queue has the reference to the items until the buffer is garbage-collected.
-
Fast and flexible k-d trees for various types of point queries. This package includes static and dynamic versions of k-d trees, as well as "Map" variants that store data at each point in the k-d tree structure. Supports nearest neighbor, k nearest neighbors, points within a given radius, and points within a given range. To learn to use this package, start with the documentation for the Data.KdTree.Static module.
-
TCP keep alive implementation This module allows you to set per-connection keep alive parameters on windows, linux and darwin enviroments. For more information on keep alive signals see https://en.wikipedia.org/wiki/Keepalive. See also https://tldp.org/HOWTO/html_single/TCP-Keepalive-HOWTO/ for a linux specific implementation.