New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
The storage strategy for arrays is weird in Rakudo #2677
Comments
From @masak<masak> r: my $t = now; my @a; @a[ $_ ] = $_ for 1 .. 1e4; print now - $t Submitting bug reports about suboptimality is risky business. So |
From @pmichaudThe speed of Array vs. Hash element access is partially addressed by For the benchmark given in RT #111848, this resulted in a ~25% I'm still looking into the "two layers of nextiter" part; I agree Given that the ticket refers to "suboptimality", it's hard to know Pm |
The RT System itself - Status changed from 'new' to 'open' |
From @nwc10On Mon Mar 19 11:34:12 2012, pmichaud wrote:
Timings remain roughly consistent today (at a3869a037bb10552): $ ./perl6 -e 'my $t = now; my @a; @a[ $_ ] = $_ for 1 .. 1e4; say now - $t' with hashes still faster. Nicholas Clark |
From @cokeOn Sun Feb 10 02:05:54 2013, nicholas wrote:
Ran this today with rakudo-m: $ ./perl6 -e 'my $t = now; my @a; @a[ $_ ] = $_ for 1 .. 1e4; say now - $t' Not only are they both much faster, arrays are now faster than hashes. Closing ticket. -- |
@coke - Status changed from 'open' to 'resolved' |
Migrated from rt.perl.org#111848 (status was 'resolved')
Searchable as RT111848$
The text was updated successfully, but these errors were encountered: