steve
/
factor
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

sorting.quick: a bit faster for standard data types.

db4
John Benediktsson 2015-08-15 08:57:47 -07:00
parent 43aa46384c
commit 7711c2720f
1 changed files with 11 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
extra/sorting/quick/quick.factor
View File

@ -1,25 +1,25 @@
! Copyright (C) 2014 John Benediktsson
! See http://factorcode.org/license.txt for BSD license
USING: combinators kernel locals math math.order sequences
sequences.private ;
USING: arrays combinators kernel locals math math.order
sequences sequences.private strings vectors ;
IN: sorting.quick
<PRIVATE
:: quicksort ( seq from to quot -- )
:: quicksort ( seq from to quot: ( obj1 obj2 -- <=> ) -- )
from to < [
from to + 2/ seq nth-unsafe :> pivot
from to [ 2dup <= ] [
[
over seq nth-unsafe pivot quot call( x x -- x )
over seq nth-unsafe pivot quot call
+lt+ eq?
] [ [ 1 + ] dip ] while
[
dup seq nth-unsafe pivot quot call( x x -- x )
dup seq nth-unsafe pivot quot call
+gt+ eq?
] [ 1 - ] while
@ -44,5 +44,9 @@ PRIVATE>
: inv-sort-with! ( seq quot: ( elt -- key ) -- )
[ compare invert-comparison ] curry sort! ; inline
: natural-sort! ( seq -- )
[ <=> ] sort! ;
GENERIC: natural-sort! ( seq -- )
M: object natural-sort! [ <=> ] sort! ;
M: array natural-sort! [ <=> ] sort! ;
M: vector natural-sort! [ <=> ] sort! ;
M: string natural-sort! [ <=> ] sort! ;