final case class IArray1[A](head: A, tail: IArray[A]) extends Product with Serializable
Ordering
- Alphabetic
- By Inheritance
Inherited
- IArray1
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- def +:(a: A): IArray1[A]
- def :+(a: A): IArray1[A]
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def ===(that: IArray1[A])(implicit E: Equal[A]): Boolean
- def align[B](that: IArray1[B]): IArray1[\&/[A, B]]
- def alignWith[B, C](that: IArray1[B])(f: (\&/[A, B]) => C): IArray1[C]
- def apply(i: Int): A
- Annotations
- @inline()
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def cobind[B](f: (IArray1[A]) => B): IArray1[B]
- def cojoin: IArray1[IArray1[A]]
- def collect[B](f: PartialFunction[A, B]): IArray[B]
- def collectFirst[B](f: PartialFunction[A, B]): Option[B]
- def collectLast[B](f: PartialFunction[A, B]): Option[B]
- def contains(a: A)(implicit E: Equal[A]): Boolean
- def count(f: (A) => Boolean): Int
- def dropL(n: Int): IArray[A]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- IArray1 → Equals → AnyRef → Any
- def exists(f: (A) => Boolean): Boolean
- def finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def find(f: (A) => Boolean): Option[A]
- def findRight(f: (A) => Boolean): Option[A]
- def flatMap[B](f: (A) => IArray1[B]): IArray1[B]
- def flatten[B](implicit A: <:<[A, IArray1[B]]): IArray1[B]
- def foldMap1[B](f: (A) => B)(implicit B: Semigroup[B]): B
- def foldMapLeft1[B](z: (A) => B)(f: (B, A) => B): B
- def foldMapRight1[B](z: (A) => B)(f: (A, B) => B): B
- def foldl[B](z: B)(f: (B, A) => B): B
- def foldl1(f: (A, A) => A): A
- def foldr[B](z: B)(f: (A, B) => B): B
- def foldr1(f: (A, A) => A): A
- def forall(f: (A) => Boolean): Boolean
- def foreach[U](f: (A) => U): Unit
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- IArray1 → AnyRef → Any
- val head: A
- def indexOfL(a: A)(implicit E: Equal[A]): Option[Int]
- def indexOfR(a: A)(implicit E: Equal[A]): Option[Int]
- def init: IArray[A]
- def intercalate1(a: A)(implicit A: Semigroup[A]): A
- def intersperse(a: A): IArray1[A]
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def last: A
- def length: Int
- Annotations
- @inline()
- def map[B](f: (A) => B): IArray1[B]
- def max(implicit O: Order[A]): A
- def maxBy[B](f: (A) => B)(implicit O: Order[B]): A
- def maxOf[B](f: (A) => B)(implicit O: Order[B]): B
- def min(implicit O: Order[A]): A
- def minBy[B](f: (A) => B)(implicit O: Order[B]): A
- def minOf[B](f: (A) => B)(implicit O: Order[B]): B
- def mkString(start: String, sep: String, end: String): String
- def mkString(sep: String): String
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def oneAnd: OneAnd[IArray, A]
- def partition(f: (A) => Boolean): (IArray[A], IArray[A])
- def plus(that: IArray1[A]): IArray1[A]
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def reverse: IArray1[A]
- def reverseMap[B](f: (A) => B): IArray1[B]
- def scanLeft[B](z: B)(f: (B, A) => B): IArray1[B]
- def scanRight[B](z: B)(f: (A, B) => B): IArray1[B]
- def size: Int
- Annotations
- @inline()
- def sortBy[B](f: (A) => B)(implicit O: Order[B]): IArray1[A]
- def sortWith(f: (A, A) => Boolean): IArray1[A]
- def sorted(implicit O: Order[A]): IArray1[A]
- def sum(implicit A: Numeric[A]): A
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- val tail: IArray[A]
- def toArray(implicit A: ClassTag[A]): Array[A]
- def toIArray: IArray[A]
- def toIList: IList[A]
- def toIterator: Iterator[A]
- def toList: List[A]
- def toNel: NonEmptyList[A]
- def toString(): String
- Definition Classes
- IArray1 → AnyRef → Any
- def traverse1[F[_], B](f: (A) => F[B])(implicit F: Apply[F]): F[IArray1[B]]
- def unite[G[_], B](implicit A: <:<[A, G[B]], G: Foldable[G]): IArray[B]
- def unite1[G[_], B](implicit A: <:<[A, G[B]], G: Foldable1[G]): IArray1[B]
- def unzip[B, C](implicit e: <:<[A, Product2[B, C]]): (IArray1[B], IArray1[C])
- def unzip3[B, C, D](implicit e: <:<[A, Product3[B, C, D]]): (IArray1[B], IArray1[C], IArray1[D])
- def unzip4[B, C, D, E](implicit e: <:<[A, Product4[B, C, D, E]]): (IArray1[B], IArray1[C], IArray1[D], IArray1[E])
- def unzip5[B, C, D, E, F](implicit e: <:<[A, Product5[B, C, D, E, F]]): (IArray1[B], IArray1[C], IArray1[D], IArray1[E], IArray1[F])
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- def widen[B](implicit ev: <:<[A, B]): IArray1[B]
- def zip[B](that: IArray1[B]): IArray1[(A, B)]
- def zipAll[B](that: IArray1[B], a: A, b: B): IArray1[(A, B)]
- def zipWith[B, C](that: IArray1[B])(f: (A, B) => C): IArray1[C]
- def zipWithIndex: IArray1[(A, Int)]