Tim Bunce wrote:
>> What am I misinterpreting? Or am I running into something weird?
>
> All sounds odd. Are string evals or recursion involved?
Moose is, so there's all the evals for the generated methods, but that's
compile time. No recursion.
The thing that is confusing is the exclusive time for the subroutine: it's a
fairly high level routine that is primarily a driver. The high inclusive time
is not a surprise.
There is an anonymous sub in there that gets called a lot of times. It's
declared in a situation like this:
my $predicate = $arguments{predicate} // sub { $TRUE };
While the count of calls to that sub is large, the total time spent in it is
tiny, which make sense.
Previously, the big problem with this code was creating DateTime objects; I was
able to minimize the amount of those by using as much string comparison as I
could and got a 12% runtime savings. The NYTProf output prior to the change
was reasonable and was what identified the issue. It's after making the change
that this confusing stuff showed up.
> Could you give me a url to the report so I can look at it? Or send me
> a tarball, including the nytprof.out file.
Sorry, but I can't. Proprietary code, blah, paranoid financial industry, blah,
blah.
--~--~---------~--~----~------------~-------~--~----~
You've received this message because you are subscribed to
the Devel::NYTProf Development User group.
Group hosted at: http://groups.google.com/group/develnytprof-dev
Project hosted at: http://perl-devel-nytprof.googlecode.com
CPAN distribution: http://search.cpan.org/dist/Devel-NYTProf
To post, email: [email protected]
To unsubscribe, email: [email protected]
-~----------~----~----~----~------~----~------~--~---
