| OLD | NEW |
| 1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008 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 124 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 135 } | 135 } |
| 136 break; | 136 break; |
| 137 } | 137 } |
| 138 } | 138 } |
| 139 | 139 |
| 140 var primes = new Array(0); | 140 var primes = new Array(0); |
| 141 | 141 |
| 142 function isPrime(possible_prime) { | 142 function isPrime(possible_prime) { |
| 143 for (var d = 0; d < primes.length; d++) { | 143 for (var d = 0; d < primes.length; d++) { |
| 144 var p = primes[d]; | 144 var p = primes[d]; |
| 145 if (possible_prime % p == 0) | 145 if (possible_prime % p == 0) { |
| 146 return false; | 146 return false; |
| 147 if (p * p > possible_prime) | 147 } |
| 148 if (p * p > possible_prime) { |
| 148 return true; | 149 return true; |
| 150 } |
| 149 } | 151 } |
| 150 return true; | 152 return true; |
| 151 } | 153 } |
| 152 | 154 |
| 153 for (var i = 2; i < 10000; i++) { | 155 for (var i = 2; i < 10000; i++) { |
| 154 if (isPrime(i)) { | 156 if (isPrime(i)) { |
| 155 primes.push(i); | 157 primes.push(i); |
| 156 } | 158 } |
| 157 } | 159 } |
| 158 | 160 |
| (...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 190 "moreseper-prime"); | 192 "moreseper-prime"); |
| 191 | 193 |
| 192 delete(Array.prototype["1"]); | 194 delete(Array.prototype["1"]); |
| 193 | 195 |
| 194 // Check correct handling of non-array argument lists. | 196 // Check correct handling of non-array argument lists. |
| 195 assertSame(this, f0.apply(this, {}), "non-array-1"); | 197 assertSame(this, f0.apply(this, {}), "non-array-1"); |
| 196 assertSame(this, f0.apply(this, { length:1 }), "non-array-2"); | 198 assertSame(this, f0.apply(this, { length:1 }), "non-array-2"); |
| 197 assertEquals(void 0, f1.apply(this, { length:1 }), "non-array-3"); | 199 assertEquals(void 0, f1.apply(this, { length:1 }), "non-array-3"); |
| 198 assertEquals(void 0, f1.apply(this, { 0:"foo" }), "non-array-4"); | 200 assertEquals(void 0, f1.apply(this, { 0:"foo" }), "non-array-4"); |
| 199 assertEquals("foo", f1.apply(this, { length:1, 0:"foo" }), "non-array-5"); | 201 assertEquals("foo", f1.apply(this, { length:1, 0:"foo" }), "non-array-5"); |
| OLD | NEW |