@@ -41149,9 +41149,10 @@ <h1>%TypedArray%.prototype.indexOf ( _searchElement_ [ , _fromIndex_ ] )</h1>
41149
41149
1. Let _k_ be _len_ + _n_.
41150
41150
1. If _k_ < 0, set _k_ to 0.
41151
41151
1. Repeat, while _k_ < _len_,
41152
- 1. Let _kPresent_ be ! HasProperty(_O_, ! ToString(π½(_k_))).
41152
+ 1. Let _Pk_ be ! ToString(π½(_k_)).
41153
+ 1. Let _kPresent_ be ! HasProperty(_O_, _Pk_).
41153
41154
1. If _kPresent_ is *true*, then
41154
- 1. Let _elementK_ be ! Get(_O_, ! ToString(π½(_k_)) ).
41155
+ 1. Let _elementK_ be ! Get(_O_, _Pk_ ).
41155
41156
1. If IsStrictlyEqual(_searchElement_, _elementK_) is *true*, return π½(_k_).
41156
41157
1. Set _k_ to _k_ + 1.
41157
41158
1. Return *-1*<sub>π½</sub>.
@@ -41209,9 +41210,10 @@ <h1>%TypedArray%.prototype.lastIndexOf ( _searchElement_ [ , _fromIndex_ ] )</h1
41209
41210
1. Else,
41210
41211
1. Let _k_ be _len_ + _n_.
41211
41212
1. Repeat, while _k_ β₯ 0,
41212
- 1. Let _kPresent_ be ! HasProperty(_O_, ! ToString(π½(_k_))).
41213
+ 1. Let _Pk_ be ! ToString(π½(_k_)).
41214
+ 1. Let _kPresent_ be ! HasProperty(_O_, _Pk_).
41213
41215
1. If _kPresent_ is *true*, then
41214
- 1. Let _elementK_ be ! Get(_O_, ! ToString(π½(_k_)) ).
41216
+ 1. Let _elementK_ be ! Get(_O_, _Pk_ ).
41215
41217
1. If IsStrictlyEqual(_searchElement_, _elementK_) is *true*, return π½(_k_).
41216
41218
1. Set _k_ to _k_ - 1.
41217
41219
1. Return *-1*<sub>π½</sub>.
0 commit comments