factor: trim using lists

[factor.git] / extra / benchmark / beust2 / beust2.factor

diff --git a/extra/benchmark/beust2/beust2.factor b/extra/benchmark/beust2/beust2.factor
index 68f40ef3990aecab42c83a70a503c0dbf8a93a86..18d78cfb2a2694ce941d8761c66cfcd8a106935b 100644 (file)
--- a/extra/benchmark/beust2/beust2.factor
+++ b/extra/benchmark/beust2/beust2.factor
@@ -1,12 +1,12 @@
 ! Copyright (C) 2008 Slava Pestov.
 ! See http://factorcode.org/license.txt for BSD license.
-USING: math math.ranges math.parser sequences kernel io locals ;
+USING: kernel math sequences ;
 IN: benchmark.beust2
 
 ! http://crazybob.org/BeustSequence.java.html
 
 :: (count-numbers) ( remaining first value used max listener: ( -- ) -- ? )
-    10 first - iota [| i |
+    10 first - <iota> [| i |
         i first + :> digit
         digit 2^ :> mask
         i value + :> value'
@@ -28,12 +28,11 @@ IN: benchmark.beust2
     ] any? ; inline recursive
 
 :: count-numbers ( max listener -- )
-    10 iota [ 1 + 1 1 0 max listener (count-numbers) ] any? drop ;
-    inline
+    10 <iota> [ 1 + 1 1 0 max listener (count-numbers) ] any? drop ; inline
 
 :: beust2-benchmark ( -- )
     0 :> i!
     5000000000 [ i 1 + i! ] count-numbers
-    i number>string " unique numbers." append print ;
+    i 7063290 assert= ;
 
 MAIN: beust2-benchmark