public void PUT_AddContract([PexAssumeUnderTest] HashSet.HashSet <int> hs, int x) { AssumePrecondition.IsTrue(true); int Old_hsCount = hs.Count; int Old_x = x; bool Old_hsContainsX = hs.Contains(x); //code bool New_Ret = hs.Add(x); int New_hsCount = hs.Count; int New_x = x; bool New_hsContainsX = hs.Contains(x); PexObserve.ValueForViewing("$old_hs_Count", Old_hsCount); PexObserve.ValueForViewing("$new_hs_Count", New_hsCount); PexObserve.ValueForViewing("$old_hs_x", Old_x); PexObserve.ValueForViewing("$new_hs_x", New_x); PexObserve.ValueForViewing("$New_ret", New_Ret); PexObserve.ValueForViewing("$old_hs_contains_x", Old_hsContainsX); PexObserve.ValueForViewing("$new_hs_contains_x", New_hsContainsX); Assert.True(((New_hsContainsX && New_x == Old_x) && ((((New_hsCount == Old_hsCount && (!(New_Ret))) && (((New_x == Old_hsCount && Old_x == Old_hsCount && Old_x == New_hsCount) && New_x == New_hsCount) || ((Old_x != Old_hsCount && New_x != Old_hsCount && Old_x != New_hsCount && New_x != New_hsCount) && (!(New_x == New_hsCount))))) && Old_hsContainsX) || (((New_Ret && New_hsCount == Old_hsCount + 1 && New_hsCount != Old_hsCount) && (((Old_x == Old_hsCount && Old_x != New_hsCount && New_x != New_hsCount) && New_x == Old_hsCount) || ((Old_x != Old_hsCount && New_x != Old_hsCount) && (!(New_x == Old_hsCount))))) && (!(Old_hsContainsX)))))); }
public static MySet.HashSet <string> GetTable(string[] words) { var table = new HashSet.HashSet <string>(); foreach (var word in words) { table.Add(word); } return(table); }
public static MySet.HashSet<string> GetTable(string[] words) { var table = new HashSet.HashSet<string>(); foreach (var word in words) { table.Add(word); } return table; }
public static HashSet.HashSet <int> Create([PexAssumeNotNull] int[] elems) { //PexAssume.IsTrue(elems != null && elems.Length < 11); //PexAssume.TrueForAll(0, elems.Length, _i => elems[_i] > -11 && elems[_i] < 11); PexAssume.AreDistinctValues(elems); HashSet.HashSet <int> ret = new HashSet.HashSet <int>();// DataStructure has big enough capacity for Commutativity Test for (int i = 0; i < elems.Length; i++) { //PexAssume.IsTrue(elems[i] > -101 && elems[i] < 101); // For stack, add any element. //if(!ret.Contains(elems[i])) ret.Add(elems[i]); } return(ret); }
public static HashSet.HashSet <int> CreateChoose(int min, int max) { //PexAssume.IsTrue(elems != null && elems.Length < 11); //PexAssume.AreDistinctValues(elems); //PexChoose. PexAssume.IsTrue(min <= 0 || min > 0); PexAssume.IsTrue(max <= 0 || max > 0); HashSet.HashSet <int> ret = new HashSet.HashSet <int>();// DataStructure has big enough capacity for Commutativity Test //for (int i = 0; i < elems.Length; i++) //{ //PexAssume.IsTrue(elems[i] > -101 && elems[i] < 101); // For stack, add any element. //if(!ret.Contains(elems[i])) ret.Add(PexChoose.ValueFromRange("elements", min, max)); //} return(ret); }