NOTE: use Perl; is on undef hiatus. You can read content, but you can't post it. More info will be forthcoming forthcomingly.
All the Perl that's Practical to Extract and Report
Stories, comments, journals, and other submissions on use Perl; are Copyright 1998-2006, their respective owners.
Another one to look at (Score:1)
Something like sub { 1 } turns into dramatically faster XS.
Re: (Score:1)
The next thing I might tackle is setters. However, since those come in a much wider variety than getters, it'll take some better matching tools than what we have now in B::Utils. Just look at the code of AutoXS::Accessor for a sample of what kind of cruft I produced.
So as a yak shaving exercise, I'd like to write two routines: One that produces a pattern/condition structure for B::Util's opgrep() from an existing op tree and one th
Re: (Score:1)
But the XS version is even faster again.
Re: (Score:1)
How can a sub call be faster than compile-time constant folding?
Re: (Score:1)
Oh, and there is a typo in my last comment. The second code snippet is missing a closing ]. Sorry about that.
Class::Accessor::Classy and/or Moose (Score:1)
I would rather see it work declaratively instead of scanning for candidates (that seems like a separate tool.)
I'm also sort of envisioning an optimizing build process (which would eliminate any latency in compiling during development -- something that always bugs me about Inline.)
Re: (Score:1)
Actually, it would be even simpler to have a module and interface:
use Class::Accessor::XS::I::Am::Sure::That::Namespace::Is::Taken
Re: (Score:1)