| 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,13 → 1661,14 |
|---|
| { |
| if (bStrict) |
| { |
| eval( |
| 'if (aHaystack[i] === needle) {' |
| + ' result = i;' |
| + ' break;' |
| + '}'); |
| if (aHaystack[i] === needle) |
| { |
| result = i; |
| break; |
| } |
| |
| } |
| else |
| { |
| if (aHaystack[i] == needle) |
| { |
| result = i; |
| 1676,19 → 1677,21 |
|---|
| } |
| } |
| } |
| } |
| else |
| { |
| 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; |
| } |
| } |
| else |
| { |
| if (aHaystack == needle) |
| { |
| if (bDeepSearch) |
| 1698,6 → 1701,7 |
|---|
| result = index; |
| } |
| } |
| } |
| |
| return result; |
| }, |