diff options
| author | bculkin2442 <bjculkin@mix.wvu.edu> | 2016-03-22 12:29:26 -0400 |
|---|---|---|
| committer | bculkin2442 <bjculkin@mix.wvu.edu> | 2016-03-22 12:29:26 -0400 |
| commit | 7ed88d289b0bbc00b097e345dfac90208038cab3 (patch) | |
| tree | f9e047616595cf2c644752b39fc2a81c83c64f41 /BJC-Utils2/src/examples | |
| parent | 01cb9f504c860bc1c037a44f3a76bf342a293d46 (diff) | |
General formatting changes
Diffstat (limited to 'BJC-Utils2/src/examples')
3 files changed, 19 insertions, 10 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 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) { |