Dictionary

abstract def apply(names: Set[String]): Dictionary[T]

Returns a DataDictionary containing Fields of the given names, preserving the original order of fields.

abstract def fields: Array[T]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That

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

def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That

def :\[B](z: B)(op: (T, 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, T) ⇒ B, combop: (B, B) ⇒ B): B

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

def apply(fieldIndex: Int): T

def apply(name: String): T

Extracts the Field with the given name.

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

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

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

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

def combinations(n: Int): Iterator[Seq[T]]

def companion: GenericCompanion[Seq]

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

def contains(elem: Any): Boolean

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

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 corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean

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

def diff[B >: T](that: GenSeq[B]): Seq[T]

def distinct: Seq[T]

def drop(n: Int): Seq[T]

def dropRight(n: Int): Seq[T]

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

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

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def field(name: String): Field

Returns the field of a given name.

def fieldIndex(name: String): Int

Returns the index of a given field.

def fieldNames: Array[String]

Returns all field names in an array.

lazy val fieldNamesSet: Set[String]

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

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

def finalize(): Unit

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

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

def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Seq[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

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

def get(name: String): Option[T]

final def getClass(): Class[_]

def getField(name: String): Option[Field]

Returns the field of a given name, None if a field with the given name does not exist

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

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: T

def headOption: Option[T]

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

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

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

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

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

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

def indices: Range

def init: Seq[T]

def inits: Iterator[Seq[T]]

def intersect[B >: T](that: GenSeq[B]): Seq[T]

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[T]

def last: T

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

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

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

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

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

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

def lastOption: Option[T]

def length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[T]

def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Seq[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

lazy val nameToField: Map[String, T]

lazy val nameToIndex: Map[String, Int]

final def ne(arg0: AnyRef): Boolean

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

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def par: ParSeq[T]

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

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

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

def permutations: Iterator[Seq[T]]

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

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: Seq[T]

def reverse: Seq[T]

def reverseIterator: Iterator[T]

def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That

def reversed: List[T]

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

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

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

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

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

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

def seq: Seq[T]

def size: Int

def slice(from: Int, until: Int): Seq[T]

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

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

def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): Seq[T]

def sortWith(lt: (T, T) ⇒ Boolean): Seq[T]

def sorted[B >: T](implicit ord: Ordering[B]): Seq[T]

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

def splitAt(n: Int): (Seq[T], Seq[T])

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

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

def stringPrefix: String

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

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

def tail: Seq[T]

def tails: Iterator[Seq[T]]

def take(n: Int): Seq[T]

def takeRight(n: Int): Seq[T]

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

def thisCollection: Seq[T]

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

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

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

def toCollection(repr: Seq[T]): Seq[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]

def toSeq: Seq[T]

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

def toStream: Stream[T]

def toString(): String

def toTraversable: Traversable[T]

def toVector: Vector[T]

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

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

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

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

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

def view(from: Int, until: Int): SeqView[T, Seq[T]]

def view: SeqView[T, Seq[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, Seq[T]]

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

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

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

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