Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!ukma!psuvm.bitnet!rice.bitnet!storkel
From: STORKEL@RICE.BITNET (Scott Storkel)
Newsgroups: comp.sys.mac.hypercard,comp.sys.mac
Subject: Quick intersection function?
Message-ID: <191STORKEL@RICE>
Date: Tue, 17-Nov-87 17:25:50 EST
Article-I.D.: RICE.191STORKEL
Posted: Tue Nov 17 17:25:50 1987
Date-Received: Fri, 20-Nov-87 07:44:28 EST
Organization: Rice University - ICSA
Lines: 15
Xref: mnetor comp.sys.mac.hypercard:128 comp.sys.mac:9899

Here's what I'm trying to do: I have two, or more lists of card id numbers and
I want to compute the union or intersection of the lists. The reason is that
the lists contain the id numbers of cards that have information belonging in a
certain category. The information on a card, may however fit into more than one
category. To find all the cards that have information  that belongs in
category A, or category B I need to take the union of the two lists, or to get
category A and category B, the intersection. What I want to know is, is there a
quick algorithm for doing this? The only ways I can think of seem to be
reminiscent of the bubblesort, i.e. sssslllloooooowwwwww. So is there a method
of doing a QuickIntersection, and/or a QuickUnion? Please e-mail replies to me
directly, if possible. Thanks for the help.
     
Scott Storkel
Rice University Macintosh Software Development
(STORKEL@RICE.BITNET)