| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 19 matching lines...) Expand all Loading... |
| 30 | 30 |
| 31 var global = this; | 31 var global = this; |
| 32 function strict() { "use strict"; assertEquals(void 0, this); } | 32 function strict() { "use strict"; assertEquals(void 0, this); } |
| 33 function non_strict() { assertEquals(global, this); } | 33 function non_strict() { assertEquals(global, this); } |
| 34 | 34 |
| 35 [1,2,3].sort(strict); | 35 [1,2,3].sort(strict); |
| 36 [1,2,3].sort(non_strict); | 36 [1,2,3].sort(non_strict); |
| 37 | 37 |
| 38 "axc".replace("x", strict); | 38 "axc".replace("x", strict); |
| 39 "axc".replace("x", non_strict); | 39 "axc".replace("x", non_strict); |
| OLD | NEW |