🚀 go-pugleaf

Joel Quevedo wrote:

> I was recently asked if I could create an Abstract Data Type that could take
> the place of a Pascal Set.  I don't quite understand the question.  Could
> anyone help me make sense of this?

     I'm guessing here, but I think what is required is something that has the
properties
of a set.  For example, you need to be able to test if X is an element of the
set
(equivalent to "x IN setofx"), add elements to the set, and to implement the set
operations of intersection, union, and difference.

     If you can create a type "mysettype" that mimics the set, you only need to
write code
for the requisite functions and procedures.

     FUNCTION isamemberof (x : elementtype; setofx : mysettype) : boolean;

     PROCEDURE union (set1, set2 : mysettype; VAR set3 : mysettype);

etc.  It won't look at "pretty" as the Pascal set implementation, but it should
work.

Bob Schor
Pascal Enthusiast