| 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 122 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 133 for (let p in x) { | 133 for (let p in x) { |
| 134 a.push(function () { return p; }); | 134 a.push(function () { return p; }); |
| 135 } | 135 } |
| 136 let k = 0; | 136 let k = 0; |
| 137 for (let q in x) { | 137 for (let q in x) { |
| 138 assertEquals(q, a[k]()); | 138 assertEquals(q, a[k]()); |
| 139 ++k; | 139 ++k; |
| 140 } | 140 } |
| 141 } | 141 } |
| 142 closures3({a : [0], b : 1, c : {v : 1}, get d() {}, set e(x) {}}); | 142 closures3({a : [0], b : 1, c : {v : 1}, get d() {}, set e(x) {}}); |
| OLD | NEW |
|---|
Chromium Code Reviews
