But a hash is just an array of key/value pairs. Can't you just try:
$T{$id} = [\%hash];
What happens?
--
Cheers
Ron Savage, ron@xxxxxxxxxxxxx on 14/10/2005
http://savage.net.au/index.html Let the record show: Microsoft is not an Australian company
RE: hash ... > I have an array of hash pointers.... Each hash has like 2 key/value pairs....loop I posted. ... (perl.beginners)
Duck Typed Concepts for Ruby (was Re: A use case for an ordered hash) ... An Sequencable mixin can be defined that implements all sorts of operations such as append, concat, splice, sort, etc. ... extending an instance of Array with Sorted if the array is known to be sorted. ... Now returning to the thread at hand we can see that the difference between the associative array and hash hierarchies is that the hash hierarchy depends upon Hashable keys. ... (comp.lang.ruby)
Re: Suggestions for double-hashing scheme ... >> The items that are being moved are the items in the hash table itself, ... >> which are of fixed size (they are in an array,... > typedef struct { ... One "uchar" aka 'unsigned char' is plenty to hold a probe... (comp.programming)
[SUMMARY] Index and Query (#54) ... This was a fun quiz for me because I really don't know anything about indexing... We see in initializethat the index is just a Hash.... an Array of symbolic document names where the word can be found ). ... (comp.lang.ruby)
Re: Comment on how to uniquely track your objects in C# / hash table / get hash code ...Array, correct? ... This is largely irrelevant to the issue of performance, since hash... where both insertions and lookups happen frequently, ... about fast lookups for balanced red/black binary trees.... (microsoft.public.dotnet.languages.csharp)
