// Peek using a queue public void Peek2() { Node node = new Node(15); Qeue que = new Qeue(node); que.Front = node; Assert.Equal(15, que.Front.Value); }
// Showing front of que exists public void Enque2() { Node node = new Node(300); Qeue que = new Qeue(node); que.Front = node; Assert.Equal(300, que.Front.Value); }
// Showing tRear exists in que public void Enque1() { Node node = new Node(125); Qeue que = new Qeue(node); que.Rear = node; Assert.Equal(125, que.Rear.Value); }
// Peek With a queue public void Peek3() { Node node = new Node(125); // Peek at front--which is 125 Qeue que = new Qeue(node); que.Front = node; Assert.Equal(125, que.Front.Value); }
// Shwoing rear and front added to the queue public void Enque3() { Node node1 = new Node(400); Node node2 = new Node(200); Qeue que = new Qeue(node1); que.Front = node2; que.Rear = node1; Assert.Equal(200, que.Front.Value); }
static void Main(string[] args) { Message habbitMQMessage = new HabbitMQMessage(); Qeue habbitMQeue = new Qeue(habbitMQMessage); habbitMQeue.SendMessage(); Message azureServiceBusMessage = new AzureServiceBusMessage(); Qeue azureServiceBusQeue = new Qeue(azureServiceBusMessage); azureServiceBusQeue.SendMessage(); }