From c1b6ffe70bd281c6c230fd63fabcaac2aff47514 Mon Sep 17 00:00:00 2001
From: Fuwn <contact@fuwn.me>
Date: Sun, 7 Apr 2024 23:18:32 -0700
Subject: feat: initial commit

---
 chapter8/node2.template | 128 ++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 128 insertions(+)
 create mode 100644 chapter8/node2.template

(limited to 'chapter8/node2.template')

diff --git a/chapter8/node2.template b/chapter8/node2.template
new file mode 100644
index 0000000..45c3470
--- /dev/null
+++ b/chapter8/node2.template
@@ -0,0 +1,128 @@
+// 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>    // Provides assert
+#include <cstdlib>    // Provides NULL and size_t
+
+namespace main_savitch_6B
+{
+    template <class Item>
+    void list_clear(node<Item>*& head_ptr)
+    // Library facilities used: cstdlib
+    {
+	while (head_ptr != NULL)
+	    list_head_remove(head_ptr);
+    }
+
+    template <class Item>
+    void list_copy(
+	const node<Item>* source_ptr,
+	node<Item>*& head_ptr,
+	node<Item>*& tail_ptr
+	) 
+    // Library facilities used: cstdlib
+    {
+	head_ptr = NULL;
+	tail_ptr = NULL;
+
+	// Handle the case of the empty list
+	if (source_ptr == NULL)
+	    return;	
+
+	// Make the head node for the newly created list, and put data in it
+	list_head_insert(head_ptr, source_ptr->data( ));
+	tail_ptr = head_ptr; 
+	
+	// Copy rest of the nodes one at a time, adding at the tail of new list
+	source_ptr = source_ptr->link( ); 
+        while (source_ptr != NULL)
+	{
+	    list_insert(tail_ptr, source_ptr->data( ));
+	    tail_ptr = tail_ptr->link( );
+	    source_ptr = source_ptr->link( );
+	}
+    }
+    
+    template <class Item>
+    void list_head_insert(node<Item>*& head_ptr, const Item& entry)
+    {
+	head_ptr = new node<Item>(entry, head_ptr);
+    }
+
+    template <class Item>
+    void list_head_remove(node<Item>*& head_ptr)
+    {
+	node<Item> *remove_ptr;
+
+	remove_ptr = head_ptr;
+	head_ptr = head_ptr->link( );
+	delete remove_ptr;
+    }
+
+    template <class Item>
+    void list_insert(node<Item>* previous_ptr, const Item& entry) 
+    {
+	node<Item> *insert_ptr;
+    
+	insert_ptr = new node<Item>(entry, previous_ptr->link( ));
+	previous_ptr->set_link(insert_ptr);
+    }
+
+    template <class Item>
+    std::size_t list_length(const node<Item>* head_ptr)
+    // Library facilities used: cstdlib
+    {
+	const node<Item> *cursor;
+	std::size_t answer;
+	
+	answer = 0;
+	for (cursor = head_ptr; cursor != NULL; cursor = cursor->link( ))
+	    ++answer;
+	
+	return answer;
+    }
+
+    template <class NodePtr, class SizeType>
+    NodePtr list_locate(NodePtr head_ptr, SizeType position) 
+    // Library facilities used: cassert, cstdlib
+    {
+	NodePtr cursor;
+	SizeType i;
+    
+	assert(0 < position);
+	cursor = head_ptr;
+	for (i = 1; (i < position) && (cursor != NULL); ++i)
+	    cursor = cursor->link( );
+	return cursor;
+    }
+
+    template <class Item>
+    void list_remove(node<Item>* previous_ptr)
+    {
+	node<Item> *remove_ptr;
+
+	remove_ptr = previous_ptr->link( );
+	previous_ptr->set_link(remove_ptr->link( ));
+	delete remove_ptr;
+    }
+
+    template <class NodePtr, class Item>
+    NodePtr list_search(NodePtr head_ptr, const Item& target) 
+    // Library facilities used: cstdlib
+    {
+	NodePtr cursor;
+	
+	for (cursor = head_ptr; cursor != NULL; cursor = cursor->link( ))
+	    if (target == cursor->data( ))
+		return cursor;
+	return NULL;
+    }
+}
-- 
cgit v1.2.3