Class

scalaz

ICons

Related Doc: package scalaz

Permalink

final case class ICons[A](head: A, tail: IList[A]) extends IList[A] with Product with Serializable

Source
IList.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ICons
  2. IList
  3. Serializable
  4. Serializable
  5. Product
  6. Equals
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ICons(head: A, tail: IList[A])

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def ++(as: IList[A]): IList[A]

    Permalink

    alias for concat

    alias for concat

    Definition Classes
    IList
  4. def ++:(as: IList[A]): IList[A]

    Permalink

    alias for prepend

    alias for prepend

    Definition Classes
    IList
  5. def +:(a: A): IList[A]

    Permalink
    Definition Classes
    IList
  6. def /:[B](b: B)(f: (B, A) ⇒ B): B

    Permalink

    alias for foldLeft

    alias for foldLeft

    Definition Classes
    IList
  7. def :+(a: A): IList[A]

    Permalink
    Definition Classes
    IList
  8. def ::(a: A): IList[A]

    Permalink
    Definition Classes
    IList
  9. def :::(as: IList[A]): IList[A]

    Permalink
    Definition Classes
    IList
  10. def :\[B](b: B)(f: (A, B) ⇒ B): B

    Permalink

    alias for foldRight

    alias for foldRight

    Definition Classes
    IList
  11. final def <^>[B](f: (OneAnd[IList, A]) ⇒ B)(implicit B: Monoid[B]): B

    Permalink

    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.

    Definition Classes
    IList
  12. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  13. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  14. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  15. def collect[B](pf: PartialFunction[A, B]): IList[B]

    Permalink
    Definition Classes
    IList
  16. def collectFirst[B](pf: PartialFunction[A, B]): Maybe[B]

    Permalink
    Definition Classes
    IList
  17. def concat(as: IList[A]): IList[A]

    Permalink
    Definition Classes
    IList
  18. def containsSlice(as: IList[A])(implicit ev: Equal[A]): Boolean

    Permalink
    Definition Classes
    IList
  19. def count(f: (A) ⇒ Boolean): Int

    Permalink
    Definition Classes
    IList
  20. def distinct(implicit A: Order[A]): IList[A]

    Permalink
    Definition Classes
    IList
  21. def drop(n: Int): IList[A]

    Permalink
    Definition Classes
    IList
  22. def dropRight(n: Int): IList[A]

    Permalink
    Definition Classes
    IList
  23. def dropRightWhile(f: (A) ⇒ Boolean): IList[A]

    Permalink
    Definition Classes
    IList
  24. def dropWhile(f: (A) ⇒ Boolean): IList[A]

    Permalink
    Definition Classes
    IList
  25. def endsWith(as: IList[A])(implicit ev: Equal[A]): Boolean

    Permalink
    Definition Classes
    IList
  26. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  27. def filter(f: (A) ⇒ Boolean): IList[A]

    Permalink
    Definition Classes
    IList
  28. def filterM[F[_]](f: (A) ⇒ F[Boolean])(implicit F: Applicative[F]): F[IList[A]]

    Permalink
    Definition Classes
    IList
  29. def filterNot(f: (A) ⇒ Boolean): IList[A]

    Permalink
    Definition Classes
    IList
  30. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  31. def find(f: (A) ⇒ Boolean): Maybe[A]

    Permalink
    Definition Classes
    IList
  32. def flatMap[B](f: (A) ⇒ IList[B]): IList[B]

    Permalink
    Definition Classes
    IList
  33. def flatten[B](implicit ev: <~<[A, IList[B]]): IList[B]

    Permalink
    Definition Classes
    IList
  34. def foldLeft[B](b: B)(f: (B, A) ⇒ B): B

    Permalink
    Definition Classes
    IList
  35. def foldRight[B](b: B)(f: (A, B) ⇒ B): B

    Permalink
    Definition Classes
    IList
  36. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  37. def groupBy[K](f: (A) ⇒ K)(implicit ev: Order[K]): ==>>[K, NonEmptyList[A]]

    Permalink
    Definition Classes
    IList
  38. def groupBy1[K](f: (A) ⇒ K)(implicit ev: Order[K]): ==>>[K, OneAnd[IList, A]]

    Permalink
    Definition Classes
    IList
  39. val head: A

    Permalink
  40. def headMaybe: Maybe[A]

    Permalink
    Definition Classes
    IList
  41. def headOption: Option[A]

    Permalink
    Definition Classes
    IList
  42. def indexOf(a: A)(implicit ev: Equal[A]): Option[Int]

    Permalink
    Definition Classes
    IList
  43. def indexOfSlice(slice: IList[A])(implicit ev: Equal[A]): Option[Int]

    Permalink
    Definition Classes
    IList
  44. def indexWhere(f: (A) ⇒ Boolean): Option[Int]

    Permalink
    Definition Classes
    IList
  45. def initMaybe: Maybe[IList[A]]

    Permalink
    Definition Classes
    IList
  46. def inits: IList[IList[A]]

    Permalink
    Definition Classes
    IList
  47. def interleave(that: IList[A]): IList[A]

    Permalink
    Definition Classes
    IList
  48. def intersperse(a: A): IList[A]

    Permalink
    Definition Classes
    IList
  49. def isEmpty: Boolean

    Permalink
    Definition Classes
    IList
  50. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  51. def lastIndexOf(a: A)(implicit ev: Equal[A]): Option[Int]

    Permalink
    Definition Classes
    IList
  52. def lastIndexOfSlice(as: IList[A])(implicit ev: Equal[A]): Option[Int]

    Permalink
    Definition Classes
    IList
  53. def lastIndexWhere(f: (A) ⇒ Boolean): Option[Int]

    Permalink
    Definition Classes
    IList
  54. final def lastOption: Option[A]

    Permalink
    Definition Classes
    IList
    Annotations
    @tailrec()
  55. def length: Int

    Permalink
    Definition Classes
    IList
  56. def map[B](f: (A) ⇒ B): IList[B]

    Permalink
    Definition Classes
    IList
  57. def mapAccumLeft[B, C](c: C)(f: (C, A) ⇒ (C, B)): (C, IList[B])

    Permalink

    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.

    Definition Classes
    IList
  58. final def mapAccumRight[B, C](c: C)(f: (C, A) ⇒ (C, B)): (C, IList[B])

    Permalink

    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.

    Definition Classes
    IList
  59. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  60. def nonEmpty: Boolean

    Permalink
    Definition Classes
    IList
  61. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  62. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  63. def padTo(n: Int, a: A): IList[A]

    Permalink
    Definition Classes
    IList
  64. def partition(f: (A) ⇒ Boolean): (IList[A], IList[A])

    Permalink
    Definition Classes
    IList
  65. def patch(from: Int, patch: IList[A], replaced: Int): IList[A]

    Permalink
    Definition Classes
    IList
  66. def prefixLength(f: (A) ⇒ Boolean): Int

    Permalink
    Definition Classes
    IList
  67. def prepend(as: IList[A]): IList[A]

    Permalink
    Definition Classes
    IList
  68. def reduceLeftOption(f: (A, A) ⇒ A): Option[A]

    Permalink
    Definition Classes
    IList
  69. def reduceRightOption(f: (A, A) ⇒ A): Option[A]

    Permalink
    Definition Classes
    IList
  70. def reverse: IList[A]

    Permalink
    Definition Classes
    IList
  71. def reverseMap[B](f: (A) ⇒ B): IList[B]

    Permalink
    Definition Classes
    IList
  72. def reverse_:::(as: IList[A]): IList[A]

    Permalink
    Definition Classes
    IList
  73. def scanLeft[B](z: B)(f: (B, A) ⇒ B): IList[B]

    Permalink
    Definition Classes
    IList
  74. def scanRight[B](z: B)(f: (A, B) ⇒ B): IList[B]

    Permalink
    Definition Classes
    IList
  75. def slice(from: Int, until: Int): IList[A]

    Permalink
    Definition Classes
    IList
  76. def sortBy[B](f: (A) ⇒ B)(implicit B: Order[B]): IList[A]

    Permalink
    Definition Classes
    IList
  77. def sorted(implicit ev: Order[A]): IList[A]

    Permalink
    Definition Classes
    IList
  78. def span(f: (A) ⇒ Boolean): (IList[A], IList[A])

    Permalink
    Definition Classes
    IList
  79. def splitAt(n: Int): (IList[A], IList[A])

    Permalink
    Definition Classes
    IList
  80. def startsWith(as: IList[A])(implicit ev: Equal[A]): Boolean

    Permalink
    Definition Classes
    IList
  81. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  82. val tail: IList[A]

    Permalink
  83. def tailMaybe: Maybe[IList[A]]

    Permalink
    Definition Classes
    IList
  84. def tails: IList[IList[A]]

    Permalink
    Definition Classes
    IList
  85. def take(n: Int): IList[A]

    Permalink
    Definition Classes
    IList
  86. def takeRight(n: Int): IList[A]

    Permalink
    Definition Classes
    IList
  87. def takeRightWhile(f: (A) ⇒ Boolean): IList[A]

    Permalink
    Definition Classes
    IList
  88. def takeWhile(f: (A) ⇒ Boolean): IList[A]

    Permalink
    Definition Classes
    IList
  89. def toEphemeralStream: EphemeralStream[A]

    Permalink
    Definition Classes
    IList
  90. def toList: List[A]

    Permalink
    Definition Classes
    IList
  91. def toMap[K, V](implicit ev0: <~<[A, (K, V)], ev1: Order[K]): ==>>[K, V]

    Permalink
    Definition Classes
    IList
  92. def toNel: Maybe[NonEmptyList[A]]

    Permalink
    Definition Classes
    IList
  93. def toStream: Stream[A]

    Permalink
    Definition Classes
    IList
  94. def toString(): String

    Permalink
    Definition Classes
    IList → AnyRef → Any
  95. def toVector: Vector[A]

    Permalink
    Definition Classes
    IList
  96. def toZipper: Maybe[Zipper[A]]

    Permalink
    Definition Classes
    IList
  97. def traverseDisjunction[E, B](f: (A) ⇒ \/[E, B]): \/[E, IList[B]]

    Permalink

    Referentially transparent replacement for traverse, specialised to disjunction.

    Referentially transparent replacement for traverse, specialised to disjunction.

    Definition Classes
    IList
  98. def uncons[B](n: ⇒ B, c: (A, IList[A]) ⇒ B): B

    Permalink
    Definition Classes
    IList
  99. def unzip[B, C](implicit ev: <~<[A, (B, C)]): (IList[B], IList[C])

    Permalink
    Definition Classes
    IList
  100. def updated(index: Int, a: A): IList[A]

    Permalink

    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

    Definition Classes
    IList
  101. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  102. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  103. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  104. def widen[B](implicit ev: <~<[A, B]): IList[B]

    Permalink
    Definition Classes
    IList
  105. def zip[B](b: ⇒ IList[B]): IList[(A, B)]

    Permalink
    Definition Classes
    IList
  106. def zipWithIndex: IList[(A, Int)]

    Permalink
    Definition Classes
    IList

Inherited from IList[A]

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped