Updates for 4.0 beta 2

Author: REAS

Basics/Math/Interpolate/Interpolate.pde

@@ -4,9 +4,7 @@
  * Move the mouse across the screen and the symbol will follow.  
  * Between drawing each frame of the animation, the ellipse moves 
  * part of the distance (0.05) from its current position toward 
- * the cursor using the lerp() function. 
- *
- * This is the same as the Easing under input only with lerp() instead. 
+ * the cursor using the lerp() function.
  */
 
 float x;
@@ -32,4 +30,4 @@ void draw() {
   fill(255);
   stroke(255);
   ellipse(x, y, 66, 66);
-}
+}

Basics/Math/OperatorPrecedence/OperatorPrecedence.pde

@@ -3,12 +3,12 @@
  * 
  * If you don't direction state the order in which an 
  * expression is evaluated, it is decided by the operator 
- * precedence. For example, in the statement "4+2*8", the 
+ * precedence. For example, in the expression 4+2*8, the 
  * 2 will first be multiplied by 8 and then the result will 
  * be added to 4. This is because multiplication has a higher 
  * precedence than addition. To avoid ambiguity in reading 
  * the program, it is recommended to write the expression as 
- * "4+(2*8)". The order of evaluation can be controlled through 
+ * 4+(2*8). The order of evaluation can be controlled through 
  * adding parenthesis in the code. 
  */
 
@@ -53,5 +53,3 @@ for (int i = 0; i < width; i+= 2) {
     line(i, 151, i, height-1);
   } 
 }
-
-

Basics/Math/PolarToCartesian/PolarToCartesian.pde

@@ -3,7 +3,7 @@
  * by Daniel Shiffman.  
  * 
  * Convert a polar coordinate (r,theta) to cartesian (x,y).
- * The calculations are "x = r * cos(theta)" and "y = r * sin(theta)".  
+ * The calculations are x=r*cos(theta) and y=r*sin(theta).  
  */
 
 float r;
@@ -45,7 +45,3 @@ void draw() {
   theta += theta_vel;
 
 }
-
-
-
-

Basics/Shape/DisableStyle/DisableStyle.pde

@@ -24,8 +24,8 @@ void draw() {
 
   // Draw left bot
   bot.disableStyle();  // Ignore the colors in the SVG
-  fill(0, 102, 153);    // Set the SVG fill to blue
-  stroke(255);          // Set the SVG fill to white
+  fill(0, 102, 153);  // Set the SVG fill to blue
+  stroke(255);  // Set the SVG fill to white
   shape(bot, 20, 25, 300, 300);
 
   // Draw right bot

Basics/Structure/CreateGraphics/CreateGraphics.pde

@@ -1,11 +1,13 @@
 /**
  * Create Graphics. 
  * 
- * The createGraphics() function creates an object from the PGraphics class. 
- * PGraphics is the main graphics and rendering context for Processing. 
- * The beginDraw() method is necessary to prepare for drawing and endDraw() is
- * necessary to finish. Use this class if you need to draw into an off-screen 
- * graphics buffer or to maintain two contexts with different properties.
+ * The createGraphics() function creates an object from 
+ * the PGraphics class. PGraphics is the main graphics and 
+ * rendering context for Processing. The beginDraw() method 
+ * is necessary to prepare for drawing and endDraw() is
+ * necessary to finish. Use this class if you need to draw 
+ * into an off-screen graphics buffer or to maintain two 
+ * drawing surfaces with different properties.
  */
 
 PGraphics pg;

Topics/Cellular Automata/GameOfLife/GameOfLife.pde

@@ -2,12 +2,11 @@
  * Game of Life
  * by Joan Soler-Adillon.
  *
- * Press SPACE BAR to pause and change the cell's values with the mouse. 
- * On pause, click to activate/deactivate cells. 
- * Press R to randomly reset the cells' grid. 
- * Press C to clear the cells' grid. 
- *
- * The original Game of Life was created by John Conway in 1970.
+ * Press SPACE BAR to pause and change the cell's values 
+ * with the mouse. On pause, click to activate/deactivate 
+ * cells. Press 'R' to randomly reset the cells' grid. 
+ * Press 'C' to clear the cells' grid. The original Game 
+ * of Life was created by John Conway in 1970.
  */
 
 // Size of cells
@@ -26,7 +25,8 @@ color dead = color(0);
 
 // Array of cells
 int[][] cells; 
-// Buffer to record the state of the cells and use this while changing the others in the interations
+// Buffer to record the state of the cells and use this 
+// while changing the others in the interations
 int[][] cellsBuffer; 
 
 // Pause
@@ -57,7 +57,8 @@ void setup() {
       cells[x][y] = int(state); // Save state of each cell
     }
   }
-  background(0); // Fill in black in case cells don't cover all the windows
+  // Fill in black in case cells don't cover all the windows
+  background(0); 
 }
 
 
@@ -111,8 +112,6 @@ void draw() {
   }
 }
 
-
-
 void iteration() { // When the clock ticks
   // Save cells to buffer (so we opeate with one array keeping the other intact)
   for (int x=0; x<width/cellSize; x++) {
@@ -179,4 +178,3 @@ void keyPressed() {
     }
   }
 }
-

Topics/Cellular Automata/Wolfram/CA.pde

@@ -1,10 +1,10 @@
 class CA {
 
-  int[] cells;     // An array of 0s and 1s 
+  int[] cells;  // An array of 0s and 1s 
   int generation;  // How many generations?
-  int scl;         // How many pixels wide/high is each cell?
+  int scl;  // How many pixels wide/high is each cell?
 
-  int[] rules;     // An array to store the ruleset, for example {0,1,1,0,1,1,0,1}
+  int[] rules;  // Array to store the rules, for example {0,1,1,0,1,1,0,1}
 
   CA(int[] r) {
     rules = r;
@@ -30,21 +30,25 @@ class CA {
     for (int i = 0; i < cells.length; i++) {
       cells[i] = 0;
     }
-    cells[cells.length/2] = 1;    // We arbitrarily start with just the middle cell having a state of "1"
+    // We arbitrarily start with just the middle 
+    // cell having a state of "1"
+    cells[cells.length/2] = 1;  
     generation = 0;
   }
 
   // The process of creating the new generation
   void generate() {
     // First we create an empty array for the new values
     int[] nextgen = new int[cells.length];
-    // For every spot, determine new state by examing current state, and neighbor states
+    // For every spot, determine new state by examing current 
+    // state, and neighbor states
     // Ignore edges that only have one neighor
     for (int i = 1; i < cells.length-1; i++) {
       int left = cells[i-1];   // Left neighbor state
       int me = cells[i];       // Current state
       int right = cells[i+1];  // Right neighbor state
-      nextgen[i] = executeRules(left,me,right); // Compute next generation state based on ruleset
+      // Compute next generation state based on ruleset
+      nextgen[i] = executeRules(left,me,right); 
     }
     // Copy the array into current value
     for (int i = 1; i < cells.length-1; i++) {
@@ -54,7 +58,8 @@ class CA {
     generation++;
   }
 
-  // This is the easy part, just draw the cells, fill 255 for '1', fill 0 for '0'
+  // This is the easy part, just draw the cells, 
+  // fill 255 for '1', fill 0 for '0'
   void render() {
     for (int i = 0; i < cells.length; i++) {
       if (cells[i] == 1) {
@@ -68,7 +73,8 @@ class CA {
   }
 
   // Implementing the Wolfram rules
-  // Could be improved and made more concise, but here we can explicitly see what is going on for each case
+  // Could be improved and made more concise, 
+  // but here we can explicitly see what is going on for each case
   int executeRules (int a, int b, int c) {
     if (a == 1 && b == 1 && c == 1) { return rules[0]; }
     if (a == 1 && b == 1 && c == 0) { return rules[1]; }

Topics/Cellular Automata/Wolfram/Wolfram.pde

@@ -2,25 +2,28 @@
  * Wolfram Cellular Automata
  * by Daniel Shiffman.  
  * 
- * Simple demonstration of a Wolfram's 1-dimensional cellular automata. 
- * When the system reaches bottom of the window, it restarts with a new ruleset. 
+ * Simple demonstration of a Wolfram's 1-dimensional 
+ * cellular automata. When the system reaches bottom 
+ * of the window, it restarts with a new ruleset. 
  * Mouse click restarts as well. 
  */
 
-CA ca;   // An instance object to describe the Wolfram basic Cellular Automata
+CA ca; // An instance object to the cellular automata
 
 void setup() {
   size(640, 360);
-  int[] ruleset = {0,1,0,1,1,0,1,0};    // An initial rule system
-  ca = new CA(ruleset);                 // Initialize CA
+  int[] ruleset = {0,1,0,1,1,0,1,0};  // An initial rule system
+  ca = new CA(ruleset);  // Initialize CA
   background(0);
 }
 
 void draw() {
-  ca.render();    // Draw the CA
+  ca.render();  // Draw the CA
   ca.generate();  // Generate the next level
 
-  if (ca.finished()) {   // If we're done, clear the screen, pick a new ruleset and restart
+  // If we're done, clear the screen, 
+  // pick a new ruleset and restart
+  if (ca.finished()) {  
     background(0);
     ca.randomize();
     ca.restart();
@@ -32,6 +35,3 @@ void mousePressed() {
   ca.randomize();
   ca.restart();
 }
-
-
-

Topics/Simulate/ForcesWithVectors/ForcesWithVectors.pde

@@ -1,9 +1,9 @@
 /**
- * Forces (Gravity and Fluid Resistence) with Vectors 
- * by Daniel Shiffman.  
- * 
- * Demonstration of multiple forces acting on bodies. 
- * Bodies experience gravity continuously and fluid 
+ * Forces (Gravity and Fluid Resistence) with Vectors
+ * by Daniel Shiffman.
+ *
+ * Demonstration of multiple forces acting on bodies.
+ * Bodies experience gravity continuously and fluid
  * resistance when in "water".
  */
 
@@ -60,4 +60,4 @@ void reset() {
   for (int i = 0; i < movers.length; i++) {
     movers[i] = new Mover(random(0.5, 3), 40+i*70, 0);
   }
-}
+}

Topics/Simulate/ForcesWithVectors/Liquid.pde

@@ -7,10 +7,8 @@
  * Bodies experience fluid resistance when in "water"
  */
 
-// Liquid class 
 class Liquid {
 
-
   // Liquid is a rectangle
   float x, y, w, h;
   // Coefficient of drag
@@ -54,4 +52,4 @@ class Liquid {
     fill(127);
     rect(x, y, w, h);
   }
-}
+}

Topics/Simulate/ForcesWithVectors/Mover.pde

@@ -7,7 +7,6 @@
  * Bodies experience fluid resistance when in "water"
  */
 
-
 class Mover {
 
   // position, velocity, and acceleration 
@@ -35,7 +34,6 @@ class Mover {
   }
 
   void update() {
-
     // Velocity changes according to acceleration
     velocity.add(acceleration);
     // position changes by velocity
@@ -59,4 +57,4 @@ class Mover {
       position.y = height;
     }
   }
-}
+}

Topics/Vectors/VectorMath/VectorMath.pde

@@ -2,7 +2,7 @@
  * Vector 
  * by Daniel Shiffman.  
  * 
- * Demonstration some basic vector math: subtraction, 
+ * Demonstration of some basic vector math: subtraction, 
  * normalization, scaling. Normalizing a vector sets 
  * its length to 1.
  */