http://www.unixreview.com/documents/s=1780/urm0111h/0111h.htm
Dan
--"it's like this"---
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and ev
Granted, I need to have the fink install installed to provide dynaloading,
but with it I get a reasonably clean build, link, and test. Woohoo!
I'll check in the darwin hints file in a bit.
Dan
--"it's like this"---
On Sat, 24 Nov 2001, Bryan C.Warnock wrote:
> On a side note, do we want to be positive-oriented or
> negative-oriented? (Do we want to succeed as fast as possible, or fail
> as fast as possible? I'm thinking fail, since you're probably more
> likely to do that.) If you weight each kind of rege
At 07:34 PM 11/25/2001 -0800, Brent Dax wrote:
>Dan Sugalski:
># I realize that benchmarking the RE engine's a pain, what with
># no GC so we
># leak until we blow memory and die, but...
>#
># I'd like to take a series of regexes that exercise various bits of the
># perl 5 engine and time them aga
Hi,
Currently pmc2c.pl requires that the user writes methods in .pmc files in
exaclty the same order than in vtable.tbl. That's not a nice thing to do.
The version I am attaching hopefully fixes this, and creates a dummy version
of the method if the user has not provided one.
This allows us to
At 02:54 PM 11/22/2001 -0800, Wizard wrote:
>I was wandering around looking for some non-parrot related stuff, and came
>across this wonderful tidbit. Was this mentioned somewhere in the mail list
>or on perl.com and I missed it?
>http://www.unixreview.com/documents/s=1780/urm0111h/0111h.htm
>
>If
At 01:46 PM 11/23/2001 -0500, brian wheeler wrote:
>On Fri, 2001-11-23 at 13:41, Simon Cozens wrote:
> > On Fri, Nov 23, 2001 at 06:04:29PM +, Simon Cozens wrote:
> > > * Rewrite mops.pasm to use integer PMCs, and compare the speeds.
> >
> > I couldn't wait. :)
> >
> > % ../../test_prog m
Dan Sugalski;
# What I really want to know is whether using ops to do regexes
# is feasable.
# After that we'll work on programmatically generating the op stream.
There are definitely some weaknesses to it (for example, it's hard to do
operations on 'optimized' forms of things, like using bitmaps
At 11:10 AM 11/26/2001 -0800, Brent Dax wrote:
>Dan Sugalski;
># What I really want to know is whether using ops to do regexes
># is feasable.
># After that we'll work on programmatically generating the op stream.
>
>There are definitely some weaknesses to it (for example, it's hard to do
>operati
I've done a bunch of reading, and though I'm not finished, I'm starting to
look towards the following overall algorithm based on the below specified
assumptions. I'm not _necessarily_ looking for comments at this point,
because I haven't finished evaluating the specifics of several algorithms,
bu
On Sun, Nov 25, 2001 at 04:39:40PM +0100, Bart Lateur wrote:
> I think that this may come close:
I think it does. Thanks very much, applied.
--
"You can have my Unix system when you pry it from my cold, dead fingers."
On Sun, 25 Nov 2001 19:34:15 -0800, Brent Dax wrote:
>Perl 5's REs will always appear faster because Perl 5 has an
>intelligent, optimizing regex compiler. For example, take the following
>simple regex:
>
> /a+bc+/
>
>pregcomp will optimize that by searching for a 'b' and working outwards
12 matches
Mail list logo
