This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revision | |||
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 | ||
+ | | search(int value) | ||
+ | insert(Node *) | ||
+ | ^ Function | ||
+ | |insert(int value) | int value | bool | | ||
+ | Overloaded function (Node *, Node* location) | ||
+ | |||
+ | |PATH: ../ | ||
+ | |||
+ | <code c++> | ||
+ | myList.insert(INT, | ||
+ | </ | ||
+ | |||
+ | ^ Function | ||
+ | | insert(int, Node*) | ||
+ | |||
+ | Overloaded function (int value, Node* location) | ||
+ | ^ Function | ||
+ | |||
+ | <code c++> | ||
+ | myList.insert(value, | ||
+ | </ | ||
+ | |||
+ | ===append()=== | ||
+ | ^ Function | ||
+ | | append(node, | ||
+ | ^ 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); | ||
+ | </ | ||
+ | |||
+ | ^ Function | ||
+ | | append(int) | ||
+ | |||
+ | |||
+ | ===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); | ||
+ | </ | ||
+ | |||
+ | ^ Function | ||
+ | | append(Node *) | node pointer to location of node to insert | ||
+ | |||
+ | |||
+ | ===delete(Node *)=== | ||
+ | ^ Function | ||
+ | |deleteNode() | int value | bool | | ||
+ | |||
+ | ---- | ||
+ | |||