About :: TODO :: Blog :: RSS :: Old blog :: Projects :: GIT :: Gallery :: Notes

Wed, 29 Nov 2006

Multidimensional trie implementation.


Although long-running test was completed without errors (actually it is not interesting test at all, since 10 rules is a too small set), after some thoughts I've found a bug in the algorithm - I tried to avoid recursive searching in case of wildcard nodes found traversing trie, but it seems that it is unavoidable.
I also added trivial memory leak detector, which found another bug in algorithm - there is possibility to not free next-dimensional roots in some cases.
So I started to change algorithm itself, and although its theoretical ground is fully completed, practical implementation has a place where bug lives - I know exactly what is the bug and where is that buggy place in the code, what are the reasons, actually I know everything to fix it, but do not know how to make a good fix. Yet.

/devel/networking :: Link / Comments ()