Chromium Code Reviews| 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 721 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 732 assertEquals(["\u{daff}", "\u{e000}"], "\u{daff}\u{e000}".split(/[a-z]{0,1}/u)); | 732 assertEquals(["\u{daff}", "\u{e000}"], "\u{daff}\u{e000}".split(/[a-z]{0,1}/u)); |
| 733 assertEquals(["\u{daff}\u{dfff}"], "\u{daff}\u{dfff}".split(/[a-z]{0,1}/u)); | 733 assertEquals(["\u{daff}\u{dfff}"], "\u{daff}\u{dfff}".split(/[a-z]{0,1}/u)); |
| 734 | 734 |
| 735 // Test that changing a property on RegExp.prototype results in us taking the | 735 // Test that changing a property on RegExp.prototype results in us taking the |
| 736 // slow path, which executes RegExp.prototype.exec instead of our | 736 // slow path, which executes RegExp.prototype.exec instead of our |
| 737 // RegExpExecStub. | 737 // RegExpExecStub. |
| 738 const RegExpPrototypeExec = RegExp.prototype.exec; | 738 const RegExpPrototypeExec = RegExp.prototype.exec; |
| 739 RegExp.prototype.exec = function() { throw new Error(); } | 739 RegExp.prototype.exec = function() { throw new Error(); } |
| 740 assertThrows(() => "abc".replace(/./, "")); | 740 assertThrows(() => "abc".replace(/./, "")); |
| 741 RegExp.prototype.exec = RegExpPrototypeExec; | 741 RegExp.prototype.exec = RegExpPrototypeExec; |
| 742 | |
| 743 // Test the code path in RE.proto[@@search] when previousLastIndex is a receiver | |
| 744 // but can't be converted to a primitive. This exposed a crash in the | |
| 745 // C++ implementation of @@search. | |
| 746 | |
| 747 var re = /./; | |
| 748 re.lastIndex = { [Symbol.toPrimitive]: 42 }; | |
| 749 () => "abc".search(re); | |
|
Dan Ehrenberg
2016/11/02 12:03:45
Does this test actually run anything? Did you mean
jgruber
2016/11/07 07:56:18
Good catch, thanks! This line was originally in an
| |
| OLD | NEW |