stdlib: Fix long line in sort.rs

This commit is contained in:
Patrick Walton 2011-06-30 22:21:30 -07:00
parent 4c76bfdc1f
commit b4465aca5a

View file

@ -209,7 +209,8 @@ mod ivector {
// Based on algorithm presented by Sedgewick and Bentley here: // Based on algorithm presented by Sedgewick and Bentley here:
// http://www.cs.princeton.edu/~rs/talks/QuicksortIsOptimal.pdf // http://www.cs.princeton.edu/~rs/talks/QuicksortIsOptimal.pdf
// According to these slides this is the algorithm of choice for // 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, fn qsort3[T](lteq[T] compare_func_lt, lteq[T] compare_func_eq,
&T[mutable] arr, int left, int right) { &T[mutable] arr, int left, int right) {
if (right <= left) { ret; } if (right <= left) { ret; }