Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!cernvax!chx400!chx400!bernina!iis!neeri
From: neeri@iis.ethz.ch (Matthias Ulrich Neeracher)
Newsgroups: comp.sys.mac.programmer
Subject: Re: Need an LDEF that breaks the 32K barrier
Message-ID: <1991Apr26.085843.14104@bernina.ethz.ch>
Date: 26 Apr 91 08:58:43 GMT
References: <4501@ryn.mro4.dec.com> <3604@sequent.cs.qmw.ac.uk>
Sender: neeri@iis (Matthias Ulrich Neeracher)
Reply-To: neeri@iis.ethz.ch (Matthias Ulrich Neeracher)
Organization: Integrated Systems Laboratory, ETH, Zurich
Lines: 32
Nntp-Posting-Host: etzj-gw

In article <3604@sequent.cs.qmw.ac.uk>, jeremyr@cs.qmw.ac.uk (Jeremy Roussak) writes:
>In <4501@ryn.mro4.dec.com> domenikos@emass1.enet.dec.com (George Domenikos.) writes:
>One easy way round this is to store pointers (or better yet,
>handles) to your data in the list.  You can then have >100,000
                                                        ^^^^^^^
>items in your list with no problems.

a) how do you address the 100'000 items ?? Cells have only a signed 16-bit
   vertical component (limiting the items to 32767).
b) I find it easier *not* to store *any* data in the list, but use the
   Cell parameter to the LDEF as an index into my own data structure. If
   you store a pointer for each item in the list, you are limited to 8191
   items.

>Building the list will be
>much quicker, too. 

Relatively spoken, yes.

> You'll have to write an LDEF to draw the
>items in the list, but LDEFs are terribly simple to write.

"Simply terrible" is another word for it :-)

>Jeremy Roussak

Matthias

-- 
Matthias Neeracher                                      neeri@iis.ethz.ch
   "These days, though, you have to be pretty technical before you can 
    even aspire to crudeness." -- William Gibson, _Johnny Mnemonic_