OLD | NEW |
1 // Copyright 2009 the V8 project authors. All rights reserved. | 1 // Copyright 2009 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 45 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
56 TEST(ListAdd) { | 56 TEST(ListAdd) { |
57 // Add elements to the list to grow it to its capacity. | 57 // Add elements to the list to grow it to its capacity. |
58 List<int, ZeroingAllocationPolicy> list(4); | 58 List<int, ZeroingAllocationPolicy> list(4); |
59 list.Add(1); | 59 list.Add(1); |
60 list.Add(2); | 60 list.Add(2); |
61 list.Add(3); | 61 list.Add(3); |
62 list.Add(4); | 62 list.Add(4); |
63 | 63 |
64 // Add an existing element, the backing store should have to grow. | 64 // Add an existing element, the backing store should have to grow. |
65 list.Add(list[0]); | 65 list.Add(list[0]); |
66 ASSERT(list[4] == 1); | 66 CHECK(list[4] == 1); |
67 } | 67 } |
OLD | NEW |