1
// Copyright 2015 Canonical Ltd.
2
// Licensed under the LGPLv3, see LICENCE file for details.
4
// The deque package implements an efficient double-ended queue data
5
// structure called Deque.
13
// l := d.Len() // l == 3
14
// v, ok := d.PopFront() // v.(string) == "foo", ok == true
15
// v, ok = d.PopFront() // v.(string) == "bar", ok == true
16
// v, ok = d.PopBack() // v.(string) == "123", ok == true
17
// v, ok = d.PopBack() // v == nil, ok == false
18
// v, ok = d.PopFront() // v == nil, ok == false
19
// l = d.Len() // l == 0
21
// A discussion of the internals can be found at the top of deque.go.