notes:data:spring2024:projects:cgfx
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| notes:data:spring2024:projects:cgfx [2024/03/07 04:57] – [doubly linked stack] rspringe | notes:data:spring2024:projects:cgfx [2024/03/14 03:31] (current) – [doubly linked stack] rspringe | ||
|---|---|---|---|
| Line 18: | Line 18: | ||
| * Clubs | * Clubs | ||
| =====doubly linked stack===== | =====doubly linked stack===== | ||
| + | **Reference: | ||
| + | |||
| A doubly linked list is nearly similar to a singly linked list, as it is a list of structs, where each struct has a pointer to the next struct in the list. | A doubly linked list is nearly similar to a singly linked list, as it is a list of structs, where each struct has a pointer to the next struct in the list. | ||
| Line 23: | Line 25: | ||
| ===Stack Struct=== | ===Stack Struct=== | ||
| + | A separate struct can be created specifically for the stack. This struct will need pointers to the structs being used for the cards and piles. | ||
| + | |||
| + | Another option is to initialize the stack using the pile struct. since the stack is it's own pile, it does not need to be in a list with other piles. | ||
| ===Function to Create Stack=== | ===Function to Create Stack=== | ||
| + | <code c> | ||
| + | struct Pile { | ||
| + | // Other Data Needed for Pile | ||
| + | Card* firstCard; | ||
| + | }; | ||
| + | |||
| + | void main(void) { | ||
| + | |||
| + | Pile* Stack = (Pile*)malloc(sizeof(Pile)); | ||
| + | | ||
| + | // Set Stack to be Empty | ||
| + | Stack-> | ||
| + | } | ||
| + | </ | ||
| =====LIFO/ | =====LIFO/ | ||
| + | |||
| + | LIFO and FILO are both used to describe a way to insert and retrieve data from a data structure. | ||
| + | |||
| + | LIFO stands for **Last In First Out**, which means the last element to be put into the data structure is the first to be retrieved. This is the main method for pushing and popping data from a stack. | ||
| + | |||
| + | FILO stands for **First In Last Out**, which is another term for the same process. | ||
| =====size: bounded vs unbounded===== | =====size: bounded vs unbounded===== | ||
| Line 32: | Line 57: | ||
| =====push===== | =====push===== | ||
| ====stack overflow==== | ====stack overflow==== | ||
| + | When pushing data to the stack, it is important to not push too much data onto the stack, as a stack overflow can occur. | ||
| + | In a stack overflow, there are so many elements pushed onto it, that the stack data starts overlapping with the program data in RAM, which can cause severe errors when the program then tries to read that data. | ||
| + | |||
| + | To solve this, make sure that whatever gets pushed to the stack gets popped at some point before moving on. | ||
| =====pop===== | =====pop===== | ||
| ====stack underflow==== | ====stack underflow==== | ||
| Line 40: | Line 69: | ||
| =====card game: freecell===== | =====card game: freecell===== | ||
| + | Freecell is a Solitaire card game where the goal is to move piles of cards around in order to get each card to four " | ||
| ====foundations==== | ====foundations==== | ||
| + | |||
| + | The foundations are where you need to get each card to by the end of the game in order to win. | ||
| ===Foundation logic=== | ===Foundation logic=== | ||
| + | There are four foundations, | ||
| + | Foundations are also sorted by rank: to start a foundation, you need to place an Ace onto an empty foundation, then place the next value card of the same suit onto that Ace, and so on from Ace-King. | ||
| ====storage==== | ====storage==== | ||
| ====tableau==== | ====tableau==== | ||
| + | The tableau is the main playing area of the game. This is where the various piles of cards get moved around in order to get to cards that can be moved to a foundation. | ||
| ====pile==== | ====pile==== | ||
notes/data/spring2024/projects/cgfx.1709787479.txt.gz · Last modified: 2024/03/07 04:57 by rspringe
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
