提交 b5526742 编写于 作者: D darcy

7031376: Typos in javadoc of TimSort classes

Reviewed-by: darcy
Contributed-by: jjb@google.com
上级 e6d9ee13
...@@ -241,7 +241,7 @@ class ComparableTimSort { ...@@ -241,7 +241,7 @@ class ComparableTimSort {
* pivot < all in [left, start), so pivot belongs at left. Note * pivot < all in [left, start), so pivot belongs at left. Note
* that if there are elements equal to pivot, left points to the * that if there are elements equal to pivot, left points to the
* first slot after them -- that's why this sort is stable. * first slot after them -- that's why this sort is stable.
* Slide elements over to make room to make room for pivot. * Slide elements over to make room for pivot.
*/ */
int n = start - left; // The number of elements to move int n = start - left; // The number of elements to move
// Switch is just an optimization for arraycopy in default case // Switch is just an optimization for arraycopy in default case
......
...@@ -274,7 +274,7 @@ class TimSort<T> { ...@@ -274,7 +274,7 @@ class TimSort<T> {
* pivot < all in [left, start), so pivot belongs at left. Note * pivot < all in [left, start), so pivot belongs at left. Note
* that if there are elements equal to pivot, left points to the * that if there are elements equal to pivot, left points to the
* first slot after them -- that's why this sort is stable. * first slot after them -- that's why this sort is stable.
* Slide elements over to make room to make room for pivot. * Slide elements over to make room for pivot.
*/ */
int n = start - left; // The number of elements to move int n = start - left; // The number of elements to move
// Switch is just an optimization for arraycopy in default case // Switch is just an optimization for arraycopy in default case
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册