Trait

quasar.yggdrasil.TableModule

TableLike

Related Doc: package TableModule

Permalink

trait TableLike extends AnyRef

Self Type
Table
Linear Supertypes
AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TableLike
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def canonicalize(length: Int, maxLength0: Option[Int] = None): Table

    Permalink
  2. abstract def cogroup(leftKey: TransSpec1, rightKey: TransSpec1, that: Table)(left: TransSpec1, right: TransSpec1, both: TransSpec2): Table

    Permalink

    Cogroups this table with another table, using equality on the specified transformation on rows of the table.

  3. abstract def compact(spec: TransSpec1, definedness: Definedness = AnyDefined): Table

    Permalink

    Removes all rows in the table for which definedness is satisfied Remaps the indicies.

  4. abstract def concat(t2: Table): Table

    Permalink
  5. abstract def cross(that: Table)(spec: TransSpec2): Table

    Permalink

    Performs a full cartesian cross on this table with the specified table, applying the specified transformation to merge the two tables into a single table.

  6. abstract def distinct(spec: TransSpec1): Table

    Permalink
  7. abstract def drop(count: Long): Table

    Permalink
  8. abstract def force: M[Table]

    Permalink

    Force the table to a backing store, and provice a restartable table over the results.

  9. abstract def groupByN(groupKeys: Seq[TransSpec1], valueSpec: TransSpec1, sortOrder: DesiredSortOrder = SortAscending, unique: Boolean = false): M[Seq[Table]]

    Permalink

    Sorts the KV table by ascending or descending order based on a seq of transformations applied to the rows.

    Sorts the KV table by ascending or descending order based on a seq of transformations applied to the rows.

    groupKeys

    The transspecs to use to obtain the values to sort on

    valueSpec

    The transspec to use to obtain the non-sorting values

    sortOrder

    Whether to sort ascending or descending

    unique

    If true, the same key values will sort into a single row, otherwise we assign a unique row ID as part of the key so that multiple equal values are preserved

  10. abstract def leftShift(focus: CPath): Table

    Permalink

    Performs a dimensional pivot on any array or object values at the given focus.

    Performs a dimensional pivot on any array or object values at the given focus. We can view the focus as a form of lens: the structure at the focus is pivoted, while everything *around* the focus is left untouched. Usually, this results in data being duplicated, since the resulting number of rows will be greater-than or equal-to the input number of rows, provided that the focus does indeed refer to arrays/objects and those structures are non-empty.

  11. abstract def load(apiKey: APIKey, tpe: JType): EitherT[M, ResourceError, Table]

    Permalink

    For each distinct path in the table, load all columns identified by the specified jtype and concatenate the resulting slices into a new table.

  12. abstract def metrics: TableMetrics

    Permalink
  13. abstract def paged(limit: Int): Table

    Permalink
  14. abstract def partitionMerge(partitionBy: TransSpec1)(f: (Table) ⇒ M[Table]): M[Table]

    Permalink
  15. abstract def printer(prelude: String = "", flag: String = ""): Table

    Permalink
  16. abstract def reduce[A](reducer: Reducer[A])(implicit arg0: Monoid[A]): M[A]

    Permalink

    Folds over the table to produce a single value (stored in a singleton table).

  17. abstract def renderCsv(): StreamT[M, CharBuffer]

    Permalink
  18. abstract def renderJson(prefix: String = "", delimiter: String = "\n", suffix: String = ""): StreamT[M, CharBuffer]

    Permalink
  19. abstract def schemas: M[Set[JType]]

    Permalink
  20. abstract def size: TableSize

    Permalink

    Return an indication of table size, if known

  21. abstract def sort(sortKey: TransSpec1, sortOrder: DesiredSortOrder = SortAscending, unique: Boolean = false): M[Table]

    Permalink

    Sorts the KV table by ascending or descending order of a transformation applied to the rows.

    Sorts the KV table by ascending or descending order of a transformation applied to the rows.

    sortKey

    The transspec to use to obtain the values to sort on

    sortOrder

    Whether to sort ascending or descending

    unique

    If true, the same key values will sort into a single row, otherwise we assign a unique row ID as part of the key so that multiple equal values are preserved

  22. abstract def take(count: Long): Table

    Permalink
  23. abstract def toArray[A](implicit tpe: CValueType[A]): Table

    Permalink
  24. abstract def toJson: M[Iterable[JValue]]

    Permalink
  25. abstract def transform(spec: TransSpec1): Table

    Permalink

    Performs a one-pass transformation of the keys and values in the table.

    Performs a one-pass transformation of the keys and values in the table. If the key transform is not identity, the resulting table will have unknown sort order.

  26. abstract def zip(t2: Table): M[Table]

    Permalink

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  13. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  14. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  15. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  16. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  17. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  18. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def takeRange(startIndex: Long, numberToTake: Long): Table

    Permalink
    Annotations
    @deprecated
    Deprecated

    use drop/take directly

Inherited from AnyRef

Inherited from Any

Ungrouped