Function TestDequeue

topics/go/algorithms/data/queue/queue_test.go:118–161

TestDequeue validates the Dequeue functionality.

(t *testing.T)

// TestDequeue validates the Dequeue functionality.
func TestDequeue(t *testing.T) {
	t.Log("Given the need to test Dequeue functionality.")
	{
		const items = 5
		t.Logf("\tTest 0:\tWhen dequeuing %d items", items)
		{
			q, err := queue.New(items)
			if err != nil {
				t.Fatalf("\t%s\tTest 0:\tShould be able to create a queue for %d items : %v", failed, items, err)
			}
			t.Logf("\t%s\tTest 0:\tShould be able to create a queue for %d items.", succeed, items)

			var orgData string
			for i := 0; i < items; i++ {
				name := fmt.Sprintf("Name%d", i)
				orgData += name
				if err := q.Enqueue(&queue.Data{Name: name}); err != nil {
					t.Fatalf("\t%s\tTest 0:\tShould be able to enqueue item %d in the queue : %v", failed, i+1, err)
				}
			}

			if q.Count != items {
				t.Logf("\t%s\tTest 0:\tShould be able to enqueue %d items.", failed, items)
				t.Fatalf("\t\tTest 0:\tGot %d, Expected %d.", q.Count, items)
			}
			t.Logf("\t%s\tTest 0:\tShould be able to enqueue %d items.", succeed, items)

			var data string
			for i := 0; i < items; i++ {
				d, err := q.Dequeue()
				if err != nil {
					t.Fatalf("\t%s\tTest 0:\tShould be able to dequeue an item from the queue : %d, %v", failed, i+1, err)
				}
				data += d.Name
			}

			if data != orgData {
				t.Logf("\t%s\tTest 0:\tShould be able to dequeue over %d items in FIFO order.", failed, items)
				t.Fatalf("\t\tTest 0:\tGot %s, Expected %s.", data, orgData)
			}
			t.Logf("\t%s\tTest 0:\tShould be able to dequeue over %d items in FIFO order.", succeed, items)
		}
	}
}

// TestEnqueueFull validates the Enqueue functionality when full.
func TestEnqueueFull(t *testing.T) {