At Fri Feb 04 18:53:09 -0500 2011, Uri Guttman wrote:
> that will kill your cpu. alternations are very slow since they have to
> go back and try from the beginning of the list each time.
Since we're talking about literals, this hasn't been true since 2007,
with the release of perl 5.10. Perl now
On Wed, 2009-04-01 at 15:34 -0400, Bob Freeman wrote:
> Any plans on making it available on the web *after* the talk? Can't
> sit and listen/watch realtime...
I believe so, yes.
- Alex
--
Networking -- only one letter away from not working
___
SIPB will be providing a live webcast of the talk, for those who can't
make it:
http://sipb.mit.edu/projects/talks/2009/larry_wall/
- Alex
--
Networking -- only one letter away from not working
___
Boston-pm mailing list
Boston-pm@mail.pm.org
On Tue, 2008-01-29 at 12:04 -0800, Ben Tilly wrote:
> [snip]
> That is logically unavoidable.
Yup, and in fact provably true. The problem is the same as finding a
topological ordering among a directed acyclic graph. Wikipedia can
inform you more on the topic
(
On Wed, 2003-06-18 at 13:08, John Sequeira wrote:
> I'm working on a web site that would like to change their color scheme.
> They have about a thousand images (buttons/widgets/etc) and I was
> wondering if there was a easy way to do this programmatically or at
> least give the manual process
On Tue, 2002-09-24 at 04:27, Simon Wilcox wrote:
> This appeared on use.perl.org yesterday and boston.pm has disappeared.
> [snippage]
I sent him email earlier today about this. No doubt he's been deluged
with emails, and is hence reasonably convinced that we exist. ;>
- Alex V.
--
6 matches
Mail list logo
