static void Main(string[] args)
{
Console.WriteLine("Code Sample: Kevin Salicos");
var deck = new PokerDeck_52();
Console.WriteLine("Base:");
Console.WriteLine(deck);
deck.Shuffle();
Console.WriteLine("Shuffled:");
Console.WriteLine(deck);
deck.Sort();
Console.WriteLine("Sorted:");
Console.WriteLine(deck);
var results = new int[52];
var count = 100000f;
for (var i = 0; i < count; i++)
{
deck = new PokerDeck_52();
deck.Shuffle();
for (var j = 0; j < 52; j++)
{
results[j] += (int)deck.GetNext().Rank;
}
}
Console.WriteLine("Average Value At Position: ");
Console.WriteLine(string.Format("0: {0}", results[0] / count));
Console.WriteLine(string.Format("20: {0}", results[20] / count));
Console.WriteLine(string.Format("51: {0}", results[51] / count));
Console.ReadLine();
}
public void PokerDeckSorted()
{
//Note: This test is useless if shuffle fails
var deck = new PokerDeck_52();
deck.Shuffle();
deck.Sort();
Assert.IsTrue(deck.IsSorted());
}
public void PokerDeckShuffled()
{
//I'll leave deep analysis to the math majors. If the list isn't still in order, it's shuffled
//Visual inspection should give a good idea of how effective we were
//I mainly just want to make sure it doesn't crash.
var deck = new PokerDeck_52();
deck.Shuffle();
Assert.IsFalse(deck.IsSorted());
}
public void SortCheckWorks()
{
var deck = new PokerDeck_52(false);
deck.PutOnBottom(new PokerCard(PokerCard.Ranks.Two, PokerCard.Suits.Spades));
deck.PutOnBottom(new PokerCard(PokerCard.Ranks.Five, PokerCard.Suits.Spades));
deck.PutOnBottom(new PokerCard(PokerCard.Ranks.Ace, PokerCard.Suits.Hearts));
deck.PutOnBottom(new PokerCard(PokerCard.Ranks.Ace, PokerCard.Suits.Spades));
Assert.IsTrue(deck.IsSorted());
deck.PutOnBottom(new PokerCard(PokerCard.Ranks.Three, PokerCard.Suits.Spades));
Assert.IsFalse(deck.IsSorted());
}
public void PokerDeckEmptyConstructorRuns()
{
var deck = new PokerDeck_52(false);
Assert.AreEqual(deck.Count, 0);
}
public void PokerDeckConstructorRuns()
{
var deck = new PokerDeck_52();
Assert.AreEqual(deck.Count, 52);
}
