Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. singleton :: k -> a -> MonoidalMap k a

   monoidal-containers	Data.Map.Monoidal.Strict

   O(1). A map with a single element.

2. singleton :: Key -> a -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(1). A map with a single element.

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

3. singleton :: Key -> a -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty.Internal

   O(1). A map with a single element.

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

4. singleton :: Key -> NEIntSet

   nonempty-containers	Data.IntSet.NonEmpty

   O(1). Create a singleton set.

5. singleton :: Key -> NEIntSet

   nonempty-containers	Data.IntSet.NonEmpty.Internal

   O(1). Create a singleton set.

6. singleton :: k -> a -> NEMap k a

   nonempty-containers	Data.Map.NonEmpty

   O(1). A map with a single element.

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

7. singleton :: k -> a -> NEMap k a

   nonempty-containers	Data.Map.NonEmpty.Internal

   O(1). A map with a single element.

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

8. singleton :: a -> NESeq a

   nonempty-containers	Data.Sequence.NonEmpty

   A singleton sequence.

9. singleton :: a -> NESeq a

   nonempty-containers	Data.Sequence.NonEmpty.Internal

   A singleton sequence.

10. singleton :: a -> NESet a

    nonempty-containers	Data.Set.NonEmpty

    O(1). Create a singleton set.

Page 19 of many | Previous | Next