fix 简化

Author: toolgood

csharp/ToolGood.Algorithm/Internals/Visitors/CharUtil.cs

@@ -29,28 +29,7 @@ public static char StandardChar(char o)
 			}
 			return char.ToUpperInvariant(o);
 		}
-
-		public static string StandardString(string s)
-		{
-			// 快速路径：检查是否需要转换
-			bool needsConversion = false;
-			for(int i = 0; i < s.Length; i++) {
-				char c = s[i];
-				if(c != StandardChar(c)) {
-					needsConversion = true;
-					break;
-				}
-			}
-			if(!needsConversion) return s;
-
-			// 使用 string.Create 减少堆分配
-			return string.Create(s.Length, s, (span, str) => {
-				for(int i = 0; i < str.Length; i++) {
-					span[i] = StandardChar(str[i]);
-				}
-			});
-		}
-
+	 
 		public static bool Equals(string left, char right)
 		{
 			if(left.Length != 1) return false;
@@ -73,13 +52,6 @@ public static bool Equals(string left, string right)
 			return true;
 		}
 
-		public static bool Equals(string left, string arg1, string arg2)
-		{
-			if(Equals(left, arg1)) return true;
-			if(Equals(left, arg2)) return true;
-			return false;
-		}
-
 		public static bool Equals(string left, string arg1, string arg2, string arg3)
 		{
 			if(Equals(left, arg1)) return true;

csharp/ToolGood.Algorithm/Internals/Visitors/MathSplitVisitor.cs

@@ -19,7 +19,7 @@ public ConditionTree VisitAndOr_fun(mathParser.AndOr_funContext context)
 				Nodes = new List<ConditionTree>()
 			};
 			var t = context.op.Text;
-			if(CharUtil.Equals(t, "&&", "and")) {
+			if(CharUtil.Equals(t, "&&")) {
 				tree.Type = ConditionTreeType.And;
 			} else {
 				tree.Type = ConditionTreeType.Or;