928,7 → 928,7 |
{ |
var key = keys[i]; |
|
if (key % 1 == 0) |
if (key % 1 === 0) |
{ |
if (!bStrict || (key > -1 && key < _MAX_ARRAY_LENGTH - 1)) |
{ |
1620,7 → 1620,7 |
} |
|
/* avoid dupes */ |
if (aAncestors.length == 0 |
if (aAncestors.length === 0 |
|| aAncestors[aAncestors.length - 1] != aHaystack) |
{ |
_array_push(aAncestors, aHaystack); |
1661,17 → 1661,19 |
{ |
if (bStrict) |
{ |
eval( |
'if (aHaystack[i] === needle) {' |
+ ' result = i;' |
+ ' break;' |
+ '}'); |
if (aHaystack[i] === needle) |
{ |
result = i; |
break; |
} |
} |
|
if (aHaystack[i] == needle) |
else |
{ |
result = i; |
break; |
if (aHaystack[i] == needle) |
{ |
result = i; |
break; |
} |
} |
} |
} |
1680,22 → 1682,24 |
{ |
if (bStrict) |
{ |
eval( |
'if (aHaystack === needle) {' |
+ ' if (bDeepSearch) {' |
+ ' aResultVector[iLevel - 1] = index;' |
+ ' }' |
+ ' result = index;' |
+ '}'); |
if (aHaystack === needle) |
{ |
if (bDeepSearch) { |
aResultVector[iLevel - 1] = index; |
} |
result = index; |
} |
} |
|
if (aHaystack == needle) |
else |
{ |
if (bDeepSearch) |
if (aHaystack == needle) |
{ |
aResultVector[iLevel - 1] = index; |
if (bDeepSearch) |
{ |
aResultVector[iLevel - 1] = index; |
} |
result = index; |
} |
result = index; |
} |
} |
|
2217,4 → 2221,4 |
return a; |
} |
}); |
} |
} |