1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2 /* ***** BEGIN LICENSE BLOCK *****
3 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
5 * The contents of this file are subject to the Mozilla Public License Version
6 * 1.1 (the "License"); you may not use this file except in compliance with
7 * the License. You may obtain a copy of the License at
8 * http://www.mozilla.org/MPL/
10 * Software distributed under the License is distributed on an "AS IS" basis,
11 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12 * for the specific language governing rights and limitations under the
15 * The Original Code is mozilla.org code.
17 * The Initial Developer of the Original Code is
18 * Netscape Communications Corporation.
19 * Portions created by the Initial Developer are Copyright (C) 1998
20 * the Initial Developer. All Rights Reserved.
23 * pschwartau@netscape.com
25 * Alternatively, the contents of this file may be used under the terms of
26 * either the GNU General Public License Version 2 or later (the "GPL"), or
27 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
28 * in which case the provisions of the GPL or the LGPL are applicable instead
29 * of those above. If you wish to allow use of your version of this file only
30 * under the terms of either the GPL or the LGPL, and not to allow others to
31 * use your version of this file under the terms of the MPL, indicate your
32 * decision by deleting the provisions above and replace them with the notice
33 * and other provisions required by the GPL or the LGPL. If you do not delete
34 * the provisions above, a recipient may use your version of this file under
35 * the terms of any one of the MPL, the GPL or the LGPL.
37 * ***** END LICENSE BLOCK ***** /
40 * Date: 27 September 2001
42 * SUMMARY: Performance: truncating even very large arrays should be fast!
43 * See http://bugzilla.mozilla.org/show_bug.cgi?id=101964
45 * Adjust this testcase if necessary. The FAST constant defines
46 * an upper bound in milliseconds for any truncation to take.
48 //-----------------------------------------------------------------------------
49 var gTestfile
= 'regress-101964.js';
51 var BUGNUMBER
= 101964;
52 var summary
= 'Performance: truncating even very large arrays should be fast!';
55 var FAST
= 50; // array truncation should be 50 ms or less to pass the test
56 var MSG_FAST
= 'Truncation took less than ' + FAST
+ ' ms';
57 var MSG_SLOW
= 'Truncation took ';
62 var actualvalues
= [];
64 var expectedvalues
= [];
68 status
= inSection(1);
70 var start
= new Date();
72 actual
= elapsedTime(start
);
78 //-----------------------------------------------------------------------------
80 //-----------------------------------------------------------------------------
84 function elapsedTime(startTime
)
86 return new Date() - startTime
;
92 statusitems
[UBound
] = status
;
93 actualvalues
[UBound
] = isThisFast(actual
);
94 expectedvalues
[UBound
] = isThisFast(expect
);
99 function isThisFast(ms
)
103 return MSG_SLOW
+ ms
+ MSG_MS
;
110 printBugNumber(BUGNUMBER
);
111 printStatus (summary
);
113 for (var i
=0; i
<UBound
; i
++)
115 reportCompare(expectedvalues
[i
], actualvalues
[i
], statusitems
[i
]);