Home
last modified time | relevance | path

Searched refs:nextPrime (Results 1 – 25 of 109) sorted by relevance

12345

/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/primes/
H A DPrimesTest.java74 Primes.nextPrime(n); in assertNextPrimeException()
87 Assert.assertEquals(2, Primes.nextPrime(0)); in testNextPrime()
88 Assert.assertEquals(2, Primes.nextPrime(1)); in testNextPrime()
89 Assert.assertEquals(2, Primes.nextPrime(2)); in testNextPrime()
90 Assert.assertEquals(3, Primes.nextPrime(3)); in testNextPrime()
91 Assert.assertEquals(5, Primes.nextPrime(4)); in testNextPrime()
92 Assert.assertEquals(5, Primes.nextPrime(5)); in testNextPrime()
96 Assert.assertEquals(SmallPrimes.PRIMES[i+1], Primes.nextPrime(j)); in testNextPrime()
100 Assert.assertEquals(25325981, Primes.nextPrime(25325981)); in testNextPrime()
102 Assert.assertEquals(25326023, Primes.nextPrime(i)); in testNextPrime()
[all …]
/dports/net/mpich2/mpich2-1.5/src/mpe2/src/slog2sdk/src/cern/colt/map/
H A DAbstractMap.java62 return nextPrime(Math.max(size+1, (int) ((4*size / (3*minLoad+maxLoad))))); in chooseGrowCapacity()
85 return nextPrime(Math.max(size+1, (int) ((2*size / (minLoad+maxLoad))))); in chooseMeanCapacity()
93 return nextPrime(Math.max(size+1, (int) ((4*size / (minLoad+3*maxLoad))))); in chooseShrinkCapacity()
125 protected int nextPrime(int desiredCapacity) { in nextPrime() method in AbstractMap
126 return PrimeFinder.nextPrime(desiredCapacity); in nextPrime()
H A DPrimeFinder.java154 public static int nextPrime(int desiredCapacity) { in nextPrime() method in PrimeFinder
176 int primeCapacity = nextPrime(i); in statistics()
/dports/math/R-cran-numbers/numbers/man/
H A Dnextprime.Rd1 \name{nextPrime}
2 \alias{nextPrime}
8 nextPrime(n)
14 \code{nextPrime} finds the next prime number greater than \code{n}, while
28 p <- nextPrime(1e+6) # 1000003
H A Drabin.Rd39 # Rabin-Miller 10 times faster than nextPrime()
42 system.time(p <- nextPrime(N)) # 0.029
47 p <- nextPrime(n)
/dports/science/colt/colt/src/cern/colt/map/
H A DAbstractMap.java62 return nextPrime(Math.max(size+1, (int) ((4*size / (3*minLoad+maxLoad))))); in chooseGrowCapacity()
85 return nextPrime(Math.max(size+1, (int) ((2*size / (minLoad+maxLoad))))); in chooseMeanCapacity()
93 return nextPrime(Math.max(size+1, (int) ((4*size / (minLoad+3*maxLoad))))); in chooseShrinkCapacity()
125 protected int nextPrime(int desiredCapacity) { in nextPrime() method in AbstractMap
126 return PrimeFinder.nextPrime(desiredCapacity); in nextPrime()
H A DPrimeFinder.java154 public static int nextPrime(int desiredCapacity) { in nextPrime() method in PrimeFinder
176 int primeCapacity = nextPrime(i); in statistics()
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/math/
H A DBitSieve.java82 int nextPrime = 3; in BitSieve() local
86 sieveSingle(length, nextIndex + nextPrime, nextPrime); in BitSieve()
88 nextPrime = 2*nextIndex + 1; in BitSieve()
89 } while((nextIndex > 0) && (nextPrime < length)); in BitSieve()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/math/
H A DBitSieve.java82 int nextPrime = 3; in BitSieve() local
86 sieveSingle(length, nextIndex + nextPrime, nextPrime); in BitSieve()
88 nextPrime = 2*nextIndex + 1; in BitSieve()
89 } while((nextIndex > 0) && (nextPrime < length)); in BitSieve()
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/math/
H A DBitSieve.java82 int nextPrime = 3; in BitSieve() local
86 sieveSingle(length, nextIndex + nextPrime, nextPrime); in BitSieve()
88 nextPrime = 2*nextIndex + 1; in BitSieve()
89 } while((nextIndex > 0) && (nextPrime < length)); in BitSieve()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.base/share/classes/java/math/
H A DBitSieve.java82 int nextPrime = 3; in BitSieve() local
86 sieveSingle(length, nextIndex + nextPrime, nextPrime); in BitSieve()
88 nextPrime = 2*nextIndex + 1; in BitSieve()
89 } while((nextIndex > 0) && (nextPrime < length)); in BitSieve()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.base/share/classes/java/math/
H A DBitSieve.java82 int nextPrime = 3; in BitSieve() local
86 sieveSingle(length, nextIndex + nextPrime, nextPrime); in BitSieve()
88 nextPrime = 2*nextIndex + 1; in BitSieve()
89 } while((nextIndex > 0) && (nextPrime < length)); in BitSieve()
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.base/share/classes/java/math/
H A DBitSieve.java82 int nextPrime = 3; in BitSieve() local
86 sieveSingle(length, nextIndex + nextPrime, nextPrime); in BitSieve()
88 nextPrime = 2*nextIndex + 1; in BitSieve()
89 } while((nextIndex > 0) && (nextPrime < length)); in BitSieve()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.base/share/classes/java/math/
H A DBitSieve.java82 int nextPrime = 3; in BitSieve() local
86 sieveSingle(length, nextIndex + nextPrime, nextPrime); in BitSieve()
88 nextPrime = 2*nextIndex + 1; in BitSieve()
89 } while((nextIndex > 0) && (nextPrime < length)); in BitSieve()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.base/share/classes/java/math/
H A DBitSieve.java82 int nextPrime = 3; in BitSieve() local
86 sieveSingle(length, nextIndex + nextPrime, nextPrime); in BitSieve()
88 nextPrime = 2*nextIndex + 1; in BitSieve()
89 } while((nextIndex > 0) && (nextPrime < length)); in BitSieve()
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.base/share/classes/java/math/
H A DBitSieve.java82 int nextPrime = 3; in BitSieve() local
86 sieveSingle(length, nextIndex + nextPrime, nextPrime); in BitSieve()
88 nextPrime = 2*nextIndex + 1; in BitSieve()
89 } while((nextIndex > 0) && (nextPrime < length)); in BitSieve()
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/math/
H A DBitSieve.java82 int nextPrime = 3; in BitSieve() local
86 sieveSingle(length, nextIndex + nextPrime, nextPrime); in BitSieve()
88 nextPrime = 2*nextIndex + 1; in BitSieve()
89 } while((nextIndex > 0) && (nextPrime < length)); in BitSieve()
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/ghc-exactprint-0.6.4/tests/examples/ghc710/
H A DTH.hs49 nextPrime :: (Integral a) => a -> a
50 nextPrime n | isPrime n = n | otherwise = nextPrime (n+1) function
57 where curr = nextPrime n
/dports/math/clingo/clingo-5.5.1/libgringo/src/
H A Dprimes.cc156 T nextPrime(T n) { in nextPrime() function
181 uint32_t nextPrime(uint32_t n) { in nextPrime() function
183 return nextPrime<uint32_t>(n); in nextPrime()
187 uint64_t nextPrime(uint64_t n) { in nextPrime() function
189 return nextPrime<uint64_t>(n); in nextPrime()
192 uint64_t nextPrime(uint64_t) { throw std::runtime_error("support for 64bit primes not enabled"); } in nextPrime() function
/dports/java/trove4j/3.1a1/src/gnu/trove/impl/hash/
H A DTHash.java175 rehash( PrimeFinder.nextPrime( Math.max( size() + 1, in ensureCapacity()
201 rehash( PrimeFinder.nextPrime( Math.max( _size + 1, in compact()
295 capacity = PrimeFinder.nextPrime( initialCapacity ); in setUp()
387 … int newCapacity = _size > _maxSize ? PrimeFinder.nextPrime( capacity() << 1 ) : capacity(); in postInsertHook()
/dports/math/clingo/clingo-5.5.1/libgringo/gringo/
H A Dprimes.hh42 uint32_t nextPrime(uint32_t n);
43 uint64_t nextPrime(uint64_t n);
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/trilinos/packages/teuchos/core/src/
H A DTeuchos_HashSet.hpp96 inline int nextPrime(int newCap) const ;
117 : data_(), count_(0), capacity_(HashUtils::nextPrime(capacity)) in HashSet()
161 capacity_ = HashUtils::nextPrime(capacity_+1); in put()
/dports/biology/gatk/gatk-4.2.0.0/src/main/java/org/broadinstitute/hellbender/utils/mcmc/
H A DMinibatchSliceSampler.java205 final int nextPrime = Primes.nextPrime(numDataPoints); in lazyShuffleIterator() local
219 index = (index + increment) % nextPrime; in lazyShuffleIterator()
/dports/math/primecount/primecount-7.2/lib/primesieve/include/primesieve/
H A DErat.hpp112 static uint64_t nextPrime(uint64_t, uint64_t);
133 inline uint64_t Erat::nextPrime(uint64_t bits, uint64_t low) in nextPrime() function in primesieve::Erat
/dports/math/primesieve/primesieve-7.7/include/primesieve/
H A DErat.hpp112 static uint64_t nextPrime(uint64_t, uint64_t);
133 inline uint64_t Erat::nextPrime(uint64_t bits, uint64_t low) in nextPrime() function in primesieve::Erat

12345