IndexedSeq

abstract def isSizeGtPred(idx: Int): (Int) ⇒ Boolean

For a given value i, returns a test function that when passed a measure, compare's the measure's size component against i using f(m) > i

abstract def isSizeLteqPred(idx: Int): (Int) ⇒ Boolean

For a given value i, returns a test function that when passed a measure, compare's the measure's size component against i using f(m) <= i

implicit abstract def m: Measure[A, Int]

abstract def size: Int

abstract def tree: FingerTree[Int, A]

abstract def wrap(tree: FingerTree[Int, A]): IndexedSeq[A]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ++(xs: IndexedSeq[A]): IndexedSeq[A]

final def +:(x: A): IndexedSeq[A]

final def :+(x: A): IndexedSeq[A]

final def ==(arg0: Any): Boolean

final def apply(idx: Int): A

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def drop(n: Int): IndexedSeq[A]

final def dropRight(n: Int): IndexedSeq[A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def head: A

final def headOption: Option[A]

final def init: IndexedSeq[A]

final def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def iterator: Iterator[A]

final def last: A

final def lastOption: Option[A]

final def ne(arg0: AnyRef): Boolean

final def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def slice(from: Int, until: Int): IndexedSeq[A]

final def splitAt(idx: Int): (IndexedSeq[A], IndexedSeq[A])

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

final def tail: IndexedSeq[A]

final def take(n: Int): IndexedSeq[A]

final def takeRight(n: Int): IndexedSeq[A]

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

final def toList: List[A]

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit