scalaz-core/scalaz.std/LazyListFunctions

LazyListFunctions

trait LazyListFunctions
class Object
trait Matchable
class Any
object Scalaz
object lazylist

Value members

Concrete methods

final
def heads[A](as: LazyList[A]): LazyList[LazyList[A]]

[as take 1, as take 2, ..., as]

[as take 1, as take 2, ..., as]

final
def interleave[A](s1: LazyList[A], s2: LazyList[A]): LazyList[A]
final
def intersperse[A](as: LazyList[A], a: A): LazyList[A]

Intersperse the element a between each adjacent pair of elements in as

Intersperse the element a between each adjacent pair of elements in as

final
def tails[A](as: LazyList[A]): LazyList[LazyList[A]]

[as, as.tail, as.tail.tail, ..., LazyList(as.last)]

[as, as.tail, as.tail.tail, ..., LazyList(as.last)]

final
def toZipper[A](as: LazyList[A]): Maybe[Zipper[A]]
def unfold[A, B](seed: A)(f: A => Option[(B, A)]): LazyList[B]
final
def unfoldForest[A, B](as: LazyList[A])(f: A => (B, () => LazyList[A])): LazyList[Tree[B]]
final
def unfoldForestM[A, B, M[_] : Monad](as: LazyList[A])(f: A => M[(B, LazyList[A])]): M[LazyList[Tree[B]]]
def unfoldm[A, B](seed: A)(f: A => Maybe[(B, A)]): LazyList[B]
final
def zapp[A, B, C](a: LazyList[A])(f: LazyList[A => B => C]): LazyList[B => C]
final
def zipperEnd[A](as: LazyList[A]): Maybe[Zipper[A]]