Edit Thanks bi. That looks very much like an implementation of a Trie. As such, it would be very efficient, (in searching speed) but I fear the amount of memory used up would be *fearsome* and creating it in the first place may also be very slow.
Edit Thanks bi. That looks very much like an implementation of a Trie. As such, it would be very efficient, (in searching speed) but I fear the amount of memory used up would be *fearsome* and creating it in the first place may also be very slow.
New HTML Parser: The long-awaited libxml2 based HTML parser code is live. It needs further work but already handles most markup better than the original parser.
Keep up with the latest Advogato features by reading the Advogato status blog.
If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!