◄Keywords► ◄Contents► ◄Index► ◄Back► SET OF <ordinal type> Description The keyword SET defines a group that contains zero or more related elements of some ordinal type. The elements must have a range of 256 or less. The following are the only legal operations on sets: Assignment := defines a value of a set Logical combination - returns the difference between two sets * returns the intersection between two sets + returns the union of two sets Inclusion <= tests if a set is a subset of a set >= tests if a set contains a subset of a set IN tests if something is a member of a set Relational = tests for set equality <> tests for set inequality See also: Data Types Hierarchy