void set_data(const value_type& new_data) { data_field = new_data; } void set_link(node* new_link) { link_field = new_link; }

Transcription

1 node1.h Page 1 of 1 class node // TYPEDEF typedef double value_type; // CONSTRUCTOR node( const value_type& init_data = value_type( ), node* init_link = NULL ) data_field = init_data; link_field = init_link; // Member functions to set the data and link fields: void set_data(const value_type& new_data) data_field = new_data; void set_link(node* new_link) link_field = new_link; // Constant member function to retrieve the current data: value_type data( ) const return data_field; // Two slightly different member functions to retreive // the current link: const node* link( ) const return link_field; node* link( ) return link_field; value_type data_field; node* link_field; ; // FUNCTIONS for the linked list toolkit std::size_t list_length(const node* head_ptr); void list_head_insert(node*& head_ptr, const node::value_type& entry); void list_insert(node* previous_ptr, const node::value_type& entry); node* list_search(node* head_ptr, const node::value_type& target); const node* list_search (const node* head_ptr, const node::value_type& target); node* list_locate(node* head_ptr, std::size_t position); const node* list_locate(const node* head_ptr, std::size_t position); void list_head_remove(node*& head_ptr); void list_remove(node* previous_ptr); void list_clear(node*& head_ptr); void list_copy(const node* source_ptr, node*& head_ptr, node*& tail_ptr);

2 node1.cxx // FILE: node1.cxx // IMPLEMENTS: The functions of the node class and the // linked list toolkit (see node1.h for documentation). // INVARIANT for the node class: // The data of a node is stored in data_field, and the link in link_field. #include "node1.h" #include <cassert> #include <cstdlib> using namespace std; // Provides assert // Provides NULL and size_t namespace main_savitch_5 size_t list_length(const node* head_ptr) const node *cursor; size_t answer; answer = 0; ++answer; return answer; void list_head_insert(node*& head_ptr, const node::value_type& entry) head_ptr = new node(entry, head_ptr); node* list_search(node* head_ptr, const node::value_type& target) node *cursor; if (target == cursor->data( )) return cursor; return NULL; const node* list_search(const node* head_ptr, const node::value_type& target) const node *cursor; if (target == cursor->data( )) return cursor; return NULL;... Page 1

3 node2.h Page 1 of 1 class node // TYPEDEF typedef Item value_type; // CONSTRUCTOR node(const Item& init_data=item( ), node* init_link=null) data_field = init_data; link_field = init_link; // MODIFICATION MEMBER FUNCTIONS Item& data( ) return data_field; node* link( ) return link_field; void set_data(const Item& new_data) data_field = new_data; void set_link(node* new_link) link_field = new_link; // CONST MEMBER FUNCTIONS const Item& data( ) const return data_field; const node* link( ) const return link_field; Item data_field; node *link_field; ; // FUNCTIONS to manipulate a linked list: void list_clear(node<item>*& head_ptr); void list_copy (const node<item>* source_ptr, node<item>*& head_ptr, node<item>*& tail_ptr) void list_head_insert(node<item>*& head_ptr, const Item& entry); void list_head_remove(node<item>*& head_ptr); void list_insert(node<item>* previous_ptr, const Item& entry); std::size_t list_length(const node<item>* head_ptr); template <class NodePtr, class SizeType> NodePtr list_locate(nodeptr head_ptr, SizeType position); void list_remove(node<item>* previous_ptr); template <class NodePtr, class Item> NodePtr list_search(nodeptr head_ptr, const Item& target);

4 node2.template // FILE: node2.template // IMPLEMENTS: The functions of the node template class and the // linked list toolkit (see node2.h for documentation). // // NOTE: // Since node is a template class, this file is included in node2.h. // Therefore, we should not put any using directives in this file. // // INVARIANT for the node class: // The data of a node is stored in data_field, and the link in link_field. #include <cassert> #include <cstdlib> // Provides assert // Provides NULL and size_t namespace main_savitch_6b std::size_t list_length(const node<item>* head_ptr) const node<item> *cursor; std::size_t answer; answer = 0; ++answer; return answer; void list_head_insert(node<item>*& head_ptr, const Item& entry) head_ptr = new node<item>(entry, head_ptr);... template <class NodePtr, class Item> NodePtr list_search(nodeptr head_ptr, const Item& target) NodePtr cursor; if (target == cursor->data( )) return cursor; return NULL;... Page 1

5 node2.h iterators // FORWARD ITERATORS to step through the nodes of a linked list // A node_iterator of can change the underlying linked list through the // * operator, so it may not be used with a const node. The // node_const_iterator cannot change the underlying linked list // through the * operator, so it may be used with a const node. // WARNING: // This classes use std::iterator as its base class; // Older compilers that do not support the std::iterator class can // delete everything after the word iterator in the second line: class node_iterator : public std::iterator<std::forward_iterator_tag, Item> node_iterator(node<item>* initial = NULL) current = initial; Item& operator *( ) const return current->data( ); node_iterator& operator ++( ) // Prefix ++ return *this; node_iterator operator ++(int) // Postfix ++ node_iterator original(current); return original; bool operator ==(const node_iterator other) const return current == other.current; bool operator!=(const node_iterator other) const return current!= other.current; node<item>* current; ; class const_node_iterator : public std::iterator<std::forward_iterator_tag, const Item> const_node_iterator(const node<item>* initial = NULL) current = initial; const Item& operator *( ) const return current->data( ); const_node_iterator& operator ++( ) // Prefix ++ return *this; const_node_iterator operator ++(int) // Postfix ++ const_node_iterator original(current); return original; bool operator ==(const const_node_iterator other) const return current == other.current; bool operator!=(const const_node_iterator other) const return current!= other.current; const node<item>* current; Page 1 of 2

6 ; Page 2 of 2