WOW! That is hardcore! :D This should prove to be very useful.

I had no idea Feyr was still around. And what a great way to come back to the scene. :)

Hats off to Feyr.


Aww, I'm blushing. ;) Seriously, thanks for the support, and for getting my account restored. I wrote that thing over the past 18 hours or so, so it hasn't seen a whole lot of use, but I tested all of the boundary conditions I could think of. Bug reports and suggestions for further development are welcome.

Also, some of you might enjoy my HookRetrace Priority Queue, which I've just prettied up for public consumption. It sets up a priority queue for HookRetraces (duh) that you can add and remove functions from. The example will hopefully be a little more clear than my explanation here.

I had no idea Feyr was still around.
I've been popping in at odd moments to see how V3 was coming along, but I've only recently (ie, within the last two days) started using it. I'm starting to work on a little game for my girlfriend, and I'm going to need a lot of support code...figured somebody else might like to see it too.

if you are up for sugestions could you make varible sized nodes :)
...you know, I wonder why I didn't think of that? o_O Shouldn't be much of a problem...I'll see what I can do when I've made a little more headway on my software engineering term project.

Excellent, glad someone has a use for it. If you're going to be doing a lot of node allocation, you may want to consider turning off the logging feature by setting NodePreventTrace = 1. That'll keep it from writing to disk every time it allocates or frees a node, which you'll want if you're trying to squeeze every bit of speed out of it. You'll lose the ability to find memory leaks, but as long as you stick to the operations that aren't marked 'Internal' and remember to call ListFree() on any lists you create then you should be fine.