| TIP: Click on subject to list as thread! | ANSI |
| echo: | |
|---|---|
| to: | |
| from: | |
| date: | |
| subject: | human-readable nodelist format |
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) SEEN-BY: 120/544 123/500 132/500 400/300 490/33 633/104 260 262 267 270 284 SEEN-BY: 633/285 634/383 640/531 954 1674 690/682 712/610 848 713/615 771/4020 SEEN-BY: 774/605 800/1 2432/200 @PATH: 640/531 954 774/605 633/260 285 267 |
|
| SOURCE: echomail via fidonet.ozzmosis.com | |
Email questions or comments to sysop@ipingthereforeiam.com
All parts of this website painstakingly hand-crafted in the U.S.A.!
IPTIA BBS/MUD/Terminal/Game Server List, © 2025 IPTIA Consulting™.