mirror of
https://github.com/hanzoai/core-js.git
synced 2026-09-24 16:58:15 +00:00
43 lines
1.7 KiB
JavaScript
43 lines
1.7 KiB
JavaScript
import { STRICT } from '../helpers/constants.js';
|
|
|
|
import reduce from 'core-js-pure/es/array/reduce';
|
|
|
|
QUnit.test('Array#reduce', assert => {
|
|
assert.isFunction(reduce);
|
|
const array = [1];
|
|
const accumulator = {};
|
|
reduce(array, function (memo, value, key, that) {
|
|
assert.same(arguments.length, 4, 'correct number of callback arguments');
|
|
assert.same(memo, accumulator, 'correct callback accumulator');
|
|
assert.same(value, 1, 'correct value in callback');
|
|
assert.same(key, 0, 'correct index in callback');
|
|
assert.same(that, array, 'correct link to array in callback');
|
|
}, accumulator);
|
|
assert.same(reduce([1, 2, 3], (a, b) => a + b, 1), 7, 'works with initial accumulator');
|
|
reduce([1, 2], (memo, value, key) => {
|
|
assert.same(memo, 1, 'correct default accumulator');
|
|
assert.same(value, 2, 'correct start value without initial accumulator');
|
|
assert.same(key, 1, 'correct start index without initial accumulator');
|
|
});
|
|
assert.same(reduce([1, 2, 3], (a, b) => a + b), 6, 'works without initial accumulator');
|
|
let values = '';
|
|
let keys = '';
|
|
reduce([1, 2, 3], (memo, value, key) => {
|
|
values += value;
|
|
keys += key;
|
|
}, 0);
|
|
assert.same(values, '123', 'correct order #1');
|
|
assert.same(keys, '012', 'correct order #2');
|
|
assert.same(reduce({
|
|
0: 1,
|
|
1: 2,
|
|
length: 2,
|
|
}, (a, b) => a + b), 3, 'generic');
|
|
assert.throws(() => reduce([], () => { /* empty */ }), TypeError);
|
|
assert.throws(() => reduce(Array(5), () => { /* empty */ }), TypeError);
|
|
if (STRICT) {
|
|
assert.throws(() => reduce(null, () => { /* empty */ }, 1), TypeError);
|
|
assert.throws(() => reduce(undefined, () => { /* empty */ }, 1), TypeError);
|
|
}
|
|
});
|