| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 3480 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3491 strongWeak->take(keepNumbersAlive[i + 1])->value()); | 3491 strongWeak->take(keepNumbersAlive[i + 1])->value()); |
| 3492 } else if (collectionNumber == weakWeakIndex) { | 3492 } else if (collectionNumber == weakWeakIndex) { |
| 3493 if (deleteAfterwards) | 3493 if (deleteAfterwards) |
| 3494 EXPECT_EQ(i + 1, weakWeak->take(keepNumbersAlive[i])->value()); | 3494 EXPECT_EQ(i + 1, weakWeak->take(keepNumbersAlive[i])->value()); |
| 3495 } | 3495 } |
| 3496 if (!deleteAfterwards) | 3496 if (!deleteAfterwards) |
| 3497 count++; | 3497 count++; |
| 3498 } else if (collectionNumber == weakSetIndex && firstAlive) { | 3498 } else if (collectionNumber == weakSetIndex && firstAlive) { |
| 3499 ASSERT_TRUE(weakSet->contains(keepNumbersAlive[i])); | 3499 ASSERT_TRUE(weakSet->contains(keepNumbersAlive[i])); |
| 3500 if (deleteAfterwards) | 3500 if (deleteAfterwards) |
| 3501 weakSet->remove(keepNumbersAlive[i]); | 3501 weakSet->erase(keepNumbersAlive[i]); |
| 3502 else | 3502 else |
| 3503 count++; | 3503 count++; |
| 3504 } else if (collectionNumber == weakOrderedSetIndex && firstAlive) { | 3504 } else if (collectionNumber == weakOrderedSetIndex && firstAlive) { |
| 3505 ASSERT_TRUE(weakOrderedSet->contains(keepNumbersAlive[i])); | 3505 ASSERT_TRUE(weakOrderedSet->contains(keepNumbersAlive[i])); |
| 3506 if (deleteAfterwards) | 3506 if (deleteAfterwards) |
| 3507 weakOrderedSet->remove(keepNumbersAlive[i]); | 3507 weakOrderedSet->remove(keepNumbersAlive[i]); |
| 3508 else | 3508 else |
| 3509 count++; | 3509 count++; |
| 3510 } | 3510 } |
| 3511 } | 3511 } |
| (...skipping 2850 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 6362 "HeapVector"); | 6362 "HeapVector"); |
| 6363 static_assert( | 6363 static_assert( |
| 6364 WTF::IsGarbageCollectedType<HeapDeque<Member<IntWrapper>>>::value, | 6364 WTF::IsGarbageCollectedType<HeapDeque<Member<IntWrapper>>>::value, |
| 6365 "HeapDeque"); | 6365 "HeapDeque"); |
| 6366 static_assert(WTF::IsGarbageCollectedType< | 6366 static_assert(WTF::IsGarbageCollectedType< |
| 6367 HeapTerminatedArray<Member<IntWrapper>>>::value, | 6367 HeapTerminatedArray<Member<IntWrapper>>>::value, |
| 6368 "HeapTerminatedArray"); | 6368 "HeapTerminatedArray"); |
| 6369 } | 6369 } |
| 6370 | 6370 |
| 6371 } // namespace blink | 6371 } // namespace blink |
| OLD | NEW |