Take

Instance Constructors

new Take(from: Node, count: Node)

Type Members

type Self = Take

Definition Classes
Take → SimpleFilteredQuery → SimplyTypedNode → FilteredQuery → Node

Value Members

final def !=(arg0: Any): Boolean

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

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

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
def ->[B](y: B): (Take, B)

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()
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
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 buildType: Type

Definition Classes
SimpleFilteredQuery → SimplyTypedNode
def childNames: Seq[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
Take → Node
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 Node subclasses. n.children.foreach(f) }}} implemented more efficiently in Node subclasses. n.childrenForeach(f) }}} implemented more efficiently in Node subclasses.
Definition Classes
BinaryNode → Node
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val count: Node
def ensuring(cond: (Take) ⇒ Boolean, msg: ⇒ Any): Take

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
def ensuring(cond: (Take) ⇒ Boolean): Take

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
def ensuring(cond: Boolean, msg: ⇒ Any): Take

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
def ensuring(cond: Boolean): Take

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
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def finalize(): Unit

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

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()
val from: Node

Definition Classes
Take → FilteredQuery
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
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
Node → Dumpable
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 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
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def left: Node

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

Definition Classes
BinaryNode → Node
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
final def notifyAll(): Unit

Definition Classes
AnyRef
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 rebuild(left: Node, right: Node): Take

Attributes
protected[this]
Definition Classes
Take → 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 right: Node

Definition Classes
Take → BinaryNode
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
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( ... )
final def wait(arg0: Long, arg1: Int): Unit

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

Definition Classes
AnyRef
Annotations
@throws( ... )
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
def →[B](y: B): (Take, B)

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

Related Doc: package ast

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

Instance Constructors

new Take(from: Node, count: Node)

Type Members

type Self = Take

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (Take, B)

final def :@(newType: Type): Self

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

final def buildCopy: Self

def buildType: Type

def childNames: Seq[String]

lazy val children: ConstArray[Node]

final def childrenForeach[R](f: (Node) ⇒ R): Unit

def clone(): AnyRef

val count: Node

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

def ensuring(cond: (Take) ⇒ Boolean): Take

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

def ensuring(cond: Boolean): Take

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

val from: Node

final def getClass(): Class[_]

def getDumpInfo: DumpInfo

def hasType: Boolean

final def infer(scope: Scope = Map.empty, typeChildren: Boolean = false): Self

final def isInstanceOf[T0]: Boolean

def left: Node

final def mapChildren(f: (Node) ⇒ Node, keepType: Boolean = false): Self

final def ne(arg0: AnyRef): Boolean

def nodeType: Type

final def notify(): Unit

final def notifyAll(): Unit

def peekType: Type

def rebuild(left: Node, right: Node): Take

final def rebuild(ch: ConstArray[Node]): Self

def right: Node

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

final def toString(): String

final def untyped: Self

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def withChildren(ch2: ConstArray[Node]): Self

final def withInferredType(scope: Scope, typeChildren: Boolean): Self

def →[B](y: B): (Take, B)

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