OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. | 2 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. |
3 // | 3 // |
4 // Redistribution and use in source and binary forms, with or without | 4 // Redistribution and use in source and binary forms, with or without |
5 // modification, are permitted provided that the following conditions | 5 // modification, are permitted provided that the following conditions |
6 // are met: | 6 // are met: |
7 // 1. Redistributions of source code must retain the above copyright | 7 // 1. Redistributions of source code must retain the above copyright |
8 // notice, this list of conditions and the following disclaimer. | 8 // notice, this list of conditions and the following disclaimer. |
9 // 2. Redistributions in binary form must reproduce the above copyright | 9 // 2. Redistributions in binary form must reproduce the above copyright |
10 // notice, this list of conditions and the following disclaimer in the | 10 // notice, this list of conditions and the following disclaimer in the |
11 // documentation and/or other materials provided with the distribution. | 11 // documentation and/or other materials provided with the distribution. |
12 // | 12 // |
13 // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND AN
Y | 13 // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND AN
Y |
14 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED | 14 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
15 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | 15 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
16 // DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR AN
Y | 16 // DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR AN
Y |
17 // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | 17 // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
18 // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | 18 // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
19 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND O
N | 19 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND O
N |
20 // ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 20 // ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
21 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | 21 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
22 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 22 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
23 | 23 |
24 description( | 24 description( |
25 "This tests that Math.min and Math.max for doubles works correctly in the DFG JI
T." | 25 "This page tests handling of malformed escape sequences." |
26 ); | 26 ); |
27 | 27 |
28 function doMin(a, b) { | 28 var regexp; |
29 return Math.min(a, b); | |
30 } | |
31 | 29 |
32 function doMax(a, b) { | 30 regexp = /\ug/gm; |
33 return Math.max(a, b); | 31 debug("\nTesting regexp: " + regexp); |
34 } | 32 shouldBeTrue("regexp.test('ug')"); |
| 33 shouldBe("regexp.lastIndex", "2"); |
35 | 34 |
36 for (var i = 0; i < 1000; ++i) { | 35 regexp = /\xg/gm; |
37 doMin(1.5, 2.5); | 36 debug("\nTesting regexp: " + regexp); |
38 doMax(1.5, 2.5); | 37 shouldBeTrue("regexp.test('xg')"); |
39 } | 38 shouldBe("regexp.lastIndex", "2"); |
40 | 39 |
41 shouldBe("doMin(1.5, 2.5)", "1.5"); | 40 regexp = /\c_/gm; |
42 shouldBe("doMin(2.5, 1.5)", "1.5"); | 41 debug("\nTesting regexp: " + regexp); |
43 shouldBe("doMin(1.5, 1.5)", "1.5"); | 42 shouldBeTrue("regexp.test('\\\\c_')"); |
44 shouldBe("doMin(2.5, 2.5)", "2.5"); | 43 shouldBe("regexp.lastIndex", "3"); |
45 | 44 |
46 shouldBe("doMin(1.5, NaN)", "NaN"); | 45 regexp = /[\B]/gm; |
47 shouldBe("doMin(2.5, NaN)", "NaN"); | 46 debug("\nTesting regexp: " + regexp); |
48 shouldBe("doMin(NaN, 1.5)", "NaN"); | 47 shouldBeTrue("regexp.test('B')"); |
49 shouldBe("doMin(NaN, 2.5)", "NaN"); | 48 shouldBe("regexp.lastIndex", "1"); |
50 | 49 |
51 shouldBe("doMin(NaN, NaN)", "NaN"); | 50 regexp = /[\b]/gm; |
| 51 debug("\nTesting regexp: " + regexp); |
| 52 shouldBeTrue("regexp.test('\\b')"); |
| 53 shouldBe("regexp.lastIndex", "1"); |
52 | 54 |
53 shouldBe("doMax(1.5, 2.5)", "2.5"); | 55 regexp = /\8/gm; |
54 shouldBe("doMax(2.5, 1.5)", "2.5"); | 56 debug("\nTesting regexp: " + regexp); |
55 shouldBe("doMax(1.5, 1.5)", "1.5"); | 57 shouldBeTrue("regexp.test('\\\\8')"); |
56 shouldBe("doMax(2.5, 2.5)", "2.5"); | 58 shouldBe("regexp.lastIndex", "2"); |
57 | 59 |
58 shouldBe("doMax(1.5, NaN)", "NaN"); | 60 regexp = /^[\c]$/; |
59 shouldBe("doMax(2.5, NaN)", "NaN"); | 61 debug("\nTesting regexp: " + regexp); |
60 shouldBe("doMax(NaN, 1.5)", "NaN"); | 62 shouldBeTrue("regexp.test('c')"); |
61 shouldBe("doMax(NaN, 2.5)", "NaN"); | |
62 | 63 |
63 shouldBe("doMax(NaN, NaN)", "NaN"); | 64 regexp = /^[\c_]$/; |
| 65 debug("\nTesting regexp: " + regexp); |
| 66 shouldBeFalse("regexp.test('c')"); |
64 | 67 |
65 var successfullyParsed = true; | 68 regexp = /^[\c]]$/; |
| 69 debug("\nTesting regexp: " + regexp); |
| 70 shouldBeTrue("regexp.test('c]')"); |
OLD | NEW |