|
||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||
| Class Summary | |
| ExponentialHashMap | |
| GrandDataPage | GrandDataPage behaves as a small hash table. Linear hashing and the GrandOverflow structure are used to resolve collisions. The shift argument to the various methods is the number of pages in the parent node to indicate how many low bits of the hash are ignored. |
| GrandEntry | GrandEntries probably want to not be remembered right when they are created, and remembered when they are finally put into their place in the GrandDataPages or GrandOverflows |
| GrandHashSet | |
| GrandHashSetTester | |
| GrandHashTable | |
| GrandHashTableTester | |
| GrandNode | oldOverflowRoot holds onto the overflow tree that was in place when a node doubling starts. It allows an object stored to be found at any time during the doubling. |
| GrandOverflow | This class has a comment The instance variable depth actually holds the value OTreeArity ^ depth. |
| GrandSetEntry | |
| GrandTableEntry | |
|
||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||