Hoogle Search

Within LTS Haskell 24.17 (ghc-9.10.3)

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

Exact lookup

1. module Rebase.Data.List.NonEmpty

   No documentation available.

2. data NonEmpty a

   rebase	Rebase.Prelude

   Non-empty (and non-strict) list type.

3. data NonEmpty a

   base-prelude	BasePrelude

   Non-empty (and non-strict) list type.

4. data NonEmpty a

   base-prelude	BasePrelude.DataTypes

   Non-empty (and non-strict) list type.

5. module Cursor.List.NonEmpty

   No documentation available.

6. module Cursor.Simple.List.NonEmpty

   No documentation available.

7. data NonEmpty a

   extra-data-yj	Data.List.Infinite

   Non-empty (and non-strict) list type.

8. module Data.Vector.NonEmpty

   A library for non-empty boxed vectors (that is, polymorphic arrays capable of holding any Haskell value). Non-empty vectors come in two flavors:

   • mutable
   • immutable
   This library attempts to provide support for all standard Vector operations in the API, with some slight variation in types and implementation. For example, since head and foldr are always gauranteed to be over a non-empty Vector, it is safe to make use of the 'unsafe-*' Vector operations and semigroupal folds available in the API in lieu of the standard implementations. In contrast, some operations such as filter may "break out" of a NonEmptyVector due to the fact that there are no guarantees that may be made on the types of Bool-valued functions passed in, hence one could write the following:

   filter (const false) v
   

   which always produces an empty vector. Thus, some operations must return either a Maybe containing a NonEmptyVector or a Vector whenever appropriate. Generally The former is used in initialization and generation operations, and the latter is used in iterative operations where the intent is not to create an instance of NonEmptyVector. Credit to Roman Leshchinskiy for the original Vector library upon which this is based.

9. module Data.TDigest.NonEmpty

   No documentation available.

10. module Data.TDigest.Tree.NonEmpty

    This is non empty version of TDigest, i.e. this is not a Monoid, but on the other hand, quantile returns Double not Maybe Double. See Data.TDigest for documentation. The exports should be similar, sans non-Maybe results.

    Examples

    >>> quantile 0.99 (tdigest (1 :| [2..1000]) :: TDigest 25)
    990.5
    

    >>> quantile 0.99 (tdigest (1 :| [2..1000]) :: TDigest 3)
    989.0...
    

    t-Digest is more precise in tails, especially median is imprecise:

    >>> median (forceCompress $ tdigest (1 :| [2..1000]) :: TDigest 25)
    497.6...
    

Page 5 of many | Previous | Next