Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Specifying two compare subroutines using db_btree

by l2kashe (Deacon)
on Aug 18, 2003 at 18:51 UTC ( #284675=note: print w/ replies, xml ) Need Help??


in reply to Specifying two compare subroutines using db_btree

Off the cuff, if I am understanding you right

tie(my %cal, etc, etc, etc) or die "Cant tie cal: $!\n"; tie(my %addr, etc, etc, etc) or die "Cant tie addr: $!\n"; @sorted_cal_keys = sort { $a <=> $b } keys %cal; @sorted_adrr_keys = sort { $a cmp $b } keys %addr;

You didnt specify any particular relation between the 2 data sets, so there is no better way to correlate them at this point. You cant sort on both sets at the same time unless you're key's name maps to its data structure.. ala

tie(my %cal, etc) or die "cal: $!\n"; tie(my %addr, etc) or die "addr: $!\n"; $cal{"cal_$key"} = $cal_value; $addr{"addr_$key"} = $addr_value; # later for ( sort { $a <=> $b || $a cmp $b } keys %cal, keys %addr) ) { if (m/^cal/) { # its from the calendar } elseif ( m/^addr_/ ) { # from the address book } else { # where did this come from? } }

use perl;


Comment on Re: Specifying two compare subroutines using db_btree
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (5)
As of 2014-07-26 07:53 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (175 votes), past polls