final case class Insert(tableSym: TermSymbol, table: Node, linear: Node, allFields: ConstArray[FieldSymbol]) extends BinaryNode with DefNode with Product with Serializable
- Alphabetic
- By Inheritance
- Insert
- Serializable
- Product
- Equals
- DefNode
- BinaryNode
- Node
- Dumpable
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new Insert(tableSym: TermSymbol, table: Node, linear: Node, allFields: ConstArray[FieldSymbol])
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (Insert, B)
- final def :@(newType: 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
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- val allFields: ConstArray[FieldSymbol]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- final def buildCopy: Self
Build a copy of this node with the current children.
Build a copy of this node with the current children.
- Attributes
- protected[this]
- Definition Classes
- BinaryNode → Node
- def childNames: Vector[String]
Names for the child nodes to show in AST dumps.
- lazy val children: ConstArray[Node]
All child nodes of this node.
All child nodes of this node. Must be implemented by subclasses.
- Definition Classes
- BinaryNode → Node
- final def childrenForeach[R](f: (Node) => R): Unit
Apply a side-effecting function to all direct children from left to right.
Apply a side-effecting function to all direct children from left to right. Note that
n.childrenForeach(f)
is equivalent to
n.children.foreach(f)
but can be implemented more efficiently in
Nodesubclasses. n.children.foreach(f) }}} implemented more efficiently inNodesubclasses. n.childrenForeach(f) }}} implemented more efficiently inNodesubclasses.- Definition Classes
- BinaryNode → Node
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def ensuring(cond: (Insert) => Boolean, msg: => Any): Insert
- def ensuring(cond: (Insert) => Boolean): Insert
- def ensuring(cond: Boolean, msg: => Any): Insert
- def ensuring(cond: Boolean): Insert
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def generators: ConstArray[(TermSymbol, Node)]
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getDumpInfo: DumpInfo
Return the name, main info, attribute info and named children
- def hasType: Boolean
Check if this node has a type without marking the type as seen.
Check if this node has a type without marking the type as seen.
- Definition Classes
- Node
- final def infer(scope: Scope = Map.empty, typeChildren: 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
typeChildrenretype- Definition Classes
- Node
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def left: Node
- Definition Classes
- Insert → BinaryNode
- val linear: Node
- final def mapChildren(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- Definition Classes
- BinaryNode → Node
- final def mapScopedChildren(f: (Option[TermSymbol], Node) => Node): Self with DefNode
- Definition Classes
- DefNode
- final def mapSymbols(f: (TermSymbol) => TermSymbol): Node
- Definition Classes
- DefNode
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nodeType: Type
The current type of this node.
The current type of this node.
- Definition Classes
- Node
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def peekType: Type
Get the current type of this node for debug output without marking it as seen.
Get the current type of this node for debug output without marking it as seen.
- Attributes
- protected[this]
- Definition Classes
- Node
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def rebuild(l: Node, r: Node): Insert
- Definition Classes
- Insert → BinaryNode
- final def rebuild(ch: ConstArray[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 reuse the current node. This method always returns a fresh copy.
- Attributes
- protected[this]
- Definition Classes
- BinaryNode → Node
- def rebuildWithSymbols(gen: ConstArray[TermSymbol]): Insert
- def right: Node
- Definition Classes
- Insert → BinaryNode
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- val table: Node
- val tableSym: TermSymbol
- final def toString(): String
- Definition Classes
- Node → AnyRef → Any
- final def untyped: Self
Return this Node with no Type assigned (if it has not yet been observed) or an untyped copy.
Return this Node with no Type assigned (if it has not yet been observed) or an untyped copy.
- Definition Classes
- Node
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def withChildren(ch2: ConstArray[Node]): Self
Rebuild this node with new child nodes unless all children are identical to the current ones, in which case this node is returned.
Rebuild this node with new child nodes unless all children are identical to the current ones, in which case this node is returned.
- Definition Classes
- Node
- def withInferredType(scope: Scope, typeChildren: Boolean): Self
Deprecated Value Members
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from Insert toStringFormat[Insert] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): (Insert, B)
- Implicit
- This member is added by an implicit conversion from Insert toArrowAssoc[Insert] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
edit this text on github
Scala Language-Integrated Connection Kit
This is the API documentation for the Slick database library. It should be used as an additional resource to the user manual.
Further documentation for Slick can be found on the documentation pages.
To the slick package list...