aboutsummaryrefslogtreecommitdiff
path: root/sql
diff options
context:
space:
mode:
authorDaoyuan Wang <daoyuan.wang@intel.com>2015-01-14 09:50:01 -0800
committerReynold Xin <rxin@databricks.com>2015-01-14 09:50:01 -0800
commit38bdc992a1a0485ac630af500da54f0a77e133bf (patch)
tree5c29be4acc7fa41686edf54f524c0b0b3889eed1 /sql
parent81f72a0df2250debe8a6a0773d809d8c42eeabb9 (diff)
downloadspark-38bdc992a1a0485ac630af500da54f0a77e133bf.tar.gz
spark-38bdc992a1a0485ac630af500da54f0a77e133bf.tar.bz2
spark-38bdc992a1a0485ac630af500da54f0a77e133bf.zip
[SQL] some comments fix for GROUPING SETS
Author: Daoyuan Wang <daoyuan.wang@intel.com> Closes #4000 from adrian-wang/comment and squashes the following commits: 9c24fc4 [Daoyuan Wang] some comments
Diffstat (limited to 'sql')
-rw-r--r--sql/catalyst/src/main/scala/org/apache/spark/sql/catalyst/analysis/Analyzer.scala12
1 files changed, 6 insertions, 6 deletions
diff --git a/sql/catalyst/src/main/scala/org/apache/spark/sql/catalyst/analysis/Analyzer.scala b/sql/catalyst/src/main/scala/org/apache/spark/sql/catalyst/analysis/Analyzer.scala
index bd00ff22ba..7f4cc234dc 100644
--- a/sql/catalyst/src/main/scala/org/apache/spark/sql/catalyst/analysis/Analyzer.scala
+++ b/sql/catalyst/src/main/scala/org/apache/spark/sql/catalyst/analysis/Analyzer.scala
@@ -126,10 +126,10 @@ class Analyzer(catalog: Catalog,
}
/*
- * GROUP BY a, b, c, WITH ROLLUP
+ * GROUP BY a, b, c WITH ROLLUP
* is equivalent to
- * GROUP BY a, b, c GROUPING SETS ( (a, b, c), (a, b), (a), ( )).
- * Group Count: N + 1 (N is the number of group expression)
+ * GROUP BY a, b, c 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 the bit masks.
@@ -139,12 +139,12 @@ class Analyzer(catalog: Catalog,
}
/*
- * GROUP BY a, b, c, WITH CUBE
+ * GROUP BY a, b, c WITH CUBE
* is equivalent to
* GROUP BY a, b, c GROUPING SETS ( (a, b, c), (a, b), (b, c), (a, c), (a), (b), (c), ( ) ).
- * Group Count: 2^N (N is the number of group expression)
+ * Group Count: 2 ^ N (N is the number of group expressions)
*
- * We need to get all of its sub sets for a given GROUPBY expressions, the subset is
+ * We need to get all of its subsets for a given GROUPBY expression, the subsets are
* represented as the bit masks.
*/
def bitmasks(c: Cube): Seq[Int] = {