searchsortedfirst has much lower overhead than first(searchsorted). Once https://github.com/JuliaMath/Primes.jl/pull/114 is merged, I will rebase this on top of that, to make use of increment! which will be another 2x speedup for factorization since it won't have to do the searchsorted twice.
searchsortedfirsthas much lower overhead thanfirst(searchsorted). Once https://github.com/JuliaMath/Primes.jl/pull/114 is merged, I will rebase this on top of that, to make use ofincrement!which will be another 2x speedup for factorization since it won't have to do thesearchsortedtwice.