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.
-
Swizzle functions Please see the README on GitHub at https://github.com/YoshikuniJujo/swizzle#readme
-
Swizzle set functions Please see the README on GitHub at https://github.com/YoshikuniJujo/swizzle-set#readme
-
A webdriver companion library for sydtest A webdriver companion library for sydtest
package
synthesizer-dimensional Audio signal processing with static physical dimensions High-level functions that use physical units and abstract from the sample rate in a statically type safe way.
-
alternative package for processing of tag soups Tagchup is a package for processing XML, HTML, XHTML documents that can also be malformed. It allows parsing, formatting and retrieval of such document. All functions should be as lazy as possible. I use a custom data structure based on types from xml-basic for easy interchange with the wraxml package. Its lazy monadic parser should be more comprehensible and easier to extend than the one of tagsoup-0.6. It also handles XML processing instructions and CDATA sections correctly. The name Tagchup resembles Ketchup.
-
Check multiple items during a tasty test Allows the test to check a number of items during a test and only signal pass or fail when the end if the checklist is reached. Also provides an easy method to check multiple derived values from a single input value.
-
Bencmarking using instruction counting Benchmarking framework which uses instruction counters intead of time measurements. Instruction count is only proxy for code performance but unlike time could be measured deterministically. PAPI is used in order to access hardware counters.
-
Test 'wai' endpoints via Test.Tasty Helper functions and runners for testing wai endpoints using the Tasty testing infrastructure.
-
On-line accumulation of rank-based statistics A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means. See original paper: "Computing extremely accurate quantiles using t-digest" by Ted Dunning and Otmar Ertl for more details https://github.com/tdunning/t-digest/blob/07b8f2ca2be8d0a9f04df2feadad5ddc1bb73c88/docs/t-digest-paper/histo.pdf.
-
Build safe and composable teardown sub-routines for resources The teardown library allows you to reliably execute cleanup sub-routines for allocated resources. When a program is initialized, it:
- Ensures that teardown sub-routines are executed exactly once
- Ensures that if errors occur on the execution of a Teardown sub-routine, the error does not propagate to others; bulkheading failure on cleanup.
- Requires every sub-routine to be documented at creation time; thus helping tracing your application structure.
- Allows tracing the teardown of your application, how is structured, how much time it takes to execute, and what component (if any) failed to finalize.