AbstractTable

Instance Constructors

new AbstractTable(schemaName: Option[String], tableName: String)

Type Members

type Self = TableNode

Definition Classes
TableNode → Node

Abstract Value Members

abstract def *: ColumnBase[T]
abstract def tpe: Type

Definition Classes
Typed

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

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

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AbstractTable.this.type

Definition Classes
WithOp → AnyRef
def collectFieldSymbols(n: Node): Iterable[FieldSymbol]

Attributes
protected[this]
def create_*: Iterable[FieldSymbol]
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
def foreignKey[P, PU, TT <: TableNode, U](name: String, sourceColumns: P, targetTable: TT)(targetColumns: (TT) ⇒ P, onUpdate: ForeignKeyAction = ForeignKeyAction.NoAction, onDelete: ForeignKeyAction = ForeignKeyAction.NoAction)(implicit unpack: Shape[TT, U, _], unpackp: Shape[P, PU, _]): ForeignKeyQuery[TT, U]
final def foreignKeys: Iterable[ForeignKey[_ <: TableNode, _]]
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def index[T](name: String, on: T, unique: Boolean = false)(implicit shape: Shape[T, _, _]): Index
def indexes: Iterable[Index]
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def mapOp(f: (Node, List[Int]) ⇒ Node, positions: List[Int] = Nil): AbstractTable.this.type

Definition Classes
WithOp
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def nodeBuildTypedNode[T >: AbstractTable.this.type <: Node](newNode: T, newType: Type): T

Definition Classes
Node
def nodeChildNames: Iterable[String]

Names for the child nodes to show in AST dumps.
Names for the child nodes to show in AST dumps. Defaults to a numbered sequence starting at 0 but can be overridden by subclasses to produce more suitable names.

Definition Classes
Node
val nodeChildren: collection.immutable.Nil.type

All child nodes of this node.
All child nodes of this node. Must be implemented by subclasses.

Definition Classes
NullaryNode → Node
def nodeDelegate: Node

Definition Classes
Node → NodeGenerator
def nodeHasType: Boolean

Definition Classes
TypedNode → Node
final def nodeIntrinsicSymbol: IntrinsicSymbol

The intrinsic symbol that points to this Node object.
The intrinsic symbol that points to this Node object.

Definition Classes
Node
final def nodeMapChildren(f: (Node) ⇒ Node): Self

Apply a mapping function to all children of this node and recreate the node with the new children.
Apply a mapping function to all children of this node and recreate the node with the new children. If all new children are identical to the old ones, this node is returned.

Definition Classes
Node
final def nodeMapChildrenKeepType(f: (Node) ⇒ Node): Self

Like nodeMapChildren, except the type of this node is kept even if the children have changed.
Like nodeMapChildren, except the type of this node is kept even if the children have changed. We don't do this by default in nodeMapChildren because many transformations change the type.

Definition Classes
Node
def nodeRebuild: TableNode

Definition Classes
TableNode → NullaryNode
final def nodeRebuild(ch: IndexedSeq[Node]): Self

Rebuild this node with a new list of children.
Rebuild this node with a new list of children. Implementations of this method *must not* perform any optimization to reuse the current node. This method always returns a fresh copy.

Attributes
protected[this]
Definition Classes
NullaryNode → Node
def nodeRebuildWithType(tpe: Type): Self

Definition Classes
Node
def nodeTableProjection: Node

Definition Classes
AbstractTable → TableNode
def nodeType: Type

The current type of this node
The current type of this node

Definition Classes
TypedNode → Node
def nodeTyped(tpe: Type): AbstractTable.this.type

Return this Node with a Type assigned.
Return this Node with a Type assigned. This may only be called on freshly constructed nodes with no other existing references, i.e. creating the Node plus assigning it a Type must be atomic.

Definition Classes
Node
def nodeTypedOrCopy(tpe: Type): Self

Return this Node with a Type assigned (if no other type has been seen for it yet) or a typed copy.
Return this Node with a Type assigned (if no other type has been seen for it yet) or a typed copy.

Definition Classes
Node
def nodeWithComputedType(scope: SymbolScope, retype: Boolean): Self

Rebuild this node and all children with their computed type.
Rebuild this node and all children with their computed type. If this node already has a type, it is only recomputed if retype is set to true. The types of all children are computed recursively (if this node's type is actually computed) using the same retype setting.

Definition Classes
AbstractTable → TypedNode → TableNode → Node
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def op: Node

Definition Classes
WithOp
def primaryKey[T](name: String, sourceColumns: T)(implicit shape: Shape[T, _, _]): PrimaryKey
final def primaryKeys: Iterable[PrimaryKey]
val schemaName: Option[String]

Definition Classes
AbstractTable → TableNode
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tableConstraints: Iterator[Constraint]
val tableName: String

Definition Classes
AbstractTable → TableNode
def toString(): String

Definition Classes
TableNode → Node → AnyRef → Any
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws()

abstract class AbstractTable[T] extends TableNode with TypedNode with ColumnBase[T] with WithOp

Instance Constructors

new AbstractTable(schemaName: Option[String], tableName: String)

Type Members

type Self = TableNode

Abstract Value Members

abstract def *: ColumnBase[T]

abstract def tpe: Type

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AbstractTable.this.type

def collectFieldSymbols(n: Node): Iterable[FieldSymbol]

def create_*: Iterable[FieldSymbol]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def foreignKeys: Iterable[ForeignKey[_ <: TableNode, _]]

final def getClass(): Class[_]

def hashCode(): Int

def index[T](name: String, on: T, unique: Boolean = false)(implicit shape: Shape[T, _, _]): Index

def indexes: Iterable[Index]

final def isInstanceOf[T0]: Boolean

def mapOp(f: (Node, List[Int]) ⇒ Node, positions: List[Int] = Nil): AbstractTable.this.type

final def ne(arg0: AnyRef): Boolean

def nodeBuildTypedNode[T >: AbstractTable.this.type <: Node](newNode: T, newType: Type): T

def nodeChildNames: Iterable[String]

val nodeChildren: collection.immutable.Nil.type

def nodeDelegate: Node

def nodeHasType: Boolean

final def nodeIntrinsicSymbol: IntrinsicSymbol

final def nodeMapChildren(f: (Node) ⇒ Node): Self

final def nodeMapChildrenKeepType(f: (Node) ⇒ Node): Self

def nodeRebuild: TableNode

final def nodeRebuild(ch: IndexedSeq[Node]): Self

def nodeRebuildWithType(tpe: Type): Self

def nodeTableProjection: Node

def nodeType: Type

def nodeTyped(tpe: Type): AbstractTable.this.type

def nodeTypedOrCopy(tpe: Type): Self

def nodeWithComputedType(scope: SymbolScope, retype: Boolean): Self

final def notify(): Unit

final def notifyAll(): Unit

final def op: Node

def primaryKey[T](name: String, sourceColumns: T)(implicit shape: Shape[T, _, _]): PrimaryKey

final def primaryKeys: Iterable[PrimaryKey]

val schemaName: Option[String]

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

def tableConstraints: Iterator[Constraint]

val tableName: String

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from ColumnBase[T]

Inherited from Rep[T]

Inherited from WithOp

Inherited from Cloneable

Inherited from java.lang.Cloneable

Inherited from TypedNode

Inherited from Typed

Inherited from TableNode

Inherited from NullaryNode

Inherited from Node

Inherited from NodeGenerator

Inherited from AnyRef

Inherited from Any

Ungrouped