following up a message from David Chord to All:
[Prior message arealdy scanned and sent :-(]
 DC> I'm starting to work on a program that'll potentially handle some
 DC> fairly large linked lists.
[..]
Here's the basic structure I've come up with so far:
          Prior    : Pointer to prior record
          AreaName : String[30]
          AreaAcs  : String[30]
          AreaDesc : String[30]
          AreaDiv  : String[100] (*The division the area is in, if any*)
         Case Msg   AreaPath   : String[80]
                    AreaStyle  : String[100]
                    AreaOrigin : String[100]
                    AreaTag    : String[100]
         Case File  AreaDLPath : String[80]
                    AreaULPath : String[80]
          Override : Array [1..10] of String[80]
          Comments : Array [1..120] of string [100]
          Next     : Pointer to next record
Which is approx 13.5k/record.
I'll want to be able to handle at least 1,000 of these records (maybe not so 
many, some applications may only use 5 or 6, but others could convievably use 
over 3,000 of msg! Average would be (IME) about 400 MSG, 200 File)
Obviously, loading only what I can into memory while having the rest on disk 
is what I'm going to need to do. 
I'm doing a bit of study into what I can on lists, bu will definetly need 
some help on this.
Anyone? Please?
Dave
Save your BBS! Join INTBBS_WK now! 
--- timEd 1.10
---------------