Hoogle Search

Within LTS Haskell 13.3 (ghc-8.6.3)

  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 :: ListLike full item => item -> full -> full

    ListLike Data.ListLike

    Add an item between each element in the structure

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

    ListLike Data.ListLike.Base

    Add an item between each element in the structure

  7. intersperse :: () => a -> [a] -> [a]

    listsafe Data.List.Safe

    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"
    

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

    prelude-compat Data.List2010

    No documentation available.

Page 1 of 1