Lines Matching refs:i
1 …i)return i(o,!0);throw new Error("Cannot find module '"+o+"'")}var f=n[o]={exports:{}};t[o][0].cal… variable
37 for (var i = 0; i < this.format.channelsPerFrame; i++) {
38 this.decoded[i] = new Int32Array(cookie.maxBlockSize);
145 for (var i = 0; i < channels; i++)
146 this.decodeSubframe(i);
161 for (var i = 0; i < channels; i++) {
162 buf[j++] = decoded[i][k];
168 for (var i = 0; i < blockSize; i++) {
169 var left = decoded[0][i],
170 right = decoded[1][i];
178 for (var i = 0; i < blockSize; i++) {
179 var left = decoded[0][i],
180 right = decoded[1][i];
188 for (var i = 0; i < blockSize; i++) {
189 var left = decoded[0][i],
190 right = decoded[1][i];
235 for (var i = 0; i < blockSize; i++)
236 decoded[channel][i] = tmp;
240 for (var i = 0; i < blockSize; i++)
241 decoded[channel][i] = stream.read(bps, true);
254 for (var i = 0; i < blockSize; i++)
255 decoded[channel][i] <<= wasted;
265 for (var i = 0; i < predictor_order; i++)
266 decoded[i] = stream.read(bps, true);
295 for (var i = predictor_order; i < blockSize; i++) {
296 abcd[predictor_order - 1] += decoded[i];
302 decoded[i] = abcd[0];
319 for (var i = 0; i < predictor_order; i++) {
320 decoded[i] = stream.read(bps, true);
332 for (var i = 0; i < predictor_order; i++) {
333 coeffs[i] = stream.read(coeff_prec, true);
339 for (var i = predictor_order; i < blockSize - 1; i += 2) {
340 var d = decoded[i - predictor_order],
346 d = decoded[i - j];
352 d = decoded[i] += (s0 >> qlevel);
354 decoded[i + 1] += (s1 >> qlevel);
357 if (i < blockSize) {
360 sum += coeffs[j] * decoded[i - j - 1];
362 decoded[i] += (sum >> qlevel);
367 for (var i = predictor_order; i < blockSize; i++) {
374 multiply_add(total, coeffs[j], decoded[i - j - 1]);
379 decoded[i] += (total[0] >>> qlevel) | (total[1] << (32 - qlevel));
449 i = predictor_order;
456 for (; i < samples; i++)
460 for (; i < samples; i++)
464 i = 0;
486 for (var i = 0; data.read(1) === 0; i++)
489 if (i < limit - 1) {
495 v = buf + (i << k);
497 } else if (i === limit - 1) {
694 for (var i = 0; i < length; i++) {