Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re^3: new keyword "size" to avoid scalar trap ? ( scalar @array != scalar(LIST) )

by tobyink (Abbot)
on Dec 07, 2012 at 22:33 UTC ( #1007833=note: print w/ replies, xml ) Need Help??


in reply to Re^2: new keyword "size" to avoid scalar trap ? ( scalar @array != scalar(LIST) )
in thread new keyword "size" to avoid scalar trap ? ( scalar @array != scalar(LIST) )

Inline::C allows a pretty fast implementation...

use 5.010; use Benchmark qw(cmpthese); use Inline C => <<'INLINE'; int count1 (SV* name1, ...) { Inline_Stack_Vars; return Inline_Stack_Items; } INLINE sub count2 { scalar @_ } sub count3 { 0 + @_ } sub count4 { my $_ = @_ } sub count5 (\@) { scalar @{$_[0]} } my @array = 'a'..'z'; my %implementations = ( count1 => sub { count1(@array) }, count2 => sub { count2(@array) }, count3 => sub { count3(@array) }, count4 => sub { count4(@array) }, count5 => sub { count5(@array) }, ); for my $i (sort keys %implementations) { say $i, ": ", $implementations{$i}->(); } cmpthese(250_000, \%implementations);

XS may well allow faster still.

perl -E'sub Monkey::do{say$_,for@_,do{($monkey=[caller(0)]->[3])=~s{::}{ }and$monkey}}"Monkey say"->Monkey::do'


Comment on Re^3: new keyword "size" to avoid scalar trap ? ( scalar @array != scalar(LIST) )
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1007833]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (18)
As of 2015-07-30 16:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (273 votes), past polls