Hoogle Search

Within LTS Haskell 24.53 (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]

   ghc-internal	GHC.Internal.Data.OldList

   Construct a list from a single element.

   Examples

   >>> singleton True
   [True]
   

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

   >>> singleton 'c'
   "c"
   

2. singleton :: Load r ix e => e -> Array r ix e

   massiv	Data.Massiv.Array

   Create an Array with a single element.

   Examples

   >>> import Data.Massiv.Array as A
   
   >>> singleton 7 :: Array D Ix4 Double
   Array D Seq (Sz (1 :> 1 :> 1 :. 1))
   [ [ [ [ 7.0 ]
   ]
   ]
   ]
   

   Instead of specifying type signature we could use TypeApplications

   >>> :set -XTypeApplications
   
   >>> singleton @U @Ix4 @Double 7
   Array U Seq (Sz (1 :> 1 :> 1 :. 1))
   [ [ [ [ 7.0 ]
   ]
   ]
   ]
   

3. singleton :: Load r ix e => e -> Array r ix e

   massiv	Data.Massiv.Vector

   Create an Array with a single element.

   Examples

   >>> import Data.Massiv.Array as A
   
   >>> singleton 7 :: Array D Ix4 Double
   Array D Seq (Sz (1 :> 1 :> 1 :. 1))
   [ [ [ [ 7.0 ]
   ]
   ]
   ]
   

   Instead of specifying type signature we could use TypeApplications

   >>> :set -XTypeApplications
   
   >>> singleton @U @Ix4 @Double 7
   Array U Seq (Sz (1 :> 1 :> 1 :. 1))
   [ [ [ [ 7.0 ]
   ]
   ]
   ]
   

4. singleton :: Hashable k => k -> v -> InsOrdHashMap k v

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   No documentation available.

5. singleton :: forall instr a (m :: Type -> Type) . instr a -> ProgramT instr m a

   operational	Control.Monad.Operational

   Program made from a single primitive instruction.

6. singleton :: (k, v) -> OMap k v

   ordered-containers	Data.Map.Ordered

   No documentation available.

7. singleton :: (k, v) -> OMap k v

   ordered-containers	Data.Map.Ordered.Strict

   No documentation available.

8. singleton :: a -> OSet a

   ordered-containers	Data.Set.Ordered

   No documentation available.

9. singleton :: a -> IORef (Weak b) -> (b -> IO ()) -> IO (WeakBag a, WeakBagTicket)

   reflex	Data.WeakBag

   Create a WeakBag with one item; equivalent to creating the WeakBag with empty, then using insert.

10. singleton :: Char -> Builder

    text-show	TextShow

    O(1). A Builder taking a single character, satisfying

    • toLazyText (singleton c) = singleton
      c

Page 13 of many | Previous | Next