rewrap

dlang · Apr 30, 2016 · 4a28601 · 4a28601
1 parent f46e52b
commit 4a28601
Showing 1 changed file with 4 additions and 5 deletions.
diff --git a/std/algorithm/mutation.d b/std/algorithm/mutation.d
@@ -1564,11 +1564,10 @@ of the array over the slots to be removed. This way there is less data
 movement to be done which improves the execution time of the function.
 
 The function $(D remove) works on bidirectional ranges that have assignable
-lvalue elements. The moving
-strategy is (listed from fastest to slowest): $(UL $(LI If $(D s ==
-SwapStrategy.unstable && isRandomAccessRange!Range && hasLength!Range
-&& hasLvalueElements!Range), then elements are moved from the end
-of the range into the slots to be filled. In this case, the absolute
+lvalue elements. The moving strategy is (listed from fastest to slowest):
+$(UL $(LI If $(D s == SwapStrategy.unstable && isRandomAccessRange!Range &&
+hasLength!Range && hasLvalueElements!Range), then elements are moved from the
+end of the range into the slots to be filled. In this case, the absolute
 minimum of moves is performed.)  $(LI Otherwise, if $(D s ==
 SwapStrategy.unstable && isBidirectionalRange!Range && hasLength!Range
 && hasLvalueElements!Range), then elements are still moved from the