Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses

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;

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://284675]
[chacham]: i sent him a private message expressing my displeasure.
[1nickt]: chacham It was worse than 2-1 ! almost 4-1 !
[jdporter]: Dang. No good example of how to use IPC::Run's run() in its simplest mode?
[LanX]: him or her! ;)
[1nickt]: jdporter Maybe try IPC::Run3

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (15)
As of 2017-05-24 20:54 GMT
Find Nodes?
    Voting Booth?