/// <summary> /// Distributings the card. /// this function will get parameter from the user like number of players, number of card to be distributed and the deck array. /// it will show in 2d array distributedPages /// </summary> /// <param name="players">The players.</param> /// <param name="cards">The cards.</param> /// <param name="shuffleDeck">The shuffle deck.</param> /// <exception cref="Exception"></exception> public static void DistributingCard(int players, int cards, String[] shuffleDeck) { try { QueueUsingLinkedList playersque = new QueueUsingLinkedList(); QueueUsingLinkedList cardsque = new QueueUsingLinkedList(); for (int i = 0; i < players * cards; i++) { cardsque.Enqueue(shuffleDeck[i]);//cards are enqueue in cardsque } for (int i = 0; i < players; i++) { playersque.Enqueue("Player:" + (i + 1));//players are enqueue in playersque } playersque.Show(); while (!playersque.IsEmpty()) { Console.WriteLine(playersque.Get()); for (int j = 0; j < cards; j++) { Console.Write(cardsque.Get() + " "); cardsque.Dequeue(); } Console.WriteLine(""); playersque.Dequeue(); } } catch (Exception e) { throw new Exception(e.Message); } }
public void VerifyPushInQueue() { var actual = new QueueUsingLinkedList(); actual.Enqueue(12); actual.Enqueue(14); actual.Enqueue(16); Assert.AreEqual(3, actual.Count()); }
public void Enqueue() { QueueUsingLinkedList <int> queue = new QueueUsingLinkedList <int>(); queue.Enqueue(10); queue.Enqueue(20); queue.Enqueue(30); queue.Enqueue(40); //10 <- 20 <- 30 <- 40 Assert.AreEqual(queue.Count, 4); }
public void VerifyPeekInQueue() { var actual = new QueueUsingLinkedList(); actual.Enqueue(12); actual.Enqueue(14); actual.Enqueue(16); Assert.AreEqual(3, actual.Count()); var value = actual.Peek(); Assert.AreEqual(12, value); Assert.AreEqual(3, actual.Count()); }
public void Clear() { QueueUsingLinkedList <int> queue = new QueueUsingLinkedList <int>(); queue.Enqueue(10); queue.Enqueue(20); queue.Enqueue(30); queue.Enqueue(40); //10 <- 20 <- 30 <- 40 queue.Dequeue(); queue.Dequeue(); queue.Dequeue(); queue.Dequeue(); Assert.AreEqual(queue.Count(), 0); }
public void Peek() { QueueUsingLinkedList <int> queue = new QueueUsingLinkedList <int>(); queue.Enqueue(10); queue.Enqueue(20); queue.Enqueue(30); queue.Enqueue(40); //10 <- 20 <- 30 <- 40 queue.Dequeue(); queue.Dequeue(); //30 <- 40 Assert.AreEqual(queue.Peek(), 30); }
public void QueueUsingLinkedList_Basic() { var q = new QueueUsingLinkedList<int>(); q.Enqueue(1); var data = q.Dequeue(); Assert.AreEqual(1, data); q.Enqueue(2); q.Enqueue(3); q.Enqueue(4); q.Enqueue(5); data = q.Dequeue(); Assert.AreEqual(2, data); data = q.Dequeue(); Assert.AreEqual(3, data); data = q.Dequeue(); Assert.AreEqual(4, data); data = q.Dequeue(); Assert.AreEqual(5, data); }
public void QueueUsingLinkedList_ThrowsException_WhenDequeingFromEmptyQueue() { var q = new QueueUsingLinkedList<int>(); q.Dequeue(); }