> From: Dan Sugalski [mailto:[EMAIL PROTECTED]] > I'm hoping to have this stage of optimization in perl. Off by > default with > a normal parse-and-go run (though certainly enableable if you > want), on by > default with the bytecode compiler. Don't forget about run-time information: You could mark candidates for optimisation at compile time then, at run time, if the size of the array is "big" then spend the time to see if you can optimise. I'm not sure how to define "big", but I'm sure that's solvable. Dave.
- Re: What can we optimize (was... John Porter
- Re: What can we optimize (was... Dan Sugalski
- Re: What can we optimize (was... Russ Allbery
- Re: What can we optimize (was... Dan Sugalski
- Re: What can we optimize (was... Hong Zhang
- Re: What can we optimize (was... James Mastros
- Re: What can we optimize (was... Russ Allbery
- Re: What can we optimize (was... Dan Sugalski
- Re: What can we optimize (was... Uri Guttman
- Re: What can we optimize (was... Dan Sugalski
- RE: What can we optimize (was... David Whipp
- RE: What can we optimize (was... Dan Sugalski
- Re: What can we optimize (was... David L. Nicol
- pitching names for the attrib... David L. Nicol
- Re: pitching names for the at... Dan Sugalski
- Re: pitching names for the at... John Porter
- Re: What can we optimize (was... Juanma Barranquero
- Re: What can we optimize (was Re: Schw... Piers Cawley
- Re: What can we optimize (was Re:... Dan Sugalski
- Re: Schwartzian transforms James Mastros
- Re: Schwartzian transforms John Porter