(t *testing.T)
| 20 | } |
| 21 | |
| 22 | func TestQueueWrapping(t *testing.T) { |
| 23 | q := New() |
| 24 | |
| 25 | for i := 0; i < minQueueLen; i++ { |
| 26 | q.Add(i) |
| 27 | } |
| 28 | for i := 0; i < 3; i++ { |
| 29 | q.Remove() |
| 30 | q.Add(minQueueLen + i) |
| 31 | } |
| 32 | |
| 33 | for i := 0; i < minQueueLen; i++ { |
| 34 | if q.Peek().(int) != i+3 { |
| 35 | t.Error("peek", i, "had value", q.Peek()) |
| 36 | } |
| 37 | q.Remove() |
| 38 | } |
| 39 | } |
| 40 | |
| 41 | func TestQueueLength(t *testing.T) { |
| 42 | q := New() |