Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. singleton :: a -> [a]

   ihaskell	IHaskellPrelude

   Construct a list from a single element.

   Examples

   >>> singleton True
   [True]
   

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

   >>> singleton 'c'
   "c"
   

2. singleton :: Int -> IntSet

   intern	Data.Interned.IntSet

   O(1). A set of one element.

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

   linear-base	Foreign.Heap

   No documentation available.

4. singleton :: a -> AList a

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

   O(1) a singleton AList

5. 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
   

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

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

7. singleton :: Key -> IntMultiSet

   multiset	Data.IntMultiSet

   O(1). Create a singleton mutli set.

8. singleton :: a -> MultiSet a

   multiset	Data.MultiSet

   O(1). Create a singleton mutli set.

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

   netwire	FRP.Netwire.Utils.Timeline

   Singleton timeline with the given point.

10. singleton :: Int -> Bitmap

    primitive-extras	PrimitiveExtras.Bitmap

    No documentation available.

Page 25 of many | Previous | Next