From: xie xingguo Date: Wed, 5 Jul 2017 08:49:29 +0000 (+0800) Subject: crush: fix misuse of some ASCII chars X-Git-Tag: v12.1.1~101^2~5 X-Git-Url: http://git-server-git.apps.pok.os.sepia.ceph.com/?a=commitdiff_plain;h=a301938da03e6537a16291e39348c870070f8424;p=ceph.git crush: fix misuse of some ASCII chars Signed-off-by: xie xingguo --- diff --git a/src/crush/crush.h b/src/crush/crush.h index 4be114631e36b..e5bdba2d791e0 100644 --- a/src/crush/crush.h +++ b/src/crush/crush.h @@ -143,7 +143,7 @@ enum crush_algorithm { * can contain items with arbitrary weights. To place a * replica, CRUSH begins at the head of the list with the most * recently added item and compares its weight to the sum of - * all remaining items’ weights. Depending on the value of + * all remaining items' weights. Depending on the value of * hash( x , r , item), either the current item is chosen with * the appropriate probability, or the process continues * recursively down the list. This is a natural and intuitive @@ -174,13 +174,13 @@ enum crush_algorithm { * change due an addition, removal, or re-weighting of an * item. * - * The straw2 bucket type allows all items to fairly “compete” + * The straw2 bucket type allows all items to fairly "compete" * against each other for replica placement through a process * analogous to a draw of straws. To place a replica, a straw * of random length is drawn for each item in the bucket. The * item with the longest straw wins. The length of each straw * is initially a value in a fixed range. Each straw length - * is scaled by a factor based on the item’s weight so that + * is scaled by a factor based on the item's weight so that * heavily weighted items are more likely to win the draw. * Although this process is almost twice as slow (on average) * than a list bucket and even slower than a tree bucket