steve
/
factor
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
factor/extra/benchmark/binary-search/binary-search.factor

18 lines
554 B
Factor
Raw Normal View History

Add some benchmarks
2008-08-24 04:59:22 -04:00
! Copyright (C) 2008 Slava Pestov.
! See http://factorcode.org/license.txt for BSD license.
Remove "primes-under-million" list In the past, this was a static list used to optimize prime factors computation. Now that the dependency has been reversed, there is no point in keeping this list which can be obtained by "1000000 primes-upto" as easily.
2009-01-07 04:34:07 -05:00
USING: binary-search compiler.units kernel math.primes math.ranges
memoize prettyprint sequences ;
Add some benchmarks
2008-08-24 04:59:22 -04:00
IN: benchmark.binary-search
Remove "primes-under-million" list In the past, this was a static list used to optimize prime factors computation. Now that the dependency has been reversed, there is no point in keeping this list which can be obtained by "1000000 primes-upto" as easily.
2009-01-07 04:34:07 -05:00
[
MEMO: primes-under-million ( -- seq ) 1000000 primes-upto ;
] with-compilation-unit
Add some benchmarks
2008-08-24 04:59:22 -04:00
Force primes list evaluation before benchmark
2008-12-29 15:29:26 -05:00
! Force computation of the primes list before benchmarking the binary search
primes-under-million drop
Remove "primes-under-million" list In the past, this was a static list used to optimize prime factors computation. Now that the dependency has been reversed, there is no point in keeping this list which can be obtained by "1000000 primes-upto" as easily.
2009-01-07 04:34:07 -05:00
: binary-search-benchmark ( -- )
1 1000000 [a,b] [ primes-under-million sorted-member? ] map length . ;
Add some benchmarks
2008-08-24 04:59:22 -04:00
MAIN: binary-search-benchmark