SliceBase

abstract def selfSlice: Slice[T]

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: T](other: Array[B])(implicit arg0: ClassTag[B]): Slice[B]

def ++[B >: T](other: Slice[B])(implicit arg0: ClassTag[B]): Slice[B]

def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def /:[B](z: B)(op: (B, T) ⇒ B): B

def :\[B](z: B)(op: (T, B) ⇒ B): B

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

val allocatedSize: Int

def apply(index: Int): T

def arrayLength: Int

final def asInstanceOf[T0]: T0

def asSliceOption(): SliceOption[T]

def binarySearch[A >: T, N <: A](target: A, nullValue: N)(implicit ordering: Ordering[A]): A

def canEqual(that: Any): Boolean

implicit val classTag: ClassTag[T]

def clone(): AnyRef

def close(): Slice[T]

Returns a new non-writable slice.

def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

def companion: GenericCompanion[Iterable]

def copy(): Slice[T]

def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: T](xs: Array[B]): Unit

def copyToArray[B >: T](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: T](dest: Buffer[B]): Unit

def count(p: (T) ⇒ Boolean): Int

def currentWritePosition: Int

def currentWritePositionInThisSlice: Int

def drop(count: Int): Slice[T]

def dropHead(): Slice[T]

def dropRight(count: Int): Slice[T]

def dropTo[B >: T](elem: B): Option[Slice[T]]

def dropUntil[B >: T](elem: B): Option[Slice[T]]

def dropWhile(p: (T) ⇒ Boolean): Iterable[T]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (T) ⇒ Boolean): Boolean

def existsFor(forItems: Int, exists: (T) ⇒ Boolean): Boolean

def filter(p: (T) ⇒ Boolean): Slice[T]

def filterNot(p: (T) ⇒ Boolean): Slice[T]

def finalize(): Unit

def find(p: (T) ⇒ Boolean): Option[T]

def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

def foldRight[B](z: B)(op: (T, B) ⇒ B): B

def forall(p: (T) ⇒ Boolean): Boolean

def foreach[U](f: (T) ⇒ U): Unit

val fromOffset: Int

def genericBuilder[B]: Builder[B, Iterable[B]]

def get(index: Int): T

final def getClass(): Class[_]

def groupBy[K](f: (T) ⇒ K): Map[K, Iterable[T]]

def grouped(size: Int): Iterator[Slice[T]]

def groupedSlice(size: Int): Slice[Slice[T]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: T

def headOption: Option[T]

def headOrNull: T

def headSlice: Slice[T]

def indexOf[B >: T](elem: B): Option[Int]

def init: Iterable[T]

def inits: Iterator[Iterable[T]]

def isEmpty: Boolean

def isFull: Boolean

final def isInstanceOf[T0]: Boolean

def isOriginalFullSlice: Boolean

def isOriginalSlice: Boolean

final def isTraversableAgain: Boolean

def isUnslicedOption: Boolean

def iterator: Iterator[T]

def last: T

def lastOption: Option[T]

def lastOrNull: T

def lastSlice: Slice[T]

def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def max[B >: T](implicit cmp: Ordering[B]): T

def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def min[B >: T](implicit cmp: Ordering[B]): T

def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[T, Iterable[T]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[T]

def parCombiner: Combiner[T, ParIterable[T]]

def partition(p: (T) ⇒ Boolean): (Iterable[T], Iterable[T])

def product[B >: T](implicit num: Numeric[B]): B

def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: T](op: (B, T) ⇒ B): B

def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: T](op: (T, B) ⇒ B): B

def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

def repr: Iterable[T]

def reverse: Iterator[T]

def reversed: List[T]

def sameElements[B >: T](that: GenIterable[B]): Boolean

def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[T], B, That]): That

def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def seq: Iterable[T]

def size: Int

def slice(fromOffset: Int, toOffset: Int): Slice[T]

Create a new Slice for the offsets.

def sliding(size: Int, step: Int): Iterator[Iterable[T]]

def sliding(size: Int): Iterator[Iterable[T]]

def sorted[B >: T](implicit ordering: Ordering[B]): Slice[B]

Return a new ordered Slice.

def span(p: (T) ⇒ Boolean): (Iterable[T], Iterable[T])

def splitAt(index: Int): (Slice[T], Slice[T])

def splitInnerArrayAt(index: Int): (Slice[T], Slice[T])

def splitUnwritten(): (Slice[T], Slice[T])

def stringPrefix: String

def sum[B >: T](implicit num: Numeric[B]): B

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: Iterable[T]

def tails: Iterator[Iterable[T]]

def take(fromIndex: Int, count: Int): Slice[T]

def take(count: Int): Slice[T]

def takeRight(count: Int): Slice[T]

def takeWhile(p: (T) ⇒ Boolean): Iterable[T]

def thisCollection: Iterable[T]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

Returns the original Array if Slice is not a sub Slice else returns a new copied Array from the offsets defined for this Slice.

def toArrayCopy[B >: T](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: T]: Buffer[B]

def toCollection(repr: Iterable[T]): Iterable[T]

def toIndexedSeq: IndexedSeq[T]

def toIterable: Iterable[T]

def toIterator: Iterator[T]

def toList: List[T]

def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

val toOffset: Int

def toOption: Option[Slice[T]]

def toOptionUnsliced(): Option[Slice[T]]

def toSeq: Seq[T]

def toSet[B >: T]: Set[B]

def toStream: scala.collection.immutable.Stream[T]

def toString(): String

def toTraversable: Traversable[T]

def toVector: Vector[T]

def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def underlyingArraySize: Int

def unslice(): Slice[T]

def unwrittenTail(): Slice[T]

def unwrittenTailSize(): Int

def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def view(from: Int, until: Int): IterableView[T, Iterable[T]]

def view: IterableView[T, Iterable[T]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, Iterable[T]]

def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[T], (A1, B), That]): That

def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[T], (A1, B), That]): That

def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[Iterable[T], (A1, Int), That]): That