You could use the keys of a dictionary-like structure (hashtable, alist, plist) to represent the unordered list. An equality function could be iterate over the keys of one dictionary and checking for existence in another, but you'd need some extra check to be sure you aren't just testing set containment.
HTH, Ryan Davis Acceleration.net Director of Programming Services 2831 NW 41st street, suite B Gainesville, FL 32606 Office: 352-335-6500 x 124 Fax: 352-335-6506 Francesco Petrogalli wrote: > Hello, > > any idea on how to implement an un'ordered list? > > Something which can held to the equality between the "unordered list" > (1 2) and (2 1)? > > Maybe something like a new predicate of equality that check > componentwise the first pair with the second pair and its reversed? > > Thanks, > > Francesco > > _______________________________________________ Gardeners mailing list [email protected] http://www.lispniks.com/mailman/listinfo/gardeners
