struct linked-list-node {
std::string value;
linked-list-node * next;
}
linked-list-node *
new-linked-list-node(std::string value, linked-list-node * next) {
linked-list-node * np = new linked-list-node;
np->value = value;
np->next = next;
return np;
}
linked_list_node *
find(Element value)
for (linked_list_node * p = head; p; p = p->next)
if (p->value == value)
return p
return 0
find() to turn an element value into an element pointer.
linked-list-node * insert_after(linked-list-node * here, Element value) linked-list-node * np = new linked-list-node hp->value = value np->next = here->next here->next = np return np
void
remove(linked-list-node * here)
for (prev = &head; prev->next != here; prev = prev->next) { }
prev->next = here->next
delete here;
This page last modified on 3 December 2003.