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 | 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 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
67 cq.Enqueue(i); | 67 cq.Enqueue(i); |
68 CHECK(!cq.IsEmpty()); | 68 CHECK(!cq.IsEmpty()); |
69 } | 69 } |
70 for (int i = 5; i <= 12; ++i) { | 70 for (int i = 5; i <= 12; ++i) { |
71 CHECK(!cq.IsEmpty()); | 71 CHECK(!cq.IsEmpty()); |
72 cq.Dequeue(&rec); | 72 cq.Dequeue(&rec); |
73 CHECK_EQ(i, rec); | 73 CHECK_EQ(i, rec); |
74 } | 74 } |
75 CHECK(cq.IsEmpty()); | 75 CHECK(cq.IsEmpty()); |
76 } | 76 } |
77 | |
OLD | NEW |