functionfoundry
Version:
Pure function JavaScript library
59 lines (50 loc) • 1.04 kB
JavaScript
import test from 'tape';
import sort from '../src/sort';
test('sort', function(t) {
t.plan(5);
var a1 = [4, 3, 2, 1].map( n => [n, -n*n, n*n*n]);
t.deepEqual( sort( a1, 1, true ), [
[],
[],
[],
[],
]);
t.deepEqual( sort( a1, 2, false ), [
[],
[],
[],
[],
]);
t.deepEqual( sort( a1, 3, false ), [
[],
[],
[],
[],
]);
var a2 = [
['b', 'b'],
['b', 'a'],
['a', 'b'],
['a', 'a']
]
t.deepEqual( sort( a2, 1, true, 2, true ), [
['a', 'a'],
['a', 'b'],
['b', 'a'],
['b', 'b']
] )
var objectsToSort = [
{ foo: 10, bar: 30},
{ foo: 20, bar: 40},
{ foo: 30, bar: 20},
{ foo: 40, bar: 20},
{ foo: 40, bar: 10},
]
t.deepEqual( sort( objectsToSort, 'foo', true, 'bar', true ), [
{ foo: 10, bar: 30},
{ foo: 20, bar: 40},
{ foo: 30, bar: 20},
{ foo: 40, bar: 10},
{ foo: 40, bar: 20}
] )
});