Re: Array/Group Help [message #62988] |
Tue, 21 October 2008 16:19 |
plim.dreaming
Messages: 22 Registered: February 2008
|
Junior Member |
|
|
D,
That looks like just what I need!
You're never leaving this group, and we're all the better for that.
Thanks so much!!
B
On Oct 21, 6:49 pm, David Fanning <n...@dfanning.com> wrote:
> plim.dream...@gmail.com writes:
>> There must be a real simple way of doing the following but my
>> knowledge of IDL is real limited.
>
>> I have three 1-D arrays. Each array contains numbers from 1 to 1000.
>> But they differ because the arrays contain different arrangements of
>> numbers and different number of number.
>
>> I would like to get a list of numbers that exist in all three arrays.
>> In terms of groups I have three groups and I want to know what the
>> intersect is.
>
> Assuming the "numbers" are integers, you can use the set
> methods outlined here:
>
> http://www.dfanning.com/tips/set_operations.html
>
> Cheers,
>
> David
> --
> David Fanning, Ph.D.
> Coyote's Guide to IDL Programming (www.dfanning.com)
> Sepore ma de ni thui. ("Perhaps thou speakest truth.")
|
|
|
Re: Array/Group Help [message #62990 is a reply to message #62988] |
Tue, 21 October 2008 15:49  |
David Fanning
Messages: 11724 Registered: August 2001
|
Senior Member |
|
|
plim.dreaming@gmail.com writes:
> There must be a real simple way of doing the following but my
> knowledge of IDL is real limited.
>
> I have three 1-D arrays. Each array contains numbers from 1 to 1000.
> But they differ because the arrays contain different arrangements of
> numbers and different number of number.
>
> I would like to get a list of numbers that exist in all three arrays.
> In terms of groups I have three groups and I want to know what the
> intersect is.
Assuming the "numbers" are integers, you can use the set
methods outlined here:
http://www.dfanning.com/tips/set_operations.html
Cheers,
David
--
David Fanning, Ph.D.
Coyote's Guide to IDL Programming (www.dfanning.com)
Sepore ma de ni thui. ("Perhaps thou speakest truth.")
|
|
|