Differences

This shows you the differences between two versions of the page.

--- notes:data:list [2010/11/20 01:56] – ccarpe10
+++ notes:data:list [2010/11/20 01:57] (current) – ccarpe10
@@ Line 1: / Line 1: @@
+====list class====
+===search===
+^  Function  ^  Parameter(s)  ^  Return value  |      ===bool insert()===
+| search(int value)  | int value |  bool  |
+insert(Node *)
+^  Function  ^  Parameter(s)  ^  Return value  |
+|insert(int value) | int value |  bool  |
+Overloaded function (Node *, Node* location)
+|PATH: ../backgammon/list|
+<code c++>
+myList.insert(INT, NODE*);
+</code>
+^  Function  ^  Parameter(s)  ^  Return value  |
+|  insert(int, Node*)  |  int, Node*  |   bool   |
+Overloaded function (int value, Node* location)
+^  Function  ^  Parameter(s)  ^  Return value  |
+<code c++>
+myList.insert(value, tmp);
+</code>
+===append()===
+^  Function  ^  Parameter(s)  ^  Return value  ^
+| append(node, *location)  | node, *location |  bool   |
+^ Brief Description | Inserts a node after a given location in the list |   |
+===append(value)===
+appending a value involves inserting a node with a value after the program finds the wanted node and then puts the new node with the value after it.
+<code c++>
+myList.append(value);
+</code>
+^  Function  ^  Parameter(s)  ^  Return value  ^
+| append(int)  | value to insert into node |  bool value of success  |
+===append(Node *)===
+append(Node *)  will add a node to the end of the list or if the list is empty create the list
+<code c++>
+myList.append(tmp);
+</code>
+^  Function  ^  Parameter(s)  ^  Return value  |
+|  append(Node *)  |  node pointer to location of node to insert  |  bool value of success vs failure  |
+===delete(Node *)===
+^  Function  ^  Parameter(s)  ^  Return value  |
+|deleteNode() | int value | bool |
+----

Lab46 Wiki

User Tools

Site Tools

Differences

Page Tools