Consecutive primes with ascending or descending differences: Difference between revisions

The code makes heavy use of "Sieve" object developed for other Rosetta Code tasks. The Sieve object finds all the primes in below a certain value and puts them in an array. It can be used test if a number is prime or it can be used to find a sequence of primes. It even has the option of use bit boolean, which extends the array space in 32-bit programs from 4 gigabytes todescribed 32here: gigabytes.[[Extensible_prime_generator#Delphi]]