@@ -41055,9 +41055,10 @@ <h1>%TypedArray%.prototype.indexOf ( _searchElement_ [ , _fromIndex_ ] )</h1>
41055
41055
1. Let _k_ be _len_ + _n_.
41056
41056
1. If _k_ < 0, set _k_ to 0.
41057
41057
1. Repeat, while _k_ < _len_,
41058
- 1. Let _kPresent_ be ! HasProperty(_O_, ! ToString(π½(_k_))).
41058
+ 1. Let _Pk_ be ! ToString(π½(_k_)).
41059
+ 1. Let _kPresent_ be ! HasProperty(_O_, _Pk_).
41059
41060
1. If _kPresent_ is *true*, then
41060
- 1. Let _elementK_ be ! Get(_O_, ! ToString(π½(_k_)) ).
41061
+ 1. Let _elementK_ be ! Get(_O_, _Pk_ ).
41061
41062
1. If IsStrictlyEqual(_searchElement_, _elementK_) is *true*, return π½(_k_).
41062
41063
1. Set _k_ to _k_ + 1.
41063
41064
1. Return *-1*<sub>π½</sub>.
@@ -41115,9 +41116,10 @@ <h1>%TypedArray%.prototype.lastIndexOf ( _searchElement_ [ , _fromIndex_ ] )</h1
41115
41116
1. Else,
41116
41117
1. Let _k_ be _len_ + _n_.
41117
41118
1. Repeat, while _k_ β₯ 0,
41118
- 1. Let _kPresent_ be ! HasProperty(_O_, ! ToString(π½(_k_))).
41119
+ 1. Let _Pk_ be ! ToString(π½(_k_)).
41120
+ 1. Let _kPresent_ be ! HasProperty(_O_, _Pk_).
41119
41121
1. If _kPresent_ is *true*, then
41120
- 1. Let _elementK_ be ! Get(_O_, ! ToString(π½(_k_)) ).
41122
+ 1. Let _elementK_ be ! Get(_O_, _Pk_ ).
41121
41123
1. If IsStrictlyEqual(_searchElement_, _elementK_) is *true*, return π½(_k_).
41122
41124
1. Set _k_ to _k_ - 1.
41123
41125
1. Return *-1*<sub>π½</sub>.
0 commit comments