Java tutorial
/* * The MIT License * * Copyright 2015 Neil McAlister. * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN * THE SOFTWARE. */ package sonicScream.utilities; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.nio.file.Files; import java.nio.file.Path; import java.util.ArrayList; import javafx.scene.control.TreeItem; import org.apache.commons.lang3.StringUtils; /** * * @author Neil McAlister */ public class ScriptParser { private static TreeItem<String> _rootItem = null; private static TreeItem<String> _currentNode = null; private static TreeItem<String> _currentParent = null; //These two are used to track how many braces we've seen--the files we get //out of the VPKs are actually missing a pair of braces. We add the first one in //parseHeaderAndFirstTwoLines, but tracking where the second one belongs requires //tracking the number of brace-pairs after that. private static int _openBraces = 0; private static int _closeBraces = 0; public static TreeItem<String> parseScript(Path script, String fileName) throws IOException { BufferedReader reader = new BufferedReader(new InputStreamReader(Files.newInputStream(script))); return parseScript(reader, fileName); } public static TreeItem<String> parseScript(BufferedReader scriptReader, String fileName) throws IOException { if (fileName.contains(".vsndevts_c")) { return parseCompiledScript(scriptReader, fileName); } else { _rootItem = new TreeItem<>("root"); _currentParent = _rootItem; String line; while ((line = scriptReader.readLine()) != null) { parseLine(line); } return _rootItem; } } private static TreeItem<String> parseCompiledScript(BufferedReader scriptReader, String fileName) throws IOException { _rootItem = new TreeItem<>("root"); _currentParent = _rootItem; parseHeaderAndFirstTwoLines(scriptReader, StringParsing.getScriptNameFromFileName(fileName)); String line; while ((line = scriptReader.readLine()) != null) { if (line.contains("operator_stacks")) { parseNameAndOperatorStacks(line); } else { parseLine(line); } if (line.contains("{")) { _openBraces++; } if (line.contains("}")) { _closeBraces++; } if (_openBraces == _closeBraces && (_openBraces != 0) && (_closeBraces != 0)) { parseLine("}"); _openBraces = 0; _closeBraces = 0; } } return _rootItem; } //This strips out all the header junk and correctly separates and parses the first two lines of the actual script. private static void parseHeaderAndFirstTwoLines(BufferedReader br, String scriptSubject) throws IOException { int seenCount = 0; ArrayList<String> possibleSubjects = new ArrayList<>(); possibleSubjects.add(handleSpecialCaseFiles(scriptSubject)); //Some of the names of "Hero_" in front of them. Account for that possibleSubjects.add("Hero_" + scriptSubject); //Some heroes have underscores in their file name, but no spaces in their name in the script possibleSubjects.add(handleSpecialCaseFiles(scriptSubject).replace("_", "")); //Seek to the end of the header while (seenCount < 2) { String line = br.readLine(); IndexAndSubject ias = getIndexOfSubjectInLine(possibleSubjects, line, 0); int dataStartIndex = ias.index; if (dataStartIndex != -1) { seenCount++; } //Sometimes the entire header is a single line. Check for a second occurrence immediately. if (seenCount < 2 && dataStartIndex != -1) { int secondIndex = getIndexOfSubjectInLine(possibleSubjects, line, dataStartIndex + ias.subject.length()).index; if (secondIndex != -1 && secondIndex != dataStartIndex) { dataStartIndex = secondIndex; seenCount++; } } if (seenCount == 2) { //-1 to account for parseNameAndOperatorStacks name substring starting at index 1 to remove the stray whitespace line = line.substring(dataStartIndex - 1, line.length() - 1); int separatorIndex = line.indexOf("\""); //now we have the sound name and "operator stacks" mashed together //like so: heroname"operator stacks" // We need to add a quote to the beginning of each, then separate these two. parseNameAndOperatorStacks(line); } } } private static String handleSpecialCaseFiles(String scriptSubject) { switch (scriptSubject) { case ("items"): return "DOTA_Item"; } return scriptSubject; } private static void parseNameAndOperatorStacks(String line) { int separatorIndex = line.indexOf("\""); String name = "\"" + line.substring(1, separatorIndex - 1) + "\""; String operator = line.substring(separatorIndex, line.length()); if (operator.charAt(operator.length() - 1) != ('"')) { operator = operator + '"'; } parseLine(name); parseLine("{"); parseLine(operator); } //Basic recursive-descent parser private static void parseLine(String line) throws NullPointerException { //System.out.println(line); //Enable this to write out scripts as they're parsed. Warning: Causes massive slowdown if (StringUtils.isBlank(line)) { return; } //Need this if we want braces commented out too if (line.trim().startsWith("//")) { try { TreeItem<String> newNode = new TreeItem<>(StringUtils.normalizeSpace(line)); _currentNode = newNode; if (_currentNode != null) { _currentParent.getChildren().add(newNode); } } catch (NullPointerException ex) { ex.printStackTrace(); } } else if (line.contains("{")) { _currentParent = _currentNode; } else if (line.contains("}")) { _currentParent = _currentParent.getParent(); if (_currentParent == null) { _currentParent = _rootItem; } } else { try { TreeItem<String> newNode = new TreeItem<>(StringUtils.normalizeSpace(line)); _currentNode = newNode; if (_currentNode != null) { _currentParent.getChildren().add(newNode); } } catch (NullPointerException ex) { ex.printStackTrace(); } } } public static String parseScriptTreeToString(TreeItem<String> currentScriptTree) { TreeItem<String> root = currentScriptTree; StringBuilder scriptString = new StringBuilder(); recursiveBuildScript(scriptString, root, 0); //Remove first, final braces, starting newline. We don't need that first layer of nesting the braces would cause scriptString.deleteCharAt(0); scriptString.deleteCharAt(0); //Remove final brace scriptString.deleteCharAt(scriptString.lastIndexOf("}")); return scriptString.toString(); } private static StringBuilder recursiveBuildScript(StringBuilder scriptString, TreeItem<String> node, int level) { String tabs = ""; for (int i = 1; i < level; i++) { tabs += "\t"; } if (node.getParent() != null) { scriptString.append(tabs + node.getValue() + "\n"); } /* * TODO: Figure out a way to track brace placement without just checking to see if a node has children. Maybe * a custom node object that tracks whether a node is followed by braces? */ if (!node.isLeaf()) { scriptString.append(tabs + "{\n"); level++; for (int i = 0; i < node.getChildren().size(); i++) { scriptString = recursiveBuildScript(scriptString, node.getChildren().get(i), level); } level--; scriptString.append(tabs + "}\n"); } return scriptString; } //TODO: Optimize this. It traverses both trees in their entirety. Can we halt //the instant we get a "false"? public static boolean areScriptTreesEqual(TreeItem<String> lhs, TreeItem<String> rhs) { if (lhs.getChildren().size() != rhs.getChildren().size() || lhs.isLeaf() != rhs.isLeaf()) { return false; } boolean areEqual = true; if (!lhs.isLeaf()) { for (int i = 0; i < lhs.getChildren().size() - 1; i++) { areScriptTreesEqual(lhs.getChildren().get(i), rhs.getChildren().get(i)); } } return lhs.getValue().equals(rhs.getValue()); } private static IndexAndSubject getIndexOfSubjectInLine(ArrayList<String> possibleSubjects, String line, int startIndex) { int index = -1; for (String s : possibleSubjects) { index = line.toLowerCase().indexOf(s.toLowerCase(), startIndex); IndexAndSubject ias = new IndexAndSubject(); ias.index = index; ias.subject = s; if (index != -1) return ias; } IndexAndSubject ias = new IndexAndSubject(); ias.index = -1; ias.subject = null; return ias; } } class IndexAndSubject { int index = -1; String subject; }