Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

  1. singleton :: Int -> IntSet

    intern Data.Interned.IntSet

    O(1). A set of one element.

  2. singleton :: (Representable k, Representable a) => k % 1 -> a % 1 -> Pool % 1 -> Heap k a

    linear-base Foreign.Heap

    No documentation available.

  3. singleton :: a -> AList a

    monad-par-extras Control.Monad.Par.AList

    O(1) a singleton AList

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

    monoidmap-internal Data.MonoidMap.Internal

    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

  5. singleton :: Ord k => k -> v -> Map k v

    monoidmap-internal Data.MonoidMap.Internal.RecoveredMap

    No documentation available.

  6. singleton :: Key -> IntMultiSet

    multiset Data.IntMultiSet

    O(1). Create a singleton mutli set.

  7. singleton :: a -> MultiSet a

    multiset Data.MultiSet

    O(1). Create a singleton mutli set.

  8. singleton :: t -> a -> Timeline t a

    netwire FRP.Netwire.Utils.Timeline

    Singleton timeline with the given point.

  9. singleton :: Int -> Bitmap

    primitive-extras PrimitiveExtras.Bitmap

    No documentation available.

  10. singleton :: Int -> e -> By6Bits e

    primitive-extras PrimitiveExtras.By6Bits

    An array with a single element at the specified index.

Page 25 of many | Previous | Next