scalaz-core/scalaz/ICons

ICons

final case
class ICons[A](head: A, tail: IList[A]) extends IList[A]
class IList[A]
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any

Value members

Inherited methods

def ++(as: IList[A]): IList[A]

alias for concat

alias for concat

Inherited from
IList
def ++:(as: IList[A]): IList[A]

alias for prepend

alias for prepend

Inherited from
IList
def +:(a: A): IList[A]
Inherited from
IList
def /:[B](b: B)(f: (B, A) => B): B

alias for foldLeft

alias for foldLeft

Inherited from
IList
def :+(a: A): IList[A]
Inherited from
IList
def ::(a: A): IList[A]
Inherited from
IList
def :::(as: IList[A]): IList[A]
Inherited from
IList
def :\[B](b: B)(f: (A, B) => B): B

alias for foldRight

alias for foldRight

Inherited from
IList
final
def <^>[B](f: OneAnd[IList, A] => B)(implicit B: Monoid[B]): B

Returns f applied to contents if non-empty, otherwise the zero of B.

Returns f applied to contents if non-empty, otherwise the zero of B.

Inherited from
IList
def collect[B](pf: PartialFunction[A, B]): IList[B]
Inherited from
IList
def collectFirst[B](pf: PartialFunction[A, B]): Maybe[B]
Inherited from
IList
def concat(as: IList[A]): IList[A]
Inherited from
IList
def containsSlice(as: IList[A])(implicit ev: Equal[A]): Boolean
Inherited from
IList
def count(f: A => Boolean): Int
Inherited from
IList
def distinct(implicit A: Order[A]): IList[A]
Inherited from
IList
def drop(n: Int): IList[A]
Inherited from
IList
def dropRight(n: Int): IList[A]
Inherited from
IList
def dropRightWhile(f: A => Boolean): IList[A]
Inherited from
IList
def dropWhile(f: A => Boolean): IList[A]
Inherited from
IList
def endsWith(as: IList[A])(implicit ev: Equal[A]): Boolean
Inherited from
IList
def filter(f: A => Boolean): IList[A]
Inherited from
IList
def filterM[F[_]](f: A => F[Boolean])(implicit F: Applicative[F]): F[IList[A]]
Inherited from
IList
def filterNot(f: A => Boolean): IList[A]
Inherited from
IList
def find(f: A => Boolean): Maybe[A]
Inherited from
IList
def flatMap[B](f: A => IList[B]): IList[B]
Inherited from
IList
def flatten[B](implicit ev: Liskov[A, IList[B]]): IList[B]
Inherited from
IList
def foldLeft[B](b: B)(f: (B, A) => B): B
Inherited from
IList
def foldRight[B](b: B)(f: (A, B) => B): B
Inherited from
IList
def groupBy[K](f: A => K)(implicit ev: Order[K]): K ==>> NonEmptyList[A]
Inherited from
IList
def groupBy1[K](f: A => K)(implicit ev: Order[K]): K ==>> OneAnd[IList, A]
Inherited from
IList
def headMaybe: Maybe[A]
Inherited from
IList
def headOption: Option[A]
Inherited from
IList
def indexOf(a: A)(implicit ev: Equal[A]): Option[Int]
Inherited from
IList
def indexOfSlice(slice: IList[A])(implicit ev: Equal[A]): Option[Int]
Inherited from
IList
def indexWhere(f: A => Boolean): Option[Int]
Inherited from
IList
def initMaybe: Maybe[IList[A]]
Inherited from
IList
def inits: IList[IList[A]]
Inherited from
IList
def interleave(that: IList[A]): IList[A]
Inherited from
IList
def intersperse(a: A): IList[A]
Inherited from
IList
def isEmpty: Boolean
Inherited from
IList
def lastIndexOf(a: A)(implicit ev: Equal[A]): Option[Int]
Inherited from
IList
def lastIndexOfSlice(as: IList[A])(implicit ev: Equal[A]): Option[Int]
Inherited from
IList
def lastIndexWhere(f: A => Boolean): Option[Int]
Inherited from
IList
@tailrec
final
def lastOption: Option[A]
Inherited from
IList
def length: Int
Inherited from
IList
def map[B](f: A => B): IList[B]
Inherited from
IList
def mapAccumLeft[B, C](c: C)(f: (C, A) => (C, B)): (C, IList[B])

All of the Bs, in order, and the final C acquired by a stateful left fold over as.

All of the Bs, in order, and the final C acquired by a stateful left fold over as.

Inherited from
IList
final
def mapAccumRight[B, C](c: C)(f: (C, A) => (C, B)): (C, IList[B])

All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.

All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.

Inherited from
IList
def nonEmpty: Boolean
Inherited from
IList
def padTo(n: Int, a: A): IList[A]
Inherited from
IList
def partition(f: A => Boolean): (IList[A], IList[A])
Inherited from
IList
def patch(from: Int, patch: IList[A], replaced: Int): IList[A]
Inherited from
IList
def prefixLength(f: A => Boolean): Int
Inherited from
IList
def prepend(as: IList[A]): IList[A]
Inherited from
IList
def productElementNames: Iterator[String]
Inherited from
Product
def productIterator: Iterator[Any]
Inherited from
Product
def reduceLeftOption(f: (A, A) => A): Option[A]
Inherited from
IList
def reduceRightOption(f: (A, A) => A): Option[A]
Inherited from
IList
def reverse: IList[A]
Inherited from
IList
def reverseMap[B](f: A => B): IList[B]
Inherited from
IList
def reverse_:::(as: IList[A]): IList[A]
Inherited from
IList
def scanLeft[B](z: B)(f: (B, A) => B): IList[B]
Inherited from
IList
def scanRight[B](z: B)(f: (A, B) => B): IList[B]
Inherited from
IList
def slice(from: Int, until: Int): IList[A]
Inherited from
IList
def sortBy[B](f: A => B)(implicit B: Order[B]): IList[A]
Inherited from
IList
def sorted(implicit ev: Order[A]): IList[A]
Inherited from
IList
def span(f: A => Boolean): (IList[A], IList[A])
Inherited from
IList
def splitAt(n: Int): (IList[A], IList[A])
Inherited from
IList
def startsWith(as: IList[A])(implicit ev: Equal[A]): Boolean
Inherited from
IList
def tailMaybe: Maybe[IList[A]]
Inherited from
IList
def tails: IList[IList[A]]
Inherited from
IList
def take(n: Int): IList[A]
Inherited from
IList
def takeRight(n: Int): IList[A]
Inherited from
IList
def takeRightWhile(f: A => Boolean): IList[A]
Inherited from
IList
def takeWhile(f: A => Boolean): IList[A]
Inherited from
IList
def toList: List[A]
Inherited from
IList
def toMap[K, V](implicit ev0: Liskov[A, (K, V)], ev1: Order[K]): K ==>> V
Inherited from
IList
def toNel: Maybe[NonEmptyList[A]]
Inherited from
IList
def toStream: Stream[A]
Inherited from
IList
override
def toString: String
Definition Classes
IList -> Any
Inherited from
IList
def toVector: Vector[A]
Inherited from
IList
def toZipper: Maybe[Zipper[A]]
Inherited from
IList
def traverseDisjunction[E, B](f: A => E \/ B): E \/ IList[B]

Referentially transparent replacement for traverse, specialised to disjunction.

Referentially transparent replacement for traverse, specialised to disjunction.

Inherited from
IList
def uncons[B](n: => B, c: (A, IList[A]) => B): B
Inherited from
IList
def unzip[B, C](implicit ev: Liskov[A, (B, C)]): (IList[B], IList[C])
Inherited from
IList
def updated(index: Int, a: A): IList[A]

Unlike stdlib's version, this is total and simply ignores indices that are out of range

Unlike stdlib's version, this is total and simply ignores indices that are out of range

Inherited from
IList
def widen[B](implicit ev: Liskov[A, B]): IList[B]
Inherited from
IList
def zip[B](b: => IList[B]): IList[(A, B)]
Inherited from
IList
def zipWithIndex: IList[(A, Int)]
Inherited from
IList