comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Re: Efficient comparison of arrays / Set operations
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: Efficient comparison of arrays / Set operations [message #9916 is a reply to message #9863] Wed, 10 September 1997 00:00 Go to previous messageGo to previous message
davidf is currently offline  davidf
Messages: 2866
Registered: September 1996
Senior Member
Saeid Zoonematkermani writes:

>> Research Systems Inc. writes:
>>
>>> Below appear three IDL functions that operate on sets represented by
>>> arrays of positive integers. The SetIntersection(a,b) function
>>> returns the common elements, SetUnion(a,b) returns all unique elements
>>> in both arguments, and SetDifference(a,b) returns the elements
>>> (members) in a but not in b.
>>
>
> Ooops! I was gone for a while and missed the posting of the above
> functions. Could some one repost the functions, or make them available at
> a web site some where. Thanks,

You can find them on my web page. The URL is:

http://www.dfanning.com/tips/set_operations.html

Cheers,

David

------------------------------------------------------------ -----
David Fanning, Ph.D.
Fanning Software Consulting
Customizable IDL Programming Courses
Phone: 970-221-0438 E-Mail: davidf@dfanning.com
Coyote's Guide to IDL Programming: http://www.dfanning.com
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Best ORB for Java and C/C++
Next Topic: Triangulate and Trigrid

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Sun Apr 26 13:57:07 PDT 2026

Total time taken to generate the page: 1.91805 seconds