Formatting

5 files changed, 12 insertions, 13 deletions

diff --git a/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearchTest.java b/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearchTest.java
index 1e0a1df..5e42b8f 100644
--- a/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearchTest.java
+++ b/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearchTest.java
@@ -61,13 +61,10 @@ public class BinarySearchTest {
 	 */
 	public static void main(String[] args) {
 		Scanner input = new Scanner(System.in);
-
 		System.out.println("Binary Tree Constructor/Searcher");
-
-		char command = ' ';
-
 		BinarySearchTree<Character> tree = new BinarySearchTree<>((o1, o2) -> o1 - o2);
 
+		char command = ' ';
 		while(command != 'e') {
 			System.out.print("Enter a command (m for help): ");
 			command = input.nextLine().charAt(0);
diff --git a/BJC-Utils2/src/examples/java/bjc/utils/examples/parsing/ShuntTest.java b/BJC-Utils2/src/examples/java/bjc/utils/examples/parsing/ShuntTest.java
index e228765..5f84d6b 100644
--- a/BJC-Utils2/src/examples/java/bjc/utils/examples/parsing/ShuntTest.java
+++ b/BJC-Utils2/src/examples/java/bjc/utils/examples/parsing/ShuntTest.java
@@ -26,6 +26,7 @@ public class ShuntTest {
 		String line = inputSource.nextLine();
 
 		ShuntingYard<String> yard = new ShuntingYard<>(true);
+
 		IList<String> preTokens = new FunctionalStringTokenizer(line).toList(strang -> strang);
 		IList<String> shuntedTokens = yard.postfix(preTokens, strang -> strang);
 
diff --git a/BJC-Utils2/src/examples/java/bjc/utils/examples/parsing/TreeConstructTest.java b/BJC-Utils2/src/examples/java/bjc/utils/examples/parsing/TreeConstructTest.java
index 58a6a5c..27a2c3e 100644
--- a/BJC-Utils2/src/examples/java/bjc/utils/examples/parsing/TreeConstructTest.java
+++ b/BJC-Utils2/src/examples/java/bjc/utils/examples/parsing/TreeConstructTest.java
@@ -29,8 +29,7 @@ public class TreeConstructTest {
 	private static final class OperatorPicker implements Predicate<String> {
 		@Override
 		public boolean test(String token) {
-			if(StringUtils.containsOnly(token, "\\["))
-				return true;
+			if(StringUtils.containsOnly(token, "\\["))      return true;
 			else if(StringUtils.containsOnly(token, "\\]")) return true;
 
 			switch(token) {
@@ -87,14 +86,14 @@ public class TreeConstructTest {
 		System.out.println("Shunted: " + shuntedTokens.toString());
 
 		Predicate<String> specialPicker = (operator) -> {
-			if(StringUtils.containsOnly(operator, "\\["))
-				return true;
+			if(StringUtils.containsOnly(operator, "\\["))      return true;
 			else if(StringUtils.containsOnly(operator, "\\]")) return true;
 
 			return false;
 		};
 
-		IMap<String, Function<Deque<ITree<String>>, ITree<String>>> operators = new FunctionalMap<>();
+		IMap<String, Function<Deque<ITree<String>>, ITree<String>>> operators
+			= new FunctionalMap<>();
 
 		operators.put("[", (queuedTrees) -> {
 			return null;
@@ -120,8 +119,8 @@ public class TreeConstructTest {
 			return arrayTree;
 		});
 
-		ITree<String> constructedTree = TreeConstructor.constructTree(shuntedTokens, new OperatorPicker(),
-				specialPicker, operators::get);
+		ITree<String> constructedTree = TreeConstructor.constructTree(shuntedTokens,
+				new OperatorPicker(), specialPicker, operators::get);
 
 		System.out.println("AST: " + constructedTree.toString());
 
diff --git a/BJC-Utils2/src/examples/java/bjc/utils/examples/rangen/DiabloItemGen.java b/BJC-Utils2/src/examples/java/bjc/utils/examples/rangen/DiabloItemGen.java
index c83c86e..2c84bcc 100644
--- a/BJC-Utils2/src/examples/java/bjc/utils/examples/rangen/DiabloItemGen.java
+++ b/BJC-Utils2/src/examples/java/bjc/utils/examples/rangen/DiabloItemGen.java
@@ -14,7 +14,8 @@ public class DiabloItemGen {
 	private static WeightedGrammar<String> rules = new WeightedGrammar<>();
 
 	private static void addCase(String ruleName, int probability, String ruleParts) {
-		IList<String> parts = FunctionalStringTokenizer.fromString(ruleParts).toList(strang -> strang);
+		IList<String> parts = FunctionalStringTokenizer.fromString(ruleParts)
+			.toList(strang -> strang);
 
 		rules.addCase(ruleName, probability, parts);
 	}
diff --git a/BJC-Utils2/src/examples/java/bjc/utils/examples/rangen/RandomStringExamples.java b/BJC-Utils2/src/examples/java/bjc/utils/examples/rangen/RandomStringExamples.java
index c490107..8546d2e 100644
--- a/BJC-Utils2/src/examples/java/bjc/utils/examples/rangen/RandomStringExamples.java
+++ b/BJC-Utils2/src/examples/java/bjc/utils/examples/rangen/RandomStringExamples.java
@@ -18,7 +18,8 @@ public class RandomStringExamples {
 		IList<IList<String>> cses = new FunctionalList<>();
 
 		for(String strang : cases) {
-			IList<String> lst = FunctionalStringTokenizer.fromString(strang).toList(s -> s);
+			IList<String> lst = FunctionalStringTokenizer.fromString(strang)
+				.toList(s -> s);
 
 			cses.add(lst);
 		}