Frame

abstract def buffer: Buffer

abstract def schema: FrameSchema

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++(frame: Frame): Frame

final def ==(arg0: Any): Boolean

def addColumn(name: String, defaultValue: String): Frame

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def collect(pf: PartialFunction[Row, Row]): Frame

def drop(k: Int): Frame

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def except(other: Frame): Frame

def exists(p: (Row) ⇒ Boolean): Plan[Boolean]

def filter(column: String, p: (String) ⇒ Boolean): Frame

Filters where the given column matches the given predicate.

def filter(p: (Row) ⇒ Boolean): Frame

def filterNot(p: (Row) ⇒ Boolean): Frame

def finalize(): Unit

def find(p: (Row) ⇒ Boolean): Plan[Option[Row]]

def forall(p: (Row) ⇒ Boolean): Plan[Boolean]

def foreach[U](f: (Row) ⇒ U): Frame

Execute a side effect function for every row in the frame, returning the same Frame.

final def getClass(): Class[_]

def hashCode(): Int

def head: Plan[Option[Row]]

final def isInstanceOf[T0]: Boolean

def join(other: Frame): Frame

def map(f: (Row) ⇒ Row): Frame

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def projection(columns: Seq[String]): Frame

def projection(first: String, rest: String*): Frame

def removeColumn(name: String): Frame

def size: Plan[Long]

def step(k: Int): Frame

Returns a new Frame where only each "step" row is retained.

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

def takeWhile(column: String, pred: (String) ⇒ Boolean): Frame

def takeWhile(pred: (Row) ⇒ Boolean): Frame

def to(sink: Sink): ConcurrentPlan[Long]

def toList: Plan[List[Row]]

def toString(): String

def union(other: Frame): Frame

final def wait(): Unit

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

final def wait(arg0: Long): Unit