RE: [DUG]: How to approach this?

2001-07-15 Thread Stephen Barker
Donovan, If the range of ID's are not too sparse then an array would be a very direct way of looking them up. Another way would be a linked list of records or a 2 dimensional arrayholding ID and Code, and pre-sort the list by ID. then look it up with a binary search or B-Tree or similar.

RE: [DUG]: How to approach this?

2001-07-15 Thread Stephen Bertram
Hi Donovan I assume you are trying to normalise out common data. Question 1 The simplest way is as a TStringList if the Player IDs are not contiguous - thsi handles non-existant IDs and a lot of hastles. If the IDs are a contiguous list and will always exist you can use an array of