You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@flink.apache.org by ch...@apache.org on 2018/09/05 10:32:11 UTC
[flink] branch master updated: [hotfix][docs] Fix html tags in
Batch API overview
This is an automated email from the ASF dual-hosted git repository.
chesnay pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/flink.git
The following commit(s) were added to refs/heads/master by this push:
new 4d233ba [hotfix][docs] Fix html tags in Batch API overview
4d233ba is described below
commit 4d233bac48b00cd321408f3eca9df5c931d7829f
Author: 谢磊 <22...@qq.com>
AuthorDate: Wed Sep 5 18:32:04 2018 +0800
[hotfix][docs] Fix html tags in Batch API overview
---
docs/dev/batch/index.md | 5 ++---
1 file changed, 2 insertions(+), 3 deletions(-)
diff --git a/docs/dev/batch/index.md b/docs/dev/batch/index.md
index c624fce..62e4117 100644
--- a/docs/dev/batch/index.md
+++ b/docs/dev/batch/index.md
@@ -592,7 +592,7 @@ val output: DataSet[(Int, String, Double)] = input.sum(0).min(2)
</td>
</tr>
- </tr>
+ <tr>
<td><strong>Join</strong></td>
<td>
Joins two data sets by creating all pairs of elements that are equal on their keys.
@@ -608,7 +608,7 @@ val result = input1.join(input2).where(0).equalTo(1)
describe whether the join happens through partitioning or broadcasting, and whether it uses
a sort-based or a hash-based algorithm. Please refer to the
<a href="dataset_transformations.html#join-algorithm-hints">Transformations Guide</a> for
- a list of possible hints and an example.</br>
+ a list of possible hints and an example.<br />
If no hint is specified, the system will try to make an estimate of the input sizes and
pick the best strategy according to those estimates.
{% highlight scala %}
@@ -700,7 +700,6 @@ val result = in.partitionByRange(0).mapPartition { ... }
{% endhighlight %}
</td>
</tr>
- </tr>
<tr>
<td><strong>Custom Partitioning</strong></td>
<td>