Some typo fixes (#326)

Author: Gama11

src/checkstyle/Checker.hx

@@ -15,7 +15,6 @@ import checkstyle.token.TokenTree;
 import checkstyle.token.TokenTreeBuilder;
 
 using checkstyle.utils.ArrayUtils;
-using StringTools;
 
 class Checker {
 

src/checkstyle/checks/block/ConditionalCompilationCheck.hx

@@ -33,7 +33,7 @@ class ConditionalCompilationCheck extends Check {
 	function checkSingleLine(tok:TokenTree, line:Int):Bool {
 		var endTok:TokenTree = null;
 
-		for (child in tok.childs) {
+		for (child in tok.children) {
 			switch (child.tok) {
 				case Sharp("end"):
 					endTok = child;
@@ -67,7 +67,7 @@ class ConditionalCompilationCheck extends Check {
 			case ALIGNED:
 				if (checkIndentation(tok, linePos)) return;
 		}
-		for (childTok in tok.childs) {
+		for (childTok in tok.children) {
 			switch (childTok.tok) {
 				case Sharp("else"), Sharp("elseif"), Sharp("end"):
 					var childLinePos:LinePos = checker.getLinePos(childTok.pos.min);
@@ -106,7 +106,7 @@ class ConditionalCompilationCheck extends Check {
 		var nextLen:Int = -1;
 
 		var lineIndex:Int = linePos.line - 1;
-		while (lineIndex >= 0)  {
+		while (lineIndex >= 0) {
 			var line:String = checker.lines[lineIndex];
 			prevLen = getIndentLength(line);
 			if (prevLen >= 0) break;

src/checkstyle/checks/block/EmptyBlockCheck.hx

@@ -83,19 +83,19 @@ class EmptyBlockCheck extends Check {
 	}
 
 	function checkForText(brOpen:TokenTree) {
-		if (brOpen.childs.length == 1) {
+		if (brOpen.children.length == 1) {
 			logPos("Empty block should contain a comment or a statement", brOpen.pos);
 			return;
 		}
 	}
 
 	function checkForStatement(brOpen:TokenTree) {
-		if (brOpen.childs.length == 1) {
+		if (brOpen.children.length == 1) {
 			logPos("Empty block should contain a statement", brOpen.pos);
 			return;
 		}
 		var onlyComments:Bool = true;
-		for (child in brOpen.childs) {
+		for (child in brOpen.children) {
 			switch (child.tok) {
 				case Comment(_), CommentLine(_):
 				case BrClose:
@@ -108,8 +108,8 @@ class EmptyBlockCheck extends Check {
 	}
 
 	function checkForEmpty(brOpen:TokenTree) {
-		if (brOpen.childs.length > 1) return;
-		var brClose:TokenTree = brOpen.childs[0];
+		if (brOpen.children.length > 1) return;
+		var brClose:TokenTree = brOpen.children[0];
 		if (brOpen.pos.max != brClose.pos.min) logPos('Empty block should be written as "{}"', brOpen.pos);
 	}
 }

src/checkstyle/checks/block/LeftCurlyCheck.hx

@@ -178,13 +178,13 @@ class LeftCurlyCheck extends Check {
 		try {
 			if (curlyAtEOL) {
 				logErrorIf((option == NL), "Left curly should be on new line (only whitespace before curly)", pos);
-				logErrorIf((option == NLOW) && wrapped, "Left curly should be on new line (previous expression is split over muliple lines)", pos);
+				logErrorIf((option == NLOW) && wrapped, "Left curly should be on new line (previous expression is split over multiple lines)", pos);
 				logErrorIf((option != EOL) && (option != NLOW), "Left curly unknown option ${option}", pos);
 				return;
 			}
-			logErrorIf((option == EOL), "Left curly should be at EOL (only linebreak or comment after curly)", pos);
+			logErrorIf((option == EOL), "Left curly should be at EOL (only line break or comment after curly)", pos);
 			logErrorIf((!curlyOnNL), "Left curly should be on new line (only whitespace before curly)", pos);
-			logErrorIf((option == NLOW) && !wrapped, "Left curly should be at EOL (previous expression is not split over muliple lines)", pos);
+			logErrorIf((option == NLOW) && !wrapped, "Left curly should be at EOL (previous expression is not split over multiple lines)", pos);
 			logErrorIf((option != NL) && (option != NLOW), "Left curly unknown option ${option}", pos);
 		}
 		catch (e:String) {

src/checkstyle/checks/block/NeedBracesCheck.hx

@@ -63,7 +63,7 @@ class NeedBracesCheck extends Check {
 	}
 
 	function checkIfChild(token:TokenTree) {
-		if (token == null || !token.hasChilds()) return;
+		if (token == null || !token.hasChildren()) return;
 
 		var lastChild:TokenTree = token.getLastChild();
 		if (Type.enumEq(lastChild.tok, Kwd(KwdElse))) {
@@ -78,12 +78,12 @@ class NeedBracesCheck extends Check {
 	}
 
 	function checkFunctionChild(token:TokenTree) {
-		if (token == null || !token.hasChilds()) return;
+		if (token == null || !token.hasChildren()) return;
 
 		var lastChild:TokenTree = token.getLastChild();
 		switch (lastChild.tok) {
 			case Const(CIdent(_)), Kwd(KwdNew):
-				if (!lastChild.hasChilds()) return;
+				if (!lastChild.hasChildren()) return;
 				lastChild = lastChild.getLastChild();
 			default:
 		}
@@ -98,7 +98,7 @@ class NeedBracesCheck extends Check {
 	}
 
 	function checkDoWhileChild(token:TokenTree) {
-		if (token == null || !token.hasChilds()) return;
+		if (token == null || !token.hasChildren()) return;
 
 		var lastChild:TokenTree = token.getLastChild();
 		var expr:TokenTree = lastChild.previousSibling;
@@ -111,7 +111,7 @@ class NeedBracesCheck extends Check {
 	}
 
 	function checkWhileChild(token:TokenTree) {
-		if (token == null || !token.hasChilds() || Type.enumEq(token.parent.tok, Kwd(KwdDo))) return;
+		if (token == null || !token.hasChildren() || Type.enumEq(token.parent.tok, Kwd(KwdDo))) return;
 		var lastChild:TokenTree = token.getLastChild();
 		switch (lastChild.tok) {
 			case BrOpen:
@@ -122,7 +122,7 @@ class NeedBracesCheck extends Check {
 	}
 
 	function checkLastChild(token:TokenTree) {
-		if (token == null || !token.hasChilds()) return;
+		if (token == null || !token.hasChildren()) return;
 
 		var lastChild:TokenTree = token.getLastChild();
 		switch (lastChild.tok) {

src/checkstyle/checks/coding/HiddenFieldCheck.hx

@@ -42,10 +42,10 @@ class HiddenFieldCheck extends Check {
 	}
 
 	function checkMethod(method:TokenTree, memberNames:Array<String>, ignoreFormatRE:EReg) {
-		if (!method.hasChilds()) throw "function has invalid structure!";
+		if (!method.hasChildren()) throw "function has invalid structure!";
 
 		// handle constructor and setters
-		var methodName:TokenTree = method.childs[0];
+		var methodName:TokenTree = method.children[0];
 		if (methodName.is(Kwd(KwdNew)) && ignoreConstructorParameter) return;
 		if (ignoreSetter && isSetterFunction(methodName, memberNames)) return;
 		switch (methodName.tok) {
@@ -81,15 +81,15 @@ class HiddenFieldCheck extends Check {
 		if ((paramDef == null) || (paramDef.length != 1)) {
 			throw "function parameters have invalid structure!";
 		}
-		var paramList:Array<TokenTree> = paramDef[0].childs;
+		var paramList:Array<TokenTree> = paramDef[0].children;
 		for (param in paramList) checkName(param, memberNames, "Parameter definition");
 	}
 
 	function checkVars(method:TokenTree, memberNames:Array<String>) {
 		var vars:Array<TokenTree> = method.filter([Kwd(KwdVar)], ALL);
 		for (v in vars) {
-			if (!v.hasChilds()) throw "var has invalid structure!";
-			checkName(v.childs[0], memberNames, "Variable definition");
+			if (!v.hasChildren()) throw "var has invalid structure!";
+			checkName(v.children[0], memberNames, "Variable definition");
 		}
 	}
 
@@ -99,8 +99,8 @@ class HiddenFieldCheck extends Check {
 			var popens:Array<TokenTree> = f.filter([POpen], FIRST, 2);
 			if (popens.length <= 0) continue;
 			var pOpen:TokenTree = popens[0];
-			if (!pOpen.hasChilds()) continue;
-			checkName(pOpen.childs[0], memberNames, "For loop definition");
+			if (!pOpen.hasChildren()) continue;
+			checkName(pOpen.children[0], memberNames, "For loop definition");
 		}
 	}
 
@@ -124,8 +124,8 @@ class HiddenFieldCheck extends Check {
 		//          |- Kwd(KwdFunction)
 		var varFields:Array<TokenTree> = clazz.filter([Kwd(KwdVar)], FIRST, MAX_FIELD_LEVEL);
 		for (member in varFields) {
-			if (!member.hasChilds()) continue;
-			switch (member.childs[0].tok) {
+			if (!member.hasChildren()) continue;
+			switch (member.children[0].tok) {
 				case Const(CIdent(name)): memberNames.push(name);
 				default:
 			}

src/checkstyle/checks/coding/InnerAssignmentCheck.hx

@@ -90,8 +90,8 @@ class InnerAssignmentCheck extends Check {
 		var parent:TokenTree;
 		if (Type.enumEq(token.parent.tok, BrOpen)) {
 			var brOpen:TokenTree = token.parent;
-			// parent is a block and has more than two childs
-			if (brOpen.childs.length > 2) return true;
+			// parent is a block and has more than two children
+			if (brOpen.children.length > 2) return true;
 			parent = brOpen.parent;
 		}
 		else {

src/checkstyle/checks/coding/MultipleVariableDeclarationsCheck.hx

@@ -22,7 +22,7 @@ class MultipleVariableDeclarationsCheck extends Check {
 			if (lastVarLineNo > 0 && lastVarLineNo == curVarLineNo) logPos("Only one variable definition per line allowed", v.pos);
 			lastVarLineNo = curVarLineNo;
 			var count = 0;
-			for (c in v.childs) {
+			for (c in v.children) {
 				switch (c.tok) {
 					case Const(CIdent(name)):
 						count++;

src/checkstyle/checks/coding/ReturnCountCheck.hx

@@ -28,7 +28,7 @@ class ReturnCountCheck extends Check {
 				default:
 			}
 			if (isPosSuppressed(fn.pos)) continue;
-			if (!fn.hasChilds()) throw "function has invalid structure!";
+			if (!fn.hasChildren()) throw "function has invalid structure!";
 			var returns = fn.filterCallback(filterReturns);
 			if (returns.length > max) {
 				logPos('Return count is ${returns.length} (max allowed is ${max})', fn.pos);

src/checkstyle/checks/coding/SimplifyBooleanReturnCheck.hx

@@ -21,7 +21,7 @@ class SimplifyBooleanReturnCheck extends Check {
 			if (elseLiteral == null) continue;
 
 			var elseStatement = elseLiteral.getFirstChild();
-			var thenStatement = token.childs[1];
+			var thenStatement = token.children[1];
 
 			if (canReturnOnlyBooleanLiteral(thenStatement) && canReturnOnlyBooleanLiteral(elseStatement)) {
 				logPos("Conditional logic can be removed", token.pos);