Cleanup

1 files changed, 18 insertions, 18 deletions

diff --git a/BJC-Utils2/src/main/java/bjc/utils/esodata/Stack.java b/BJC-Utils2/src/main/java/bjc/utils/esodata/Stack.java
index 21a922d..5f7be6c 100644
--- a/BJC-Utils2/src/main/java/bjc/utils/esodata/Stack.java
+++ b/BJC-Utils2/src/main/java/bjc/utils/esodata/Stack.java
@@ -65,7 +65,7 @@ public abstract class Stack<T> {
 	 *                The number of items to drop.
 	 */
 	public void drop(int n) {
-		for (int i = 0; i < n; i++) {
+		for(int i = 0; i < n; i++) {
 			pop();
 		}
 	}
@@ -109,12 +109,12 @@ public abstract class Stack<T> {
 	public void multidup(int n, int m) {
 		List<T> lst = new ArrayList<>(n);
 
-		for (int i = n; i > 0; i--) {
+		for(int i = n; i > 0; i--) {
 			lst.set(i - 1, pop());
 		}
 
-		for (int i = 0; i < m; i++) {
-			for (T elm : lst) {
+		for(int i = 0; i < m; i++) {
+			for(T elm : lst) {
 				push(elm);
 			}
 		}
@@ -150,17 +150,17 @@ public abstract class Stack<T> {
 
 		T elm = pop();
 
-		for (int i = n; i > 0; i--) {
+		for(int i = n; i > 0; i--) {
 			lst.set(i - 1, pop());
 		}
 
-		for (T nelm : lst) {
+		for(T nelm : lst) {
 			push(nelm);
 		}
 		push(elm);
 
-		for (int i = 1; i < m; i++) {
-			for (T nelm : lst) {
+		for(int i = 1; i < m; i++) {
+			for(T nelm : lst) {
 				push(nelm);
 			}
 		}
@@ -273,13 +273,13 @@ public abstract class Stack<T> {
 	public void dip(int n, Consumer<Stack<T>> cons) {
 		List<T> elms = new ArrayList<>(n);
 
-		for (int i = n; i > 0; i--) {
+		for(int i = n; i > 0; i--) {
 			elms.set(i - 1, pop());
 		}
 
 		cons.accept(this);
 
-		for (T elm : elms) {
+		for(T elm : elms) {
 			push(elm);
 		}
 	}
@@ -319,12 +319,12 @@ public abstract class Stack<T> {
 	public void multicleave(int n, List<Consumer<Stack<T>>> conses) {
 		List<T> elms = new ArrayList<>(n);
 
-		for (int i = n; i > 0; i--) {
+		for(int i = n; i > 0; i--) {
 			elms.set(i - 1, pop());
 		}
 
-		for (Consumer<Stack<T>> cons : conses) {
-			for (T elm : elms) {
+		for(Consumer<Stack<T>> cons : conses) {
+			for(T elm : elms) {
 				push(elm);
 			}
 
@@ -353,10 +353,10 @@ public abstract class Stack<T> {
 	public void multispread(int n, List<Consumer<Stack<T>>> conses) {
 		List<List<T>> nelms = new ArrayList<>(conses.size());
 
-		for (int i = conses.size(); i > 0; i--) {
+		for(int i = conses.size(); i > 0; i--) {
 			List<T> elms = new ArrayList<>(n);
 
-			for (int j = n; j > 0; j--) {
+			for(int j = n; j > 0; j--) {
 				elms.set(j, pop());
 			}
 
@@ -364,8 +364,8 @@ public abstract class Stack<T> {
 		}
 
 		int i = 0;
-		for (List<T> elms : nelms) {
-			for (T elm : elms) {
+		for(List<T> elms : nelms) {
+			for(T elm : elms) {
 				push(elm);
 			}
 
@@ -396,7 +396,7 @@ public abstract class Stack<T> {
 	public void multiapply(int n, int m, Consumer<Stack<T>> cons) {
 		List<Consumer<Stack<T>>> conses = new ArrayList<>(m);
 
-		for (int i = 0; i < m; i++) {
+		for(int i = 0; i < m; i++) {
 			conses.add(cons);
 		}