From 31bf2e9acf3dbaf5f8325b3caa50b5ad963135d0 Mon Sep 17 00:00:00 2001 From: Loic Dachary Date: Mon, 27 Feb 2017 09:18:04 +0100 Subject: [PATCH] doc: crush typo in algorithm description Signed-off-by: Loic Dachary --- src/crush/crush.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/crush/crush.h b/src/crush/crush.h index 6669bbf4b347e..9af8c6aceb476 100644 --- a/src/crush/crush.h +++ b/src/crush/crush.h @@ -168,7 +168,7 @@ enum crush_algorithm { * they divide and conquer in a way that either gives certain * items precedence (e. g., those at the beginning of a list) * or obviates the need to consider entire subtrees of items - * at all. That im- proves the performance of the replica + * at all. That improves the performance of the replica * placement process, but can also introduce suboptimal * reorganization behavior when the contents of a bucket * change due an addition, removal, or re-weighting of an -- 2.39.5