lists and queues and deques, oh my!
 

It looks like really good code, but why does the project have what are essentially stripped down versions of ANSI C++ STL data structures? I don't see how any good can come of using them over the STL versions, only errors. I haven't looked at the inbred implementation enough to determine whether there is in fact something that they do that the STL doesn't, but even so... why not just derive and augment? No offense meant to whoever wrote the code - it looks good - just that it is reinventing the wheel.

Very few members of the devteam are fluent completely in C++, and especially the STL. I agree, STL objects have been tested and honed over time, we spend ALOT of time performance wise in the code just going through the iterators and yanking data out, using the STL containers would be alot better, and easier to support in the long run as they're fixtures of the language...