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 various array enumeration functions in cert
ain edge case scenarios |
| 25 |
| 26 On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE
". |
| 27 |
| 28 |
| 29 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], returnFals
e, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray),
forwarders[f], returnFalse, 0) |
| 30 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], returnFalse
, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), fo
rwarders[f], returnFalse, 0) |
| 31 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], return
False, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmpty
Array), forwarders[f], returnFalse, 0) |
| 32 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], retur
nFalse, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSpar
seArray), forwarders[f], returnFalse, 0) |
| 33 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], returnTrue
, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), f
orwarders[f], returnTrue, 0) |
| 34 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], returnTrue,
0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), for
warders[f], returnTrue, 0) |
| 35 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], return
True, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyA
rray), forwarders[f], returnTrue, 0) |
| 36 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], retur
nTrue, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSpars
eArray), forwarders[f], returnTrue, 0) |
| 37 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], returnElem
, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), f
orwarders[f], returnElem, 0) |
| 38 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], returnElem,
0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), for
warders[f], returnElem, 0) |
| 39 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], return
Elem, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyA
rray), forwarders[f], returnElem, 0) |
| 40 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], retur
nElem, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSpars
eArray), forwarders[f], returnElem, 0) |
| 41 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], returnInde
x, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray),
forwarders[f], returnIndex, 0) |
| 42 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], returnIndex
, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), fo
rwarders[f], returnIndex, 0) |
| 43 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], return
Index, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmpty
Array), forwarders[f], returnIndex, 0) |
| 44 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], retur
nIndex, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSpar
seArray), forwarders[f], returnIndex, 0) |
| 45 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], increaseLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray
), forwarders[f], increaseLength, 0) |
| 46 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], increaseLen
gth, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray),
forwarders[f], increaseLength, 0) |
| 47 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], increa
seLength, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEm
ptyArray), forwarders[f], increaseLength, 0) |
| 48 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], incre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeS
parseArray), forwarders[f], increaseLength, 0) |
| 49 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], decreaseLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray
), forwarders[f], decreaseLength, 0) |
| 50 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], decreaseLen
gth, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray),
forwarders[f], decreaseLength, 0) |
| 51 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], decrea
seLength, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEm
ptyArray), forwarders[f], decreaseLength, 0) |
| 52 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], decre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeS
parseArray), forwarders[f], decreaseLength, 0) |
| 53 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], halveLengt
h, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray),
forwarders[f], halveLength, 0) |
| 54 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], halveLength
, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), fo
rwarders[f], halveLength, 0) |
| 55 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], halveL
ength, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmpty
Array), forwarders[f], halveLength, 0) |
| 56 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], halve
Length, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSpar
seArray), forwarders[f], halveLength, 0) |
| 57 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], returnFa
lse, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArra
y), forwarders[f], returnFalse, 0) |
| 58 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], returnFal
se, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray)
, forwarders[f], returnFalse, 0) |
| 59 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], retu
rnFalse, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeE
mptyArray), forwarders[f], returnFalse, 0) |
| 60 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], ret
urnFalse, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(large
SparseArray), forwarders[f], returnFalse, 0) |
| 61 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], returnTr
ue, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray
), forwarders[f], returnTrue, 0) |
| 62 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], returnTru
e, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray),
forwarders[f], returnTrue, 0) |
| 63 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], retu
rnTrue, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEm
ptyArray), forwarders[f], returnTrue, 0) |
| 64 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], ret
urnTrue, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeS
parseArray), forwarders[f], returnTrue, 0) |
| 65 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], returnEl
em, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray
), forwarders[f], returnElem, 0) |
| 66 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], returnEle
m, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray),
forwarders[f], returnElem, 0) |
| 67 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], retu
rnElem, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEm
ptyArray), forwarders[f], returnElem, 0) |
| 68 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], ret
urnElem, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeS
parseArray), forwarders[f], returnElem, 0) |
| 69 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], returnIn
dex, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArra
y), forwarders[f], returnIndex, 0) |
| 70 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], returnInd
ex, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray)
, forwarders[f], returnIndex, 0) |
| 71 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], retu
rnIndex, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeE
mptyArray), forwarders[f], returnIndex, 0) |
| 72 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], ret
urnIndex, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(large
SparseArray), forwarders[f], returnIndex, 0) |
| 73 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], increase
Length, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleA
rray), forwarders[f], increaseLength, 0) |
| 74 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], increaseL
ength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArr
ay), forwarders[f], increaseLength, 0) |
| 75 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], incr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(lar
geEmptyArray), forwarders[f], increaseLength, 0) |
| 76 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], inc
reaseLength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(la
rgeSparseArray), forwarders[f], increaseLength, 0) |
| 77 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], decrease
Length, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleA
rray), forwarders[f], decreaseLength, 0) |
| 78 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], decreaseL
ength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArr
ay), forwarders[f], decreaseLength, 0) |
| 79 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], decr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(lar
geEmptyArray), forwarders[f], decreaseLength, 0) |
| 80 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], dec
reaseLength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(la
rgeSparseArray), forwarders[f], decreaseLength, 0) |
| 81 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], halveLen
gth, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArra
y), forwarders[f], halveLength, 0) |
| 82 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], halveLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray)
, forwarders[f], halveLength, 0) |
| 83 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], halv
eLength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeE
mptyArray), forwarders[f], halveLength, 0) |
| 84 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], hal
veLength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(large
SparseArray), forwarders[f], halveLength, 0) |
| 85 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], returnFalse
, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), fo
rwarders[f], returnFalse, 0) |
| 86 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], returnFalse,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forw
arders[f], returnFalse, 0) |
| 87 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], returnF
alse, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyAr
ray), forwarders[f], returnFalse, 0) |
| 88 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], return
False, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparse
Array), forwarders[f], returnFalse, 0) |
| 89 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], returnTrue,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), for
warders[f], returnTrue, 0) |
| 90 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], returnTrue,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwa
rders[f], returnTrue, 0) |
| 91 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], returnT
rue, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArr
ay), forwarders[f], returnTrue, 0) |
| 92 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], return
True, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseA
rray), forwarders[f], returnTrue, 0) |
| 93 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], returnElem,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), for
warders[f], returnElem, 0) |
| 94 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], returnElem,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwa
rders[f], returnElem, 0) |
| 95 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], returnE
lem, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArr
ay), forwarders[f], returnElem, 0) |
| 96 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], return
Elem, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseA
rray), forwarders[f], returnElem, 0) |
| 97 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], returnIndex
, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), fo
rwarders[f], returnIndex, 0) |
| 98 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], returnIndex,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forw
arders[f], returnIndex, 0) |
| 99 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], returnI
ndex, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyAr
ray), forwarders[f], returnIndex, 0) |
| 100 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], return
Index, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparse
Array), forwarders[f], returnIndex, 0) |
| 101 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], increaseLen
gth, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray),
forwarders[f], increaseLength, 0) |
| 102 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], increaseLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), f
orwarders[f], increaseLength, 0) |
| 103 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], increas
eLength, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmpt
yArray), forwarders[f], increaseLength, 0) |
| 104 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], increa
seLength, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSpa
rseArray), forwarders[f], increaseLength, 0) |
| 105 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], decreaseLen
gth, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray),
forwarders[f], decreaseLength, 0) |
| 106 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], decreaseLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), f
orwarders[f], decreaseLength, 0) |
| 107 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], decreas
eLength, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmpt
yArray), forwarders[f], decreaseLength, 0) |
| 108 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], decrea
seLength, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSpa
rseArray), forwarders[f], decreaseLength, 0) |
| 109 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], halveLength
, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), fo
rwarders[f], halveLength, 0) |
| 110 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], halveLength,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forw
arders[f], halveLength, 0) |
| 111 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], halveLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyAr
ray), forwarders[f], halveLength, 0) |
| 112 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], halveL
ength, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparse
Array), forwarders[f], halveLength, 0) |
| 113 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], returnFal
se, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray)
, forwarders[f], returnFalse, 0) |
| 114 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], returnFals
e, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray),
forwarders[f], returnFalse, 0) |
| 115 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], retur
nFalse, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmp
tyArray), forwarders[f], returnFalse, 0) |
| 116 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], retu
rnFalse, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSp
arseArray), forwarders[f], returnFalse, 0) |
| 117 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], returnTru
e, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray),
forwarders[f], returnTrue, 0) |
| 118 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], returnTrue
, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), f
orwarders[f], returnTrue, 0) |
| 119 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], retur
nTrue, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmpt
yArray), forwarders[f], returnTrue, 0) |
| 120 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], retu
rnTrue, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSpa
rseArray), forwarders[f], returnTrue, 0) |
| 121 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], returnEle
m, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray),
forwarders[f], returnElem, 0) |
| 122 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], returnElem
, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), f
orwarders[f], returnElem, 0) |
| 123 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], retur
nElem, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmpt
yArray), forwarders[f], returnElem, 0) |
| 124 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], retu
rnElem, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSpa
rseArray), forwarders[f], returnElem, 0) |
| 125 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], returnInd
ex, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray)
, forwarders[f], returnIndex, 0) |
| 126 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], returnInde
x, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray),
forwarders[f], returnIndex, 0) |
| 127 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], retur
nIndex, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmp
tyArray), forwarders[f], returnIndex, 0) |
| 128 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], retu
rnIndex, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSp
arseArray), forwarders[f], returnIndex, 0) |
| 129 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], increaseL
ength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArr
ay), forwarders[f], increaseLength, 0) |
| 130 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], increaseLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray
), forwarders[f], increaseLength, 0) |
| 131 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], incre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(large
EmptyArray), forwarders[f], increaseLength, 0) |
| 132 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], incr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(larg
eSparseArray), forwarders[f], increaseLength, 0) |
| 133 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], decreaseL
ength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArr
ay), forwarders[f], decreaseLength, 0) |
| 134 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], decreaseLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray
), forwarders[f], decreaseLength, 0) |
| 135 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], decre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(large
EmptyArray), forwarders[f], decreaseLength, 0) |
| 136 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], decr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(larg
eSparseArray), forwarders[f], decreaseLength, 0) |
| 137 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], halveLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray)
, forwarders[f], halveLength, 0) |
| 138 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], halveLengt
h, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray),
forwarders[f], halveLength, 0) |
| 139 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], halve
Length, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmp
tyArray), forwarders[f], halveLength, 0) |
| 140 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], halv
eLength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSp
arseArray), forwarders[f], halveLength, 0) |
| 141 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnFal
se, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray)
, forwarders[f], returnFalse, 0) |
| 142 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnFals
e, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray),
forwarders[f], returnFalse, 0) |
| 143 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], retur
nFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmp
tyArray), forwarders[f], returnFalse, 0) |
| 144 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], retu
rnFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSp
arseArray), forwarders[f], returnFalse, 0) |
| 145 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnTru
e, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray),
forwarders[f], returnTrue, 0) |
| 146 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnTrue
, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), f
orwarders[f], returnTrue, 0) |
| 147 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], retur
nTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmpt
yArray), forwarders[f], returnTrue, 0) |
| 148 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], retu
rnTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSpa
rseArray), forwarders[f], returnTrue, 0) |
| 149 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnEle
m, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray),
forwarders[f], returnElem, 0) |
| 150 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnElem
, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), f
orwarders[f], returnElem, 0) |
| 151 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], retur
nElem, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmpt
yArray), forwarders[f], returnElem, 0) |
| 152 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], retu
rnElem, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSpa
rseArray), forwarders[f], returnElem, 0) |
| 153 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnInd
ex, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray)
, forwarders[f], returnIndex, 0) |
| 154 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnInde
x, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray),
forwarders[f], returnIndex, 0) |
| 155 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], retur
nIndex, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmp
tyArray), forwarders[f], returnIndex, 0) |
| 156 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], retu
rnIndex, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSp
arseArray), forwarders[f], returnIndex, 0) |
| 157 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], increaseL
ength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArr
ay), forwarders[f], increaseLength, 0) |
| 158 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], increaseLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray
), forwarders[f], increaseLength, 0) |
| 159 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], incre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(large
EmptyArray), forwarders[f], increaseLength, 0) |
| 160 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], incr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(larg
eSparseArray), forwarders[f], increaseLength, 0) |
| 161 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], decreaseL
ength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArr
ay), forwarders[f], decreaseLength, 0) |
| 162 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], decreaseLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray
), forwarders[f], decreaseLength, 0) |
| 163 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], decre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(large
EmptyArray), forwarders[f], decreaseLength, 0) |
| 164 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], decr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(larg
eSparseArray), forwarders[f], decreaseLength, 0) |
| 165 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], halveLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray)
, forwarders[f], halveLength, 0) |
| 166 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], halveLengt
h, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray),
forwarders[f], halveLength, 0) |
| 167 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], halve
Length, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmp
tyArray), forwarders[f], halveLength, 0) |
| 168 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], halv
eLength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSp
arseArray), forwarders[f], halveLength, 0) |
| 169 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], returnFalse,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forw
arders[f], returnFalse, 0) |
| 170 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], returnFalse,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forwar
ders[f], returnFalse, 0) |
| 171 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], returnF
alse, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseAr
ray), forwarders[f], returnFalse, 0) |
| 172 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], returnTrue,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwa
rders[f], returnTrue, 0) |
| 173 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], returnTrue, 0
) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], returnTrue, 0) |
| 174 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], returnT
rue, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArr
ay), forwarders[f], returnTrue, 0) |
| 175 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], returnElem,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwa
rders[f], returnElem, 0) |
| 176 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], returnElem, 0
) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], returnElem, 0) |
| 177 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], returnE
lem, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArr
ay), forwarders[f], returnElem, 0) |
| 178 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], returnIndex,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forw
arders[f], returnIndex, 0) |
| 179 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], returnIndex,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forwar
ders[f], returnIndex, 0) |
| 180 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], returnI
ndex, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseAr
ray), forwarders[f], returnIndex, 0) |
| 181 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], increaseLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), f
orwarders[f], increaseLength, 0) |
| 182 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], increaseLengt
h, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), for
warders[f], increaseLength, 0) |
| 183 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], increas
eLength, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSpars
eArray), forwarders[f], increaseLength, 0) |
| 184 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], decreaseLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), f
orwarders[f], decreaseLength, 0) |
| 185 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], decreaseLengt
h, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), for
warders[f], decreaseLength, 0) |
| 186 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], decreas
eLength, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSpars
eArray), forwarders[f], decreaseLength, 0) |
| 187 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], halveLength,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forw
arders[f], halveLength, 0) |
| 188 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], halveLength,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forwar
ders[f], halveLength, 0) |
| 189 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], halveLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseAr
ray), forwarders[f], halveLength, 0) |
| 190 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], retu
rnFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(si
mpleArray), forwarders[f], returnFalse, 0) |
| 191 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], retur
nFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emp
tyArray), forwarders[f], returnFalse, 0) |
| 192 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
returnFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObjec
t(largeEmptyArray), forwarders[f], returnFalse, 0) |
| 193 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
returnFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObje
ct(largeSparseArray), forwarders[f], returnFalse, 0) |
| 194 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], retu
rnTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(sim
pleArray), forwarders[f], returnTrue, 0) |
| 195 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], retur
nTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(empt
yArray), forwarders[f], returnTrue, 0) |
| 196 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
returnTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject
(largeEmptyArray), forwarders[f], returnTrue, 0) |
| 197 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
returnTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObjec
t(largeSparseArray), forwarders[f], returnTrue, 0) |
| 198 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], retu
rnElem, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(sim
pleArray), forwarders[f], returnElem, 0) |
| 199 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], retur
nElem, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(empt
yArray), forwarders[f], returnElem, 0) |
| 200 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
returnElem, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject
(largeEmptyArray), forwarders[f], returnElem, 0) |
| 201 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
returnElem, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObjec
t(largeSparseArray), forwarders[f], returnElem, 0) |
| 202 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], incr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject
(simpleArray), forwarders[f], increaseLength, 0) |
| 203 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], incre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(
emptyArray), forwarders[f], increaseLength, 0) |
| 204 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
increaseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toOb
ject(largeEmptyArray), forwarders[f], increaseLength, 0) |
| 205 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
increaseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toO
bject(largeSparseArray), forwarders[f], increaseLength, 0) |
| 206 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], decr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject
(simpleArray), forwarders[f], decreaseLength, 0) |
| 207 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], decre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(
emptyArray), forwarders[f], decreaseLength, 0) |
| 208 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
decreaseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toOb
ject(largeEmptyArray), forwarders[f], decreaseLength, 0) |
| 209 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
decreaseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toO
bject(largeSparseArray), forwarders[f], decreaseLength, 0) |
| 210 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], halv
eLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(si
mpleArray), forwarders[f], halveLength, 0) |
| 211 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], halve
Length, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emp
tyArray), forwarders[f], halveLength, 0) |
| 212 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
halveLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObjec
t(largeEmptyArray), forwarders[f], halveLength, 0) |
| 213 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
halveLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObje
ct(largeSparseArray), forwarders[f], halveLength, 0) |
| 214 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], returnFals
e, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(simpl
eArray), forwarders[f], returnFalse, 0) |
| 215 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], returnFalse
, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(emptyA
rray), forwarders[f], returnFalse, 0) |
| 216 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], return
False, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(l
argeEmptyArray), forwarders[f], returnFalse, 0) |
| 217 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], retur
nFalse, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(
largeSparseArray), forwarders[f], returnFalse, 0) |
| 218 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], returnTrue
, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(simple
Array), forwarders[f], returnTrue, 0) |
| 219 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], returnTrue,
0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(emptyAr
ray), forwarders[f], returnTrue, 0) |
| 220 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], return
True, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(la
rgeEmptyArray), forwarders[f], returnTrue, 0) |
| 221 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], retur
nTrue, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(l
argeSparseArray), forwarders[f], returnTrue, 0) |
| 222 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], returnElem
, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(simple
Array), forwarders[f], returnElem, 0) |
| 223 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], returnElem,
0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(emptyAr
ray), forwarders[f], returnElem, 0) |
| 224 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], return
Elem, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(la
rgeEmptyArray), forwarders[f], returnElem, 0) |
| 225 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], retur
nElem, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(l
argeSparseArray), forwarders[f], returnElem, 0) |
| 226 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], returnInde
x, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(simpl
eArray), forwarders[f], returnIndex, 0) |
| 227 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], returnIndex
, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(emptyA
rray), forwarders[f], returnIndex, 0) |
| 228 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], return
Index, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(l
argeEmptyArray), forwarders[f], returnIndex, 0) |
| 229 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], retur
nIndex, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(
largeSparseArray), forwarders[f], returnIndex, 0) |
| 230 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], increaseLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(si
mpleArray), forwarders[f], increaseLength, 0) |
| 231 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], increaseLen
gth, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(emp
tyArray), forwarders[f], increaseLength, 0) |
| 232 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], increa
seLength, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObjec
t(largeEmptyArray), forwarders[f], increaseLength, 0) |
| 233 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], incre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObje
ct(largeSparseArray), forwarders[f], increaseLength, 0) |
| 234 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], decreaseLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(si
mpleArray), forwarders[f], decreaseLength, 0) |
| 235 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], decreaseLen
gth, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(emp
tyArray), forwarders[f], decreaseLength, 0) |
| 236 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], decrea
seLength, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObjec
t(largeEmptyArray), forwarders[f], decreaseLength, 0) |
| 237 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], decre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObje
ct(largeSparseArray), forwarders[f], decreaseLength, 0) |
| 238 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], halveLengt
h, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(simpl
eArray), forwarders[f], halveLength, 0) |
| 239 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], halveLength
, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(emptyA
rray), forwarders[f], halveLength, 0) |
| 240 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], halveL
ength, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(l
argeEmptyArray), forwarders[f], halveLength, 0) |
| 241 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], halve
Length, 0) is count=0;lastIndex=-1;Array.prototype.every.call(toUnorderedObject(
largeSparseArray), forwarders[f], halveLength, 0) |
| 242 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], returnFa
lse, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObject(s
impleArray), forwarders[f], returnFalse, 0) |
| 243 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], returnFal
se, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObject(em
ptyArray), forwarders[f], returnFalse, 0) |
| 244 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], retu
rnFalse, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObje
ct(largeEmptyArray), forwarders[f], returnFalse, 0) |
| 245 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], ret
urnFalse, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObj
ect(largeSparseArray), forwarders[f], returnFalse, 0) |
| 246 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], returnTr
ue, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObject(si
mpleArray), forwarders[f], returnTrue, 0) |
| 247 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], returnTru
e, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObject(emp
tyArray), forwarders[f], returnTrue, 0) |
| 248 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], retu
rnTrue, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObjec
t(largeEmptyArray), forwarders[f], returnTrue, 0) |
| 249 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], ret
urnTrue, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObje
ct(largeSparseArray), forwarders[f], returnTrue, 0) |
| 250 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], returnEl
em, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObject(si
mpleArray), forwarders[f], returnElem, 0) |
| 251 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], returnEle
m, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObject(emp
tyArray), forwarders[f], returnElem, 0) |
| 252 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], retu
rnElem, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObjec
t(largeEmptyArray), forwarders[f], returnElem, 0) |
| 253 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], ret
urnElem, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObje
ct(largeSparseArray), forwarders[f], returnElem, 0) |
| 254 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], returnIn
dex, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObject(s
impleArray), forwarders[f], returnIndex, 0) |
| 255 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], returnInd
ex, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObject(em
ptyArray), forwarders[f], returnIndex, 0) |
| 256 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], retu
rnIndex, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObje
ct(largeEmptyArray), forwarders[f], returnIndex, 0) |
| 257 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], ret
urnIndex, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObj
ect(largeSparseArray), forwarders[f], returnIndex, 0) |
| 258 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], increase
Length, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObjec
t(simpleArray), forwarders[f], increaseLength, 0) |
| 259 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], increaseL
ength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObject
(emptyArray), forwarders[f], increaseLength, 0) |
| 260 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], incr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedO
bject(largeEmptyArray), forwarders[f], increaseLength, 0) |
| 261 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], inc
reaseLength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnordered
Object(largeSparseArray), forwarders[f], increaseLength, 0) |
| 262 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], decrease
Length, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObjec
t(simpleArray), forwarders[f], decreaseLength, 0) |
| 263 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], decreaseL
ength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObject
(emptyArray), forwarders[f], decreaseLength, 0) |
| 264 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], decr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedO
bject(largeEmptyArray), forwarders[f], decreaseLength, 0) |
| 265 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], dec
reaseLength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnordered
Object(largeSparseArray), forwarders[f], decreaseLength, 0) |
| 266 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], halveLen
gth, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObject(s
impleArray), forwarders[f], halveLength, 0) |
| 267 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], halveLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObject(em
ptyArray), forwarders[f], halveLength, 0) |
| 268 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], halv
eLength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObje
ct(largeEmptyArray), forwarders[f], halveLength, 0) |
| 269 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], hal
veLength, 0) is count=0;lastIndex=-1;Array.prototype.forEach.call(toUnorderedObj
ect(largeSparseArray), forwarders[f], halveLength, 0) |
| 270 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], returnFalse
, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(simpleA
rray), forwarders[f], returnFalse, 0) |
| 271 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], returnFalse,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(emptyArr
ay), forwarders[f], returnFalse, 0) |
| 272 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], returnF
alse, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(lar
geEmptyArray), forwarders[f], returnFalse, 0) |
| 273 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], return
False, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(la
rgeSparseArray), forwarders[f], returnFalse, 0) |
| 274 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], returnTrue,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(simpleAr
ray), forwarders[f], returnTrue, 0) |
| 275 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], returnTrue,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(emptyArra
y), forwarders[f], returnTrue, 0) |
| 276 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], returnT
rue, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(larg
eEmptyArray), forwarders[f], returnTrue, 0) |
| 277 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], return
True, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(lar
geSparseArray), forwarders[f], returnTrue, 0) |
| 278 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], returnElem,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(simpleAr
ray), forwarders[f], returnElem, 0) |
| 279 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], returnElem,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(emptyArra
y), forwarders[f], returnElem, 0) |
| 280 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], returnE
lem, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(larg
eEmptyArray), forwarders[f], returnElem, 0) |
| 281 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], return
Elem, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(lar
geSparseArray), forwarders[f], returnElem, 0) |
| 282 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], returnIndex
, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(simpleA
rray), forwarders[f], returnIndex, 0) |
| 283 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], returnIndex,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(emptyArr
ay), forwarders[f], returnIndex, 0) |
| 284 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], returnI
ndex, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(lar
geEmptyArray), forwarders[f], returnIndex, 0) |
| 285 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], return
Index, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(la
rgeSparseArray), forwarders[f], returnIndex, 0) |
| 286 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], increaseLen
gth, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(simp
leArray), forwarders[f], increaseLength, 0) |
| 287 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], increaseLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(empty
Array), forwarders[f], increaseLength, 0) |
| 288 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], increas
eLength, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(
largeEmptyArray), forwarders[f], increaseLength, 0) |
| 289 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], increa
seLength, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject
(largeSparseArray), forwarders[f], increaseLength, 0) |
| 290 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], decreaseLen
gth, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(simp
leArray), forwarders[f], decreaseLength, 0) |
| 291 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], decreaseLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(empty
Array), forwarders[f], decreaseLength, 0) |
| 292 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], decreas
eLength, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(
largeEmptyArray), forwarders[f], decreaseLength, 0) |
| 293 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], decrea
seLength, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject
(largeSparseArray), forwarders[f], decreaseLength, 0) |
| 294 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], halveLength
, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(simpleA
rray), forwarders[f], halveLength, 0) |
| 295 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], halveLength,
0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(emptyArr
ay), forwarders[f], halveLength, 0) |
| 296 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], halveLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(lar
geEmptyArray), forwarders[f], halveLength, 0) |
| 297 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], halveL
ength, 0) is count=0;lastIndex=-1;Array.prototype.some.call(toUnorderedObject(la
rgeSparseArray), forwarders[f], halveLength, 0) |
| 298 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], returnFal
se, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(sim
pleArray), forwarders[f], returnFalse, 0) |
| 299 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], returnFals
e, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(empt
yArray), forwarders[f], returnFalse, 0) |
| 300 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], retur
nFalse, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject
(largeEmptyArray), forwarders[f], returnFalse, 0) |
| 301 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], retu
rnFalse, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObjec
t(largeSparseArray), forwarders[f], returnFalse, 0) |
| 302 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], returnTru
e, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(simp
leArray), forwarders[f], returnTrue, 0) |
| 303 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], returnTrue
, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(empty
Array), forwarders[f], returnTrue, 0) |
| 304 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], retur
nTrue, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(
largeEmptyArray), forwarders[f], returnTrue, 0) |
| 305 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], retu
rnTrue, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject
(largeSparseArray), forwarders[f], returnTrue, 0) |
| 306 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], returnEle
m, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(simp
leArray), forwarders[f], returnElem, 0) |
| 307 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], returnElem
, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(empty
Array), forwarders[f], returnElem, 0) |
| 308 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], retur
nElem, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(
largeEmptyArray), forwarders[f], returnElem, 0) |
| 309 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], retu
rnElem, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject
(largeSparseArray), forwarders[f], returnElem, 0) |
| 310 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], returnInd
ex, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(sim
pleArray), forwarders[f], returnIndex, 0) |
| 311 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], returnInde
x, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(empt
yArray), forwarders[f], returnIndex, 0) |
| 312 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], retur
nIndex, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject
(largeEmptyArray), forwarders[f], returnIndex, 0) |
| 313 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], retu
rnIndex, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObjec
t(largeSparseArray), forwarders[f], returnIndex, 0) |
| 314 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], increaseL
ength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(
simpleArray), forwarders[f], increaseLength, 0) |
| 315 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], increaseLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(e
mptyArray), forwarders[f], increaseLength, 0) |
| 316 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], incre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObj
ect(largeEmptyArray), forwarders[f], increaseLength, 0) |
| 317 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], incr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedOb
ject(largeSparseArray), forwarders[f], increaseLength, 0) |
| 318 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], decreaseL
ength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(
simpleArray), forwarders[f], decreaseLength, 0) |
| 319 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], decreaseLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(e
mptyArray), forwarders[f], decreaseLength, 0) |
| 320 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], decre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObj
ect(largeEmptyArray), forwarders[f], decreaseLength, 0) |
| 321 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], decr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedOb
ject(largeSparseArray), forwarders[f], decreaseLength, 0) |
| 322 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], halveLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(sim
pleArray), forwarders[f], halveLength, 0) |
| 323 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], halveLengt
h, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject(empt
yArray), forwarders[f], halveLength, 0) |
| 324 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], halve
Length, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObject
(largeEmptyArray), forwarders[f], halveLength, 0) |
| 325 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], halv
eLength, 0) is count=0;lastIndex=-1;Array.prototype.filter.call(toUnorderedObjec
t(largeSparseArray), forwarders[f], halveLength, 0) |
| 326 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnFal
se, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(sim
pleArray), forwarders[f], returnFalse, 0) |
| 327 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnFals
e, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(empt
yArray), forwarders[f], returnFalse, 0) |
| 328 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], retur
nFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject
(largeEmptyArray), forwarders[f], returnFalse, 0) |
| 329 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], retu
rnFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObjec
t(largeSparseArray), forwarders[f], returnFalse, 0) |
| 330 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnTru
e, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(simp
leArray), forwarders[f], returnTrue, 0) |
| 331 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnTrue
, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(empty
Array), forwarders[f], returnTrue, 0) |
| 332 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], retur
nTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(
largeEmptyArray), forwarders[f], returnTrue, 0) |
| 333 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], retu
rnTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject
(largeSparseArray), forwarders[f], returnTrue, 0) |
| 334 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnEle
m, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(simp
leArray), forwarders[f], returnElem, 0) |
| 335 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnElem
, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(empty
Array), forwarders[f], returnElem, 0) |
| 336 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], retur
nElem, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(
largeEmptyArray), forwarders[f], returnElem, 0) |
| 337 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], retu
rnElem, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject
(largeSparseArray), forwarders[f], returnElem, 0) |
| 338 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnInd
ex, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(sim
pleArray), forwarders[f], returnIndex, 0) |
| 339 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnInde
x, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(empt
yArray), forwarders[f], returnIndex, 0) |
| 340 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], retur
nIndex, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject
(largeEmptyArray), forwarders[f], returnIndex, 0) |
| 341 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], retu
rnIndex, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObjec
t(largeSparseArray), forwarders[f], returnIndex, 0) |
| 342 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], increaseL
ength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(
simpleArray), forwarders[f], increaseLength, 0) |
| 343 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], increaseLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(e
mptyArray), forwarders[f], increaseLength, 0) |
| 344 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], incre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObj
ect(largeEmptyArray), forwarders[f], increaseLength, 0) |
| 345 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], incr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedOb
ject(largeSparseArray), forwarders[f], increaseLength, 0) |
| 346 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], decreaseL
ength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(
simpleArray), forwarders[f], decreaseLength, 0) |
| 347 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], decreaseLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(e
mptyArray), forwarders[f], decreaseLength, 0) |
| 348 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], decre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObj
ect(largeEmptyArray), forwarders[f], decreaseLength, 0) |
| 349 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], decr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedOb
ject(largeSparseArray), forwarders[f], decreaseLength, 0) |
| 350 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], halveLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(sim
pleArray), forwarders[f], halveLength, 0) |
| 351 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], halveLengt
h, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject(empt
yArray), forwarders[f], halveLength, 0) |
| 352 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], halve
Length, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObject
(largeEmptyArray), forwarders[f], halveLength, 0) |
| 353 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], halv
eLength, 0) is count=0;lastIndex=-1;Array.prototype.reduce.call(toUnorderedObjec
t(largeSparseArray), forwarders[f], halveLength, 0) |
| 354 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], returnFalse,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(simpleArr
ay), forwarders[f], returnFalse, 0) |
| 355 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], returnFalse,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(emptyArray
), forwarders[f], returnFalse, 0) |
| 356 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], returnF
alse, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(larg
eSparseArray), forwarders[f], returnFalse, 0) |
| 357 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], returnTrue,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(simpleArra
y), forwarders[f], returnTrue, 0) |
| 358 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], returnTrue, 0
) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(emptyArray)
, forwarders[f], returnTrue, 0) |
| 359 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], returnT
rue, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(large
SparseArray), forwarders[f], returnTrue, 0) |
| 360 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], returnElem,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(simpleArra
y), forwarders[f], returnElem, 0) |
| 361 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], returnElem, 0
) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(emptyArray)
, forwarders[f], returnElem, 0) |
| 362 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], returnE
lem, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(large
SparseArray), forwarders[f], returnElem, 0) |
| 363 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], returnIndex,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(simpleArr
ay), forwarders[f], returnIndex, 0) |
| 364 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], returnIndex,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(emptyArray
), forwarders[f], returnIndex, 0) |
| 365 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], returnI
ndex, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(larg
eSparseArray), forwarders[f], returnIndex, 0) |
| 366 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], increaseLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(simple
Array), forwarders[f], increaseLength, 0) |
| 367 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], increaseLengt
h, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(emptyAr
ray), forwarders[f], increaseLength, 0) |
| 368 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], increas
eLength, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(l
argeSparseArray), forwarders[f], increaseLength, 0) |
| 369 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], decreaseLeng
th, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(simple
Array), forwarders[f], decreaseLength, 0) |
| 370 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], decreaseLengt
h, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(emptyAr
ray), forwarders[f], decreaseLength, 0) |
| 371 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], decreas
eLength, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(l
argeSparseArray), forwarders[f], decreaseLength, 0) |
| 372 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], halveLength,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(simpleArr
ay), forwarders[f], halveLength, 0) |
| 373 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], halveLength,
0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(emptyArray
), forwarders[f], halveLength, 0) |
| 374 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], halveLe
ngth, 0) is count=0;lastIndex=-1;Array.prototype.map.call(toUnorderedObject(larg
eSparseArray), forwarders[f], halveLength, 0) |
| 375 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], retu
rnFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnordered
Object(simpleArray), forwarders[f], returnFalse, 0) |
| 376 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], retur
nFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnorderedO
bject(emptyArray), forwarders[f], returnFalse, 0) |
| 377 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
returnFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnord
eredObject(largeEmptyArray), forwarders[f], returnFalse, 0) |
| 378 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
returnFalse, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnor
deredObject(largeSparseArray), forwarders[f], returnFalse, 0) |
| 379 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], retu
rnTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnorderedO
bject(simpleArray), forwarders[f], returnTrue, 0) |
| 380 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], retur
nTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnorderedOb
ject(emptyArray), forwarders[f], returnTrue, 0) |
| 381 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
returnTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnorde
redObject(largeEmptyArray), forwarders[f], returnTrue, 0) |
| 382 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
returnTrue, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnord
eredObject(largeSparseArray), forwarders[f], returnTrue, 0) |
| 383 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], retu
rnElem, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnorderedO
bject(simpleArray), forwarders[f], returnElem, 0) |
| 384 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], retur
nElem, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnorderedOb
ject(emptyArray), forwarders[f], returnElem, 0) |
| 385 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
returnElem, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnorde
redObject(largeEmptyArray), forwarders[f], returnElem, 0) |
| 386 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
returnElem, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnord
eredObject(largeSparseArray), forwarders[f], returnElem, 0) |
| 387 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], incr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnorde
redObject(simpleArray), forwarders[f], increaseLength, 0) |
| 388 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], incre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnorder
edObject(emptyArray), forwarders[f], increaseLength, 0) |
| 389 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
increaseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUn
orderedObject(largeEmptyArray), forwarders[f], increaseLength, 0) |
| 390 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
increaseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toU
norderedObject(largeSparseArray), forwarders[f], increaseLength, 0) |
| 391 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], decr
easeLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnorde
redObject(simpleArray), forwarders[f], decreaseLength, 0) |
| 392 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], decre
aseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnorder
edObject(emptyArray), forwarders[f], decreaseLength, 0) |
| 393 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
decreaseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUn
orderedObject(largeEmptyArray), forwarders[f], decreaseLength, 0) |
| 394 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
decreaseLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toU
norderedObject(largeSparseArray), forwarders[f], decreaseLength, 0) |
| 395 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], halv
eLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnordered
Object(simpleArray), forwarders[f], halveLength, 0) |
| 396 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], halve
Length, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnorderedO
bject(emptyArray), forwarders[f], halveLength, 0) |
| 397 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
halveLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnord
eredObject(largeEmptyArray), forwarders[f], halveLength, 0) |
| 398 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
halveLength, 0) is count=0;lastIndex=-1;Array.prototype.reduceRight.call(toUnor
deredObject(largeSparseArray), forwarders[f], halveLength, 0) |
| 399 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], returnFals
e, 0); count is 1 |
| 400 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], returnFalse, 0); count is 1 |
| 401 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], returnFalse, 0); count is 1 |
| 402 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], returnFalse
, 0); count is 0 |
| 403 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], returnFalse, 0); count is 0 |
| 404 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], returnFalse, 0); count is 0 |
| 405 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], return
False, 0); count is 0 |
| 406 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], returnFalse, 0); count is 0 |
| 407 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], returnFalse, 0); count is 0 |
| 408 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], retur
nFalse, 0); count is 1 |
| 409 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], returnFalse, 0); count is 1 |
| 410 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], returnFalse, 0); count is 1 |
| 411 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], returnTrue
, 0); count is 6 |
| 412 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], returnTrue, 0); count is 6 |
| 413 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], returnTrue, 0); count is 6 |
| 414 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], returnTrue,
0); count is 0 |
| 415 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], returnTrue, 0); count is 0 |
| 416 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], returnTrue, 0); count is 0 |
| 417 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], return
True, 0); count is 0 |
| 418 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], returnTrue, 0); count is 0 |
| 419 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], returnTrue, 0); count is 0 |
| 420 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], retur
nTrue, 0); count is 7 |
| 421 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], returnTrue, 0); count is 7 |
| 422 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], returnTrue, 0); count is 7 |
| 423 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], returnElem
, 0); count is 1 |
| 424 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], returnElem, 0); count is 1 |
| 425 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], returnElem, 0); count is 1 |
| 426 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], returnElem,
0); count is 0 |
| 427 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], returnElem, 0); count is 0 |
| 428 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], returnElem, 0); count is 0 |
| 429 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], return
Elem, 0); count is 0 |
| 430 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], returnElem, 0); count is 0 |
| 431 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], returnElem, 0); count is 0 |
| 432 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], retur
nElem, 0); count is 1 |
| 433 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], returnElem, 0); count is 1 |
| 434 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], returnElem, 0); count is 1 |
| 435 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], returnInde
x, 0); count is 1 |
| 436 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], returnIndex, 0); count is 1 |
| 437 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], returnIndex, 0); count is 1 |
| 438 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], returnIndex
, 0); count is 0 |
| 439 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], returnIndex, 0); count is 0 |
| 440 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], returnIndex, 0); count is 0 |
| 441 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], return
Index, 0); count is 0 |
| 442 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], returnIndex, 0); count is 0 |
| 443 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], returnIndex, 0); count is 0 |
| 444 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], retur
nIndex, 0); count is 1 |
| 445 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], returnIndex, 0); count is 1 |
| 446 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], returnIndex, 0); count is 1 |
| 447 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], increaseLe
ngth, 0); count is 1 |
| 448 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], increaseLength, 0); count is 1 |
| 449 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], increaseLength, 0); count is 1 |
| 450 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], increaseLen
gth, 0); count is 0 |
| 451 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], increaseLength, 0); count is 0 |
| 452 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], increaseLength, 0); count is 0 |
| 453 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], increa
seLength, 0); count is 0 |
| 454 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], increaseLength, 0); count is 0 |
| 455 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], increaseLength, 0); count is 0 |
| 456 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], incre
aseLength, 0); count is 1 |
| 457 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], increaseLength, 0); count is 1 |
| 458 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], increaseLength, 0); count is 1 |
| 459 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], decreaseLe
ngth, 0); count is 1 |
| 460 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], decreaseLength, 0); count is 1 |
| 461 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], decreaseLength, 0); count is 1 |
| 462 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], decreaseLen
gth, 0); count is 0 |
| 463 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], decreaseLength, 0); count is 0 |
| 464 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], decreaseLength, 0); count is 0 |
| 465 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], decrea
seLength, 0); count is 0 |
| 466 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], decreaseLength, 0); count is 0 |
| 467 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], decreaseLength, 0); count is 0 |
| 468 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], decre
aseLength, 0); count is 1 |
| 469 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], decreaseLength, 0); count is 1 |
| 470 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], decreaseLength, 0); count is 1 |
| 471 PASS count=0;lastIndex=-1;copyArray(simpleArray).every(forwarders[f], halveLengt
h, 0); count is 1 |
| 472 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], halveLength, 0); count is 1 |
| 473 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(simpleArray), forw
arders[f], halveLength, 0); count is 1 |
| 474 PASS count=0;lastIndex=-1;copyArray(emptyArray).every(forwarders[f], halveLength
, 0); count is 0 |
| 475 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], halveLength, 0); count is 0 |
| 476 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(emptyArray), forwa
rders[f], halveLength, 0); count is 0 |
| 477 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).every(forwarders[f], halveL
ength, 0); count is 0 |
| 478 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], halveLength, 0); count is 0 |
| 479 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeEmptyArray),
forwarders[f], halveLength, 0); count is 0 |
| 480 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).every(forwarders[f], halve
Length, 0); count is 1 |
| 481 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], halveLength, 0); count is 1 |
| 482 PASS count=0;lastIndex=-1;Array.prototype.every.call(toObject(largeSparseArray),
forwarders[f], halveLength, 0); count is 1 |
| 483 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], returnFa
lse, 0); count is 6 |
| 484 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], returnFalse, 0); count is 6 |
| 485 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], returnFalse, 0); count is 6 |
| 486 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], returnFal
se, 0); count is 0 |
| 487 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], returnFalse, 0); count is 0 |
| 488 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], returnFalse, 0); count is 0 |
| 489 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], retu
rnFalse, 0); count is 0 |
| 490 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], returnFalse, 0); count is 0 |
| 491 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], returnFalse, 0); count is 0 |
| 492 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], ret
urnFalse, 0); count is 7 |
| 493 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], returnFalse, 0); count is 7 |
| 494 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], returnFalse, 0); count is 7 |
| 495 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], returnTr
ue, 0); count is 6 |
| 496 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], returnTrue, 0); count is 6 |
| 497 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], returnTrue, 0); count is 6 |
| 498 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], returnTru
e, 0); count is 0 |
| 499 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], returnTrue, 0); count is 0 |
| 500 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], returnTrue, 0); count is 0 |
| 501 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], retu
rnTrue, 0); count is 0 |
| 502 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], returnTrue, 0); count is 0 |
| 503 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], returnTrue, 0); count is 0 |
| 504 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], ret
urnTrue, 0); count is 7 |
| 505 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], returnTrue, 0); count is 7 |
| 506 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], returnTrue, 0); count is 7 |
| 507 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], returnEl
em, 0); count is 6 |
| 508 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], returnElem, 0); count is 6 |
| 509 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], returnElem, 0); count is 6 |
| 510 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], returnEle
m, 0); count is 0 |
| 511 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], returnElem, 0); count is 0 |
| 512 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], returnElem, 0); count is 0 |
| 513 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], retu
rnElem, 0); count is 0 |
| 514 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], returnElem, 0); count is 0 |
| 515 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], returnElem, 0); count is 0 |
| 516 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], ret
urnElem, 0); count is 7 |
| 517 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], returnElem, 0); count is 7 |
| 518 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], returnElem, 0); count is 7 |
| 519 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], returnIn
dex, 0); count is 6 |
| 520 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], returnIndex, 0); count is 6 |
| 521 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], returnIndex, 0); count is 6 |
| 522 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], returnInd
ex, 0); count is 0 |
| 523 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], returnIndex, 0); count is 0 |
| 524 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], returnIndex, 0); count is 0 |
| 525 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], retu
rnIndex, 0); count is 0 |
| 526 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], returnIndex, 0); count is 0 |
| 527 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], returnIndex, 0); count is 0 |
| 528 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], ret
urnIndex, 0); count is 7 |
| 529 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], returnIndex, 0); count is 7 |
| 530 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], returnIndex, 0); count is 7 |
| 531 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], increase
Length, 0); count is 6 |
| 532 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], increaseLength, 0); count is 6 |
| 533 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], increaseLength, 0); count is 6 |
| 534 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], increaseL
ength, 0); count is 0 |
| 535 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], increaseLength, 0); count is 0 |
| 536 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], increaseLength, 0); count is 0 |
| 537 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], incr
easeLength, 0); count is 0 |
| 538 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], increaseLength, 0); count is 0 |
| 539 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], increaseLength, 0); count is 0 |
| 540 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], inc
reaseLength, 0); count is 7 |
| 541 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], increaseLength, 0); count is 7 |
| 542 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], increaseLength, 0); count is 7 |
| 543 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], decrease
Length, 0); count is 3 |
| 544 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], decreaseLength, 0); count is 6 |
| 545 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], decreaseLength, 0); count is 6 |
| 546 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], decreaseL
ength, 0); count is 0 |
| 547 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], decreaseLength, 0); count is 0 |
| 548 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], decreaseLength, 0); count is 0 |
| 549 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], decr
easeLength, 0); count is 0 |
| 550 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], decreaseLength, 0); count is 0 |
| 551 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], decreaseLength, 0); count is 0 |
| 552 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], dec
reaseLength, 0); count is 6 |
| 553 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], decreaseLength, 0); count is 7 |
| 554 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], decreaseLength, 0); count is 7 |
| 555 PASS count=0;lastIndex=-1;copyArray(simpleArray).forEach(forwarders[f], halveLen
gth, 0); count is 3 |
| 556 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], halveLength, 0); count is 6 |
| 557 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(simpleArray), fo
rwarders[f], halveLength, 0); count is 6 |
| 558 PASS count=0;lastIndex=-1;copyArray(emptyArray).forEach(forwarders[f], halveLeng
th, 0); count is 0 |
| 559 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], halveLength, 0); count is 0 |
| 560 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(emptyArray), for
warders[f], halveLength, 0); count is 0 |
| 561 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).forEach(forwarders[f], halv
eLength, 0); count is 0 |
| 562 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], halveLength, 0); count is 0 |
| 563 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeEmptyArray)
, forwarders[f], halveLength, 0); count is 0 |
| 564 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).forEach(forwarders[f], hal
veLength, 0); count is 6 |
| 565 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], halveLength, 0); count is 7 |
| 566 PASS count=0;lastIndex=-1;Array.prototype.forEach.call(toObject(largeSparseArray
), forwarders[f], halveLength, 0); count is 7 |
| 567 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], returnFalse
, 0); count is 6 |
| 568 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], returnFalse, 0); count is 6 |
| 569 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], returnFalse, 0); count is 6 |
| 570 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], returnFalse,
0); count is 0 |
| 571 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], returnFalse, 0); count is 0 |
| 572 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], returnFalse, 0); count is 0 |
| 573 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], returnF
alse, 0); count is 0 |
| 574 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], returnFalse, 0); count is 0 |
| 575 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], returnFalse, 0); count is 0 |
| 576 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], return
False, 0); count is 7 |
| 577 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], returnFalse, 0); count is 7 |
| 578 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], returnFalse, 0); count is 7 |
| 579 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], returnTrue,
0); count is 1 |
| 580 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], returnTrue, 0); count is 1 |
| 581 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], returnTrue, 0); count is 1 |
| 582 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], returnTrue,
0); count is 0 |
| 583 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], returnTrue, 0); count is 0 |
| 584 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], returnTrue, 0); count is 0 |
| 585 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], returnT
rue, 0); count is 0 |
| 586 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], returnTrue, 0); count is 0 |
| 587 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], returnTrue, 0); count is 0 |
| 588 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], return
True, 0); count is 1 |
| 589 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], returnTrue, 0); count is 1 |
| 590 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], returnTrue, 0); count is 1 |
| 591 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], returnElem,
0); count is 2 |
| 592 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], returnElem, 0); count is 2 |
| 593 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], returnElem, 0); count is 2 |
| 594 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], returnElem,
0); count is 0 |
| 595 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], returnElem, 0); count is 0 |
| 596 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], returnElem, 0); count is 0 |
| 597 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], returnE
lem, 0); count is 0 |
| 598 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], returnElem, 0); count is 0 |
| 599 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], returnElem, 0); count is 0 |
| 600 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], return
Elem, 0); count is 2 |
| 601 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], returnElem, 0); count is 2 |
| 602 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], returnElem, 0); count is 2 |
| 603 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], returnIndex
, 0); count is 2 |
| 604 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], returnIndex, 0); count is 2 |
| 605 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], returnIndex, 0); count is 2 |
| 606 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], returnIndex,
0); count is 0 |
| 607 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], returnIndex, 0); count is 0 |
| 608 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], returnIndex, 0); count is 0 |
| 609 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], returnI
ndex, 0); count is 0 |
| 610 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], returnIndex, 0); count is 0 |
| 611 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], returnIndex, 0); count is 0 |
| 612 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], return
Index, 0); count is 2 |
| 613 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], returnIndex, 0); count is 2 |
| 614 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], returnIndex, 0); count is 2 |
| 615 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], increaseLen
gth, 0); count is 6 |
| 616 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], increaseLength, 0); count is 6 |
| 617 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], increaseLength, 0); count is 6 |
| 618 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], increaseLeng
th, 0); count is 0 |
| 619 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], increaseLength, 0); count is 0 |
| 620 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], increaseLength, 0); count is 0 |
| 621 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], increas
eLength, 0); count is 0 |
| 622 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], increaseLength, 0); count is 0 |
| 623 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], increaseLength, 0); count is 0 |
| 624 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], increa
seLength, 0); count is 7 |
| 625 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], increaseLength, 0); count is 7 |
| 626 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], increaseLength, 0); count is 7 |
| 627 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], decreaseLen
gth, 0); count is 3 |
| 628 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], decreaseLength, 0); count is 6 |
| 629 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], decreaseLength, 0); count is 6 |
| 630 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], decreaseLeng
th, 0); count is 0 |
| 631 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], decreaseLength, 0); count is 0 |
| 632 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], decreaseLength, 0); count is 0 |
| 633 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], decreas
eLength, 0); count is 0 |
| 634 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], decreaseLength, 0); count is 0 |
| 635 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], decreaseLength, 0); count is 0 |
| 636 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], decrea
seLength, 0); count is 6 |
| 637 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], decreaseLength, 0); count is 7 |
| 638 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], decreaseLength, 0); count is 7 |
| 639 PASS count=0;lastIndex=-1;copyArray(simpleArray).some(forwarders[f], halveLength
, 0); count is 3 |
| 640 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], halveLength, 0); count is 6 |
| 641 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(simpleArray), forwa
rders[f], halveLength, 0); count is 6 |
| 642 PASS count=0;lastIndex=-1;copyArray(emptyArray).some(forwarders[f], halveLength,
0); count is 0 |
| 643 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], halveLength, 0); count is 0 |
| 644 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(emptyArray), forwar
ders[f], halveLength, 0); count is 0 |
| 645 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).some(forwarders[f], halveLe
ngth, 0); count is 0 |
| 646 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], halveLength, 0); count is 0 |
| 647 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeEmptyArray), f
orwarders[f], halveLength, 0); count is 0 |
| 648 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).some(forwarders[f], halveL
ength, 0); count is 6 |
| 649 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], halveLength, 0); count is 7 |
| 650 PASS count=0;lastIndex=-1;Array.prototype.some.call(toObject(largeSparseArray),
forwarders[f], halveLength, 0); count is 7 |
| 651 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], returnFal
se, 0); count is 6 |
| 652 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], returnFalse, 0); count is 6 |
| 653 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], returnFalse, 0); count is 6 |
| 654 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], returnFals
e, 0); count is 0 |
| 655 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], returnFalse, 0); count is 0 |
| 656 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], returnFalse, 0); count is 0 |
| 657 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], retur
nFalse, 0); count is 0 |
| 658 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], returnFalse, 0); count is 0 |
| 659 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], returnFalse, 0); count is 0 |
| 660 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], retu
rnFalse, 0); count is 7 |
| 661 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], returnFalse, 0); count is 7 |
| 662 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], returnFalse, 0); count is 7 |
| 663 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], returnTru
e, 0); count is 6 |
| 664 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], returnTrue, 0); count is 6 |
| 665 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], returnTrue, 0); count is 6 |
| 666 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], returnTrue
, 0); count is 0 |
| 667 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], returnTrue, 0); count is 0 |
| 668 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], returnTrue, 0); count is 0 |
| 669 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], retur
nTrue, 0); count is 0 |
| 670 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], returnTrue, 0); count is 0 |
| 671 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], returnTrue, 0); count is 0 |
| 672 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], retu
rnTrue, 0); count is 7 |
| 673 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], returnTrue, 0); count is 7 |
| 674 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], returnTrue, 0); count is 7 |
| 675 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], returnEle
m, 0); count is 6 |
| 676 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], returnElem, 0); count is 6 |
| 677 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], returnElem, 0); count is 6 |
| 678 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], returnElem
, 0); count is 0 |
| 679 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], returnElem, 0); count is 0 |
| 680 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], returnElem, 0); count is 0 |
| 681 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], retur
nElem, 0); count is 0 |
| 682 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], returnElem, 0); count is 0 |
| 683 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], returnElem, 0); count is 0 |
| 684 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], retu
rnElem, 0); count is 7 |
| 685 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], returnElem, 0); count is 7 |
| 686 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], returnElem, 0); count is 7 |
| 687 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], returnInd
ex, 0); count is 6 |
| 688 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], returnIndex, 0); count is 6 |
| 689 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], returnIndex, 0); count is 6 |
| 690 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], returnInde
x, 0); count is 0 |
| 691 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], returnIndex, 0); count is 0 |
| 692 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], returnIndex, 0); count is 0 |
| 693 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], retur
nIndex, 0); count is 0 |
| 694 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], returnIndex, 0); count is 0 |
| 695 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], returnIndex, 0); count is 0 |
| 696 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], retu
rnIndex, 0); count is 7 |
| 697 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], returnIndex, 0); count is 7 |
| 698 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], returnIndex, 0); count is 7 |
| 699 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], increaseL
ength, 0); count is 6 |
| 700 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], increaseLength, 0); count is 6 |
| 701 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], increaseLength, 0); count is 6 |
| 702 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], increaseLe
ngth, 0); count is 0 |
| 703 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], increaseLength, 0); count is 0 |
| 704 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], increaseLength, 0); count is 0 |
| 705 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], incre
aseLength, 0); count is 0 |
| 706 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], increaseLength, 0); count is 0 |
| 707 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], increaseLength, 0); count is 0 |
| 708 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], incr
easeLength, 0); count is 7 |
| 709 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], increaseLength, 0); count is 7 |
| 710 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], increaseLength, 0); count is 7 |
| 711 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], decreaseL
ength, 0); count is 3 |
| 712 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], decreaseLength, 0); count is 6 |
| 713 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], decreaseLength, 0); count is 6 |
| 714 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], decreaseLe
ngth, 0); count is 0 |
| 715 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], decreaseLength, 0); count is 0 |
| 716 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], decreaseLength, 0); count is 0 |
| 717 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], decre
aseLength, 0); count is 0 |
| 718 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], decreaseLength, 0); count is 0 |
| 719 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], decreaseLength, 0); count is 0 |
| 720 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], decr
easeLength, 0); count is 6 |
| 721 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], decreaseLength, 0); count is 7 |
| 722 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], decreaseLength, 0); count is 7 |
| 723 PASS count=0;lastIndex=-1;copyArray(simpleArray).filter(forwarders[f], halveLeng
th, 0); count is 3 |
| 724 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], halveLength, 0); count is 6 |
| 725 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(simpleArray), for
warders[f], halveLength, 0); count is 6 |
| 726 PASS count=0;lastIndex=-1;copyArray(emptyArray).filter(forwarders[f], halveLengt
h, 0); count is 0 |
| 727 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], halveLength, 0); count is 0 |
| 728 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(emptyArray), forw
arders[f], halveLength, 0); count is 0 |
| 729 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).filter(forwarders[f], halve
Length, 0); count is 0 |
| 730 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], halveLength, 0); count is 0 |
| 731 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeEmptyArray),
forwarders[f], halveLength, 0); count is 0 |
| 732 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).filter(forwarders[f], halv
eLength, 0); count is 6 |
| 733 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], halveLength, 0); count is 7 |
| 734 PASS count=0;lastIndex=-1;Array.prototype.filter.call(toObject(largeSparseArray)
, forwarders[f], halveLength, 0); count is 7 |
| 735 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnFal
se, 0); count is 6 |
| 736 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], returnFalse, 0); count is 6 |
| 737 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], returnFalse, 0); count is 6 |
| 738 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnFals
e, 0); count is 0 |
| 739 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], returnFalse, 0); count is 0 |
| 740 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], returnFalse, 0); count is 0 |
| 741 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], retur
nFalse, 0); count is 0 |
| 742 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], returnFalse, 0); count is 0 |
| 743 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], returnFalse, 0); count is 0 |
| 744 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], retu
rnFalse, 0); count is 7 |
| 745 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], returnFalse, 0); count is 7 |
| 746 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], returnFalse, 0); count is 7 |
| 747 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnTru
e, 0); count is 6 |
| 748 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], returnTrue, 0); count is 6 |
| 749 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], returnTrue, 0); count is 6 |
| 750 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnTrue
, 0); count is 0 |
| 751 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], returnTrue, 0); count is 0 |
| 752 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], returnTrue, 0); count is 0 |
| 753 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], retur
nTrue, 0); count is 0 |
| 754 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], returnTrue, 0); count is 0 |
| 755 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], returnTrue, 0); count is 0 |
| 756 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], retu
rnTrue, 0); count is 7 |
| 757 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], returnTrue, 0); count is 7 |
| 758 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], returnTrue, 0); count is 7 |
| 759 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnEle
m, 0); count is 6 |
| 760 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], returnElem, 0); count is 6 |
| 761 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], returnElem, 0); count is 6 |
| 762 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnElem
, 0); count is 0 |
| 763 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], returnElem, 0); count is 0 |
| 764 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], returnElem, 0); count is 0 |
| 765 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], retur
nElem, 0); count is 0 |
| 766 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], returnElem, 0); count is 0 |
| 767 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], returnElem, 0); count is 0 |
| 768 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], retu
rnElem, 0); count is 7 |
| 769 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], returnElem, 0); count is 7 |
| 770 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], returnElem, 0); count is 7 |
| 771 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], returnInd
ex, 0); count is 6 |
| 772 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], returnIndex, 0); count is 6 |
| 773 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], returnIndex, 0); count is 6 |
| 774 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], returnInde
x, 0); count is 0 |
| 775 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], returnIndex, 0); count is 0 |
| 776 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], returnIndex, 0); count is 0 |
| 777 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], retur
nIndex, 0); count is 0 |
| 778 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], returnIndex, 0); count is 0 |
| 779 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], returnIndex, 0); count is 0 |
| 780 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], retu
rnIndex, 0); count is 7 |
| 781 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], returnIndex, 0); count is 7 |
| 782 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], returnIndex, 0); count is 7 |
| 783 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], increaseL
ength, 0); count is 6 |
| 784 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], increaseLength, 0); count is 6 |
| 785 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], increaseLength, 0); count is 6 |
| 786 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], increaseLe
ngth, 0); count is 0 |
| 787 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], increaseLength, 0); count is 0 |
| 788 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], increaseLength, 0); count is 0 |
| 789 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], incre
aseLength, 0); count is 0 |
| 790 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], increaseLength, 0); count is 0 |
| 791 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], increaseLength, 0); count is 0 |
| 792 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], incr
easeLength, 0); count is 7 |
| 793 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], increaseLength, 0); count is 7 |
| 794 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], increaseLength, 0); count is 7 |
| 795 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], decreaseL
ength, 0); count is 3 |
| 796 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], decreaseLength, 0); count is 6 |
| 797 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], decreaseLength, 0); count is 6 |
| 798 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], decreaseLe
ngth, 0); count is 0 |
| 799 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], decreaseLength, 0); count is 0 |
| 800 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], decreaseLength, 0); count is 0 |
| 801 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], decre
aseLength, 0); count is 0 |
| 802 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], decreaseLength, 0); count is 0 |
| 803 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], decreaseLength, 0); count is 0 |
| 804 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], decr
easeLength, 0); count is 6 |
| 805 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], decreaseLength, 0); count is 7 |
| 806 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], decreaseLength, 0); count is 7 |
| 807 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduce(forwarders[f], halveLeng
th, 0); count is 3 |
| 808 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], halveLength, 0); count is 6 |
| 809 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(simpleArray), for
warders[f], halveLength, 0); count is 6 |
| 810 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduce(forwarders[f], halveLengt
h, 0); count is 0 |
| 811 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], halveLength, 0); count is 0 |
| 812 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(emptyArray), forw
arders[f], halveLength, 0); count is 0 |
| 813 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduce(forwarders[f], halve
Length, 0); count is 0 |
| 814 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], halveLength, 0); count is 0 |
| 815 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeEmptyArray),
forwarders[f], halveLength, 0); count is 0 |
| 816 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduce(forwarders[f], halv
eLength, 0); count is 6 |
| 817 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], halveLength, 0); count is 7 |
| 818 PASS count=0;lastIndex=-1;Array.prototype.reduce.call(toObject(largeSparseArray)
, forwarders[f], halveLength, 0); count is 7 |
| 819 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], returnFalse,
0); count is 6 |
| 820 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], returnFalse, 0); count is 6 |
| 821 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], returnFalse, 0); count is 6 |
| 822 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], returnFalse,
0); count is 0 |
| 823 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], returnFalse, 0); count is 0 |
| 824 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], returnFalse, 0); count is 0 |
| 825 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).map(forwarders[f], returnFa
lse, 0); count is 0 |
| 826 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], returnFalse, 0); count is 0 |
| 827 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], returnFalse, 0); count is 0 |
| 828 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], returnF
alse, 0); count is 7 |
| 829 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], returnFalse, 0); count is 7 |
| 830 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], returnFalse, 0); count is 7 |
| 831 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], returnTrue,
0); count is 6 |
| 832 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], returnTrue, 0); count is 6 |
| 833 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], returnTrue, 0); count is 6 |
| 834 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], returnTrue, 0
); count is 0 |
| 835 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], returnTrue, 0); count is 0 |
| 836 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], returnTrue, 0); count is 0 |
| 837 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).map(forwarders[f], returnTr
ue, 0); count is 0 |
| 838 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], returnTrue, 0); count is 0 |
| 839 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], returnTrue, 0); count is 0 |
| 840 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], returnT
rue, 0); count is 7 |
| 841 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], returnTrue, 0); count is 7 |
| 842 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], returnTrue, 0); count is 7 |
| 843 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], returnElem,
0); count is 6 |
| 844 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], returnElem, 0); count is 6 |
| 845 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], returnElem, 0); count is 6 |
| 846 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], returnElem, 0
); count is 0 |
| 847 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], returnElem, 0); count is 0 |
| 848 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], returnElem, 0); count is 0 |
| 849 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).map(forwarders[f], returnEl
em, 0); count is 0 |
| 850 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], returnElem, 0); count is 0 |
| 851 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], returnElem, 0); count is 0 |
| 852 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], returnE
lem, 0); count is 7 |
| 853 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], returnElem, 0); count is 7 |
| 854 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], returnElem, 0); count is 7 |
| 855 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], returnIndex,
0); count is 6 |
| 856 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], returnIndex, 0); count is 6 |
| 857 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], returnIndex, 0); count is 6 |
| 858 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], returnIndex,
0); count is 0 |
| 859 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], returnIndex, 0); count is 0 |
| 860 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], returnIndex, 0); count is 0 |
| 861 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).map(forwarders[f], returnIn
dex, 0); count is 0 |
| 862 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], returnIndex, 0); count is 0 |
| 863 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], returnIndex, 0); count is 0 |
| 864 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], returnI
ndex, 0); count is 7 |
| 865 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], returnIndex, 0); count is 7 |
| 866 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], returnIndex, 0); count is 7 |
| 867 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], increaseLeng
th, 0); count is 6 |
| 868 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], increaseLength, 0); count is 6 |
| 869 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], increaseLength, 0); count is 6 |
| 870 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], increaseLengt
h, 0); count is 0 |
| 871 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], increaseLength, 0); count is 0 |
| 872 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], increaseLength, 0); count is 0 |
| 873 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).map(forwarders[f], increase
Length, 0); count is 0 |
| 874 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], increaseLength, 0); count is 0 |
| 875 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], increaseLength, 0); count is 0 |
| 876 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], increas
eLength, 0); count is 7 |
| 877 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], increaseLength, 0); count is 7 |
| 878 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], increaseLength, 0); count is 7 |
| 879 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], decreaseLeng
th, 0); count is 3 |
| 880 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], decreaseLength, 0); count is 6 |
| 881 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], decreaseLength, 0); count is 6 |
| 882 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], decreaseLengt
h, 0); count is 0 |
| 883 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], decreaseLength, 0); count is 0 |
| 884 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], decreaseLength, 0); count is 0 |
| 885 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).map(forwarders[f], decrease
Length, 0); count is 0 |
| 886 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], decreaseLength, 0); count is 0 |
| 887 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], decreaseLength, 0); count is 0 |
| 888 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], decreas
eLength, 0); count is 6 |
| 889 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], decreaseLength, 0); count is 7 |
| 890 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], decreaseLength, 0); count is 7 |
| 891 PASS count=0;lastIndex=-1;copyArray(simpleArray).map(forwarders[f], halveLength,
0); count is 3 |
| 892 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], halveLength, 0); count is 6 |
| 893 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(simpleArray), forwar
ders[f], halveLength, 0); count is 6 |
| 894 PASS count=0;lastIndex=-1;copyArray(emptyArray).map(forwarders[f], halveLength,
0); count is 0 |
| 895 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], halveLength, 0); count is 0 |
| 896 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(emptyArray), forward
ers[f], halveLength, 0); count is 0 |
| 897 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).map(forwarders[f], halveLen
gth, 0); count is 0 |
| 898 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], halveLength, 0); count is 0 |
| 899 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeEmptyArray), fo
rwarders[f], halveLength, 0); count is 0 |
| 900 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).map(forwarders[f], halveLe
ngth, 0); count is 6 |
| 901 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], halveLength, 0); count is 7 |
| 902 PASS count=0;lastIndex=-1;Array.prototype.map.call(toObject(largeSparseArray), f
orwarders[f], halveLength, 0); count is 7 |
| 903 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], retu
rnFalse, 0); count is 6 |
| 904 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(simpleArray)
, forwarders[f], returnFalse, 0); count is 6 |
| 905 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(simpleArray)
, forwarders[f], returnFalse, 0); count is 6 |
| 906 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], retur
nFalse, 0); count is 0 |
| 907 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emptyArray),
forwarders[f], returnFalse, 0); count is 0 |
| 908 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emptyArray),
forwarders[f], returnFalse, 0); count is 0 |
| 909 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
returnFalse, 0); count is 0 |
| 910 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeEmptyAr
ray), forwarders[f], returnFalse, 0); count is 0 |
| 911 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeEmptyAr
ray), forwarders[f], returnFalse, 0); count is 0 |
| 912 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
returnFalse, 0); count is 7 |
| 913 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeSparseA
rray), forwarders[f], returnFalse, 0); count is 7 |
| 914 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeSparseA
rray), forwarders[f], returnFalse, 0); count is 7 |
| 915 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], retu
rnTrue, 0); count is 6 |
| 916 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(simpleArray)
, forwarders[f], returnTrue, 0); count is 6 |
| 917 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(simpleArray)
, forwarders[f], returnTrue, 0); count is 6 |
| 918 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], retur
nTrue, 0); count is 0 |
| 919 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emptyArray),
forwarders[f], returnTrue, 0); count is 0 |
| 920 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emptyArray),
forwarders[f], returnTrue, 0); count is 0 |
| 921 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
returnTrue, 0); count is 0 |
| 922 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeEmptyAr
ray), forwarders[f], returnTrue, 0); count is 0 |
| 923 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeEmptyAr
ray), forwarders[f], returnTrue, 0); count is 0 |
| 924 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
returnTrue, 0); count is 7 |
| 925 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeSparseA
rray), forwarders[f], returnTrue, 0); count is 7 |
| 926 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeSparseA
rray), forwarders[f], returnTrue, 0); count is 7 |
| 927 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], retu
rnElem, 0); count is 6 |
| 928 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(simpleArray)
, forwarders[f], returnElem, 0); count is 6 |
| 929 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(simpleArray)
, forwarders[f], returnElem, 0); count is 6 |
| 930 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], retur
nElem, 0); count is 0 |
| 931 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emptyArray),
forwarders[f], returnElem, 0); count is 0 |
| 932 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emptyArray),
forwarders[f], returnElem, 0); count is 0 |
| 933 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
returnElem, 0); count is 0 |
| 934 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeEmptyAr
ray), forwarders[f], returnElem, 0); count is 0 |
| 935 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeEmptyAr
ray), forwarders[f], returnElem, 0); count is 0 |
| 936 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
returnElem, 0); count is 7 |
| 937 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeSparseA
rray), forwarders[f], returnElem, 0); count is 7 |
| 938 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeSparseA
rray), forwarders[f], returnElem, 0); count is 7 |
| 939 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], incr
easeLength, 0); count is 6 |
| 940 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(simpleArray)
, forwarders[f], increaseLength, 0); count is 6 |
| 941 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(simpleArray)
, forwarders[f], increaseLength, 0); count is 6 |
| 942 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], incre
aseLength, 0); count is 0 |
| 943 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emptyArray),
forwarders[f], increaseLength, 0); count is 0 |
| 944 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emptyArray),
forwarders[f], increaseLength, 0); count is 0 |
| 945 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
increaseLength, 0); count is 0 |
| 946 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeEmptyAr
ray), forwarders[f], increaseLength, 0); count is 0 |
| 947 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeEmptyAr
ray), forwarders[f], increaseLength, 0); count is 0 |
| 948 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
increaseLength, 0); count is 7 |
| 949 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeSparseA
rray), forwarders[f], increaseLength, 0); count is 7 |
| 950 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeSparseA
rray), forwarders[f], increaseLength, 0); count is 7 |
| 951 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], decr
easeLength, 0); count is 6 |
| 952 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(simpleArray)
, forwarders[f], decreaseLength, 0); count is 6 |
| 953 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(simpleArray)
, forwarders[f], decreaseLength, 0); count is 6 |
| 954 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], decre
aseLength, 0); count is 0 |
| 955 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emptyArray),
forwarders[f], decreaseLength, 0); count is 0 |
| 956 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emptyArray),
forwarders[f], decreaseLength, 0); count is 0 |
| 957 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
decreaseLength, 0); count is 0 |
| 958 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeEmptyAr
ray), forwarders[f], decreaseLength, 0); count is 0 |
| 959 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeEmptyAr
ray), forwarders[f], decreaseLength, 0); count is 0 |
| 960 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
decreaseLength, 0); count is 7 |
| 961 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeSparseA
rray), forwarders[f], decreaseLength, 0); count is 7 |
| 962 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeSparseA
rray), forwarders[f], decreaseLength, 0); count is 7 |
| 963 PASS count=0;lastIndex=-1;copyArray(simpleArray).reduceRight(forwarders[f], halv
eLength, 0); count is 4 |
| 964 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(simpleArray)
, forwarders[f], halveLength, 0); count is 6 |
| 965 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(simpleArray)
, forwarders[f], halveLength, 0); count is 6 |
| 966 PASS count=0;lastIndex=-1;copyArray(emptyArray).reduceRight(forwarders[f], halve
Length, 0); count is 0 |
| 967 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emptyArray),
forwarders[f], halveLength, 0); count is 0 |
| 968 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(emptyArray),
forwarders[f], halveLength, 0); count is 0 |
| 969 PASS count=0;lastIndex=-1;copyArray(largeEmptyArray).reduceRight(forwarders[f],
halveLength, 0); count is 0 |
| 970 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeEmptyAr
ray), forwarders[f], halveLength, 0); count is 0 |
| 971 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeEmptyAr
ray), forwarders[f], halveLength, 0); count is 0 |
| 972 PASS count=0;lastIndex=-1;copyArray(largeSparseArray).reduceRight(forwarders[f],
halveLength, 0); count is 7 |
| 973 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeSparseA
rray), forwarders[f], halveLength, 0); count is 7 |
| 974 PASS count=0;lastIndex=-1;Array.prototype.reduceRight.call(toObject(largeSparseA
rray), forwarders[f], halveLength, 0); count is 7 |
| 975 PASS successfullyParsed is true |
| 976 |
| 977 TEST COMPLETE |
| 978 |
OLD | NEW |