Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?

Re: Data Structure Question

by kyle (Abbot)
on Nov 25, 2009 at 21:52 UTC ( #809442=note: print w/replies, xml ) Need Help??

in reply to Data Structure Question

One way to handle this would be to put your data into a database and query it out. That can be useful especially if you have many many records or you have a data set that grows over time, and you don't want to build it repeatedly.

I'd probably represent your data with an array of hashes.

my @records = ( { employee => 10001, form => 10, date => 20090101, }, { employee => 10002, form => 10, date => 20080515, }, { employee => 10003, form => 10, date => 20080323, }, );

What's nice about this is that each hash can expand to have more fields as necessary. When you want to summarize by any given field, you can do this:

sub summarize_by { my $field_name = shift @_; my %out; for my $r ( @records ) { push @{ $out{$r->{$field_name}} }, $r; } return \%out; }

What you'd get from that is a hash of arrays of hashes. Each key of the top level hash is a unique value of the field you specified, and that hash's values are references to an array of records that had that key-value combination.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://809442]
[Corion]: Oooh - I had another devious idea - "Host C" - a C language where every struct is 4K in size. This makes memory and disk access incredibly fast ;)
[Corion]: (because everything is aligned to a memory page and all pages can be read+written directly from disk without buffering)

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (6)
As of 2017-04-25 08:55 GMT
Find Nodes?
    Voting Booth?
    I'm a fool:

    Results (449 votes). Check out past polls.