1 /****************************************************************************
3 ** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
4 ** Contact: http://www.qt-project.org/
6 ** This file is part of the test suite of the Qt Toolkit.
8 ** $QT_BEGIN_LICENSE:LGPL$
9 ** GNU Lesser General Public License Usage
10 ** This file may be used under the terms of the GNU Lesser General Public
11 ** License version 2.1 as published by the Free Software Foundation and
12 ** appearing in the file LICENSE.LGPL included in the packaging of this
13 ** file. Please review the following information to ensure the GNU Lesser
14 ** General Public License version 2.1 requirements will be met:
15 ** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
17 ** In addition, as a special exception, Nokia gives you certain additional
18 ** rights. These rights are described in the Nokia Qt LGPL Exception
19 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
21 ** GNU General Public License Usage
22 ** Alternatively, this file may be used under the terms of the GNU General
23 ** Public License version 3.0 as published by the Free Software Foundation
24 ** and appearing in the file LICENSE.GPL included in the packaging of this
25 ** file. Please review the following information to ensure the GNU General
26 ** Public License version 3.0 requirements will be met:
27 ** http://www.gnu.org/copyleft/gpl.html.
30 ** Alternatively, this file may be used in accordance with the terms and
31 ** conditions contained in a signed written agreement between you and Nokia.
40 ****************************************************************************/
42 // This JavaScript file is a single, large, imported script.
43 // It is imported by another script.
45 function testFunc(seedValue) {
47 var firstFactor = calculateFirstFactor(seedValue);
48 var secondFactor = calculateSecondFactor(seedValue);
49 var modificationTerm = calculateModificationTerm(seedValue);
51 // do some regexp matching
52 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.";
53 var regexpPattern = new RegExp("is", "i");
54 var regexpOutputLength = 0;
55 var temp = regexpPattern.exec(someString);
56 while (temp == "is") {
57 regexpOutputLength += 4;
58 regexpOutputLength *= 2;
59 temp = regexpPattern.exec(someString);
60 if (regexpOutputLength > (seedValue * 3)) {
65 // spin in a for loop for a while
68 var cumulativeTotal = 3;
69 for (i = 20; i > 1; i--) {
70 for (j = 31; j > 5; j--) {
71 var branchVariable = i + j;
72 if (branchVariable % 3 == 0) {
73 cumulativeTotal -= secondFactor;
75 cumulativeTotal += firstFactor;
78 if (cumulativeTotal > (seedValue * 50)) {
83 retn *= (1 + (cumulativeTotal * 0.001));
84 retn *= (seedValue + retn);
88 function calculateFirstFactor(seedValue) {
89 var firstFactor = (0.45 * (9.3 / 3.1) - 0.90);
90 firstFactor *= (1 + (0.000015 / seedValue));
94 function calculateSecondFactor(seedValue) {
95 var secondFactor = 0.78 * (6.3 / 2.1) - (0.39 * 4);
96 secondFactor *= (1 + (0.000015 / seedValue));
100 function calculateModificationTerm(seedValue) {
101 var modificationTerm = (12 + (9*7) - 54 + 16 - ((calculateFirstFactor(seedValue) * seedValue) / 3) + (4*calculateSecondFactor(seedValue) * seedValue * 1.33)) + (calculateSecondFactor(seedValue) * seedValue);
102 modificationTerm = modificationTerm + (33/2) + 19 - (9*2) - (61*3) + 177;
103 return modificationTerm;