Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!mit-eddie!rutgers!rochester!pt.cs.cmu.edu!henry!hairston From: hairston@henry.ece.cmu.edu (David Hairston) Newsgroups: comp.sys.mac.programmer Subject: Re: Linked Lists: Thanks! Message-ID: Date: 26 Jan 91 18:38:09 GMT References: <1991Jan25.174734.7677@umiami.ir.miami.edu> Organization: Gaia II Lines: 18 In-reply-to: gross@umiami.ir.miami.edu's message of 25 Jan 91 22:47:33 GMT [gross@umiami.ir.miami.edu (Mondo) writes:] [] Thank you everyone who replied to my query about how to handle linked [] lists. Seems the concensus is that I have to decide how I want to [] implement the list (oh, really? :) ). Some say use pointers and [] risk fragmentation. Others say use handles. Someone even sent a [] whole object class! [] [] And I see that several of you have debated the topic as well. [] [] Again, thanks a lot. Now I dunno what to do. :) keep in mind that a fragmented heap isn't a problem unless it causes problems. if it makes a difference, i'd suggest you go with handles. its harder (at first) to do than with pointers but the technique (on the mac) makes more sense (and maybe you'll learn something new). -dave- hairston@henry.ece.cmu.edu