Here for once I totally agree.
(As long you agree there is no order in a set, that is.)
I'll quote myself:
As far as element ordering in sets, a set is by mathematical definition, unordered.
Mathematically sets are collections of _unordered_ items.
That said, compilers that implement sets, such as FPC may and usually do impose an order on the set elements to allow the compiler to represent each element in the set with a single bit. To see that in action, run the code I included in a previous post. However, that order imposed by the compiler, is _not_ equivalent to ordering the elements in the set, IOW, the sets [cBlack, cOrange] and [cOrange, cBlack] are equal, the different order does not affect equality.
If the element sequence is important, e.g, [cBlack, cOrange] <> [cOrange, cBlack], then a set is not a solution. An array can be a solution for such sequences.