public void PeekTest()
{
var stack = new Stack.Stack <int>();
stack.Push(7);
stack.Push(8);
Assert.Equal(8, stack.peek());
}
public void PushTest()
{
var stack = new Stack.Stack <int>();
stack.Push(7);
stack.Push(8);
Assert.Equal(8, stack.data[stack.count - 1]);
}
public void ClearTest()
{
var stack = new Stack.Stack <int>();
stack.Push(7);
stack.Push(8);
stack.clear();
Assert.Equal(0, stack.data[0]);
}
public void Test()
{
Stack.Stack<int> stack=new Stack.Stack<int>();
stack.Push(1);
stack.Push(2);
stack.Push(2);
stack.Push(2);
Console.WriteLine(stack.Size);
Console.WriteLine(stack.Top());
Console.WriteLine(stack.Pop());
Console.WriteLine(stack.Pop());
Console.WriteLine(stack.Size);
}
public void PUT_PushContract([PexAssumeUnderTest] Stack.Stack <int> s1, int x)
{
AssumePrecondition.IsTrue(true);
int Old_s1Count = s1.Count;
int Old_Top = s1.Count > 0 ? s1.Peek() : PexChoose.Value <int>("old_top");
//int Old_Top = s1.Count > 0 ? s1.Peek() : x--;
//int Old_Top = s1.Peek();
int Old_x = x;
bool Old_s1ContainsX = s1.Contains(x);
s1.Push(x);
int New_s1Count = s1.Count;
int New_Top = s1.Peek();
int New_x = x;
bool New_s1ContainsX = s1.Contains(x);
PexObserve.ValueForViewing("$old_s1_Count", Old_s1Count);
PexObserve.ValueForViewing("$new_s1_Count", New_s1Count);
PexObserve.ValueForViewing("$old_s1_Peek", Old_Top);
PexObserve.ValueForViewing("$new_s1_Peek", New_Top);
PexObserve.ValueForViewing("$old_s1_x", Old_x);
PexObserve.ValueForViewing("$new_s1_x", New_x);
PexObserve.ValueForViewing("$Old_s1ContainsX", Old_s1ContainsX);
PexObserve.ValueForViewing("$New_s1ContainsX", New_s1ContainsX);
Assert.True(((New_s1ContainsX && New_s1Count == 1 + Old_s1Count && Old_x == New_Top && New_x == New_Top)));
}
public void MainTest()
{
var sut = new Stack.Stack <int>();
sut.Push(5);
PopAndAssert(sut, 5);
Assert.ThrowsException <InvalidOperationException>(() => sut.Pop());
sut.Push(7);
sut.Push(9);
sut.Push(1);
PopAndAssert(sut, 1);
PopAndAssert(sut, 9);
PopAndAssert(sut, 7);
}
public static Stack.Stack <int> Create([PexAssumeNotNull] int[] elems)
{
//PexAssume.AreDistinctValues(elems);
PexAssume.TrueForAll(elems, e => e <= -6 || e > -6);
//PexAssume.TrueForAll(0, elems.Length, _i => elems[_i] < -2 || elems[_i] >= 2);
Stack.Stack <int> ret = new Stack.Stack <int>();
for (int i = 0; i < elems.Length; i++)
{
ret.Push(elems[i]);
}
return(ret);
}
public static Stack.Stack <int> Create([PexAssumeNotNull] int[] elems)
{
//PexAssume.IsTrue(elems != null && elems.Length < 11);
PexAssume.TrueForAll(0, elems.Length, _i => elems[_i] > -11 && elems[_i] < 11);
Stack.Stack <int> ret = new Stack.Stack <int>(elems.Length + 2);// DataStructure has big enough capacity for Commutativity Test
for (int i = 0; i < elems.Length; i++)
{
// For stack, add any element.
ret.Push(elems[i]);
}
return(ret);
}
public static Stack.Stack <int> SortStack(Stack.Stack <int> stack)
{
Stack.Stack <int> rstk = new Stack.Stack <int>();
while (!stack.IsEmpty())
{
int temp = stack.Pop();
while (!rstk.IsEmpty() && rstk.Peek() > temp)
{
stack.Push(rstk.Pop());
}
rstk.Push(temp);
}
return(rstk);
}
static void Main(string[] args)
{
int[] input = { 1, 4, 5, 3, 2, 10 };
Stack.Stack <int> stack = new Stack.Stack <int>();
for (int i = 0; i < input.Length; i++)
{
stack.Push(input[i]);
}
stack.Print();
Console.WriteLine();
var sortedStack = SortStack(stack);
sortedStack.Print();
Console.ReadLine();
}