Hoogle Search
Within LTS Haskell 24.48 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Haskell98 indexed functors, monads, comonads Haskell98 indexed functors, monads, comonads
-
Simple, no-frills indexed lists. If the lengths of your lists are known statically, using indexed lists improves type safety with no runtime overhead.
-
InfluxDB client library for Haskell influxdb is an InfluxDB client library for Haskell. See Database.InfluxDB for a quick start guide.
-
Lets you embed C++ code into Haskell. Utilities to inline C++ code into Haskell using inline-c. See tests for example on how to build.
-
Checked conversions between integral types Provides statically or dynamically checked conversions between integral types. See documentation in Data.IntCast for more details.
package
intermediate-structures Some simple functions to deal with transformations from structures to other ones, basically lists. The function mapI is taken from the mmsyn5 package. This inspired some more general functionality.
package
interpolatedstring-perl6 QuasiQuoter for Perl6-style multi-line interpolated strings QuasiQuoter for Perl6-style multi-line interpolated strings with "q", "qq" and "qc" support.
-
piecewise linear and cubic Hermite interpolation Represent real functions by linear or cubic polynomial segments. The package provides both data structures for efficient lookup of interpolation intervals, and computation of basis functions. There are two examples that can be built with
cabal install -fbuildExamples
- example/Plot.hs: Interpolate a sinus curve using piecewise linear interpolation and piecewise Hermite cubic interpolation. For the latter one we provide the derivatives of the sinus function at the interpolation nodes.
- example/Fit.hs: Demonstrates how to use the basis functions for fitting an interpolation function to a given function using a linear least squares solver like from lapack. We use a distorted sinus as target.
-
Interval Arithmetic A Numeric.Interval.Interval is a closed, convex set of floating point values. We do not control the rounding mode of the end points of the interval when using floating point arithmetic, so be aware that in order to get precise containment of the result, you will need to use an underlying type with both lower and upper bounds like CReal
-
An imperative integer set written in Haskell. An imperative integer set written in Haskell. Read https://deliquus.com/posts/2018-07-30-imperative-programming-in-haskell.html for more information.