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.
singleton :: Int -> a -> SomeIntMapWith (SingletonProof 'Int Int) arefined-containers Data.IntMap.Refined Create a map with a single key-value pair, and return a proof that the key is in the resulting map.
singleton :: Int -> a -> SomeIntMapWith (SingletonProof 'Int Int) arefined-containers Data.IntMap.Strict.Refined Create a map with a single key-value pair, and return a proof that the key is in the resulting map.
singleton :: Int -> SomeIntSetWith (SingletonProof 'Int Int)refined-containers Data.IntSet.Refined Create a set with a single element.
singleton :: k -> a -> SomeMapWith (SingletonProof 'Regular k) k arefined-containers Data.Map.Refined Create a map with a single key-value pair, and return a proof that the key is in the resulting map.
singleton :: k -> a -> SomeMapWith (SingletonProof 'Regular k) k arefined-containers Data.Map.Strict.Refined Create a map with a single key-value pair, and return a proof that the key is in the resulting map.
singleton :: a -> SomeSetWith (SingletonProof 'Regular a) arefined-containers Data.Set.Refined Create a set with a single element.
-
xmonad-contrib XMonad.Prelude Construct a list from a single element.
Examples
>>> singleton True [True]
>>> singleton [1, 2, 3] [[1,2,3]]
>>> singleton 'c' "c"
class
Singleton (f :: Type -> Type)non-empty Data.NonEmpty.Class No documentation available.
-
weigh Weigh No documentation available.
-
tfp Type.Data.Bool No documentation available.