Implementation--
Lists
List Nodes

---

Lists represent information in a sequential structure. List Nodes hold references to the actual data item represented by the node as well as to the next and previous nodes. The first node does not have a previous node and the last node does not have a next node. In SimPlan we use list to hold information concerning:

• Changes in data
• Source code statements
• Flow control transfers in a program
• Flow control in a program
• Goals achieved so far in an execution path
• Static parts of a program
• Timing of changes in variable values
• Current program state
• Program symbols
• Leaf nodes in the search tree

Functionality of lists includes retrieving the number of nodes in the list, retrieving node positions in the list, removing nodes from the list, adding nodes and entire lists to the beginning or end of the list, adding nodes to the interior of the list and finding the nth node in the list for a given n.

Functionality of list nodes includes setting and retrieving the data, next node and previous node references.

---

Related include files:

• list.h

---

Return ...

• To my web page.
• To the SimPlan Opening page.
• To the Implementation Overview page.

---

Andrew Tompkins
Beaverton, OR 97006
Last rev: 16 JUL 03
URL:

http://home.comcast.net/~andytom/simplan.docs/control/list.html

---

---