---

pcwalton · pcwalton · commit 21dcea2e7c6d · 2011-06-30T22:21:30.000-07:00
yaml --- r: 3519 b: refs/heads/master c: b4465ac h: refs/heads/master i: 3517: 18e9b2f 3515: 686ad48 3511: 6e1a107 3503: 4177cea 3487: 9b4eb52 3455: dc5d756 v: v3
diff --git a/[refs] b/[refs]
@@ -1,2 +1,2 @@
 ---
-refs/heads/master: 4c76bfdc1f460692d378803b478f02dc45b7e049
+refs/heads/master: b4465aca5ab22447dde52a4a7083d6e3d29e56e2
diff --git a/trunk/src/lib/sort.rs b/trunk/src/lib/sort.rs
@@ -209,7 +209,8 @@ mod ivector {
     // Based on algorithm presented by Sedgewick and Bentley here:
     // http://www.cs.princeton.edu/~rs/talks/QuicksortIsOptimal.pdf
     // According to these slides this is the algorithm of choice for
-    // 'randomly ordered keys, abstract compare' & 'small number of key values'
+    // 'randomly ordered keys, abstract compare' & 'small number of key
+    // values'
     fn qsort3[T](lteq[T] compare_func_lt, lteq[T] compare_func_eq,
                  &T[mutable] arr, int left, int right) {
         if (right <= left) { ret; }

Original file line number	Diff line number	Diff line change
`@@ -1,2 +1,2 @@`
`1`	`1`	`---`
`2`		`-refs/heads/master: 4c76bfdc1f460692d378803b478f02dc45b7e049`
	`2`	`+refs/heads/master: b4465aca5ab22447dde52a4a7083d6e3d29e56e2`