Simple LIST Implementation
Original Publication Date: 1987-Jul-01
Included in the Prior Art Database: 2005-Feb-01
In order to handle a LIST of elements, the LIST operations must be able to manipulate elements to a limited degree. Specifically, some LIST operations must be able to COPY an element to place it into the list or to retrieve it from the list or must be able to COMPARE elements to see if they are in the list. If an element is itself a structure which is chained together with pointers, then merely copying or comparing the anchor block will not be good enough. A fully generic list implementation would be able (at the price of extra complexity for the user) to overcome these restrictions. This simple implementation treats the elements as CHAR(*) fields. The user must be aware of when this is not appropriate.