Fixed some typos

Author: neetkee

src/main/java/br/com/leonardoz/features/atomics/UsingAtomics.java

@@ -20,7 +20,7 @@
  * boolean indicating success or not. All atomic, only blocking briefly.
  * 
  * Interesting classes in this package are: AtomicBoolean, AtomicLong,
- * AtomicReference<T>, AtomicMarkablereference<T> and
+ * AtomicReference<T>, AtomicMarkableReference<T> and
  * AtomicReferenceFieldUpdater<T, V>.
  * 
  *

src/main/java/br/com/leonardoz/features/collections/UsingConcurrentCollections.java

@@ -31,7 +31,7 @@ public class UsingConcurrentCollections {
 	 * 
 	 * - size() and isEmpty() can be incorrect. Don't rely on them.
 	 * 
-	 * - Supports atomic operations, doen't need client side locking.
+	 * - Supports atomic operations, don't need client side locking.
 	 * 
 	 * - Readers can access concurrently, and iterator have weak consistency.
 	 * 
@@ -129,7 +129,7 @@ public static void usingCopyOnWriteArrayList() {
 	 * Concurrent Queue interface.
 	 * 
 	 * Implementations: LinkedBlockingQueue, ArrayBlockingQueue,
-	 * PriorirtBlockingQueue, SynchronizedQueue.
+	 * PriorityBlockingQueue, SynchronizedQueue.
 	 * 
 	 * Used for the Producer-Consumer pattern.
 	 * 

src/main/java/br/com/leonardoz/features/executors/UsingExecutors.java

@@ -62,12 +62,12 @@ public static void usingCachedThreadPool() {
 		ExecutorService cachedThreadPool = Executors.newCachedThreadPool();
 		List<Future<UUID>> uuids = new LinkedList<>();
 		for (int i = 0; i < 10; i++) {
-			Future<UUID> submited = cachedThreadPool.submit(() -> {
+			Future<UUID> submitted = cachedThreadPool.submit(() -> {
 				UUID randomUUID = UUID.randomUUID();
 				System.out.println("UUID " + randomUUID + " from " + Thread.currentThread().getName());
 				return randomUUID;
 			});
-			uuids.add(submited);
+			uuids.add(submitted);
 		}
 		cachedThreadPool.execute(() -> uuids.forEach((f) -> {
 			try {
@@ -91,12 +91,12 @@ public static void usingFixedThreadPool() {
 		ExecutorService fixedPool = Executors.newFixedThreadPool(4);
 		List<Future<UUID>> uuids = new LinkedList<>();
 		for (int i = 0; i < 20; i++) {
-			Future<UUID> submited = fixedPool.submit(() -> {
+			Future<UUID> submitted = fixedPool.submit(() -> {
 				UUID randomUUID = UUID.randomUUID();
 				System.out.println("UUID " + randomUUID + " from " + Thread.currentThread().getName());
 				return randomUUID;
 			});
-			uuids.add(submited);
+			uuids.add(submitted);
 		}
 		fixedPool.execute(() -> uuids.forEach((f) -> {
 			try {

src/main/java/br/com/leonardoz/features/futures/UsingCompletableFuture.java

@@ -130,7 +130,7 @@
  * 
  * CompletableFuture.join() // same as get
  * 
- * CompletableFuture.getNow(valueIfAbsent) // immediatly return
+ * CompletableFuture.getNow(valueIfAbsent) // immediately return
  * 
  * CompletableFuture.completeExceptionally() // completes throwing a exception
  * 

src/main/java/br/com/leonardoz/patterns/controlled_initialization/ControlledInitialization.java

@@ -11,7 +11,7 @@
  * speed up the process. And in order to proceed with the programming logic
  * flux, it's important to ensure that the initialization has been completed.
  * 
- * Intent: Use CountDownLatche to crate a controlled concurrent initialization
+ * Intent: Use CountDownLatch to crate a controlled concurrent initialization
  * mechanism.
  * 
  * Applicability: When you have multiple expensive resources being initialized