Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. singleton :: (Ord k, MonoidNull v) => k -> v -> MonoidMap k v

    monoidmap Data.MonoidMap

    Constructs a MonoidMap from a single key-value pair. Satisfies the following property: 

    get k (singleton k v) == v
    Nullifying the value for key k produces an empty map: 
    nullify k (singleton k v) == empty

  2. singleton :: a -> NonEmptyVector a

    nonempty-vector Data.Vector.NonEmpty

    O(1) Non-empty vector with exactly one element 

    >>> singleton "a"
["a"]

  3. singleton :: a -> SortedList a

    sorted-list Data.SortedList

    O(1). Create a sorted list with only one element.

  4. singleton :: forall (comp :: Nat) . KnownNat comp => Double -> TDigest comp

    tdigest Data.TDigest.Tree

    Make a TDigest of a single data point.

  5. singleton :: forall (comp :: Nat) . KnownNat comp => Double -> TDigest comp

    tdigest Data.TDigest.Tree.Internal

    Make a TDigest of a single data point.

  6. singleton :: forall (comp :: Nat) . KnownNat comp => Double -> TDigest comp

    tdigest Data.TDigest.Tree.NonEmpty

    No documentation available.

  7. singleton :: forall (comp :: Nat) . Double -> TDigest comp

    tdigest Data.TDigest.Vector

    Make a TDigest of a single data point.

  8. singleton :: forall (comp :: Nat) . Double -> TDigest comp

    tdigest Data.TDigest.Vector.Internal

    Make a TDigest of a single data point.

  9. singleton :: element -> Builder element

    vector-builder VectorBuilder.Builder

    Builder of a single element.

  10. singleton :: a -> [a]

    LambdaHack Game.LambdaHack.Core.Prelude

    Construct a list from a single element.

    Examples

    >>> singleton True
[True]

    >>> singleton [1, 2, 3]
[[1,2,3]]

    >>> singleton 'c'
"c"

Page 22 of many | Previous | Next