Add These To The Punch List
One big tweak I’ve really been wanting to do with Sigma is to handle XML validation errors in-code, rather than allowing libxml to do the dirty work. I want to use my nice-looking log() function.
Another big question mark for me: can one implement binary search trees based upon the memory addresses of its consituents? It’s a 32 bit number…would this be efficient?
Red and Black trees anyone? Help!
When I get Subversion up and running, it’s possible that someone – cough, hack, Meta, excuse me, cough, Magus – could submit a patch that would convert my List class to a binary search tree.
My year in the House of Gamel didn’t do anything to improve my opinion of coding binary trees. I know O(log(n)) is sweet, but I’ll be danged if I really know how to use them correctly. O(n) just sucks. Since I started the project, I’ve been self-conscious about my linked list structure.
Luckily for my future patcher, the List class (and its red-haired stepchild ManagedList [literally… it inherited List], who I killed mercilessly in my memory audit) has been dramatically simplified and cleaned since Sigma 0.0.0.0.0.1 was in production.
Although barely functional and completely not fun, Sigma 0.0.1 is at least memory-responsible. Not that I’m saying what I’ve got now is 0.0.1. Let’s call it RC 1 Pre-Release Alpha.