final case class Drop(from: Node, count: Node) extends SimpleFilteredQuery with BinaryNode with Product with Serializable
- Alphabetic
- By Inheritance
- Drop
- Serializable
- Product
- Equals
- BinaryNode
- SimpleFilteredQuery
- SimplyTypedNode
- FilteredQuery
- Node
- Dumpable
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Type Members
- type Self = Drop
- Definition Classes
- Drop → SimpleFilteredQuery → SimplyTypedNode → FilteredQuery → Node
Value Members
- 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
- def buildType: Type
- Definition Classes
- SimpleFilteredQuery → SimplyTypedNode
- def childNames: Seq[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.- Definition Classes
- BinaryNode → Node
- val count: Node
- val from: Node
- Definition Classes
- Drop → FilteredQuery
- 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
- def left: Node
- Definition Classes
- Drop → BinaryNode
- 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
- def nodeType: Type
The current type of this node.
The current type of this node.
- Definition Classes
- Node
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def right: Node
- Definition Classes
- Drop → BinaryNode
- def self: Drop
- 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 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
- final def withInferredType(scope: Scope, typeChildren: Boolean): Self
- Definition Classes
- SimplyTypedNode → Node
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...