"Bother," said Pooh to Tim Hutzler about Need More Memory.
TH>MH>Welp, unfortunately I bought Borland and don't have the money to
TH>MH>change  compilers.....:(
TH>Borland compiles 32-bit, unless you have v3, or lower. And, don;t cut
TH>Borland too much, they have a good price/point ratio, even if they
TH>don't have every feature that other (gates) guy has.
I love Borland.  Wouldn't trade it for anything else.  My problem though 
is I'm writing this program.  Well, like all programs I started it for 
myself and now two friends of mine want an OS/2 execuatable.  As far as 
I'm aware not even version 5.01 will do this....:(
TH>Anyway, you don't *have* to read in the entire file, and (in fact)
TH>you really don't want to. Just create indexes of offsets into the
TH>file and seek to it. You can have a one-to-one corespondence to
TH>entries, or one index can handle several entries. Either way the
TH>overhead is far less than loading the entire file.
Well, I'm not making a nodelist compiler (might be a fun idea), but I 
found a way around it....:)  With minimal recoding...:)
þ CMPQwk 1.42 1960 þ Mirage Net Lie #4:  You get all the messages ever sent 

--- MirageNet HQ!
---------------