From 7ed88d289b0bbc00b097e345dfac90208038cab3 Mon Sep 17 00:00:00 2001
From: bculkin2442 <bjculkin@mix.wvu.edu>
Date: Tue, 22 Mar 2016 12:29:26 -0400
Subject: General formatting changes

---
 .../src/examples/java/bjc/utils/examples/BinarySearcher.java |  8 +++++---
 .../bjc/utils/examples/parsing/DiceASTLanguageState.java     | 12 ++++++++----
 .../java/bjc/utils/examples/parsing/TreeConstructTest.java   |  9 ++++++---
 3 files changed, 19 insertions(+), 10 deletions(-)

(limited to 'BJC-Utils2/src/examples')

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 18fdbc6..b8a8ef9 100644
--- a/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearcher.java
+++ b/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearcher.java
@@ -14,7 +14,9 @@ import bjc.utils.funcdata.bst.BinarySearchTree;
 public class BinarySearcher {
 	/**
 	 * Main method of class
-	 * @param args Unused CLI args
+	 * 
+	 * @param args
+	 *            Unused CLI args
 	 */
 	public static void main(String[] args) {
 		Scanner s = new Scanner(System.in);
@@ -23,8 +25,8 @@ public class BinarySearcher {
 
 		char c = 'n';
 
-		BinarySearchTree<Character> bst = new BinarySearchTree<>(
-				(o1, o2) -> o1 - o2);
+		BinarySearchTree<Character> bst =
+				new BinarySearchTree<>((o1, o2) -> o1 - o2);
 
 		while (c != 'e') {
 			System.out.print("Enter a command (m for help): ");
diff --git a/BJC-Utils2/src/examples/java/bjc/utils/examples/parsing/DiceASTLanguageState.java b/BJC-Utils2/src/examples/java/bjc/utils/examples/parsing/DiceASTLanguageState.java
index 5513d62..9d34a18 100644
--- a/BJC-Utils2/src/examples/java/bjc/utils/examples/parsing/DiceASTLanguageState.java
+++ b/BJC-Utils2/src/examples/java/bjc/utils/examples/parsing/DiceASTLanguageState.java
@@ -8,11 +8,12 @@ import bjc.utils.dice.ast.DiceASTExpression;
 
 /**
  * Internal state of the AST-based dice langugae
+ * 
  * @author ben
  *
  */
-public class DiceASTLanguageState
-		extends Pair<DiceExpressionParser, Map<String, DiceASTExpression>> {
+public class DiceASTLanguageState extends
+		Pair<DiceExpressionParser, Map<String, DiceASTExpression>> {
 
 	/**
 	 * Create a new state
@@ -22,8 +23,11 @@ public class DiceASTLanguageState
 
 	/**
 	 * Create a new state with the given contents
-	 * @param left The parser to use
-	 * @param right The enviroment to use
+	 * 
+	 * @param left
+	 *            The parser to use
+	 * @param right
+	 *            The enviroment to use
 	 */
 	public DiceASTLanguageState(DiceExpressionParser left,
 			Map<String, DiceASTExpression> right) {
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 2b40268..fe84eb5 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
@@ -11,13 +11,16 @@ import bjc.utils.parserutils.TreeConstructor;
 
 /**
  * Test of tree constructor
+ * 
  * @author ben
  *
  */
 public class TreeConstructTest {
 	/**
 	 * Main method
-	 * @param args Unused CLI args
+	 * 
+	 * @param args
+	 *            Unused CLI args
 	 */
 	public static void main(String[] args) {
 		Scanner scn = new Scanner(System.in);
@@ -33,8 +36,8 @@ public class TreeConstructTest {
 
 		System.out.println("Shunted: " + ls.toString());
 
-		AST<String> ast = TreeConstructor.constructTree(ls,
-				new Predicate<String>() {
+		AST<String> ast =
+				TreeConstructor.constructTree(ls, new Predicate<String>() {
 					@Override
 					public boolean test(String tok) {
 						switch (tok) {
-- 
cgit v1.2.3