ReadAbstractData

abstract def accessorTag: ClassTag[Format.Accessor]

abstract def apply(i: Int): AC

abstract def components: Int

abstract def formatTag: ClassTag[Format]

abstract def isNormalized: Boolean

abstract def rawEnum: Int

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def +:[B >: AC, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[AC], B, That]): That

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

def :+[B >: AC, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[AC], B, That]): That

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

final def ==(arg0: AnyRef): Boolean

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

def andThen[C](k: (AC) ⇒ C): PartialFunction[Int, C]

def applyOrElse[A1 <: Int, B1 >: AC](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

final def asReadOnly(): Read

final def bindingBuffer(): BindingBuffer

Binding buffer can be direct or non-direct.

final def bindingBufferSubData(first: Int, count: Int): BindingBuffer

final def bindingBufferWithOffset(): BindingBuffer

final def byteCapacity: Int

Byte capacity required to store the data.

final def byteOffset: Int

final def byteStride: Int

final val bytesPerComponent: Int

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[AC, B])(implicit bf: CanBuildFrom[IndexedSeq[AC], B, That]): That

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

def combinations(n: Int): Iterator[IndexedSeq[AC]]

def companion: GenericCompanion[IndexedSeq]

def compose[A](g: (A) ⇒ Int): (A) ⇒ AC

def contains(elem: Any): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

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

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

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

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

def corresponds[B](that: GenSeq[B])(p: (AC, B) ⇒ Boolean): Boolean

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

def diff[B >: AC](that: GenSeq[B]): IndexedSeq[AC]

def distinct: IndexedSeq[AC]

def drop(n: Int): IndexedSeq[AC]

def dropRight(n: Int): IndexedSeq[AC]

def dropWhile(p: (AC) ⇒ Boolean): IndexedSeq[AC]

def endsWith[B](that: GenSeq[B]): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def filter(p: (AC) ⇒ Boolean): IndexedSeq[AC]

def filterNot(p: (AC) ⇒ Boolean): IndexedSeq[AC]

def finalize(): Unit

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

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

def flatten[B](implicit asTraversable: (AC) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

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

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

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

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

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

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

final def getClass(): Class[_]

def groupBy[K](f: (AC) ⇒ K): Map[K, IndexedSeq[AC]]

def grouped(size: Int): Iterator[IndexedSeq[AC]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: AC

def headOption: Option[AC]

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

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

def indexOfSlice[B >: AC](that: GenSeq[B], from: Int): Int

def indexOfSlice[B >: AC](that: GenSeq[B]): Int

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

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

def indices: Range

def init: IndexedSeq[AC]

def inits: Iterator[IndexedSeq[AC]]

def intersect[B >: AC](that: GenSeq[B]): IndexedSeq[AC]

final def isCached: Boolean

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isReadOnly: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[AC]

def last: AC

def lastIndexOf[B >: AC](elem: B, end: Int): Int

def lastIndexOf[B >: AC](elem: B): Int

def lastIndexOfSlice[B >: AC](that: GenSeq[B], end: Int): Int

def lastIndexOfSlice[B >: AC](that: GenSeq[B]): Int

def lastIndexWhere(p: (AC) ⇒ Boolean, end: Int): Int

def lastIndexWhere(p: (AC) ⇒ Boolean): Int

def lastOption: Option[AC]

final def length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[AC]

def map[B, That](f: (AC) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[AC], B, That]): That

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

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

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

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

def mkSerializableInstance(): SerializableData

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[AC, IndexedSeq[AC]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

final val offset: Int

def orElse[A1 <: Int, B1 >: AC](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def padTo[B >: AC, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[AC], B, That]): That

def par: ParSeq[AC]

def parCombiner: Combiner[AC, ParSeq[AC]]

def partition(p: (AC) ⇒ Boolean): (IndexedSeq[AC], IndexedSeq[AC])

def patch[B >: AC, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[AC], B, That]): That

def permutations: Iterator[IndexedSeq[AC]]

def prefixLength(p: (AC) ⇒ Boolean): Int

final val primitives: PrimitiveSeq

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

final def readOnlyBuffer(): Raw.Buffer

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

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

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

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

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

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

def repr: IndexedSeq[AC]

def reverse: IndexedSeq[AC]

def reverseIterator: Iterator[AC]

def reverseMap[B, That](f: (AC) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[AC], B, That]): That

def reversed: List[AC]

def runWith[U](action: (AC) ⇒ U): (Int) ⇒ Boolean

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

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

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

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

def segmentLength(p: (AC) ⇒ Boolean, from: Int): Int

def seq: IndexedSeq[AC]

final def sharesStorageWith(src: DataSrc): Boolean

final val size: Int

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

def sliding(size: Int, step: Int): Iterator[IndexedSeq[AC]]

def sliding(size: Int): Iterator[IndexedSeq[AC]]

def sortBy[B](f: (AC) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[AC]

def sortWith(lt: (AC, AC) ⇒ Boolean): IndexedSeq[AC]

def sorted[B >: AC](implicit ord: Ordering[B]): IndexedSeq[AC]

def span(p: (AC) ⇒ Boolean): (IndexedSeq[AC], IndexedSeq[AC])

def splitAt(n: Int): (IndexedSeq[AC], IndexedSeq[AC])

def startsWith[B](that: GenSeq[B], offset: Int): Boolean

def startsWith[B](that: GenSeq[B]): Boolean

final val storeEnum: Int

final val stride: Int

def stringPrefix: String

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

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

def tail: IndexedSeq[AC]

def tails: Iterator[IndexedSeq[AC]]

def take(n: Int): IndexedSeq[AC]

def takeRight(n: Int): IndexedSeq[AC]

def takeWhile(p: (AC) ⇒ Boolean): IndexedSeq[AC]

def thisCollection: IndexedSeq[AC]

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

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

def toBuffer[A1 >: AC]: Buffer[A1]

def toCollection(repr: IndexedSeq[AC]): IndexedSeq[AC]

def toIndexedSeq: IndexedSeq[AC]

def toIterable: Iterable[AC]

def toIterator: Iterator[AC]

def toList: List[AC]

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

def toSeq: Seq[AC]

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

def toStream: Stream[AC]

def toString(): String

def toTraversable: Traversable[AC]

def toVector: Vector[AC]

def transpose[B](implicit asTraversable: (AC) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

def union[B >: AC, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[AC], B, That]): That

def unzip[A1, A2](implicit asPair: (AC) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

def unzip3[A1, A2, A3](implicit asTriple: (AC) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

def updated[B >: AC, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[AC], B, That]): That

def view(from: Int, until: Int): SeqView[AC, IndexedSeq[AC]]

def view: SeqView[AC, IndexedSeq[AC]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (AC) ⇒ Boolean): FilterMonadic[AC, IndexedSeq[AC]]

final def writeReplace(): AnyRef

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

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

def zipWithIndex[A1 >: AC, That](implicit bf: CanBuildFrom[IndexedSeq[AC], (A1, Int), That]): That

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