• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

JuliaMath / Primes.jl / 293
96%

Build:
DEFAULT BRANCH: master
Ran 25 Aug 2019 08:41PM UTC
Jobs 4
Files 2
Run time 27s
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

pending completion
293

push

travis-ci

ararslan
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`.

12 of 12 new or added lines in 1 file covered. (100.0%)

177 of 179 relevant lines covered (98.88%)

57038176.21 hits per line

Jobs
ID Job ID Ran Files Coverage
1 293.1 25 Aug 2019 08:42PM UTC 0
97.79
Travis Job 293.1
2 293.2 25 Aug 2019 08:42PM UTC 0
97.78
Travis Job 293.2
3 293.3 25 Aug 2019 08:42PM UTC 0
99.14
Travis Job 293.3
4 293.4 25 Aug 2019 08:42PM UTC 0
99.14
Travis Job 293.4
Source Files on build 293
Detailed source file information is not available for this build.
  • Back to Repo
  • Travis Build #293
  • 4deaf526 on github
  • Prev Build on master (#286)
  • Next Build on master (#311)
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2025 Coveralls, Inc