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

sorting.insertion: faster due to fewer nths.

db4
John Benediktsson 2014-04-27 22:41:37 -07:00
parent 00bd0c52e7
commit 63b5886337
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
basis/sorting/insertion/insertion.factor
View File

@ -5,10 +5,11 @@ IN: sorting.insertion
:: insert ( ... seq quot: ( ... elt -- ... elt' ) n -- ... ) :: insert ( ... seq quot: ( ... elt -- ... elt' ) n -- ... )
n zero? [ n zero? [
n n 1 - [ seq nth-unsafe quot call ] bi@ >= [ n n 1 - [ seq nth-unsafe ] bi@
n n 1 - seq exchange-unsafe 2dup [ quot call ] bi@ >= [ 2drop ] [
n 1 - n [ seq set-nth-unsafe ] bi-curry@ bi*
seq quot n 1 - insert seq quot n 1 - insert
] unless ] if
] unless ; inline recursive ] unless ; inline recursive
PRIVATE> PRIVATE>