Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

valavanp's scratchpad

by valavanp (Curate)
on Aug 16, 2006 at 12:26 UTC ( #567666=scratchpad: print w/replies, xml ) Need Help??

Monk - 07/11/2006

use strict; use warnings; use XML::Twig; use XML::Simple; use DBI; my $dbname="sample"; my $dbh=DBI->connect("DBI:mysql:$dbname",'root',''); print "Database connected\n"; # Get an array of hashes my $recs = $dbh->selectall_arrayref('SELECT * FROM test',{ Columns => +{} }); # Convert to XML where each hash element becomes an XML element my $xml = XMLout( {records => $recs}, NoAttr => 1 ); my $a=scalar($xml); print "$a";
use strict; use warnings; my $color1="chr,red,green,yellow"; my @color1=split(',',$color1); my @colors=("red","black","blue","white","green","orange","yellow","pi +nk", "purple","violet","cyan","magenta","navy","brown","gold"," +lime", "gray","burgundy","silver","clear","teal"); my $color; foreach $color(@color1){ my $i=0; if ($color eq $colors[$i]){ print "$color here\n"; } $i++; }
Pilgrim 08/01/07

Friar 09/04/07

Hermit 18/07/07

Chaplain 25/11/07

Deacon 09/04/08

Curate 14/09/08

UTF Node_id:620803
Log In?

What's my password?
Create A New User
[Corion]: (maybe I should write this up as a SoPW) - currently, the "most efficient" data structure I come up with is a single array which I scan for the first fitting one-shot. Not efficient but I don't expect more than five outstanding one-shots anyway
[choroba]: can't you create a meta-key corresponding to the disjunction of the events?
[robby_dobby]: Corion: Heh. This whole thing smells of Strategy Pattern or MVC pattern.
[Corion]: And performance linear to the number of registered one-shots doesn't feel that bad. Maybe I should collect statistics on how many callbacks are outstanding ;)
[Corion]: choroba: Yes, but the longer I thought about efficient hashes mapping the event type back to their callbacks, and how to keep them in sync, the more I thought that all that optimization might just not be worth it, even if it's horribly inelegant
[Lady_Aleena]: My biggest problem with hashes at the moment is one with 2,501 keys.
[choroba]: how many event types are there?
[Corion]: Also I found that I can't conveniently weaken an array slot, which also is inconvenient, as I want my one-shots to disappear if the caller discards them
[Corion]: choroba: Currently two or three that my program handles (WWW::Mechanize:: Chrome), but there might be more that become interesting
[Corion]: But I don't expect more than 100 to be active at the same time, so I'm not really sure if there is a not-too-fancy data structure that is maintained with few lines of code where the performance is better than the linear scan ;)

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (7)
As of 2017-05-29 07:56 GMT
Find Nodes?
    Voting Booth?