haas:fall2018:data:projects:sln1
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| haas:fall2018:data:projects:sln1 [2018/09/03 23:10] – wedge | haas:fall2018:data:projects:sln1 [2018/09/06 14:20] (current) – [node library] wedge | ||
|---|---|---|---|
| Line 130: | Line 130: | ||
| We will use struct to package its contents. | We will use struct to package its contents. | ||
| - | What is **in** the node? Again, this answer depends on our particular needs. For now, lacking any specific application, | + | What is **in** the node? Again, this answer depends on our particular needs. For now, lacking any specific application, |
| The node, to make it practical and useful, also needs the ability to reference other nodes. Pointers are they key for referencing other variables (via memory address storage and dereferencing), | The node, to make it practical and useful, also needs the ability to reference other nodes. Pointers are they key for referencing other variables (via memory address storage and dereferencing), | ||
| Line 158: | Line 158: | ||
| <code c> | <code c> | ||
| - | struct node *first; | + | struct node *first |
| </ | </ | ||
| Line 164: | Line 164: | ||
| <code c> | <code c> | ||
| - | Node *first; | + | Node *first |
| </ | </ | ||
| Line 209: | Line 209: | ||
| <code c> | <code c> | ||
| first -> right = (Node *) malloc (sizeof(Node)); | first -> right = (Node *) malloc (sizeof(Node)); | ||
| - | first -> right -> infe = 37; | + | first -> right -> info = 37; |
| first -> right -> right = NULL; | first -> right -> right = NULL; | ||
| </ | </ | ||
| Line 220: | Line 220: | ||
| Since we need to keep a placeholder on our allocated memory, **first** is intended to be a more or less immovable aspect of our list (it is our link to everything- we don't want to adjust it unless we absolutely need to). | Since we need to keep a placeholder on our allocated memory, **first** is intended to be a more or less immovable aspect of our list (it is our link to everything- we don't want to adjust it unless we absolutely need to). | ||
| - | You may be noticing the potential for some very long code about to happen (what if we wanted to add a third node... those there' | + | You may be noticing the potential for some very long code about to happen (what if we wanted to add a third node... those there' |
| Here is that same node construction logic, redone using an additional **tmp** node pointer, and also adding in a third node (containing the value 8): | Here is that same node construction logic, redone using an additional **tmp** node pointer, and also adding in a third node (containing the value 8): | ||
| < | < | ||
| - | Node *first, *tmp = NULL; | + | Node *first |
| first = (Node *) malloc (sizeof(Node)); | first = (Node *) malloc (sizeof(Node)); | ||
| Line 446: | Line 446: | ||
| This is your API for the node library. In order to use the node library three things need to happen: | This is your API for the node library. In order to use the node library three things need to happen: | ||
| - | * you must **#include " | + | * you must **#include " |
| * you must link against **lib/ | * you must link against **lib/ | ||
| * you must call the functions providing the appropriate arguments and handling the return values | * you must call the functions providing the appropriate arguments and handling the return values | ||
haas/fall2018/data/projects/sln1.1536016232.txt.gz · Last modified: 2018/09/03 23:10 by wedge
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
