The implementation of the record ADT architecture describe in the previous
section is complex (in the context of a data structure class). It
requires the use of container data structures because the number of
data member definitions in a record type cannot be determined at
compile time. Furthermore, in terms of performance, the implementation
also requires the use of a data structure that facilitates quick
look up operations (like a tree-type data structure or a hash table).
As a result, the module does not include any description of the
implementation of records as an ADT.
Copyright © 2006-09-13 by Tak Auyeung
