Doh! I just realized there's a bug inherent in this set of classes. If you take an element of a list and add it to a different list (or the same list) you will break the original list. The pointers will no longer be correct.
I'm going to have to add some checks to deal with this. Otherwise it could easily lead to engine crashes.
"They laughed when I said I was going to be a comedian ... They're not laughing now." - Bob Monkhouse
Alright guys, I've fixed the class to deal with the case where an element is added when that element is already a member of a list (either the list it is being added to or another one, doesn't matter). The element is simply removed from its old container before being added to the new one.
While I was at it, I added a GetNextNode() and GetPreviousNode() to the node class. That should (once again) complete these classes for the moment.
I went ahead and updated the engine docs.
"They laughed when I said I was going to be a comedian ... They're not laughing now." - Bob Monkhouse
Posting Permissions
Reply With Quote