OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 10 matching lines...) Expand all Loading... |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #include <stdlib.h> | 28 #include <stdlib.h> |
29 #include <utility> | 29 #include <utility> |
30 | 30 |
31 #include "src/v8.h" | 31 #include "src/heap/gc-tracer.h" |
32 | |
33 #include "test/cctest/cctest.h" | 32 #include "test/cctest/cctest.h" |
34 | 33 |
35 using namespace v8::internal; | 34 using namespace v8::internal; |
36 | 35 |
37 TEST(RingBufferPartialFill) { | 36 TEST(RingBufferPartialFill) { |
38 const int max_size = 6; | 37 const int max_size = 6; |
39 typedef RingBuffer<int, max_size>::const_iterator Iter; | 38 typedef RingBuffer<int, max_size>::const_iterator Iter; |
40 RingBuffer<int, max_size> ring_buffer; | 39 RingBuffer<int, max_size> ring_buffer; |
41 CHECK(ring_buffer.empty()); | 40 CHECK(ring_buffer.empty()); |
42 CHECK_EQ(static_cast<int>(ring_buffer.size()), 0); | 41 CHECK_EQ(static_cast<int>(ring_buffer.size()), 0); |
(...skipping 73 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
116 CHECK(ring_buffer.begin() != ring_buffer.end()); | 115 CHECK(ring_buffer.begin() != ring_buffer.end()); |
117 | 116 |
118 // Test forward iteration | 117 // Test forward iteration |
119 int i = 14; | 118 int i = 14; |
120 for (Iter iter = ring_buffer.begin(); iter != ring_buffer.end(); ++iter) { | 119 for (Iter iter = ring_buffer.begin(); iter != ring_buffer.end(); ++iter) { |
121 CHECK(*iter == i); | 120 CHECK(*iter == i); |
122 --i; | 121 --i; |
123 } | 122 } |
124 CHECK_EQ(i, 8); // one past last element. | 123 CHECK_EQ(i, 8); // one past last element. |
125 } | 124 } |
OLD | NEW |