Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fortran 90 & 95 linked list operations: managing an ordered list with pointers to pointers

Fortran 90 & 95 linked list operations: managing an ordered list with pointers to pointers ARTICLES Fortran 90 & 95 Linked List Operations: Managing an Ordered List with Pointers to Pointers Loren P. Meissner adapted from Fortran 90 & 95 Array and Pointer Techniques, Section 5.4 (See page 25 below) Suppose that a linked list is arranged in increasing order according to a key, and a new item that is a candidate for insertion has been generated. A linear search for the new key, beginning at the root of the linked list, has three possible outcomes. 1. An item in the linked list with a matching key may be found. In this case, the new item will not be inserted but it may be desirable to modify the matching item. When the search terminates, the target of the "traveling node pointer" Trav_NP is the node with a matching key. 2. If all items in the list have keys smaller than the new one, the end of the linked list will be reached. In this case, Trav_NP is null when the search terminates. The new item is to be inserted at the end, as the new successor of the previous target of Trav_NP. 3. Otherwise, the search terminates when an item with a larger http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGPLAN Fortran Forum Association for Computing Machinery

Fortran 90 & 95 linked list operations: managing an ordered list with pointers to pointers

ACM SIGPLAN Fortran Forum , Volume 16 (2) – Aug 1, 1997

Loading next page...
 
/lp/association-for-computing-machinery/fortran-90-95-linked-list-operations-managing-an-ordered-list-with-POqp29Nrmq

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1997 by ACM Inc.
ISSN
1061-7264
DOI
10.1145/270891.270892
Publisher site
See Article on Publisher Site

Abstract

ARTICLES Fortran 90 & 95 Linked List Operations: Managing an Ordered List with Pointers to Pointers Loren P. Meissner adapted from Fortran 90 & 95 Array and Pointer Techniques, Section 5.4 (See page 25 below) Suppose that a linked list is arranged in increasing order according to a key, and a new item that is a candidate for insertion has been generated. A linear search for the new key, beginning at the root of the linked list, has three possible outcomes. 1. An item in the linked list with a matching key may be found. In this case, the new item will not be inserted but it may be desirable to modify the matching item. When the search terminates, the target of the "traveling node pointer" Trav_NP is the node with a matching key. 2. If all items in the list have keys smaller than the new one, the end of the linked list will be reached. In this case, Trav_NP is null when the search terminates. The new item is to be inserted at the end, as the new successor of the previous target of Trav_NP. 3. Otherwise, the search terminates when an item with a larger

Journal

ACM SIGPLAN Fortran ForumAssociation for Computing Machinery

Published: Aug 1, 1997

There are no references for this article.