Packages

object BaseGroupingSets

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BaseGroupingSets
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  6. def computeGroupingSetIndexes(groupingSets: Seq[Seq[Expression]]): Seq[Seq[Int]]

    This methods converts given grouping sets into the indexes of the flatten grouping sets.

    This methods converts given grouping sets into the indexes of the flatten grouping sets. Let's say we have a query below: SELECT k1, k2, avg(v) FROM t GROUP BY GROUPING SETS ((k1), (k1, k2), (k2, k1)); In this case, flatten grouping sets are "[k1, k1, k2, k2, k1]" and the method will return indexes "[2, 3], [4, 5".

  7. def cubeExprs(exprs: Seq[Seq[Expression]]): Seq[Seq[Expression]]

    'GROUP BY a, b, c WITH CUBE' is equivalent to 'GROUP BY GROUPING SETS ( (a, b, c), (a, b), (b, c), (a, c), (a), (b), (c), ( ) )'.

    'GROUP BY a, b, c WITH CUBE' is equivalent to 'GROUP BY GROUPING SETS ( (a, b, c), (a, b), (b, c), (a, c), (a), (b), (c), ( ) )'. Group Count: 2 ^ N (N is the number of group expressions)

    We need to get all of its subsets for a given GROUPBY expression, the subsets are represented as sequence of expressions.

  8. def cubeExprs0(exprs: Seq[Seq[Expression]]): Seq[Seq[Expression]]
  9. def distinctGroupByExprs(exprs: Seq[Expression]): Seq[Expression]
  10. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  14. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  18. def rollupExprs(exprs: Seq[Seq[Expression]]): Seq[Seq[Expression]]

    'GROUP BY a, b, c WITH ROLLUP' is equivalent to 'GROUP BY GROUPING SETS ( (a, b, c), (a, b), (a), ( ) )'.

    'GROUP BY a, b, c WITH ROLLUP' is equivalent to 'GROUP BY GROUPING SETS ( (a, b, c), (a, b), (a), ( ) )'. Group Count: N + 1 (N is the number of group expressions)

    We need to get all of its subsets for the rule described above, the subset is represented as sequence of expressions.

  19. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  20. def toString(): String
    Definition Classes
    AnyRef → Any
  21. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  23. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated
    Deprecated

Inherited from AnyRef

Inherited from Any

Ungrouped