Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

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

2. singleton :: ListLike full item => item -> full

   ListLike	Data.ListLike

   Creates a single-element list out of an element

3. singleton :: ListLike full item => item -> full

   ListLike	Data.ListLike.Base

   Creates a single-element list out of an element

4. singleton :: a -> [a]

   basic-prelude	BasicPrelude

   Construct a list from a single element.

   Examples

   >>> singleton True
   [True]
   

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

   >>> singleton 'c'
   "c"
   

5. singleton :: Location -> a -> BorderMap a

   brick	Brick.BorderMap

   A BorderMap that tracks only the given the point (and initially maps it to the given value).

6. singleton :: Int -> Run a -> IMap a

   brick	Data.IMap

   No documentation available.

7. singleton :: Char -> ShortText

   ghc-lib-parser	GHC.Data.ShortText

   Create a singleton

8. singleton :: Key -> a -> Word64Map a

   ghc-lib-parser	GHC.Data.Word64Map.Internal

   A map of one element.

   singleton 1 'a'        == fromList [(1, 'a')]
   size (singleton 1 'a') == 1
   

9. singleton :: Key -> a -> Word64Map a

   ghc-lib-parser	GHC.Data.Word64Map.Lazy

   A map of one element.

   singleton 1 'a'        == fromList [(1, 'a')]
   size (singleton 1 'a') == 1
   

10. singleton :: Key -> a -> Word64Map a

    ghc-lib-parser	GHC.Data.Word64Map.Strict

    A map of one element.

    singleton 1 'a'        == fromList [(1, 'a')]
    size (singleton 1 'a') == 1
    

Page 15 of many | Previous | Next