Class

slick.ast

Take

Related Doc: package ast

Permalink

final case class Take(from: Node, count: Node) extends SimpleFilteredQuery with BinaryNode with Product with Serializable

A .take call.

Source
Node.scala
Linear Supertypes
Serializable, Serializable, Product, Equals, BinaryNode, SimpleFilteredQuery, SimplyTypedNode, FilteredQuery, Node, Dumpable, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Take
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. BinaryNode
  7. SimpleFilteredQuery
  8. SimplyTypedNode
  9. FilteredQuery
  10. Node
  11. Dumpable
  12. AnyRef
  13. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Take(from: Node, count: Node)

    Permalink

Type Members

  1. type Self = Take

    Permalink
    Definition Classes
    TakeSimpleFilteredQuerySimplyTypedNodeFilteredQueryNode

Value Members

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from Take to any2stringadd[Take] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (Take, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from Take to ArrowAssoc[Take] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def :@(newType: Type): Self

    Permalink

    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
  6. final def ==(arg0: Any): Boolean

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

    Permalink
    Definition Classes
    Any
  8. final def buildCopy: Self

    Permalink

    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
    BinaryNodeNode
  9. def buildType: Type

    Permalink
    Definition Classes
    SimpleFilteredQuerySimplyTypedNode
  10. def childNames: Seq[String]

    Permalink

    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
    TakeNode
  11. lazy val children: ConstArray[Node]

    Permalink

    All child nodes of this node.

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

    Definition Classes
    BinaryNodeNode
  12. final def childrenForeach[R](f: (Node) ⇒ R): Unit

    Permalink

    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 Node subclasses. n.children.foreach(f) }}} implemented more efficiently in Node subclasses. n.childrenForeach(f) }}} implemented more efficiently in Node subclasses.

    Definition Classes
    BinaryNodeNode
  13. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  14. val count: Node

    Permalink
  15. def ensuring(cond: (Take) ⇒ Boolean, msg: ⇒ Any): Take

    Permalink
    Implicit information
    This member is added by an implicit conversion from Take to Ensuring[Take] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  16. def ensuring(cond: (Take) ⇒ Boolean): Take

    Permalink
    Implicit information
    This member is added by an implicit conversion from Take to Ensuring[Take] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  17. def ensuring(cond: Boolean, msg: ⇒ Any): Take

    Permalink
    Implicit information
    This member is added by an implicit conversion from Take to Ensuring[Take] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  18. def ensuring(cond: Boolean): Take

    Permalink
    Implicit information
    This member is added by an implicit conversion from Take to Ensuring[Take] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  19. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  20. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  21. def formatted(fmtstr: String): String

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

    Permalink
    Definition Classes
    TakeFilteredQuery
  23. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  24. def getDumpInfo: DumpInfo

    Permalink

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

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

    Definition Classes
    NodeDumpable
  25. def hasType: Boolean

    Permalink

    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
  26. final def infer(scope: Scope = Map.empty, typeChildren: Boolean = false): Self

    Permalink

    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 true. if retype is also 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 first.

    Definition Classes
    Node
  27. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  28. def left: Node

    Permalink
    Definition Classes
    TakeBinaryNode
  29. final def mapChildren(f: (Node) ⇒ Node, keepType: Boolean = false): Self

    Permalink

    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 true, the type of this node is kept even when the children have changed.

    Definition Classes
    BinaryNodeNode
  30. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  31. def nodeType: Type

    Permalink

    The current type of this node.

    The current type of this node.

    Definition Classes
    Node
  32. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  34. def peekType: Type

    Permalink

    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
  35. def rebuild(left: Node, right: Node): Take

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TakeBinaryNode
  36. final def rebuild(ch: ConstArray[Node]): Self

    Permalink

    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
    BinaryNodeNode
  37. def right: Node

    Permalink
    Definition Classes
    TakeBinaryNode
  38. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  39. final def toString(): String

    Permalink
    Definition Classes
    Node → AnyRef → Any
  40. final def untyped: Self

    Permalink

    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
  41. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  44. final def withChildren(ch2: ConstArray[Node]): Self

    Permalink

    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
  45. final def withInferredType(scope: Scope, typeChildren: Boolean): Self

    Permalink
    Definition Classes
    SimplyTypedNodeNode
  46. def [B](y: B): (Take, B)

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from BinaryNode

Inherited from SimpleFilteredQuery

Inherited from SimplyTypedNode

Inherited from FilteredQuery

Inherited from Node

Inherited from Dumpable

Inherited from AnyRef

Inherited from Any

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

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

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

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

Ungrouped