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

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.
db4
Samuel Tardieu 2009-01-07 10:34:07 +01:00
parent 2638db02d1
commit c8be645eb1
3 changed files with 8 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
extra/benchmark/binary-search/binary-search.factor
View File

@ -1,13 +1,17 @@
! Copyright (C) 2008 Slava Pestov. ! Copyright (C) 2008 Slava Pestov.
! See http://factorcode.org/license.txt for BSD license. ! See http://factorcode.org/license.txt for BSD license.
USING: binary-search kernel math.primes.list math.ranges sequences USING: binary-search compiler.units kernel math.primes math.ranges
prettyprint ; memoize prettyprint sequences ;
IN: benchmark.binary-search IN: benchmark.binary-search
: binary-search-benchmark ( -- ) [
1 1000000 [a,b] [ primes-under-million sorted-member? ] map length . ; MEMO: primes-under-million ( -- seq ) 1000000 primes-upto ;
] with-compilation-unit
! Force computation of the primes list before benchmarking the binary search ! Force computation of the primes list before benchmarking the binary search
primes-under-million drop primes-under-million drop
: binary-search-benchmark ( -- )
1 1000000 [a,b] [ primes-under-million sorted-member? ] map length . ;
MAIN: binary-search-benchmark MAIN: binary-search-benchmark

1
extra/math/primes/list/authors.txt
View File

@ -1 +0,0 @@
Doug Coleman

4
extra/math/primes/list/list.factor
View File

@ -1,4 +0,0 @@
USING: math.primes memoize ;
IN: math.primes.list
MEMO: primes-under-million ( -- seq ) 1000000 primes-upto ;