| OLD | NEW |
|---|
| 1 // Copyright 2009 the V8 project authors. All rights reserved. | 1 // Copyright 2009 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 16 matching lines...) Expand all Loading... |
| 27 | 27 |
| 28 // See http://code.google.com/p/v8/issues/detail?id=201. | 28 // See http://code.google.com/p/v8/issues/detail?id=201. |
| 29 | 29 |
| 30 function testsort(n) { | 30 function testsort(n) { |
| 31 n=1*n; | 31 n=1*n; |
| 32 var numbers=new Array(n); | 32 var numbers=new Array(n); |
| 33 for (var i=0;i<n;i++) numbers[i]=i; | 33 for (var i=0;i<n;i++) numbers[i]=i; |
| 34 numbers.sort(); | 34 numbers.sort(); |
| 35 } | 35 } |
| 36 | 36 |
| 37 testsort("5001") | 37 testsort("5001"); |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 8888006:
Make more JS files beter match the coding standard.
Base URL: https://v8.googlecode.com/svn/branches/bleeding_edge