Changeset 15725 for branches/2886_SymRegGrammarEnumeration/Test

Timestamp:

02/06/18 16:21:16 (7 years ago)

Author:

lkammere

Message:

#2886: Refactor tree hash function.

File:

• branches/2886_SymRegGrammarEnumeration/Test/TreeHashingTest.cs (modified) (1 diff)

branches/2886_SymRegGrammarEnumeration/Test/TreeHashingTest.cs

@@ -81 +81 @@
       Assert.AreEqual(hash1, hash2);
     }
+
+    [TestMethod]
+    [TestCategory("TreeHashing")]
+    public void ComplexInequality() {
+      SymbolString s1 = new SymbolString(new[] { varA, varA, varA, grammar.Multiplication, grammar.Multiplication });
+      SymbolString s2 = new SymbolString(new[] { varA, varA, varA, grammar.Multiplication, grammar.Addition });
+
+      int hash1 = grammar.CalcHashCode(s1);
+      int hash2 = grammar.CalcHashCode(s2);
+
+      Assert.AreNotEqual(hash1, hash2);
+    }
+
+
+    #region parser
+
+    [TestMethod]
+    [TestCategory("Parser")]
+    public void InfixParserSimpleTest() {
+      SymbolString postfix = new SymbolString(new[] { varA, varB, varC, grammar.Addition, grammar.Addition });
+      SymbolString infix = new SymbolString(new[] { varA, grammar.Addition, varB, grammar.Addition, varC });
+
+      Assert.AreEqual(infix.ToString(), grammar.PostfixToInfixParser(postfix).ToString());
+    }
+
+    [TestMethod]
+    [TestCategory("Parser")]
+    public void InfixParserComplexTest() {
+      SymbolString postfix = new SymbolString(new[] { varB, varA, varB, varC, grammar.Multiplication, grammar.Addition, grammar.Addition});
+      SymbolString infix = new SymbolString(new[] { varB, grammar.Addition, varA, grammar.Addition, varB, grammar.Multiplication, varC });
+
+      Assert.AreEqual(infix.ToString(), grammar.PostfixToInfixParser(postfix).ToString());
+    }
+
+    #endregion
   }
 }