 | (Hopefully this posted will be under the main
thread...groups.google.co.uk can't retrieve the parent posting...most
likely it won't be. Oh well.)
A ring buffer (i.e., something with scrolling head/tail pointers)
would eliminate the overhead of your linked list. When it wraps, it's
up to you to either overwrite it or only keep the first data you
collected. Note also that if you're desperate you could employ some
sort of simple compression scheme (e.g., using packed 7 bit or smaller
characters) if your buffer space is tight.
HTH,
-t
|
|
