Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Log sieve #210

Merged
merged 55 commits into from
Aug 22, 2020
Merged

Log sieve #210

merged 55 commits into from
Aug 22, 2020

Conversation

federico-bongiorno
Copy link
Contributor

Sieving after taking logarithms

Copy link
Owner

@Bodigrim Bodigrim left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please do not forget to clean up traces and fix Travis build.

Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
Math/NumberTheory/Primes/Factorisation/QuadraticSieve.hs Outdated Show resolved Hide resolved
app/QuadraticSieve.hs Show resolved Hide resolved
test-suite/Math/NumberTheory/Primes/QuadraticSieveTests.hs Outdated Show resolved Hide resolved
-- This routine takes the @sievedInterval@ as input, it first filters for smooth numbers
-- using the given threshold and then checks which of the filtered numbers are smooth
-- by computing their factorisation by trial division.
findLogSmoothNumbers :: [Prime Int] -> Int -> Int -> [(Prime Integer, Word)] -> Integer -> V.Vector (Integer, Int) -> V.Vector (Integer, I.IntMap Int)
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I suggest changing this function to take V.Vector Integer and U.Vector Int separately, and return Map Integer (I.IntMap Int) immediately.

@Bodigrim Bodigrim marked this pull request as ready for review August 22, 2020 18:06
@Bodigrim Bodigrim merged commit 1273632 into Bodigrim:master Aug 22, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants