• About
  • Snapshots
  • LTS
  • Nightly
  • FAQ
  • Blog

Hoogle Search

Within LTS Haskell 24.5 (ghc-9.10.2)

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

  1. singleton :: k -> a -> MinPQueue k a

    pqueue Data.PQueue.Prio.Min

    Constructs a singleton priority queue.

  2. singleton :: C bool => Singleton bool

    tfp Type.Data.Bool

    No documentation available.

  3. singleton :: Integer x => Singleton x

    tfp Type.Data.Num

    No documentation available.

  4. singleton :: C d => Singleton d

    tfp Type.Data.Num.Decimal.Digit

    No documentation available.

  5. singleton :: Integer x => Singleton x

    tfp Type.Data.Num.Decimal.Number

    No documentation available.

  6. singleton :: Natural n => Singleton n

    tfp Type.Data.Num.Unary

    No documentation available.

  7. singleton :: (Contiguous arr, Element arr a) => a -> arr a

    contiguous Data.Primitive.Contiguous

    Create a singleton array.

  8. singleton :: (Contiguous arr, Element arr a) => a -> arr a

    contiguous Data.Primitive.Contiguous.Class

    Create a singleton array.

  9. singleton :: k -> v -> Map k v

    dhall Dhall.Map

    Create a Map from a single key-value pair

    >>> singleton "A" 1
    fromList [("A",1)]
    

  10. singleton :: Ord k => k -> a -> PriorityQ k a

    distributed-process-extras Control.Distributed.Process.Extras.Internal.Queue.PriorityQ

    No documentation available.

Page 17 of many | Previous | Next

Stackage is a service provided by the Haskell Foundation │ Originally developed by FP Complete