I've been simplifying the real-time
LaBrea data processing program. 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 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.
You have my permission to link freely to any entry here. Go
ahead, I won't bite. I promise.
The dates are the permanent links to that day's entries (or
entry, if there is only one entry). The titles are the permanent
links to that entry only. The format for the links are
simple: Start with the base link for this site: https://boston.conman.org/, then add the date you are
interested in, say 2000/08/01,
so that would make the final URL:
https://boston.conman.org/2000/08/01
You can also specify the entire month by leaving off the day
portion. You can even select an arbitrary portion of time.
You may also note subtle shading of the links and that's
intentional: the “closer” the link is (relative to the
page) the “brighter” it appears. It's an experiment in
using color shading to denote the distance a link is from here. If
you don't notice it, don't worry; it's not all that
important.
It is assumed that every brand name, slogan, corporate name,
symbol, design element, et cetera mentioned in these pages is a
protected and/or trademarked entity, the sole property of its
owner(s), and acknowledgement of this status is implied.
