Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. singleton :: (Hashable k, Ord k, Ord p) => k -> p -> v -> HashPSQ k p v

   psqueues	Data.HashPSQ

   O(1) Build a queue with one element.

2. singleton :: Ord p => Int -> p -> v -> IntPSQ p v

   psqueues	Data.IntPSQ

   O(1) Build a queue with one element.

3. singleton :: k -> p -> v -> OrdPSQ k p v

   psqueues	Data.OrdPSQ

   O(1) Build a queue with one element.

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

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

   ListLike	Data.ListLike

   Creates a single-element list out of an element

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

   ListLike	Data.ListLike.Base

   Creates a single-element list out of an element

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

8. 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).

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

   brick	Data.IMap

   No documentation available.

10. singleton :: Char -> ShortText

    ghc-lib-parser	GHC.Data.ShortText

    Create a singleton

Page 15 of many | Previous | Next