| 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 13 matching lines...) Expand all Loading... |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 /** | 28 /** |
| 29 * This test is run with leak detection when running special tests. | 29 * This test is run with leak detection when running special tests. |
| 30 * Don't do too much work here or running it will take forever. | 30 * Don't do too much work here or running it will take forever. |
| 31 */ | 31 */ |
| 32 | 32 |
| 33 function fac(n) { | 33 function fac(n) { |
| 34 if (n > 0) return fac(n - 1) * n; | 34 if (n > 0) { |
| 35 else return 1; | 35 return fac(n - 1) * n; |
| 36 } else { |
| 37 return 1; |
| 38 } |
| 36 } | 39 } |
| 37 | 40 |
| 38 function testFac() { | 41 function testFac() { |
| 39 if (fac(6) != 720) throw "Error"; | 42 if (fac(6) != 720) throw "Error"; |
| 40 } | 43 } |
| 41 | 44 |
| 42 function testRegExp() { | 45 function testRegExp() { |
| 43 var input = "123456789"; | 46 var input = "123456789"; |
| 44 var result = input.replace(/[4-6]+/g, "xxx"); | 47 var result = input.replace(/[4-6]+/g, "xxx"); |
| 45 if (result != "123xxx789") throw "Error"; | 48 if (result != "123xxx789") throw "Error"; |
| 46 } | 49 } |
| 47 | 50 |
| 48 function main() { | 51 function main() { |
| 49 testFac(); | 52 testFac(); |
| 50 testRegExp(); | 53 testRegExp(); |
| 51 } | 54 } |
| 52 | 55 |
| 53 main(); | 56 main(); |
| OLD | NEW |