Bob Sneidar bobs at
Thu Jun 23 12:19:07 EDT 2011

Then intersect t2 with t1? Boolean logic? If you want unique keys in either, make copies, intersect copies one way, make copies again from the originals, intersect the other way, put the two results together? Maybe I am being simplistic. 


On Jun 22, 2011, at 10:58 PM, Pete wrote:

> I may be wrong, but I don't think intersect solves the problem.  If I
> understand the dictionary correctly, this will remove all the t1 keys that
> do NOT match t2 keys so it does the opposite of what is needed.  Even if
> intersect does remove t1 keys that DO match t2 keys, that won't help find
> values in t2 that are not present in t1, so 5 in his original example would
> be missed.

More information about the Use-livecode mailing list