comp.lang.idl-pvwave archive: archive » Re: Efficient comparison of arrays / Set operations

Home » Public Forums » archive » Re: Efficient comparison of arrays / Set operations

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Re: Efficient comparison of arrays / Set operations [message #9863 is a reply to message #9857]

Fri, 29 August 1997 00:00

davidf
Messages: 2866
Registered: September 1996

Senior Member

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.

Hey, way to go, RSI. Nice post! I, for one, think you guys
should post more often. Lord knows, we can often use the help. :-)

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

Report message to a moderator

[Message index]

		Re: Efficient comparison of arrays / Set operations By: J.D. Smith on Mon, 01 September 1997 00:00
		Re: Efficient comparison of arrays / Set operations By: davidf on Fri, 29 August 1997 00:00
		Re: Efficient comparison of arrays / Set operations By: Research Systems Inc. on Fri, 29 August 1997 00:00
		Re: Efficient comparison of arrays / Set operations By: davidf on Wed, 10 September 1997 00:00
		Re: Efficient comparison of arrays / Set operations By: szoonem on Wed, 10 September 1997 00:00

Previous Topic:	Best ORB for Java and C/C++
Next Topic:	Triangulate and Trigrid

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Fri Nov 28 12:44:16 PST 2025

Total time taken to generate the page: 0.72216 seconds