| 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 10 matching lines...) Expand all Loading... |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 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 var x = ""; | 28 var x = ""; |
| 29 var v = new Object(); | 29 var v = new Object(); |
| 30 var w = new Object(); | 30 var w = new Object(); |
| 31 var vv = function() { x += "hest"; return 1; } | 31 var vv = function() { x += "hest"; return 1; }; |
| 32 var ww = function() { x += "fisk"; return 2; } | 32 var ww = function() { x += "fisk"; return 2; }; |
| 33 v.valueOf = vv; | 33 v.valueOf = vv; |
| 34 w.valueOf = ww; | 34 w.valueOf = ww; |
| 35 assertEquals(1, Math.min(v,w)); | 35 assertEquals(1, Math.min(v,w)); |
| 36 assertEquals("hestfisk", x, "min"); | 36 assertEquals("hestfisk", x, "min"); |
| 37 | 37 |
| 38 x = ""; | 38 x = ""; |
| 39 assertEquals(2, Math.max(v,w)); | 39 assertEquals(2, Math.max(v,w)); |
| 40 assertEquals("hestfisk", x, "max"); | 40 assertEquals("hestfisk", x, "max"); |
| 41 | 41 |
| 42 x = ""; | 42 x = ""; |
| (...skipping 163 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 206 assertEquals("fisk", x, "Compare objects undefined > b valueOf order"); | 206 assertEquals("fisk", x, "Compare objects undefined > b valueOf order"); |
| 207 } | 207 } |
| 208 | 208 |
| 209 // Call inside loop to test optimization and possible caching. | 209 // Call inside loop to test optimization and possible caching. |
| 210 for (i = 0; i < 3; ++i) { | 210 for (i = 0; i < 3; ++i) { |
| 211 identical_object_comparison(); | 211 identical_object_comparison(); |
| 212 } | 212 } |
| 213 | 213 |
| 214 | 214 |
| 215 print("ok"); | 215 print("ok"); |
| OLD | NEW |