GroupBy

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. val by: Node

8. val byGen: Symbol

9. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws()

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

    Definition Classes

    AnyRef

11. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

12. val from: Node

13. val fromGen: Symbol

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

    Definition Classes

    AnyRef → Any

15. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

16. def left: Node

    Definition Classes

    GroupBy → BinaryNode

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

    Definition Classes

    AnyRef

18. def nodeChildNames: collection.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

    GroupBy → Node

19. lazy val nodeChildren: collection.Seq[Node]

    Definition Classes

    BinaryNode → Node

20. def nodeDelegate: Node

    Definition Classes

    Node → NodeGenerator

21. def nodeGenerators: collection.Seq[(Symbol, Node)]

    Definition Classes

    GroupBy → DefNode

22. def nodeIntrinsicSymbol: IntrinsicSymbol

    The intrinsic symbol that points to this Node object.

    The intrinsic symbol that points to this Node object.

    Definition Classes

    Node

23. def nodeMapChildren(f: (Node) ⇒ Node): Node

    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.

    Definition Classes

    SimpleNode → Node

24. def nodeMapGenerators(f: (Symbol) ⇒ Symbol): Node

    Definition Classes

    SimpleDefNode → DefNode

25. final def nodeMapNodes(s: Iterable[Node], f: (Node) ⇒ Node): Option[IndexedSeq[Node]]

    Attributes

    protected[this]

    Definition Classes

    Node

26. def nodeMapScopedChildren(f: (Option[Symbol], Node) ⇒ Node): DefNode

    Definition Classes

    SimpleDefNode → DefNode

27. def nodePostGeneratorChildren: collection.immutable.Nil.type

    Definition Classes

    GroupBy → DefNode

28. def nodeRebuild(left: Node, right: Node): GroupBy

    Attributes

    protected[this]

    Definition Classes

    GroupBy → BinaryNode

29. final def nodeRebuild(ch: IndexedSeq[Node]): Node

    Attributes

    protected[this]

    Definition Classes

    BinaryNode → SimpleNode

30. def nodeRebuildWithGenerators(gen: IndexedSeq[Symbol]): GroupBy

    Definition Classes

    GroupBy → SimpleDefNode

31. final def notify(): Unit

    Definition Classes

    AnyRef

32. final def notifyAll(): Unit

    Definition Classes

    AnyRef

33. def right: Node

    Definition Classes

    GroupBy → BinaryNode

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

    Definition Classes

    AnyRef

35. def toString(): String

    Definition Classes

    GroupBy → Node → AnyRef → Any

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()