OLD | NEW |
1 // Copyright 2010 the V8 project authors. All rights reserved. | 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. |
2 // | 27 // |
3 // Tests of the unbound queue. | 28 // Tests of the unbound queue. |
4 | 29 |
5 #include "v8.h" | 30 #include "v8.h" |
6 #include "unbound-queue-inl.h" | 31 #include "unbound-queue-inl.h" |
7 #include "cctest.h" | 32 #include "cctest.h" |
8 | 33 |
9 using i::UnboundQueue; | 34 using i::UnboundQueue; |
10 | 35 |
11 | 36 |
(...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
43 CHECK(!cq.IsEmpty()); | 68 CHECK(!cq.IsEmpty()); |
44 } | 69 } |
45 for (int i = 5; i <= 12; ++i) { | 70 for (int i = 5; i <= 12; ++i) { |
46 CHECK(!cq.IsEmpty()); | 71 CHECK(!cq.IsEmpty()); |
47 cq.Dequeue(&rec); | 72 cq.Dequeue(&rec); |
48 CHECK_EQ(i, rec); | 73 CHECK_EQ(i, rec); |
49 } | 74 } |
50 CHECK(cq.IsEmpty()); | 75 CHECK(cq.IsEmpty()); |
51 } | 76 } |
52 | 77 |
OLD | NEW |