Where? Not in this thread.
No. In the one before the last one if memory serves. which possibly extends the tlist type, which is retarded, because the point of my requesting that feature was to make my life EASIER, and making an extra type whenever I need a list is not making my life easier?
You make it once. It's maybe 10 lines of code, all inclusive and will not break other peoples code. If BRL change the code now, it will break more than 200 peoples code. You on the other hand could override the object iterator to return a link instead of a value without breaking any exsisting code, (including most of your own). Uh, you do know that a TMap is a binary tree, and that unless you balance it when creating it
A binary tree is always balanced when you create it. The problem you describe may arise only after millions of insert / remove operations, and only on specific data sets.While I would love to dicuss the merits of datastructures with you, I feel it's somewhat a moot point. If you're interested I suggest books by Mark Allen Weiss or Robert Sedgewick. Both have written excellent and exhustive books on the matter, although I think you'll find Wiess' books more accessible. But ofcourse knowing you prefer the difficult approach, I'm sure you'll pick up Sedgewick.
But I bet it does involve creating your own type that extends the list type.
Isn't that the whole point of the object oriented paradigm? Sswift kinda won the argument this time.
Hrm. You're entitled to your opinion. To me it seems like Sswift doesn't really understand what he's talking about.