gross@umiami.ir.miami.edu (Mondo) (01/26/91)
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. :)
--
Jason Gross Comp Sci Ugrad University of Miami Class of '91 (?)
===========================================================================
Hey, wanna save the world? | Got sumtin' to say? gross@umiami.bitnet
Nuke a Godless, Communist, | Pick and choose! gross@umiami.ir.miami.edu
gay whale for Christ. | gross@miavax.ir.miami.edu
- Anonymous | jgross@umbio.med.miami.edu
===========================================================================
The University of Miami has a lovely fountain. hairston@henry.ece.cmu.edu (David Hairston) (01/27/91)
[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