OLD | NEW |
(Empty) | |
| 1 # Copyright 2013 the V8 project authors. All rights reserved. |
| 2 # Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. |
| 3 # |
| 4 # Redistribution and use in source and binary forms, with or without |
| 5 # modification, are permitted provided that the following conditions |
| 6 # are met: |
| 7 # 1. Redistributions of source code must retain the above copyright |
| 8 # notice, this list of conditions and the following disclaimer. |
| 9 # 2. Redistributions in binary form must reproduce the above copyright |
| 10 # notice, this list of conditions and the following disclaimer in the |
| 11 # documentation and/or other materials provided with the distribution. |
| 12 # |
| 13 # THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY |
| 14 # EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
| 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 ANY |
| 17 # DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
| 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 ON |
| 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 |
| 22 # SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 23 |
| 24 This test checks the behavior of the reduceRight() method on a number of objects
. |
| 25 |
| 26 On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE
". |
| 27 |
| 28 |
| 29 PASS [0,1,2,3].reduceRight(function(a,b){ return a + b; }) is 6 |
| 30 PASS [1,2,3].reduceRight(function(a,b){ return a + b; }) is 6 |
| 31 PASS [0,1,2,3].reduceRight(function(a,b){ return a + b; }, 4) is 10 |
| 32 PASS [1,2,3].reduceRight(function(a,b){ return a + b; }, 4) is 10 |
| 33 PASS toObject([0,1,2,3]).reduceRight(function(a,b){ return a + b; }) is 6 |
| 34 PASS toObject([1,2,3]).reduceRight(function(a,b){ return a + b; }) is 6 |
| 35 PASS toObject([0,1,2,3]).reduceRight(function(a,b){ return a + b; }, 4) is 10 |
| 36 PASS toObject([1,2,3]).reduceRight(function(a,b){ return a + b; }, 4) is 10 |
| 37 PASS toUnorderedObject([0,1,2,3]).reduceRight(function(a,b){ return a + b; }) is
6 |
| 38 PASS toUnorderedObject([1,2,3]).reduceRight(function(a,b){ return a + b; }) is 6 |
| 39 PASS toUnorderedObject([0,1,2,3]).reduceRight(function(a,b){ return a + b; }, 4)
is 10 |
| 40 PASS toUnorderedObject([1,2,3]).reduceRight(function(a,b){ return a + b; }, 4) i
s 10 |
| 41 PASS sparseArray.reduceRight(function(a,b){ return a + b; }, 0) is 10 |
| 42 PASS toObject(sparseArray).reduceRight(function(a,b){ return a + b; }, 0) is 10 |
| 43 PASS sparseArray.reduceRight(function(a,b){ callCount++; }); callCount is 0 |
| 44 PASS toObject(sparseArray).reduceRight(function(a,b){ callCount++; }); callCount
is 0 |
| 45 PASS sparseArray.reduceRight(function(a,b){ callCount++; }, 0); callCount is 1 |
| 46 PASS toObject(sparseArray).reduceRight(function(a,b){ callCount++; }, 0); callCo
unt is 1 |
| 47 PASS [0,1,2,3,4].reduceRight(function(a,b){ callCount++; }, 0); callCount is 5 |
| 48 PASS [0,1,2,3,4].reduceRight(function(a,b){ callCount++; }); callCount is 4 |
| 49 PASS [1, 2, 3, 4].reduceRight(function(a,b, i, thisObj){ thisObj.length--; callC
ount++; return a + b; }, 0); callCount is 4 |
| 50 PASS [1, 2, 3, 4].reduceRight(function(a,b, i, thisObj){ thisObj.length = 1; cal
lCount++; return a + b; }, 0); callCount is 2 |
| 51 PASS [1, 2, 3, 4].reduceRight(function(a,b, i, thisObj){ thisObj.length++; callC
ount++; return a + b; }, 0); callCount is 4 |
| 52 PASS toObject([1, 2, 3, 4]).reduceRight(function(a,b, i, thisObj){ thisObj.lengt
h--; callCount++; return a + b; }, 0); callCount is 4 |
| 53 PASS toObject([1, 2, 3, 4]).reduceRight(function(a,b, i, thisObj){ thisObj.lengt
h++; callCount++; return a + b; }, 0); callCount is 4 |
| 54 PASS [[0,1], [2,3], [4,5]].reduceRight(function(a,b) {return a.concat(b);}, [])
is [4,5,2,3,0,1] |
| 55 PASS toObject([[0,1], [2,3], [4,5]]).reduceRight(function(a,b) {return a.concat(
b);}, []) is [4,5,2,3,0,1] |
| 56 PASS toObject([0,1,2,3,4,5]).reduceRight(function(a,b,i) {return a.concat([i,b])
;}, []) is [5,5,4,4,3,3,2,2,1,1,0,0] |
| 57 PASS toUnorderedObject([[0,1], [2,3], [4,5]]).reduceRight(function(a,b) {return
a.concat(b);}, []) is [4,5,2,3,0,1] |
| 58 PASS toUnorderedObject([0,1,2,3,4,5]).reduceRight(function(a,b,i) {return a.conc
at([i,b]);}, []) is [5,5,4,4,3,3,2,2,1,1,0,0] |
| 59 PASS [0,1,2,3,4,5].reduceRight(function(a,b,i) {return a.concat([i,b]);}, []) is
[5,5,4,4,3,3,2,2,1,1,0,0] |
| 60 PASS [2,3].reduceRight(function() {'use strict'; return this;}) is undefined |
| 61 PASS successfullyParsed is true |
| 62 |
| 63 TEST COMPLETE |
| 64 |
OLD | NEW |