mirror of
https://github.com/whoisclebs/lodash.git
synced 2026-01-31 23:37:49 +00:00
d5ef31929a
* Install test dependencies. * Add initial test files. These files were created using a simplistic AST manipulator using `recast` to preserve formatting. There's bound to be a huge chunk of errors, but this serves as a good start. QUnit was replaced with Mocha, with ES2015 imports running via `esm`. As far as possible, QUnit-specific syntax has been replaced with Mocha's `describe` and `it`, while the native Node.js `assert` module is used for assertions. Files in the `test` directory ending in `.test.js` will be treated as test files. * Add initial passing files to test run.
71 lines
2.3 KiB
JavaScript
71 lines
2.3 KiB
JavaScript
import assert from 'assert';
|
|
import lodashStable from 'lodash';
|
|
import { slice, empties } from './utils.js';
|
|
import rearg from '../rearg.js';
|
|
|
|
describe('rearg', function() {
|
|
function fn() {
|
|
return slice.call(arguments);
|
|
}
|
|
|
|
it('should reorder arguments provided to `func`', function() {
|
|
var rearged = rearg(fn, [2, 0, 1]);
|
|
assert.deepStrictEqual(rearged('b', 'c', 'a'), ['a', 'b', 'c']);
|
|
});
|
|
|
|
it('should work with repeated indexes', function() {
|
|
var rearged = rearg(fn, [1, 1, 1]);
|
|
assert.deepStrictEqual(rearged('c', 'a', 'b'), ['a', 'a', 'a']);
|
|
});
|
|
|
|
it('should use `undefined` for nonexistent indexes', function() {
|
|
var rearged = rearg(fn, [1, 4]);
|
|
assert.deepStrictEqual(rearged('b', 'a', 'c'), ['a', undefined, 'c']);
|
|
});
|
|
|
|
it('should use `undefined` for non-index values', function() {
|
|
var values = lodashStable.reject(empties, function(value) {
|
|
return (value === 0) || lodashStable.isArray(value);
|
|
}).concat(-1, 1.1);
|
|
|
|
var expected = lodashStable.map(values, lodashStable.constant([undefined, 'b', 'c']));
|
|
|
|
var actual = lodashStable.map(values, function(value) {
|
|
var rearged = rearg(fn, [value]);
|
|
return rearged('a', 'b', 'c');
|
|
});
|
|
|
|
assert.deepStrictEqual(actual, expected);
|
|
});
|
|
|
|
it('should not rearrange arguments when no indexes are given', function() {
|
|
var rearged = rearg(fn);
|
|
assert.deepStrictEqual(rearged('a', 'b', 'c'), ['a', 'b', 'c']);
|
|
|
|
rearged = rearg(fn, [], []);
|
|
assert.deepStrictEqual(rearged('a', 'b', 'c'), ['a', 'b', 'c']);
|
|
});
|
|
|
|
it('should accept multiple index arguments', function() {
|
|
var rearged = rearg(fn, 2, 0, 1);
|
|
assert.deepStrictEqual(rearged('b', 'c', 'a'), ['a', 'b', 'c']);
|
|
});
|
|
|
|
it('should accept multiple arrays of indexes', function() {
|
|
var rearged = rearg(fn, [2], [0, 1]);
|
|
assert.deepStrictEqual(rearged('b', 'c', 'a'), ['a', 'b', 'c']);
|
|
});
|
|
|
|
it('should work with fewer indexes than arguments', function() {
|
|
var rearged = rearg(fn, [1, 0]);
|
|
assert.deepStrictEqual(rearged('b', 'a', 'c'), ['a', 'b', 'c']);
|
|
});
|
|
|
|
it('should work on functions that have been rearged', function() {
|
|
var rearged1 = rearg(fn, 2, 1, 0),
|
|
rearged2 = rearg(rearged1, 1, 0, 2);
|
|
|
|
assert.deepStrictEqual(rearged2('b', 'c', 'a'), ['a', 'b', 'c']);
|
|
});
|
|
});
|