Hoogle Search
Within LTS Haskell 23.23 (ghc-9.8.4)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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.
Laziness
intersperse has the following properties>>> take 1 (intersperse undefined ('a' : undefined)) "a"
>>> take 2 (intersperse ',' ('a' : undefined)) "a*** Exception: Prelude.undefined
Examples
>>> intersperse ',' "abcde" "a,b,c,d,e"
>>> intersperse 1 [3, 4, 5] [3,1,4,1,5]
intersperse :: a -> NonEmpty a -> NonEmpty abase 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]
intersperse :: a -> NonEmpty a -> NonEmpty abase-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]
intersperse :: a -> NonEmpty a -> NonEmpty abase-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]
intersperse :: a -> Infinite a -> Infinite ainfinite-list Data.List.Infinite Insert an element between adjacent elements of an infinite list.
intersperse :: ListLike full item => item -> full -> fullListLike Data.ListLike Add an item between each element in the structure
intersperse :: ListLike full item => item -> full -> fullListLike Data.ListLike.Base Add an item between each element in the structure
intersperse :: a -> [a] -> [a]prelude-compat Data.List2010 No documentation available.
intersperse :: a -> Infinite a -> Infinite aextra-data-yj Data.List.Infinite No documentation available.
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 many | Next