Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!mailrus!tut.cis.ohio-state.edu!unmvax!brainerd From: brainerd@unmvax.unm.edu (Walt Brainerd) Newsgroups: comp.lang.fortran Subject: Re: Tabs in vi and some Fortran stuff Message-ID: <146@unmvax.unm.edu> Date: 14 Jun 89 21:54:40 GMT References: <2721@elxsi.UUCP> <6028@microsoft.UUCP> Distribution: usa Organization: University of New Mexico at Albuquerque Lines: 20 In article <6028@microsoft.UUCP>, bobal@microsoft.UUCP (Bob Allison) writes: > . . . Bill Leonard, in > email to members of the committee complained that it was awfully difficult > to use this form of pointers to insert items in a linked list (at least, > I think that was the example), a fairly common usage of pointers. As I > recall, someone came back with a solution which was deemed "elegant" and > was implemented using recursion. Ugh! I just want to walk around > lists and stuff. Bill, could you post the problem again and see if > anyone else can come up with a solution which doesn't require retraining > everyone who has ever used pointers in any other language? > The responses showed that Bill was all wet and that it was very easy to do linked lists, etc. It is only a little more difficult to create inelegant programs to do the same things by explicitly diddling with the pointers. If anyone else requests it, I will do an inelegant list insertion program, but I may not be able to write as bad a program as Bob, so maybe he should try, too, after he sees how it is done. Gee, the members of X3J3 are going to have to learn how to write Fortran 8x programs one of these days.