Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!wuarchive!kuhub.cc.ukans.edu!kinnersley
From: kinnersley@kuhub.cc.ukans.edu (Bill Kinnersley)
Newsgroups: comp.lang.misc
Subject: Re: Look ... [or: one, two, three, many]
Message-ID: <27699.27849b1b@kuhub.cc.ukans.edu>
Date: 4 Jan 91 21:11:22 GMT
References: <19717:Jan220:38:5491@kramden.acf.nyu.edu> <40569@nigel.ee.udel.edu> <GESSEL.91Jan4105720@masada.cs.swarthmore.edu> <40693@nigel.ee.udel.edu>
Organization: University of Kansas Academic Computing Services
Lines: 25

In article <40693@nigel.ee.udel.edu>, new@ee.udel.edu (Darren New) writes:
:
: (Disclaimer: I have not looked at FORTRAN in ~7 years. Maybe it has
: dynamic allocation by now.)
: 
Not yet but soon, patience.  The proposed Fortran 8x has structures, 
pointers, and a heap.  For example you'll be able to build linked lists 
by doing something like this:

TYPE ITEM
  REAL VALUE
  TYPE(ITEM),POINTER :: NEXTITEM
END TYPE ITEM

TYPE(ITEM),POINTER :: STACK, NEWITEM
NULLIFY(STACK)

ALLOCATE(NEWITEM)             
NEWITEM = ITEM(3.7,STACK)
STACK => NEWITEM

(I can't help it, they send me this stuff in the mail.)

-- 
--Bill Kinnersley