final
case class
ICons[A](head: A, tail: IList[A]) extends IList[A] with Product with Serializable
Instance Constructors
-
new
ICons(head: A, tail: IList[A])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
def
++:(as: IList[A]): IList[A]
-
def
+:(a: A): IList[A]
-
def
/:[B](b: B)(f: (B, A) ⇒ B): B
-
def
:+(a: A): IList[A]
-
def
::(a: A): IList[A]
-
def
:::(as: IList[A]): IList[A]
-
def
:\[B](b: B)(f: (A, B) ⇒ B): B
-
final
def
<^>[B](f: (OneAnd[IList, A]) ⇒ B)(implicit B: Monoid[B]): B
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
-
def
concat(as: IList[A]): IList[A]
-
def
containsSlice(as: IList[A])(implicit ev: Equal[A]): Boolean
-
def
count(f: (A) ⇒ Boolean): Int
-
def
distinct(implicit A: Order[A]): IList[A]
-
def
drop(n: Int): IList[A]
-
def
dropRight(n: Int): IList[A]
-
def
dropRightWhile(f: (A) ⇒ Boolean): IList[A]
-
def
dropWhile(f: (A) ⇒ Boolean): IList[A]
-
def
endsWith(as: IList[A])(implicit ev: Equal[A]): Boolean
-
-
def
filter(f: (A) ⇒ Boolean): IList[A]
-
def
filterNot(f: (A) ⇒ Boolean): IList[A]
-
def
finalize(): Unit
-
-
def
flatMap[B](f: (A) ⇒ IList[B]): IList[B]
-
def
flatten[B](implicit ev: <~<[A, IList[B]]): IList[B]
-
def
foldLeft[B](b: B)(f: (B, A) ⇒ B): B
-
def
foldRight[B](b: B)(f: (A, B) ⇒ B): B
-
final
def
getClass(): Class[_]
-
def
groupBy[K](f: (A) ⇒ K)(implicit ev: Order[K]): ==>>[K, NonEmptyList[A]]
-
def
groupBy1[K](f: (A) ⇒ K)(implicit ev: Order[K]): ==>>[K, OneAnd[IList, A]]
-
val
head: A
-
def
headMaybe: Maybe[A]
-
def
headOption: Option[A]
-
def
indexOf(a: A)(implicit ev: Equal[A]): Option[Int]
-
def
indexOfSlice(slice: IList[A])(implicit ev: Equal[A]): Option[Int]
-
-
-
-
def
interleave(that: IList[A]): IList[A]
-
def
intersperse(a: A): IList[A]
-
-
final
def
isInstanceOf[T0]: Boolean
-
def
lastIndexOf(a: A)(implicit ev: Equal[A]): Option[Int]
-
def
lastIndexOfSlice(as: IList[A])(implicit ev: Equal[A]): Option[Int]
-
def
lastIndexWhere(f: (A) ⇒ Boolean): Option[Int]
-
final
def
lastOption: Option[A]
-
def
length: Int
-
def
map[B](f: (A) ⇒ B): IList[B]
-
def
mapAccumLeft[B, C](c: C)(f: (C, A) ⇒ (C, B)): (C, IList[B])
-
final
def
mapAccumRight[B, C](c: C)(f: (C, A) ⇒ (C, B)): (C, IList[B])
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
padTo(n: Int, a: A): IList[A]
-
def
partition(f: (A) ⇒ Boolean): (IList[A], IList[A])
-
def
patch(from: Int, patch: IList[A], replaced: Int): IList[A]
-
def
prefixLength(f: (A) ⇒ Boolean): Int
-
def
reduceLeftOption(f: (A, A) ⇒ A): Option[A]
-
def
reduceRightOption(f: (A, A) ⇒ A): Option[A]
-
def
reverse: IList[A]
-
def
reverseMap[B](f: (A) ⇒ B): IList[B]
-
def
reverse_:::(as: IList[A]): IList[A]
-
def
scanLeft[B](z: B)(f: (B, A) ⇒ B): IList[B]
-
def
scanRight[B](z: B)(f: (A, B) ⇒ B): IList[B]
-
def
slice(from: Int, until: Int): IList[A]
-
def
sortBy[B](f: (A) ⇒ B)(implicit B: Order[B]): IList[A]
-
def
sorted(implicit ev: Order[A]): IList[A]
-
-
def
splitAt(n: Int): (IList[A], IList[A])
-
def
startsWith(as: IList[A])(implicit ev: Equal[A]): Boolean
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
val
tail: IList[A]
-
-
-
def
take(n: Int): IList[A]
-
def
takeRight(n: Int): IList[A]
-
def
takeRightWhile(f: (A) ⇒ Boolean): IList[A]
-
def
takeWhile(f: (A) ⇒ Boolean): IList[A]
-
-
def
toList: List[A]
-
def
toMap[K, V](implicit ev0: <~<[A, (K, V)], ev1: Order[K]): ==>>[K, V]
-
-
def
toStream: Stream[A]
-
def
toString(): String
-
def
toVector: Vector[A]
-
-
def
uncons[B](n: ⇒ B, c: (A, IList[A]) ⇒ B): B
-
def
unzip[B, C](implicit ev: <~<[A, (B, C)]): (IList[B], IList[C])
-
def
updated(index: Int, a: A): IList[A]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
widen[B](implicit ev: <~<[A, B]): IList[B]
-
def
zip[B](b: ⇒ IList[B]): IList[(A, B)]
-
def
zipWithIndex: IList[(A, Int)]