1 /****************************************************************************
3 ** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
4 ** All rights reserved.
5 ** Contact: Nokia Corporation (qt-info@nokia.com)
7 ** This file is part of the test suite of the Qt Toolkit.
9 ** $QT_BEGIN_LICENSE:LGPL$
10 ** No Commercial Usage
11 ** This file contains pre-release code and may not be distributed.
12 ** You may use this file in accordance with the terms and conditions
13 ** contained in the Technology Preview License Agreement accompanying
16 ** GNU Lesser General Public License Usage
17 ** Alternatively, this file may be used under the terms of the GNU Lesser
18 ** General Public License version 2.1 as published by the Free Software
19 ** Foundation and appearing in the file LICENSE.LGPL included in the
20 ** packaging of this file. Please review the following information to
21 ** ensure the GNU Lesser General Public License version 2.1 requirements
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
24 ** In addition, as a special exception, Nokia gives you certain additional
25 ** rights. These rights are described in the Nokia Qt LGPL Exception
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
28 ** If you have questions regarding the use of this file, please contact
29 ** Nokia at qt-info@nokia.com.
40 ****************************************************************************/
42 // This JavaScript file is a single, large, imported script.
43 // It doesn't import any other scripts.
44 .import Qt.test 1.0 as QtTest
46 function testFunc(seedValue) {
47 var retn = QtTest.EnumValue3;
48 var firstFactor = calculateFirstFactor(seedValue);
49 var secondFactor = calculateSecondFactor(seedValue);
50 var modificationTerm = calculateModificationTerm(seedValue);
52 // do some regexp matching
53 var someString = "This is a random string which we'll perform regular expression matching on to reduce considerably. This is meant to be part of a complex javascript expression whose evaluation takes considerably longer than the creation cost of QScriptValue.";
54 var regexpPattern = new RegExp("is", "i");
55 var regexpOutputLength = 0;
56 var temp = regexpPattern.exec(someString);
57 while (temp == "is") {
58 regexpOutputLength += 4;
59 regexpOutputLength *= 2;
60 temp = regexpPattern.exec(someString);
61 if (regexpOutputLength > (seedValue * 3)) {
66 // spin in a for loop for a while
69 var cumulativeTotal = 3;
70 for (i = 20; i > 1; i--) {
71 for (j = 31; j > 5; j--) {
72 var branchVariable = i + j;
73 if (branchVariable % 3 == 0) {
74 cumulativeTotal -= secondFactor;
76 cumulativeTotal += firstFactor;
79 if (cumulativeTotal > (seedValue * 50)) {
84 retn += (cumulativeTotal * 0.45);
85 retn *= (1 + (3.1415962 / seedValue));
87 retn -= (seedValue * -1);
91 function calculateFirstFactor(seedValue) {
92 var firstFactor = (0.45 * (9.3 / 3.1) - 0.90);
93 firstFactor *= (1 + (0.00001 / seedValue));
97 function calculateSecondFactor(seedValue) {
98 var secondFactor = 0.78 * (6.3 / 2.1) - (0.39 * 4);
99 secondFactor *= (1 + (0.00001 / seedValue));
103 function calculateModificationTerm(seedValue) {
104 var modificationTerm = (12 + (9*7) - 54 + 16 - ((calculateFirstFactor(seedValue) * seedValue) / 3) + (4*calculateSecondFactor(seedValue) * seedValue * 1.33)) + (calculateSecondFactor(seedValue) * seedValue);
105 modificationTerm = modificationTerm + (33/2) + 19 - (9*2) - (61*3) + 177;
106 return modificationTerm;