slick.ast

Insert

Related Doc: package ast

final case class Insert(tableSym: Symbol, table: Node, linear: Node) extends BinaryNode with DefNode with Product with Serializable

Represents an Insert operation.

Source
Insert.scala
Linear Supertypes
Serializable, Serializable, Product, Equals, DefNode, BinaryNode, Node, Dumpable, AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Insert
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. DefNode
  7. BinaryNode
  8. Node
  9. Dumpable
  10. AnyRef
  11. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Insert(tableSym: Symbol, table: Node, linear: Node)

Type Members

  1. type Self = Insert

    Definition Classes
    Insert → Node

Value Members

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

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from Insert to any2stringadd[Insert] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd

  4. def ->[B](y: B): (Insert, B)

    Implicit information
    This member is added by an implicit conversion from Insert to ArrowAssoc[Insert] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  8. def ensuring(cond: (Insert) ⇒ Boolean, msg: ⇒ Any): Insert

    Implicit information
    This member is added by an implicit conversion from Insert to Ensuring[Insert] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  9. def ensuring(cond: (Insert) ⇒ Boolean): Insert

    Implicit information
    This member is added by an implicit conversion from Insert to Ensuring[Insert] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  10. def ensuring(cond: Boolean, msg: ⇒ Any): Insert

    Implicit information
    This member is added by an implicit conversion from Insert to Ensuring[Insert] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  11. def ensuring(cond: Boolean): Insert

    Implicit information
    This member is added by an implicit conversion from Insert to Ensuring[Insert] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  12. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  14. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from Insert to StringFormat[Insert] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

  15. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  16. def getDumpInfo: DumpInfo

    Return the name, main info, attribute info and named children

    Return the name, main info, attribute info and named children

    Definition Classes
    Insert → Node → Dumpable

  17. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  18. def left: Node

    Definition Classes
    Insert → BinaryNode

  19. val linear: Node

  20. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Node

  22. def nodeChildNames: Vector[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
    Insert → Node

  23. lazy val nodeChildren: Seq[Node]

    All child nodes of this node.

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

    Definition Classes
    BinaryNode → Node

  24. def nodeGenerators: Vector[(Symbol, Node)]

    Definition Classes
    Insert → DefNode

  25. def nodeHasType: Boolean

    Definition Classes
    Node

  26. final def nodeMapChildren(f: (Node) ⇒ Node, keepType: Boolean = false): 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. If keepType is set to true, the type of this node is kept even if the children have changed.

    Definition Classes
    Node

  27. final def nodeMapGenerators(f: (Symbol) ⇒ Symbol): Node

    Definition Classes
    DefNode

  28. final def nodeMapScopedChildren(f: (Option[Symbol], Node) ⇒ Node): Self with DefNode

    Definition Classes
    DefNode

  29. def nodePeekType: Type

    Definition Classes
    Node

  30. def nodeRebuild(l: Node, r: Node): Insert

    Definition Classes
    Insert → BinaryNode

  31. 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
    BinaryNode → Node

  32. final def nodeRebuildOrThis(ch: IndexedSeq[Node]): Self

    Rebuild this node with a new list of children unless all children are identical to the current ones.

    Rebuild this node with a new list of children unless all children are identical to the current ones.

    Attributes
    protected[this]
    Definition Classes
    Node

  33. def nodeRebuildWithGenerators(gen: IndexedSeq[Symbol]): Insert

    Definition Classes
    Insert → DefNode

  34. def nodeRebuildWithType(tpe: Type): Self

    Definition Classes
    Node

  35. def nodeType: Type

    The current type of this node

    The current type of this node

    Definition Classes
    Node

  36. final def nodeTyped(tpe: Type): Insert.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

  37. final 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

  38. final def nodeUntypedOrCopy: Self

    Return this Node with no Type assigned (if it's type has not been observed yet) or an untyped copy.

    Return this Node with no Type assigned (if it's type has not been observed yet) or an untyped copy.

    Definition Classes
    Node

  39. final def nodeWithComputedType(scope: SymbolScope = SymbolScope.empty, typeChildren: Boolean = false, retype: Boolean = false): 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, the children are only type-checked again if typeChildren is set to true. if retype is also set to true, the existing type of this node is replaced. If this node does not yet have a type, the types of all children are computed.

    Definition Classes
    Node

  40. def nodeWithComputedType2(scope: SymbolScope, typeChildren: Boolean, retype: Boolean): Self

    Definition Classes
    Insert → Node

  41. final def notify(): Unit

    Definition Classes
    AnyRef

  42. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  43. def right: Node

    Definition Classes
    Insert → BinaryNode

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

    Definition Classes
    AnyRef

  45. val table: Node

  46. val tableSym: Symbol

  47. final def toString(): String

    Definition Classes
    Node → AnyRef → Any

  48. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  50. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  51. def →[B](y: B): (Insert, B)

    Implicit information
    This member is added by an implicit conversion from Insert to ArrowAssoc[Insert] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from DefNode

Inherited from BinaryNode

Inherited from Node

Inherited from Dumpable

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from Insert to any2stringadd[Insert]

Inherited by implicit conversion StringFormat from Insert to StringFormat[Insert]

Inherited by implicit conversion Ensuring from Insert to Ensuring[Insert]

Inherited by implicit conversion ArrowAssoc from Insert to ArrowAssoc[Insert]

Ungrouped