Hoogle Search

Within LTS Haskell 24.2 (ghc-9.10.2)

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

Exact lookup

1. singleton :: Hashable k => k -> v -> HashMap k v

   unordered-containers	Data.HashMap.Internal.Strict

   Construct a map with a single element.

2. singleton :: Hashable k => k -> v -> HashMap k v

   unordered-containers	Data.HashMap.Lazy

   Construct a map with a single element.

3. singleton :: Hashable k => k -> v -> HashMap k v

   unordered-containers	Data.HashMap.Strict

   Construct a map with a single element.

4. singleton :: Hashable a => a -> HashSet a

   unordered-containers	Data.HashSet

   Construct a set with a single element.

   >>> HashSet.singleton 1
   fromList [1]
   

5. singleton :: Hashable a => a -> HashSet a

   unordered-containers	Data.HashSet.Internal

   Construct a set with a single element.

   >>> HashSet.singleton 1
   fromList [1]
   

6. singleton :: Word8 -> Builder

   binary	Data.Binary.Builder

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

   • toLazyByteString (singleton b) =
     singleton b

7. singleton :: a -> Deque a

   lens	Control.Lens.Internal.Deque

   O(1). Generate a singleton Deque

   >>> singleton 1
   BD 1 [1] 0 []
   

8. singleton :: a -> Range a

   hedgehog	Hedgehog.Internal.Range

   Construct a range which represents a constant single value.

   >>> bounds x $ singleton 5
   (5,5)
   

   >>> origin $ singleton 5
   5
   

9. singleton :: a -> Range a

   hedgehog	Hedgehog.Range

   Construct a range which represents a constant single value.

   >>> bounds x $ singleton 5
   (5,5)
   

   >>> origin $ singleton 5
   5
   

10. singleton :: ByteArray a => Word8 -> a

    memory	Data.ByteArray

    Create a byte array from a single byte

Page 4 of many | Previous | Next