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

Re^2: Minimize Hash Key Value Combinations

by AlexTape (Monk)
on Nov 18, 2013 at 14:36 UTC ( #1063102=note: print w/replies, xml ) Need Help??


in reply to Re: Minimize Hash Key Value Combinations
in thread Minimize Hash Key Value Combinations

well, thank you for your answer!
i fully agree with what you writing.. but the problem is not the internal storage ir the call by value|name|referenace issue.. itīs about detecting the relations and reduce the branches..
[A] => [1, 2] [A] => [1]
is the same like
[A] => [1, 2]
i have to mention that A is already related with 1 for that the second A => 1 relation is redundant but it has to be nonredundant :)

$perlig =~ s/pec/cep/g if 'errors expected';

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (3)
As of 2022-09-28 23:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I prefer my indexes to start at:




    Results (125 votes). Check out past polls.

    Notices?