Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!cs.utexas.edu!csc.ti.com!ti-csl!m2.csc.ti.com!martin
From: martin@csc.ti.com (Steven Martin)
Newsgroups: comp.sys.mac.hypercard
Subject: Re: Need advice on speeding up card find in mega-sized stack
Message-ID: <1991May15.235039.20790@csc.ti.com>
Date: 15 May 91 23:50:39 GMT
References: <1991May15.114727.1@gsbacd.uchicago.edu>
Organization: TI Computer Science Center, Dallas
Lines: 14

In article <1991May15.114727.1@gsbacd.uchicago.edu> gft_robert@gsbacd.uchicago.edu (opcode ranger) writes:
>I have a big problem (literally).  I've set up a stack for my clients which
>is about 12 MB in size (yes, they've got a LOT of data: about 12k cards each
>containing 13 pieces of info, in addition to fields, buttons, etc).
>

I have a 10Mb, 25000 card database that I keep in a Hypercard stack.
I have found the binary search method to be the best.  I have a "goto"
script that searches on the sorted field.

-- 
Steve Martin            USENET: {ctvax,im4u,texsun,rice}!ti-csl!martin
The opinions in this    ARPANET: SMARTIN@CSC.TI.COM  COMPUSERVE: 72727,1471
article are my own.     PHONE: (214)-995-0662, 404-1061