You could write it as two iterators; one that returns the index of the next "A" event each time it's called, and one that returns the index of each "B" event each time it's called:
use strict; use warnings; use List::Util 'first'; my @ary = qw/EVENT_A EVENT_A EVENT_B EVENT_A EVENT_B EVENT_B/; my($a_it, $b_it) = map{ my $w = "EVENT_$_"; mk_it(\@ary, sub{ shift eq $w }) } qw/A + B/; while( defined(my $eva = $a_it->()) ) { my $evb = $b_it->(); die "A/B event mismatch for $ary[$eva]" unless defined $evb && $ev +b>$eva; print "$ary[$eva]($eva) => $ary[$evb]($evb)\n"; } sub mk_it { my($pos, $aref, $wanted) = (0, @_); sub { my $rv = first{$wanted->($aref->[$_])} $pos..$#$aref; $pos = defined $rv ? $rv+1 : $pos+1; $rv; } }
Update: Found the time to present actual code (not pseudo-code).
Dave
In reply to Re: processing a list of events
by davido
in thread processing a list of events
by BluePerlDev
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |