|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object mondrian.util.PrimeFinder
final class PrimeFinder
Not of interest for users; only for implementors of hashtables. Used to keep hash table capacities prime numbers.
Choosing prime numbers as hash table capacities is a good idea to keep them working fast, particularly under hash table expansions.
However, JDK 1.2, JGL 3.1 and many other toolkits do nothing to keep capacities prime. This class provides efficient means to choose prime capacities.
Choosing a prime is O(log 300) (binary search in a list of 300 int's). Memory requirements: 1 KB static memory.
Field Summary | |
---|---|
static int |
largestPrime
The largest prime this class can generate; currently equal to Integer.MAX_VALUE. |
Method Summary | |
---|---|
protected static void |
main(String[] args)
Tests correctness. |
static int |
nextPrime(int desiredCapacity)
Returns a prime number which is >= desiredCapacity and
very close to desiredCapacity (within 11% if
desiredCapacity >= 1000 ). |
protected static void |
statistics(int from,
int to,
PrintWriter pw)
Tests correctness. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
public static final int largestPrime
Method Detail |
---|
public static int nextPrime(int desiredCapacity)
>= desiredCapacity
and
very close to desiredCapacity
(within 11% if
desiredCapacity >= 1000
).
desiredCapacity
- the capacity desired by the user.
protected static void main(String[] args)
protected static void statistics(int from, int to, PrintWriter pw)
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |