Hello Roy!

Oct 14 20:01 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..

 RJT> I can't quite remember the guy's name,  at this point,  but there 
 RJT> was a guy in C_ECHO way back when (Dave something...?) who did a 
 RJT> bunch of work on that stuff in the first place.  

The Bonk-man?

 RJT> I *think* that this 
 RJT> code was an outgrowth of the Mix Database Toolchest code,  which 
 RJT> does pretty similar stuff,  but uses one index file for all indexes 
 RJT> rather than the separate ones that the nodelist setup uses.  

Okay.

 RJT> While 
 RJT> this package isn't to the best of my knowledge freely available,  it 
 RJT> _is_ very inexpensive (I think I paid $20 for it, and maybe a bit 
 RJT> more -- another $10? for the source) and the book that comes with it 
 RJT> is worthwhile for the price,  explaining that stuff in more detail 
 RJT> than you probably wanted to know...

I've a book called "Data Abstraction and Problem Solveing in C++"
it describes very clear B-trees and so on..

Regards,
Bo

--- Msged/LNX 6.1.2 (Linux/2.4.22-1-586tsc (i586))