| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 628 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 639 function recursiveObserver2(r) { | 639 function recursiveObserver2(r) { |
| 640 recordCount += r.length; | 640 recordCount += r.length; |
| 641 if (r[0].oldValue < 100) { | 641 if (r[0].oldValue < 100) { |
| 642 ++obj1.a; | 642 ++obj1.a; |
| 643 ++obj2.a; | 643 ++obj2.a; |
| 644 } | 644 } |
| 645 } | 645 } |
| 646 Object.observe(obj1, recursiveObserver2); | 646 Object.observe(obj1, recursiveObserver2); |
| 647 Object.observe(obj2, recursiveObserver2); | 647 Object.observe(obj2, recursiveObserver2); |
| 648 ++obj1.a; | 648 ++obj1.a; |
| 649 // TODO(verwaest): Disabled because of bug 2774. | 649 Object.deliverChangeRecords(recursiveObserver2); |
| 650 // Object.deliverChangeRecords(recursiveObserver2); | 650 assertEquals(199, recordCount); |
| 651 // assertEquals(199, recordCount); | |
| 652 | 651 |
| 653 | 652 |
| 654 // Observing named properties. | 653 // Observing named properties. |
| 655 reset(); | 654 reset(); |
| 656 var obj = {a: 1} | 655 var obj = {a: 1} |
| 657 Object.observe(obj, observer.callback); | 656 Object.observe(obj, observer.callback); |
| 658 obj.a = 2; | 657 obj.a = 2; |
| 659 obj["a"] = 3; | 658 obj["a"] = 3; |
| 660 delete obj.a; | 659 delete obj.a; |
| 661 obj.a = 4; | 660 obj.a = 4; |
| (...skipping 864 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1526 for (var n1 = 0; n1 < 3; ++n1) | 1525 for (var n1 = 0; n1 < 3; ++n1) |
| 1527 for (var n2 = 0; n2 < 3; ++n2) | 1526 for (var n2 = 0; n2 < 3; ++n2) |
| 1528 for (var i in mutation) | 1527 for (var i in mutation) |
| 1529 TestFastElementsLength(mutation[i], b1 != 0, b2 != 0, 20*n1, 20*n2); | 1528 TestFastElementsLength(mutation[i], b1 != 0, b2 != 0, 20*n1, 20*n2); |
| 1530 | 1529 |
| 1531 for (var b1 = 0; b1 < 2; ++b1) | 1530 for (var b1 = 0; b1 < 2; ++b1) |
| 1532 for (var b2 = 0; b2 < 2; ++b2) | 1531 for (var b2 = 0; b2 < 2; ++b2) |
| 1533 for (var n = 0; n < 3; ++n) | 1532 for (var n = 0; n < 3; ++n) |
| 1534 for (var i in mutationByIncr) | 1533 for (var i in mutationByIncr) |
| 1535 TestFastElementsLength(mutationByIncr[i], b1 != 0, b2 != 0, 7*n, 7*n+1); | 1534 TestFastElementsLength(mutationByIncr[i], b1 != 0, b2 != 0, 7*n, 7*n+1); |
| OLD | NEW |