1// Copyright 2010 the V8 project authors. All rights reserved.
2// Redistribution and use in source and binary forms, with or without
3// modification, are permitted provided that the following conditions are
4// met:
5//
6//     * Redistributions of source code must retain the above copyright
7//       notice, this list of conditions and the following disclaimer.
8//     * Redistributions in binary form must reproduce the above
9//       copyright notice, this list of conditions and the following
10//       disclaimer in the documentation and/or other materials provided
11//       with the distribution.
12//     * Neither the name of Google Inc. nor the names of its
13//       contributors may be used to endorse or promote products derived
14//       from this software without specific prior written permission.
15//
16// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27//
28// Tests of the unbound queue.
29
30#include "v8.h"
31#include "unbound-queue-inl.h"
32#include "cctest.h"
33
34using i::UnboundQueue;
35
36
37TEST(SingleRecord) {
38  typedef int Record;
39  UnboundQueue<Record> cq;
40  CHECK(cq.IsEmpty());
41  cq.Enqueue(1);
42  CHECK(!cq.IsEmpty());
43  Record rec = 0;
44  cq.Dequeue(&rec);
45  CHECK_EQ(1, rec);
46  CHECK(cq.IsEmpty());
47}
48
49
50TEST(MultipleRecords) {
51  typedef int Record;
52  UnboundQueue<Record> cq;
53  CHECK(cq.IsEmpty());
54  cq.Enqueue(1);
55  CHECK(!cq.IsEmpty());
56  for (int i = 2; i <= 5; ++i) {
57    cq.Enqueue(i);
58    CHECK(!cq.IsEmpty());
59  }
60  Record rec = 0;
61  for (int i = 1; i <= 4; ++i) {
62    CHECK(!cq.IsEmpty());
63    cq.Dequeue(&rec);
64    CHECK_EQ(i, rec);
65  }
66  for (int i = 6; i <= 12; ++i) {
67    cq.Enqueue(i);
68    CHECK(!cq.IsEmpty());
69  }
70  for (int i = 5; i <= 12; ++i) {
71    CHECK(!cq.IsEmpty());
72    cq.Dequeue(&rec);
73    CHECK_EQ(i, rec);
74  }
75  CHECK(cq.IsEmpty());
76}
77