✨ feat(sortUint16): First draft.

Fixes #7.

Author: make-github-pseudonymous-again

src/array/api/sortUint16.js

@@ -0,0 +1,15 @@
+import sort from './sort';
+
+const sortUint16 = (array) => {
+	const k = 2; // TODO make it depend on array.length
+	const M = 2 ** 8;
+	// TODO avoid copying back and forth
+	const tuples = Array.prototype.map.call(array, (x) => [
+		(x & 0xff00) >>> 8,
+		(x & 0xff) >>> 0
+	]);
+	const output = sort(k, M, tuples);
+	return Array.prototype.map.call(output, ([c, d]) => ((c << 8) | d) >>> 0);
+};
+
+export default sortUint16;

test/src/api/sortUint16.js

@@ -0,0 +1,30 @@
+import test from 'ava';
+import {sorted, range, list, map} from '@aureooms/js-itertools';
+import {shuffle, randrange} from '@aureooms/js-random';
+import {increasing} from '@aureooms/js-compare';
+
+import sortUint16 from '../../../src/array/api/sortUint16';
+
+const macro = (t, data) => {
+	const result = sortUint16(data.slice());
+	const expected = sorted(increasing, data);
+	t.deepEqual(expected, result);
+};
+
+const repr = (data) =>
+	data.length >= 20
+		? `[${data.slice(0, 9)},..,${data.slice(-9)}]`
+		: JSON.stringify(data);
+
+macro.title = (title, data) => title || `sortUint16(${repr(data)})`;
+
+test(macro, []);
+test(macro, [1, 2, 3, 4]);
+
+const N = 1 << 17;
+const longShuffledInput = list(Uint16Array.from(range(N)));
+shuffle(longShuffledInput, 0, N);
+test(macro, longShuffledInput);
+
+const longRandomInput = list(map(() => randrange(2 ** 16) >>> 0, range(N)));
+test(macro, longRandomInput);