HoH to AoA

What's the correct to walk a HoH like the following?
I built a data structure that looks like what's shown below and need a quick
way to reconstructure the data into an array of arrays.


ie $cfglist[0] = (nybmlx01,'BookManagerDaemon', '1','2','Xbook.jar');

Any assistance will be appreciated thanks.

$VAR1 = {
'nybmlx01b' => {
'BookManagerDaemon' => {
'1' => {
'2' => [

'Xbook.jar'
]
}
}
},
'nycmlx02a' => {
'CancellationManagerDaemon' => {
'0' => {
'2' =>
[

'Xbook.jar'

]
}
}
},
'nycplx01a' => {
'clientProxyDaemon' => {
'0' => {
'2' => [

'Xbook.jar'
]
}
}
},
'nyrmlx01b' => {
'RepricingManagerDaemon' => {
'1' => {
'2' => [

'Xbook.jar'
]
}
}
},


--
[ Rodrick R. Brown ]
http://www.rodrickbrown.com http://www.linkedin.com/in/rodrickbrown

Relevant Pages

  • Re: HoH to AoA
    ... I built a data structure that looks like what's shown below and need a ... way to reconstructure the data into an array of arrays. ...
    (perl.beginners)
  • Re: Latest version of glossary
    ... such as XML, refer to the use of the term within that "namespace" using ... An n-dimensional data structure, S, is one where each element of S ... Whenever mathematics is applied to anything, ... associative array (while trying to do something in JavaScript, ...
    (comp.databases.theory)
  • Re: how to read dynamic data structures from the kernel (was Re: reading routing table)
    ... could give us individual entries of the data structure on each call, ... steps for any given kernel subsystem -- we have data structures, ... bumping the references and adding pointers to the array. ... the global locks, and proceed lock, externalize, unlock, and copyout each ...
    (freebsd-net)
  • Re: Looking for advise on storring a complex array
    ... hashes etc. ... The trick is that I would not like to have to read back the entire array ... but you should look into using a database with a few ... This *really* depends on your data structure. ...
    (perl.beginners)
  • Re: any function to handle this kind of counting?
    ... Use a dynamic count data structure, that grows as new element values ... you might dimension the 2D array as ... // then increment the entry in the 2D count array that corresponds ... // then malloc a pair of arrays that are big enough to hold all of the ...
    (comp.programming)