factor/extra/benchmark/binary-search/binary-search.factor

! Copyright (C) 2008, 2010 Slava Pestov.
! See http://factorcode.org/license.txt for BSD license.
USING: binary-search kernel math.primes math.ranges memoize
prettyprint sequences ;
IN: benchmark.binary-search

MEMO: primes-under-million ( -- seq ) 1000000 primes-upto ;

! Force computation of the primes list before benchmarking the binary search
primes-under-million drop

: binary-search-benchmark ( -- )
    1 1000000 [a,b] [ primes-under-million sorted-member? ] map
    length 1000000 assert= ;

MAIN: binary-search-benchmark
benchmark.binary-search: cleanup 2010-04-17 01:57:53 -04:00			`! Copyright (C) 2008, 2010 Slava Pestov.`
Add some benchmarks 2008-08-24 04:59:22 -04:00			`! See http://factorcode.org/license.txt for BSD license.`
benchmark.binary-search: cleanup 2010-04-17 01:57:53 -04:00			`USING: binary-search kernel math.primes math.ranges memoize`
			`prettyprint sequences ;`
Add some benchmarks 2008-08-24 04:59:22 -04:00			`IN: benchmark.binary-search`

benchmark.binary-search: cleanup 2010-04-17 01:57:53 -04:00			`MEMO: primes-under-million ( -- seq ) 1000000 primes-upto ;`
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 ( -- )`
benchmark.binary-search: remove print in favor of assert. 2012-07-13 19:11:01 -04:00			`1 1000000 [a,b] [ primes-under-million sorted-member? ] map`
			`length 1000000 assert= ;`
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
Add some benchmarks 2008-08-24 04:59:22 -04:00			`MAIN: binary-search-benchmark`