ChainInChain

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def ++=(es: Iterable[E]): ChainInChain.this.type

def +=(e: E): ChainInChain.this.type

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

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def _setChainPosition(c: S, p: Int): Unit

This method should never be called outside Chain.

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, E) ⇒ B, combop: (B, B) ⇒ B): B

def apply(i: Int): E

final def asInstanceOf[T0]: T0

def asSeq: IndexedSeq[E]

def between(other: This): Seq[This]

def canEqual(that: Any): Boolean

def chain: S

def chainAfter: IndexedSeq[This]

def chainBefore: IndexedSeq[This]

def chainFreeze(): Unit

def chainFrozen: Boolean

def chainHead: This

def chainLast: This

def clone(): AnyRef

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

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

def companion: GenericCompanion[Iterable]

def contains(elem: Any): Boolean

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

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

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

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

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

def drop(n: Int): Iterable[E]

def dropRight(n: Int): Iterable[E]

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(f: (E) ⇒ Boolean): Boolean

def filter(p: (E) ⇒ Boolean): Iterable[E]

def filterNot(p: (E) ⇒ Boolean): Iterable[E]

def finalize(): Unit

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

def firstInSeq: This

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

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

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

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

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

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

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

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

final def getClass(): Class[_]

def getNext: Option[This]

def getPrev: Option[This]

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

def grouped(size: Int): Iterator[Iterable[E]]

def hasDefiniteSize: Boolean

def hasNext(n: Int): Boolean

def hasNext: Boolean

def hasPrev(n: Int): Boolean

def hasPrev: Boolean

def hashCode(): Int

def head: E

def headOption: Option[E]

def indexOf[B >: E](elem: B, from: Int): Int

def indexOf[B >: E](elem: B): Int

def indexWhere(p: (E) ⇒ Boolean): Int

def indexWhere(p: (E) ⇒ Boolean, from: Int): Int

def init: Iterable[E]

def inits: Iterator[Iterable[E]]

def insert(i: Int, e: E): ChainInChain.this.type

Use with caution, since this would invalidate indices stored elsewhere

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[E]

def last: E

def lastOption: Option[E]

def length: Int

final def links: IndexedSeq[E]

def map[B](f: (E) ⇒ B): IndexedSeq[B]

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

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

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

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

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

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[E, Iterable[E]]

def next(n: Int): This

Return the ChainLink "n" positions ahead.

def next: This

def nextWindow(n: Int): Seq[This]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[E]

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

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

def position: Int

def prev(n: Int): This

Return the ChainLink "n" positions behind.

def prev: This

def prevWindow(n: Int): Seq[This]

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

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

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

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

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

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

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

def remove(i: Int): ChainInChain.this.type

Use with caution, since this would invalidate indices stored elsewhere

def repr: Iterable[E]

def reversed: List[E]

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

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

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

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

def seq: Iterable[E]

def size: Int

def slice(from: Int, until: Int): Iterable[E]

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

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

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

def splitAt(n: Int): (Iterable[E], Iterable[E])

def stringPrefix: String

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

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

def tail: Iterable[E]

def tails: Iterator[Iterable[E]]

def take(n: Int): Iterable[E]

def takeRight(n: Int): Iterable[E]

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

def thisCollection: Iterable[E]

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

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

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

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

def toIndexedSeq: IndexedSeq[E]

def toIterable: Iterable[E]

def toIterator: Iterator[E]

def toList: List[E]

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

def toSeq: IndexedSeq[E]

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

def toStream: Stream[E]

def toString(): String

def toTraversable: Traversable[E]

def toVector: Vector[E]

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

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

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

def value: This.Value

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

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def window(n: Int): Seq[This]

def windowWithoutSelf(n: Int): Seq[This]

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

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

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

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

def /:\[A1 >: E](z: A1)(op: (A1, A1) ⇒ A1): A1