deque.go

package main

type Deque struct {
	items []interface{}
}

func NewDeque() *Deque {
	return &Deque{
		items: make([]interface{}, 0),
	}
}

func (d *Deque) AddFront(item interface{}) {
	d.items = append([]interface{}{item}, d.items...)
}

func (d *Deque) AddRear(item interface{}) {
	d.items = append(d.items, item)
}

func (d *Deque) RemoveFront() interface{} {
	if !d.IsEmpty() {
		item := d.items[0]
		d.items = d.items[1:]
		return item
	}
	return nil
}

func (d *Deque) RemoveRear() interface{} {
	if !d.IsEmpty() {
		item := d.items[len(d.items)-1]
		d.items = d.items[:len(d.items)-1]
		return item
	}
	return nil
}

func (d *Deque) IsEmpty() bool {
	return len(d.items) == 0
}

func (d *Deque) Size() int {
	return len(d.items)
}