RangeFrom

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

9. def finalize(): Unit

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

10. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

11. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

12. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

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

    Definition Classes

    Node

14. def nodeChildNames: Iterable[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

    Node

15. val nodeChildren: collection.immutable.Nil.type

    All child nodes of this node.

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

    Definition Classes

    NullaryNode → Node

16. def nodeHasType: Boolean

    Definition Classes

    TypedNode → Node

17. final def nodeIntrinsicSymbol: IntrinsicSymbol

    The intrinsic symbol that points to this Node object.

    The intrinsic symbol that points to this Node object.

    Definition Classes

    Node

18. 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

19. def nodePeekType: Type

    Definition Classes

    TypedNode → Node

20. def nodeRebuild: RangeFrom

    Definition Classes

    RangeFrom → NullaryNode

21. 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

    NullaryNode → Node

22. 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

23. def nodeRebuildWithType(tpe: Type): Self

    Definition Classes

    Node

24. def nodeType: Type

    The current type of this node

    The current type of this node

    Definition Classes

    TypedNode → Node

25. final def nodeTyped(tpe: Type): RangeFrom.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

26. 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

27. 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

28. 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

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

    Definition Classes

    TypedNode → Node

30. final def notify(): Unit

    Definition Classes

    AnyRef

31. final def notifyAll(): Unit

    Definition Classes

    AnyRef

32. val start: Long

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

    Definition Classes

    AnyRef

34. def toString(): String

    Definition Classes

    Node → AnyRef → Any

35. def tpe: CollectionType

    Definition Classes

    RangeFrom → Typed

36. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

38. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )