Hoogle Search

Within LTS Haskell 22.21 (ghc-9.6.5)

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

Exact lookup

1. intersperse :: a -> [a] -> [a]

   base	Data.List

   The intersperse function takes an element and a list and `intersperses' that element between the elements of the list. For example,

   >>> intersperse ',' "abcde"
   "a,b,c,d,e"
   

2. intersperse :: a -> NonEmpty a -> NonEmpty a

   base	Data.List.NonEmpty

   'intersperse x xs' alternates elements of the list with copies of x.

   intersperse 0 (1 :| [2,3]) == 1 :| [0,2,0,3]
   

3. intersperse :: a -> NonEmpty a -> NonEmpty a

   base-compat	Data.List.NonEmpty.Compat

   'intersperse x xs' alternates elements of the list with copies of x.

   intersperse 0 (1 :| [2,3]) == 1 :| [0,2,0,3]
   

4. intersperse :: a -> NonEmpty a -> NonEmpty a

   base-compat-batteries	Data.List.NonEmpty.Compat

   'intersperse x xs' alternates elements of the list with copies of x.

   intersperse 0 (1 :| [2,3]) == 1 :| [0,2,0,3]
   

5. intersperse :: a -> Infinite a -> Infinite a

   infinite-list	Data.List.Infinite

   Insert an element between adjacent elements of an infinite list.

6. intersperse :: a -> [a] -> [a]

   prelude-compat	Data.List2010

   No documentation available.

7. intersperse :: ListLike full item => item -> full -> full

   ListLike	Data.ListLike

   Add an item between each element in the structure

8. intersperse :: ListLike full item => item -> full -> full

   ListLike	Data.ListLike.Base

   Add an item between each element in the structure

9. intersperse :: a -> Infinite a -> Infinite a

   extra-data-yj	Data.List.Infinite

   No documentation available.

10. intersperse :: a -> [a] % 1 -> [a]

    linear-base	Data.List.Linear

    The intersperse function takes an element and a list and intersperses that element between the elements of the list.

Page 1 of 3 | Next