Problems? Is your data what you think it is? | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
Omniscient Monks,
i meditate about minimizing keys and values in an hash tree. data looks like this basically i got an object containing two lists (e.g. key list and attribute list). now i need an algorithm which is able to reduce needed memory without loosing relations the result should look like this: the problem is that the keys are really short (e.g. A1, A2,...) but the values (1,2,3,..) are really big data strings.. what would be your approach to do it efficient? i know that the simple way is to call the values by reference.. but thats not what i want! kindly perlig
$perlig =~ s/pec/cep/g if 'errors expected';
In reply to Minimize Hash Key Value Combinations by AlexTape
|
|