Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wuarchive!uunet!mcsun!ukc!icdoc!qmw-cs!jeremyr
From: jeremyr@cs.qmw.ac.uk (Jeremy Roussak)
Newsgroups: comp.sys.mac.programmer
Subject: Re: Need an LDEF that breaks the 32K barrier
Message-ID: <3604@sequent.cs.qmw.ac.uk>
Date: 25 Apr 91 18:16:59 GMT
References: <4501@ryn.mro4.dec.com>
Organization: Computer Science Dept, QMW, University of London, UK.
Lines: 16

In <4501@ryn.mro4.dec.com> domenikos@emass1.enet.dec.com (George Domenikos.) writes:


>I am have encountered the 32K limitation on the list manager storage
>capabilities. I have a list in which I would like to store at least 1000
>entries of about 160 bytes per entry. However my list runs out of space
>at about 250 entries or so ( 32K) and all the offsets of my entries get
>out of alignment and eventually my data becomes junk.

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.  Building the list will be
much quicker, too.  You'll have to write an LDEF to draw the
items in the list, but LDEFs are terribly simple to write.

Jeremy Roussak