* * * * *

                                Squishing bugs

I've been simplifying the real-time LaBrea data processing program [1]. One
simplification: don't try to grow the arrays. If I'm trying to grow the
arrays and I'm going to stop at some point anyway, why not just allocate as
much as I'll ever use when the program starts? It gives you a definite upper
bound (and one that can be set from the command line) and boy, does it
simplify the code.

I also got the binary search routine [2] working correctly after a few hours.

And I had to remind myself just how C's qsort() works, and make sure I know
that (in my program at least) I'm getting pointers to pointers to structures,
and not just pointers to structures (when I fixed that, I started getting
correctly sorted arrays).

The only outstanding bug I have right now deals with adding a record after
the array has been purged of old records. The problem is that I'm using an
index from before the purge. I should be able to get this running on the
LaBrea tarpit system in the next day or two.

[1] gopher://gopher.conman.org/0Phlog:2006/01/14.2
[2] gopher://gopher.conman.org/0Phlog:2006/01/15.2

Email author at [email protected]

You are viewing proxied material from gopher.conman.org. The copyright of proxied material belongs to its original authors. Any comments or complaints in relation to proxied material should be directed to the original authors of the content concerned. Please see the disclaimer for more details.