kudu-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From wdberke...@apache.org
Subject [1/2] kudu git commit: [design-docs] Add missing backtick in compaction-policy.md
Date Mon, 08 Oct 2018 15:47:22 GMT
Repository: kudu
Updated Branches:
  refs/heads/master 42b75278a -> 2d6f8ffa9


[design-docs] Add missing backtick in compaction-policy.md

Change-Id: Iee52f0e8551b5ea61128be56107e550c47c9fb45
Reviewed-on: http://gerrit.cloudera.org:8080/11600
Tested-by: Will Berkeley <wdberkeley@gmail.com>
Reviewed-by: Andrew Wong <awong@cloudera.com>


Project: http://git-wip-us.apache.org/repos/asf/kudu/repo
Commit: http://git-wip-us.apache.org/repos/asf/kudu/commit/88229a52
Tree: http://git-wip-us.apache.org/repos/asf/kudu/tree/88229a52
Diff: http://git-wip-us.apache.org/repos/asf/kudu/diff/88229a52

Branch: refs/heads/master
Commit: 88229a52bdebdfbaa103c553d77a7a6118e87122
Parents: 42b7527
Author: Will Berkeley <wdberkeley@gmail.org>
Authored: Fri Oct 5 14:51:34 2018 -0700
Committer: Andrew Wong <awong@cloudera.com>
Committed: Fri Oct 5 21:53:09 2018 +0000

----------------------------------------------------------------------
 docs/design-docs/compaction-policy.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/kudu/blob/88229a52/docs/design-docs/compaction-policy.md
----------------------------------------------------------------------
diff --git a/docs/design-docs/compaction-policy.md b/docs/design-docs/compaction-policy.md
index dee61d1..f11a4b4 100644
--- a/docs/design-docs/compaction-policy.md
+++ b/docs/design-docs/compaction-policy.md
@@ -372,7 +372,7 @@ Computational complexity
 ----------------------------
 
 The algorithm contains `O(n^2)` calls to BestForPair, each of which contains one instance
of the
-0-1 knapsack problem, which has complexity `O(n * max_budget). Thus, the total complexity
is cubic
+0-1 knapsack problem, which has complexity `O(n * max_budget)`. Thus, the total complexity
is cubic
 in the number of rowsets, which can become quite expensive when a given tablet may include
on the
 order of a thousand rowsets.
 


Mime
View raw message