Tako Schotanus
Tako Schotanus
Well, isn't that what the online code editor is for?
@jvasileff didn't you do something to fix this? Or was that a similar issue? Or was I just imagining things?
@matejonnet is this an issue that needs attention? Should it be implemented? Should it be reworded as a different issue? Etc etc. Assigning to 1.2 for now.
IMO not having `LinkedList` implement `List` would go completely against the principle of least surprise. What's wrong with the `RandomAccessList` idea you mentioned before?
> since array-like performance is almost always assumed by programers when working with Lists Well, this is where I disagree, I've _never_ seen people assume array-like performance characteristics for a...
> @quintesse that is wrong No it isn't. _I_ have never seen it ;)
You haven't changed mine, I can tell you that. Going against many years of "tradition", if you like, is definitely a no-no in my book and a good way to...
> The ability to quickly lookup by index is far and away the most important performance characteristic for lists, I just don't agree with that, that's what arrays are for,...
> since List would lose all of it's default implementations that don't work well for linked lists. Unless the default implementations implement this behaviour of choosing between different implementations already,...
> perhaps copy and past from Iterable Shouldn't it be possible to just call `super` when `RandomAccess` is not implemented?