Take

Instance Constructors

new Take(from: Node, count: Node)

Type Members

type Self = Take

Definition Classes
Take → Node

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
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 StringAdd performed by method any2stringadd in scala.Predef.
Definition Classes
StringAdd
def ->[B](y: B): (Take, B)

Implicit information
This member is added by an implicit conversion from Take to ArrowAssoc[Take] performed by method any2ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
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 any2Ensuring 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 any2Ensuring 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 any2Ensuring 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 any2Ensuring 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 performed by method any2stringfmt in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
val from: Node

Definition Classes
Take → FilteredQuery
val generator: AnonSymbol

Attributes
protected[this]
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
FilteredQuery → Node → Dumpable
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def left: Node

Definition Classes
Take → BinaryNode
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def nodeBuildTypedNode[T >: Take.this.type <: Node](newNode: T, newType: Type): T

Definition Classes
Node
def nodeChildNames: 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 nodeChildren: Seq[Node]

Definition Classes
BinaryNode → Node
def nodeGenerators: Seq[(Symbol, Node)]

Definition Classes
FilteredQuery
def nodeHasType: Boolean

Definition Classes
Node
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
def nodePeekType: Type

Definition Classes
Node
def nodeRebuild(left: Node, right: Node): Take

Attributes
protected[this]
Definition Classes
Take → BinaryNode
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
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
def nodeRebuildWithType(tpe: Type): Self

Definition Classes
Node
def nodeType: Type

The current type of this node
The current type of this node

Definition Classes
Node
final def nodeTyped(tpe: Type): Take.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
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
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
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
def nodeWithComputedType2(scope: SymbolScope, typeChildren: Boolean, retype: Boolean): Self

Definition Classes
FilteredQuery → Node
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

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

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

Shadowed Implicit Value Members

val self: Any
Implicit information
This member is added by an implicit conversion from Take to StringAdd performed by method any2stringadd in scala.Predef.
Shadowing
This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:
(take: StringAdd).self
Definition Classes
StringAdd
val self: Any
Implicit information
This member is added by an implicit conversion from Take to StringFormat performed by method any2stringfmt in scala.Predef.
Shadowing
This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:
(take: StringFormat).self
Definition Classes
StringFormat

Deprecated Value Members

def x: Take
Implicit information
This member is added by an implicit conversion from Take to ArrowAssoc[Take] performed by method any2ArrowAssoc in scala.Predef.
Shadowing
This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:
(take: ArrowAssoc[Take]).x
Definition Classes
ArrowAssoc
Annotations
@deprecated
Deprecated
(Since version 2.10.0) Use leftOfArrow instead
def x: Take
Implicit information
This member is added by an implicit conversion from Take to Ensuring[Take] performed by method any2Ensuring in scala.Predef.
Shadowing
This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:
(take: Ensuring[Take]).x
Definition Classes
Ensuring
Annotations
@deprecated
Deprecated
(Since version 2.10.0) Use resultOfEnsuring instead

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

Instance Constructors

new Take(from: Node, count: Node)

Type Members

type Self = Take

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

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

val generator: AnonSymbol

final def getClass(): Class[_]

def getDumpInfo: DumpInfo

final def isInstanceOf[T0]: Boolean

def left: Node

final def ne(arg0: AnyRef): Boolean

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

def nodeChildNames: Seq[String]

lazy val nodeChildren: Seq[Node]

def nodeGenerators: Seq[(Symbol, Node)]

def nodeHasType: Boolean

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

def nodePeekType: Type

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

final def nodeRebuild(ch: IndexedSeq[Node]): Self

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

def nodeRebuildWithType(tpe: Type): Self

def nodeType: Type

final def nodeTyped(tpe: Type): Take.this.type

final def nodeTypedOrCopy(tpe: Type): Self

final def nodeUntypedOrCopy: Self

final def nodeWithComputedType(scope: SymbolScope = SymbolScope.empty, typeChildren: Boolean = false, retype: Boolean = false): Self

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

final def notify(): Unit

final def notifyAll(): Unit

def right: Node

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

final def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

Shadowed Implicit Value Members

val self: Any

val self: Any

Deprecated Value Members

def x: Take

def x: Take

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from BinaryNode

Inherited from FilteredQuery

Inherited from Node

Inherited from Dumpable

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from Take to StringAdd

Inherited by implicit conversion any2stringfmt from Take to StringFormat

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

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

Ungrouped