--- Comment #2 from 2010-06-19 15:20:42 PDT ---
Answer to Comment 1: thank you for your answer, I didn't know about this rule.

In arrays the append can require a full array copy, so it can be O(n), but it's
(hopefully) O(1) on amortized time.

If this rule is present and well established then you can close this bug report
(the suggestion about the "prepend" name is for you, but you can ignore it if
you don't like it).

Another possibility is to find a compromise: instead of writing something hairy
s.insertAfter(s[], value)
You can use:
That is less noisy and equally clear in its complexity :-)

Configure issuemail:
------- You are receiving this mail because: -------

Reply via email to