Subj : Re: Multi-dimensional data structure To : comp.programming From : Willem Date : Wed Oct 12 2005 11:54 am adieyal@gmail.com wrote: ) 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. Assuming you have a datatype like this where the order of the keys *is* significant, you can simply use this by adding a new layer of 'put' and 'get' functions that sort the keys and then call the original put and get. SaSW, Willem -- Disclaimer: I am in no way responsible for any of the statements made in the above text. For all I know I might be drugged or something.. No I'm not paranoid. You all think I'm paranoid, don't you ! #EOT .