Path: utzoo!utgpu!utstat!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!ut-emx!lad-shrike!aihaug
From: aihaug@AUSTIN.LOCKHEED.COM (Daniel A Haug)
Newsgroups: comp.object
Subject: Re: Understanding the Object-Oriented Life-Cycle
Message-ID: <317@shrike.AUSTIN.LOCKHEED.COM>
Date: 10 Nov 89 20:20:43 GMT
References: <5026@internal.Apple.COM> <315@shrike.AUSTIN.LOCKHEED.COM> <654@nastar.UUCP>
Organization: Lockheed Austin Div.
Lines: 21

In article <654@nastar.UUCP>, joel@nastar.UUCP (Joel Rives) writes:
> Perhaps, i am misunderstanding the point you are making here. It is not at
> all difficult to code a QUEUE object in C++ that will accept a generic 
> reference upon which to operate. A new instantiation of this QUEUE object
> could be passed a comparison function when created that would be specific
                                                     ^^^^^^^^^^^^^^^^^^^^^^
> to the data type being queued. Actually, i can think of a couple of different
  ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
> ways to approach this problem --largely asthetic in their differences. As in
> the above example, the algorithm need be coded only once.
> 
> Joel

For many of our particular applications, this is overly restrictive.
I may very well want a single queue to hold objects of vastly different
types.  Perhaps I'm wrong (and often am ;-), but I don't see how to
accomplish this in a statically typed language.

dan haug
-- 
Internet: haug@austin.lockheed.com
UUCP:     ut-emx!lad-shrike!aihaug