Queue on golang

data_structures/queues/go/queue.go

@@ -0,0 +1,43 @@
+package queue
+
+import "sync"
+
+type Queue struct {
+	items []interface{}
+	lock  sync.Mutex
+}
+
+func NewQueue() *Queue {
+	return &Queue{
+		items: make([]interface{}, 0),
+	}
+}
+
+func (q *Queue) Enqueue(i interface{}) {
+	q.lock.Lock()
+	q.items = append(q.items, i)
+	q.lock.Unlock()
+}
+
+func (q *Queue) Dequeue() interface{} {
+	q.lock.Lock()
+	i := q.items[0]
+	q.items = q.items[1:]
+	q.lock.Unlock()
+	return i
+}
+
+func (q *Queue) Front() interface{} {
+	q.lock.Lock()
+	i := q.items[0]
+	q.lock.Unlock()
+	return i
+}
+
+func (q *Queue) IsEmpty() bool {
+	return len(q.items) == 0
+}
+
+func (q *Queue) Size() int {
+	return len(q.items)
+}

data_structures/queues/go/queue_test.go

@@ -0,0 +1,47 @@
+package queue
+
+import "testing"
+
+func TestQueue_Enqueue(t *testing.T) {
+	q := NewQueue()
+	q.Enqueue(1)
+	q.Enqueue(2)
+	q.Enqueue(3)
+
+	if size := q.Size(); size != 3 {
+		t.Errorf("invalid size, excepted %d, actual %d", 3, size)
+	}
+}
+
+func TestQueue_Dequeue(t *testing.T) {
+	q := NewQueue()
+	q.Enqueue(1)
+	q.Enqueue(2)
+	q.Enqueue(3)
+
+	q.Dequeue()
+	if size := q.Size(); size != 2 {
+		t.Errorf("invalid size, excepted %d, actual %d", 2, size)
+	}
+
+	q.Dequeue()
+	q.Dequeue()
+	if size := q.Size(); size != 0 {
+		t.Errorf("invalid size, excepted %d, actual %d", 0, size)
+	}
+}
+
+func TestQueue_IsEmpty(t *testing.T) {
+	q := NewQueue()
+	q.Enqueue(1)
+	q.Enqueue(2)
+	q.Enqueue(3)
+
+	q.Dequeue()
+	q.Dequeue()
+	q.Dequeue()
+
+	if !q.IsEmpty() {
+		t.Errorf("IsEmpty should return true")
+	}
+}