Fixes for prime examples.

Fixed order of removing from queue before checking number.
Fixed calculation of prime.

Author: coderkevin

examples/simple/actions/primes.js

@@ -1,6 +1,6 @@
 
 export const ADD_PRIME = 'ADD_PRIME';
-export const ADD_NON_PRIME = 'ADD_PRIME';
+export const ADD_NON_PRIME = 'ADD_NON_PRIME';
 export const ADD_QUEUE_NUMBER = 'ADD_QUEUE_NUMBER';
 export const REMOVE_QUEUE_NUMBER = 'REMOVE_QUEUE_NUMBER';
 

examples/simple/middleware/primesMiddleware.js

@@ -21,14 +21,14 @@ function checkNextPrime( queue, dispatch ) {
 		console.log( 'checking next number ' + number );
 		checkPrime( number ).then(
 			( isPrime ) => {
+				dispatch( removeQueueNumber( number ) );
 				if ( isPrime ) {
 					console.log( 'number ' + number + ' is prime!' );
 					dispatch( addPrime( number ) );
 				} else {
 					console.log( 'number ' + number + ' is not prime!' );
 					dispatch( addNonPrime( number ) );
 				}
-				dispatch( removeQueueNumber( number ) );
 			}
 		);
 	}
@@ -38,14 +38,15 @@ function checkPrime( number ) {
 	return new Promise(
 		( resolve, reject ) => {
 
-			for ( let i = 0; i < number; i++ ) {
+			for ( let i = 2; i < number; i++ ) {
 				if ( Number.isInteger( number / i ) ) {
-					resolve( true );
+					console.log( number + " is divisible by " + i );
+					resolve( false );
 				}
 			}
 
 			// No numbers below this one divided cleanly, it's prime.
-			resolve( false );
+			resolve( true );
 		}
 	);
 }