http://play.golang.org/p/Ja2w1Rlckr

List based queue in Go

package queue

import (
	"fmt"
	"container/list"
	"errors"
)

type Queue struct {
	list *list.List
}

func (l *Queue) Dequeue() (value interface{}, err error) {
	first := l.list.Front()
	if(first == nil) {
		err = errors.New("Queue is empty")
		return
	}
	l.list.Remove(first);
	value = first.Value;
	return
}

func (l *Queue) Enqueue(value interface{}) {
	l.list.PushBack(value)
}

func (l *Queue) Len() int {
	return l.list.Len()
}

func New(init ...interface{}) (q *Queue) {
	q = &Queue{list.New()}
	for _, value := range init {
		q.Enqueue(value)
	}
	return
}

func main() {
	l := New("Hello, playground")
	value, err := l.Dequeue()
	if err != nil {
		fmt.Println(err)
	} else {
		fmt.Printf("Value was %v\n", value)
	}
}