| TIP: Click on subject to list as thread! | ANSI |
| echo: | |
|---|---|
| to: | |
| from: | |
| date: | |
| subject: | Long `unzip` time |
Bo Simonsen wrote in a message to Roy J. Tellason: BS> Hello Roy! BS> Oct 14 03:54 03, Roy J. Tellason wrote to Bo Simonsen: BS>> No I forgot it, it was really bad code.. I'm using Bonk too, for v7 BS>> nodelist editing.. After I've learned about implementing of B-trees BS>> in programming I'll write a program simulear to bonk, just open BS>> sourced. RJT> Oh, okay. I'll be looking forward to hearing about some finished RJT> product out there... RJT> From any of you guys! :-) BS> Well right now I don't have the understanding which is required for BS> programming B-Trees which a V7 nodelist is using.. I can't quite remember the guy's name, at this point, but there was a guy in C_ECHO way back when (Dave something...?) who did a bunch of work on that stuff in the first place. I *think* that this code was an outgrowth of the Mix Database Toolchest code, which does pretty similar stuff, but uses one index file for all indexes rather than the separate ones that the nodelist setup uses. While this package isn't to the best of my knowledge freely available, it _is_ very inexpensive (I think I paid $20 for it, and maybe a bit more -- another $10? for the source) and the book that comes with it is worthwhile for the price, explaining that stuff in more detail than you probably wanted to know... ---* Origin: TANSTAAFL BBS 717-838-8539 (1:270/615) SEEN-BY: 633/267 270 @PATH: 270/615 150/220 379/1 106/1 2000 633/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™.