EBERARD@USC-ECLB.ARPA (Edward V. Berard) (11/13/85)
A simple "table" can be thought of as a two-dimensional "array" in which
each of the columns contains objects objects which are all of the same
type, yet the type of the objects in one column may differ from the type
of the objects contained in another column in the same table. One simple
way to implement a table might be to have a list of records, where the
fields in the records corresponded to the columns of the table.
I want to create a generic table package. Users of this generic will be
able to create two-dimensional tables, and to manipulate items in the
tables they create. I envision that the users of the table will be able
to supply two discrete scalar types which will represent the indicies of
the table. Further, the users will be able to create (instantiate?) any
number of columns they wish for the table by supplying a type for the
objects to be contained in a given column.
We currently have two or three unsatisfactory solutions to the above
problem, but we wonder if there is a simple and straightforward solution
to the problem of implementing this in Ada. You can send suggestions to
me or post them on the mailing list. I will post any working solutions
which are sent to me. Thank you.
-- Ed Berard
(301) 251 - 1626
-------