object BaseGroupingSets
- Alphabetic
- By Inheritance
- BaseGroupingSets
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- 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".
- 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.
- def cubeExprs0(exprs: Seq[Seq[Expression]]): Seq[Seq[Expression]]
- def distinctGroupByExprs(exprs: Seq[Expression]): Seq[Expression]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- 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.
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()