Man, Red-black trees are awesomely cool. But damn, they sure do make you work for it. So yeah, I’m currently ripping out the old POS code lookup stuff for a red black tree implementation to get better lookup times, insertion times, etc. Now if you’re thinking “but that’ll fragment the memory!” you’re one the same page as me, to solve that I’m backing all it’s node allocation with a memory pool to reduce fragmentation (and if done correctly, to zero).

There’s a bunch of other things that are being worked on(thought about)/completed, including:

So yeah, that’s the skinny. the RB code lookup is getting most of my attention right now, improving code segment handling is coming in at second place.

Peace. Out.