Table for complexity of common operations across backends

[AlexDaniel]

See this: https://irclog.perlgeek.de/perl6/2017-11-16#i_15456401
And this: https://irclog.perlgeek.de/perl6/2017-12-31#i_15637372

This makes me want to have a table like this:

⚠ Feel free to edit this table!

Operation	MoarVM	JVM	JavaScript
%hash.elems	O(1)	O(1)	O(n)
@arr.elems, $list.elems	O(1)	O(1)	O(1)
$seq.elems	O(?)	O(?)	O(?)
@arr.push	O(?)	O(?)	O(?)
@arr.pop	O(?)	O(?)	O(?)
@arr.shift	O(?)	O(?)	O(?)
@arr.unshift	O(?)	O(?)	O(?)
@arr[$n]	O(?)	O(?)	O(?)
$seq[$n]	O(?)	O(?)	O(?)
$hash{$x}	O(?)	O(?)	O(?)
@arr[$x]:delete	O(?)	O(?)	O(?)
%hash[$x]:delete	O(?)	O(?)	O(?)
%hash.push($p)	O(?)	O(?)	O(?)
…	…	…	…

Footnotes (use these for caveats and other notes):
ᵃ – …
ᵇ – …
ᶜ – …

[AlexDaniel]

If someone feels boring, here are all mentions of O(n) in clog.

[tisonkun]

👍 on this. Anyway we have to decide where this table should be. Below language/operators or a new page like language/efficiency. The table itself can be filled by contributors later.

[AlexDaniel]

It can also be on the FAQ page. Add a question like “What's the complexity of …?” and put a table there.

[tisonkun]

It can also be on the FAQ page.

That will be better :-)

[AlexDaniel]

I've added a bunch of rows into the table.

[JJ]

This would be quite complicated to maintain. And it's about implementation.

[JJ]

I come back to this to ask for closing this issue. It does not belong to documentation (but to implementation) and it would be impossible ot maintain (checking the complexity of the operation whenever there's a change). So I'm asking for closing it, will do so in a couple of days if no one says anything for.