Lab46 Wiki

User Tools

Site Tools

You are here: start » notes » discrete » fall2023 » projects » dap0
notes:discrete:fall2023:projects:dap0

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
notes:discrete:fall2023:projects:dap0 [2023/09/27 21:18] – [Deleting a node within a singly-linked list] walleynotes:discrete:fall2023:projects:dap0 [2023/09/28 01:36] (current) – [sound] jhimmel2
Line 13: Line 13:
  
 Note: The remainder you get at each step will become part of the new base number. The new base number is obtained by putting the remainders in reverse order.  Note: The remainder you get at each step will become part of the new base number. The new base number is obtained by putting the remainders in reverse order. 
 +
 +
 +An example of converting the decimal number 29 to binary would look something like this,
 +
 +^        Step      ^        Operation        ^       Result         ^   Remainder ^
 +|        1            |        29/2          |          14          | 1 |
 +|        2            |        14/2          |           7          | 0 |
 +|        3            |         7/2          |           3          | 1 |
 +|        4            |         3/2          |           1          | 1 |
 +|        5       |         1/2          |          0     | 1 |
 +
 +with the first remainder value becoming the least significant digit.
 +
  
 =====Converting between bases===== =====Converting between bases=====
Line 21: Line 34:
  
 In terms of our breakout, in which our brick structures are stored within our singly-linked list. When a brick is destroyed, it's likely that you're simply turning the visible flag to false. Once a brick is invisible, it still exists in memory even if nothing interacts with it. Freeing that brick from memory will improve performance, especially if you have a triple digit amount of bricks. In terms of our breakout, in which our brick structures are stored within our singly-linked list. When a brick is destroyed, it's likely that you're simply turning the visible flag to false. Once a brick is invisible, it still exists in memory even if nothing interacts with it. Freeing that brick from memory will improve performance, especially if you have a triple digit amount of bricks.
 +
 +In our singly-linked list, we have two pointers: one at the start of the list and one at our current position in the list. Due to the limitations of the structure, we're unable to delete the node we're currently have selected with the current pointer. We're only able to delete the node before or after the one currently selected. In this example, we'll delete the one after.
 +
 +To start, create a new brick struct pointer. We'll call it ''temp''. Next, you'll want to assign temp to point at the node after the one currently selected by making use of ''current->next''. The temp node is the node that'll be deleted.
 +
 +In order to make sure our list still stays in one piece after the node deletion, you'll need to assign ''current->next'' to ''temp->next''. This joins the list back together, and skips over the temp node.
 +
 +Afterwards, free the memory allocation of the temp node. Vircon32 has this as a function called ''free();''. See the Vircon32 C API documention for further insight.
 ====sound==== ====sound====
 .wav files can be included into your programs to produce sound.  .wav files can be included into your programs to produce sound. 
 +
 +You can include a sound for various reasons.  A collision, scoring, when the menu or pause is activated, or continuous background music.   
  
 The first thing you will want to do is to include the .wav file in your Make.sh. To do that nano into your make.sh and add the following: The first thing you will want to do is to include the .wav file in your Make.sh. To do that nano into your make.sh and add the following:
notes/discrete/fall2023/projects/dap0.1695849498.txt.gz · Last modified: 2023/09/27 21:18 by walley

Page Tools

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
CC Attribution-Share Alike 4.0 International Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki