...for code which creates, traverses and destroys a linked list. Note that this is a stack -...> t%%p => c --- If the list is NOT empty, add the newly...create a first in - first out list each new node must be pointed...=> c will give the needed link from the preceeding node t ... new node c when the list is not empty. With an ... node. A small tips: In Fortran 95 or later you can ...

.../f77tof90/stu-notes/f90studentMIF_6.html for code which creates, traverses and destroys a linked list. Note that this is a stack - last ... t%%p => c --- If the list is NOT empty, add the newly created ...they may have achieved that through a linked list, but I was guessing. How ...one observe the intended behavior of this list? -- Nevertheless, it is even harder for the...

.../tec/courses/f77tof90/stu-notes/f90studentMIF_6.html for code which creates, traverses and destroys a linked list. Note that this is a stack - last in - ... decided to write my own so that the list would be traversed in the order in which items were entered. So I sat ... only subtle part is t%%p => c --- If the list is NOT empty, add the newly created node onto...

... understand what this code does! The only subtle part is t%%p => c --- If the list is NOT empty, add the newly created node onto the chain. What data did you use to test? The read loop exits when a 0 is entered, so I tried lists with 0 through 5 members. For lists of length N, for N = 2 to 3, I tried all permutations of the integers from 1 to N. [Proof that ...

On Tue, 16 Sep 2008 11:30:59 -0700 (PDT), e p chandler posted: I acutally understand what this code does! The only subtle part is t%%p => c --- If the list is NOT empty, add the newly created node onto the chain. What data did you use to test? -- Wealth - any income that is at least one hundred dollars more a year than the income of one's wife's sister's husband. H. L...

... in most installations to set up and use the HFS. -- Gary Scott mailto:garylscott@sbcglobal dot net Fortran Library: http://www.fortranlib.com Support the Original G95 Project: http://www.g95.org -OR- Support the GNU GFortran Project: http://gcc.gnu.org/fortran/index.html If you want to do the impossible, don't hire an expert because he knows it ...

Ron Ford wrote: (snip) I'm given to understand that data structures on Turing-complete machines are somehow all the same. Glen mentioned that the directory structure--folders--for the original apples was flat, as opposed to the tree I think of when I think of a directory. The original MacOS when they only used floppies or small hard disks. The file system for OS/360, and ...

... I reread this) by in the early 90's. It is what made me start ... trick of to save memory for doubly linked lists, I believe sometimes used in C ... storing the two pointers (next and previous list element) you instead store the exclusive OR of the two. In traversing the list, you know where you are coming... elements. Assuming relative pointers are legal Fortran, it would seem to exclude bit ...