Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^4: Hashes of Hashes of Arrays? Is it possible?

by capriguy84 (Novice)
on Sep 08, 2011 at 19:31 UTC ( #924929=note: print w/replies, xml ) Need Help??


in reply to Re^3: Hashes of Hashes of Arrays? Is it possible?
in thread Hashes of Hashes of Arrays? Is it possible?

ahh..That fixed it. Thank you very much. One quick question, how do I avoid having to save the huge dataset in memory by processing and printing the results on fly? I would like to undef the HASH at after each second in time i.e create a loop for each key and undef my %HOH. Any ideas how/where I can add the control statement for $key?
  • Comment on Re^4: Hashes of Hashes of Arrays? Is it possible?

Replies are listed 'Best First'.
Re^5: Hashes of Hashes of Arrays? Is it possible?
by Marshall (Canon) on Sep 08, 2011 at 23:17 UTC
    So as I understand it, you want to dump the current results and start a new %HOH when the $key changes.

    When setting something like this up there are 3 things to consider:
    1. What is the steady state, normal thing causes the desired action?
    2. How do we get it started? (what is special about it?)
    3. How do we get it stopped? (what is special about it?)

    One approach for is to dump the results and reset %HOH when the $key changes. To do that perhaps:

    my $prev_key = ""; my %HOH; while ( a line read from file ) { ...get the current key .. code that you have already if ( $current_key ne $prev_key) { if ($prev_key ne "" ) #don't dump first time through! { ...dump the %HOH #this is the previous result } $prev_key = $current_key; ...%HOH=(); #reset! } ...processing of the current_key } ...dump the %HOH ... #the last record...
    To solve question (2), the first time through the loop, I don't dump the %HoH unless there is data there - there is more than one possible way to test for this (keys %HOH) or ($prev_key ne "" ). If the thing that does the dump/final processing of this time slice has some code to not do anything if there is no data, there is no nested "if".

    To solve question (3), after the loop ends due to lack of data, dump the final incarnation of the hash.

    There is of course more than one way to accomplish what you need, but the 3 questions are always the same : (1)steady-state operation, (2)getting started, (3)getting finished.

    I recommend writing the "steady-state", question (1) code first and then "fiddle with it" until questions (2) and (3) work out ok.

Re^5: Hashes of Hashes of Arrays? Is it possible?
by Jim (Curate) on Sep 08, 2011 at 20:21 UTC
    One quick question, how do I avoid having to save the huge dataset in memory by processing and printing the results on fly? I would like to undef the HASH at after each second in time i.e create a loop for each key and undef my %HOH.

    For that, you want to introduce a simple control break into your program.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://924929]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (1)
As of 2021-12-09 01:50 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    R or B?



    Results (36 votes). Check out past polls.

    Notices?