Anonymous user
Talk:VList: Difference between revisions
→Some problems: new section
m (Rescuing the page) |
(→Some problems: new section) |
||
Line 14:
:It can probably be rescued. [[User:Markhobley|Markhobley]] 15:18, 21 July 2011 (UTC)
== Some problems ==
# I'm not sure why length can only be found in O(log n) time. The data structure surely can have bookkeeping to have O(1).
# The second operation, "new array begining at second element" blah blah, is too limited. It's equally easy to take any valid array slice.
# However, if a slice is taken, some clarification is needed as to what can be done with it. Should the content be copied? Should the content be copied only when it's modified, or only when the slice is extended?
| |||