4
96%
master: 96%

Ran 25 Aug 2019 08:42PM UTC

Files 2

Run time 0s

Badge

Embed ▾

Committed 25 Aug 2019 08:39PM UTC coverage: 99.138% (+0.9%) from 98.286%

Job # 293.4

Build Type

push

travis-ci

Committed by

ararslan

Commit Message

Add an option to specify the increment to use when searching for primes (#71)

A common operation in cryptography is to want to find a prime `p`
such that some `n` divides `p-1`. This is accomplished by starting
at some value `q` which `n` divides and then proceeding in increments
of `n` rather than increments of `1` until a prime is found. To enable
this procedure, add a keyword argument to `nextprime`/`prevprime` that
lets the user specify the desired increment.

Also, while we're at it, speed up the default `prevprime` case for larger
values by proceeding in increments of `2`.

Run Details

230 of 232 relevant lines covered (99.14%)

18918942.57 hits per line

JuliaMath / Primes.jl / 293 / 4
96%
master: 96%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 293.4

JuliaMath / Primes.jl / 293 / 4 96% master: 96%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 293.4

JuliaMath / Primes.jl / 293 / 4
96%
master: 96%

README BADGES
x