Hoogle Search

Within LTS Haskell 24.16 (ghc-9.10.3)

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

Exact lookup

1. repeat :: a -> [a]

   base	Prelude

   repeat x is an infinite list, with x the value of every element.

   Examples

   >>> take 10 $ repeat 17
   [17,17,17,17,17,17,17,17,17, 17]
   

   >>> repeat undefined
   [*** Exception: Prelude.undefined
   

2. singleton :: a -> [a]

   base	Data.List

   Construct a list from a single element.

   Examples

   >>> singleton True
   [True]
   

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

   >>> singleton 'c'
   "c"
   

3. repeat :: a -> [a]

   base	Data.List

   repeat x is an infinite list, with x the value of every element.

   Examples

   >>> take 10 $ repeat 17
   [17,17,17,17,17,17,17,17,17, 17]
   

   >>> repeat undefined
   [*** Exception: Prelude.undefined
   

4. repeat :: a -> [a]

   base	GHC.List

   repeat x is an infinite list, with x the value of every element.

   Examples

   >>> take 10 $ repeat 17
   [17,17,17,17,17,17,17,17,17, 17]
   

   >>> repeat undefined
   [*** Exception: Prelude.undefined
   

5. shrinkNothing :: a -> [a]

   QuickCheck	Test.QuickCheck

   Returns no shrinking alternatives.

6. shrinkNothing :: a -> [a]

   QuickCheck	Test.QuickCheck.Arbitrary

   Returns no shrinking alternatives.

7. shrinkNothing :: a -> [a]

   tasty-quickcheck	Test.Tasty.QuickCheck

   Returns no shrinking alternatives.

8. repeat :: a -> [a]

   hedgehog	Hedgehog.Internal.Prelude

   repeat x is an infinite list, with x the value of every element.

   Examples

   >>> take 10 $ repeat 17
   [17,17,17,17,17,17,17,17,17, 17]
   

   >>> repeat undefined
   [*** Exception: Prelude.undefined
   

9. repeat :: a -> [a]

   ghc	GHC.Prelude.Basic

   No documentation available.

10. singleton :: a -> [a]

    ghc	GHC.Utils.Misc

    No documentation available.

Page 1 of many | Next