Subj : Multi-dimensional data structure
To   : comp.programming
From : adieyal
Date : Wed Oct 12 2005 04:29 am

Hi all

Can anyone point me in the right direction for a data structure that
represents a multi-dimensional hash. i.e. I want to be able to store
data under multiple keys but I don't want the order of the keys to be
significant. Essentially I want some sort of hypercube that I can slice
up by providing the appropriate keys.

For instance

DataStructure ds = new DataStructure();
Object o1 = new Object();
Object o2;
ds.put(new String[]{"Key1", "Key2", "Key3"}, o1);
o2 = ds.get(new String[]{"Key2", "Key3", "Key1"});
assert(o1 == o2);

I apologise if this question has been answered before but I haven't
found any satisfactory answers so far.

Adi

.