Subj : human-readable nodelist format
To : andrew clarke
From : Jasen Betts
Date : Sat Nov 09 2002 06:59 am
Hi andrew.
05-Nov-02 20:46:16, andrew clarke wrote to Scott Little
ac> Tue 2002-11-05 17:54, Scott Little (3:712/848) wrote to andrew
ac> clarke:
ac>>> The hierachy is only important when it comes down to default
ac>>> mail routing, and politics. Parsing software should be able to
ac>>> handle
>> Thing is, this format requires at least two scans of the nodelist
>> to find a node and it's uplink. The only shortcut is to assume an
>> uplink of /0 for normal nodes.
ac> Or one pass, then an in-memory search. I don't think this is a
ac> big problem.
it is... code that does that may break as the nodelist grows... (wishful
thinking I guess, but potentially borken code has caused problems in the
past.) if you use database technology like a disk-based index (eg a B+ tree)
then those probelms aren't.
-=> Bye <=-
---
* Origin: Only adults have difficulty with childproof caps. (3:640/531.42)
