Formatting changes

2 files changed, 64 insertions, 64 deletions

diff --git a/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearcher.java b/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearcher.java
index f7c15b9..8fefe70 100644
--- a/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearcher.java
+++ b/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearcher.java
@@ -12,6 +12,59 @@ import bjc.utils.funcdata.bst.TreeLinearizationMethod;
  *
  */
 public class BinarySearcher {
+	private static void displayTree(BinarySearchTree<Character> tree,
+			Scanner inputSource) {
+		System.out.print(
+				"What order would you like the tree to be printed in (m for options): ");
+
+		char command;
+
+		while (true) {
+			command = inputSource.nextLine().charAt(0);
+
+			TreeLinearizationMethod linearizationMethod = null;
+
+			switch (command) {
+				case 'm':
+					System.out.println("Possible tree printing methods: ");
+					System.out.println(
+							"\tp: Preorder printing (print parent first, then left & right).");
+					System.out.println(
+							"\ti: Inorder printing (print left first, then parent & right).");
+					System.out.println(
+							"\to: Postorder printing (print left first, then right & parent).");
+					break;
+
+				case 'p':
+					linearizationMethod = TreeLinearizationMethod.PREORDER;
+					break;
+
+				case 'i':
+					linearizationMethod = TreeLinearizationMethod.INORDER;
+					break;
+
+				case 'o':
+					linearizationMethod = TreeLinearizationMethod.POSTORDER;
+					break;
+
+				default:
+					System.out.println("ERROR: Unknown command.");
+			}
+
+			if (linearizationMethod != null) {
+				tree.traverse(linearizationMethod, (element) -> {
+					System.out.println("Node: " + element);
+					return true;
+				});
+
+				return;
+			}
+
+			System.out.print(
+					"What order would you like the tree to be printed in (m for options): ");
+		}
+	}
+
 	/**
 	 * Main method of class
 	 * 
@@ -95,57 +148,4 @@ public class BinarySearcher {
 
 		inputSource.close();
 	}
-
-	private static void displayTree(BinarySearchTree<Character> tree,
-			Scanner inputSource) {
-		System.out.print(
-				"What order would you like the tree to be printed in (m for options): ");
-
-		char command;
-
-		while (true) {
-			command = inputSource.nextLine().charAt(0);
-
-			TreeLinearizationMethod linearizationMethod = null;
-
-			switch (command) {
-				case 'm':
-					System.out.println("Possible tree printing methods: ");
-					System.out.println(
-							"\tp: Preorder printing (print parent first, then left & right).");
-					System.out.println(
-							"\ti: Inorder printing (print left first, then parent & right).");
-					System.out.println(
-							"\to: Postorder printing (print left first, then right & parent).");
-					break;
-
-				case 'p':
-					linearizationMethod = TreeLinearizationMethod.PREORDER;
-					break;
-
-				case 'i':
-					linearizationMethod = TreeLinearizationMethod.INORDER;
-					break;
-
-				case 'o':
-					linearizationMethod = TreeLinearizationMethod.POSTORDER;
-					break;
-
-				default:
-					System.out.println("ERROR: Unknown command.");
-			}
-
-			if (linearizationMethod != null) {
-				tree.traverse(linearizationMethod, (element) -> {
-					System.out.println("Node: " + element);
-					return true;
-				});
-
-				return;
-			}
-
-			System.out.print(
-					"What order would you like the tree to be printed in (m for options): ");
-		}
-	}
 }
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 0d693d7..4eaeadb 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
@@ -14,6 +14,17 @@ import bjc.utils.gen.RandomGrammar;
 public class RandomStringExamples {
 	private static RandomGrammar<String> rg;
 
+	private static void addRule(String rule, String... cases) {
+		IFunctionalList<IFunctionalList<String>> cses = new FunctionalList<>();
+
+		for (String strang : cases) {
+			cses.add(FunctionalStringTokenizer.fromString(strang)
+					.toList(s -> s));
+		}
+
+		rg.makeRule(rule, cses);
+	}
+
 	/**
 	 * Main method
 	 * 
@@ -55,15 +66,4 @@ public class RandomStringExamples {
 			System.out.println(sb.toString().replaceAll("\\s+", " "));
 		}
 	}
-
-	private static void addRule(String rule, String... cases) {
-		IFunctionalList<IFunctionalList<String>> cses = new FunctionalList<>();
-
-		for (String strang : cases) {
-			cses.add(FunctionalStringTokenizer.fromString(strang)
-					.toList(s -> s));
-		}
-
-		rg.makeRule(rule, cses);
-	}
 }