# File lib/hashery/sparsearray.rb, line 484 def qsort(ha, l, r) l_hold = l r_hold = r pivot = ha[l] while l < r r -= 1 while (ha[r] <=> pivot) >= 0 and l < r if l != r ha[l] = ha[r] l += 1 end l += 1 while (ha[l] <=> pivot) <= 0 and l < r if l != r ha[r] = ha[l] r -= 1 end end ha[l] = pivot pivot = l l = l_hold r = r_hold qsort(ha,l,pivot-1) if l < pivot qsort(ha,pivot+1,r) if r > pivot ha end