mandelbrot: code cleanup

mandelbrot/mandelbrot.c

@@ -17,9 +17,8 @@ double map(int value, int min, int max, int map_min, int map_max)
 
 void mandelbrot(double *field, int w, int h, int bail_out, int max_iter)
 {
-	double xPrime, yPrime, real, imaginary, realPrime,
-	    imaginaryPrime, x2, y2;
-	int  x, y, k;
+	double xPrime, yPrime, real, imaginary, x2, y2;
+	int x, y, k;
 	for (x = 0; x < w; x++) {
 		for (y = 0; y < h; y++) {
 			xPrime = map(x, 0, w, -2, 2);
@@ -37,7 +36,7 @@ void mandelbrot(double *field, int w, int h, int bail_out, int max_iter)
 				// x = real + c
 				xPrime = real + x2;
 				// y = imaginary + c
-				yPrime = imaginary + y2;
+				yPrime = imaginary +y2;
 
 				if ((xPrime * xPrime + yPrime * yPrime) >
 				    bail_out) {
@@ -57,12 +56,11 @@ void mandelbrot(double *field, int w, int h, int bail_out, int max_iter)
 int main(int argc, char **argv)
 {
 
-	double * pix_field;
+	double *pix_field;
 
 	pix_field = malloc(WIDTH * HEIGHT * sizeof(double));
 
-	mandelbrot(pix_field, WIDTH, HEIGHT, BAIL_OUT,
-		   MAX_ITER);
+	mandelbrot(pix_field, WIDTH, HEIGHT, BAIL_OUT, MAX_ITER);
 
 	pix_row rows[WIDTH];
 	pix p;
@@ -76,9 +74,15 @@ int main(int argc, char **argv)
 	for (int i = 0; i < WIDTH; i++) {
 		rows[i].p = malloc(HEIGHT * sizeof(pix));
 		for (int j = 0; j < HEIGHT; j++) {
-			p.r = map(pix_field[i * HEIGHT + j], 0, MAX_ITER, 0, 255);
-			p.g = map(pix_field[i * HEIGHT + j], 0, MAX_ITER, 0, 255);
-			p.b = map(pix_field[i * HEIGHT + j], 0, MAX_ITER, 0, 255);
+			p.r =
+			    map(pix_field[i * HEIGHT + j], 0, MAX_ITER, 0,
+				255);
+			p.g =
+			    map(pix_field[i * HEIGHT + j], 0, MAX_ITER, 0,
+				255);
+			p.b =
+			    map(pix_field[i * HEIGHT + j], 0, MAX_ITER, 0,
+				255);
 			rows[i].p[j] = p;
 		}
 	}