filter?

[Bob Sneidar]

I read this in the dictionary: 

"The content of individual elements of the templateArray does not affect the final result. Only which elements exist in the templateArray, not their content, controls which elements of the array are retained and which are removed. If the array and templateArray have the same set of elements but different content in each element, the intersect command does not change the value of the array."

Okay, so the actual data must be the keys themselves, a one dimensional array as it were. I suppose that has some limited use, but this is the 21st century. This could be made a lot more useful by both considering the array contents, and also by allowing inclusive or exclusive as an argument. Seems like a pretty simple thing to implement. 

Bob


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.