push @results, $x if 
            !$until ||
            (
            $session eq "first" ?
                grep { 
                    ($_->first_session->_epoch() < $until) &&
                    ($_->first_session->_epoch() > $from)
                } $x->presentations
            :
                grep { 
                    grep {
                        ($_->_epoch() < $until) &&
                        ($_->_epoch() > $from)
                    } $_->sessions
                } $x->presentations
            );

Of course, this had to be fixed…

    $max = [$a=>$b]->[$a<=$b];
 Read more about My Perl life is complete

While I agree with what he's doing, I'm not sure I agree with his assertion that all bands are manufactured these days - the recent success of pub singer Gordon Haskell (although I really don't care for his music at all) shows that there is still some hope for the independent musician. At least for now.

Seriously, I got a lot of good work done today; I fleshed out the outline of my new book a little more, and I finished off some more work on Shishi. I spent the morning working out how to remove recursion from Shishi - then it dawned on me that since Shishi's a recursive descent parser (essentially) that removing the recursion may turn out to be difficult. This has various knock-on effects for the Perl 6 regex engine - people have to be very careful not to blow the C stack if they implement the regexes naively. I'm currently looking up clever ways to turn the depth-first search into an iterative algorithm. (Yes, I know I have to maintain a stack of child nodes, but that's as far as I've got.)