Question

I’m writing an array-backed hashtable in Java, where the type of key and value are Object; no other guarantee.

The easiest way for me code-wise is to create an object to hold them:

public class Pair { 
    public Object key;
    public Object value;
}

And then create an array

public Pair[] storage = new Pair[8];

But how does the jvm treat that in memory? Which is to say, will the array actually:

• be an array of pointers to Pair() objects sitting elsewhere, or
• contain the actual data?

edit

Since the objects are instantiated later as new Pair(), they’re randomly placed in the heap. Is there any good way to ensure they’re sequential in the heap? Would I need to do some trickery with sun.misc.unsafe to make that work?

Explaining my motivation, if I want to try and ensure that sequential items are in the same page of memory, is there any way to do this in Java?

Answer 1

The array will be an object on the heap containing pointers to the Pair objects which will also be on the heap (but separate from the array itself).