✨ feat: Implement sortUint32.

Author: make-github-pseudonymous-again

package.json

@@ -27,7 +27,6 @@
             "transform-remove-console",
             {
               "exclude": [
-                "debug",
                 "log",
                 "error",
                 "warn"
@@ -82,6 +81,7 @@
   "devDependencies": {
     "@aureooms/js-compare": "^1.4.8",
     "@aureooms/js-itertools": "^4.1.0",
+    "@aureooms/js-random": "^2.0.0",
     "@babel/cli": "7.11.6",
     "@babel/core": "7.11.6",
     "@babel/preset-env": "7.11.5",

src/array/sort.js renamed to src/array/api/sort.js

@@ -1,6 +1,6 @@
 import assert from 'assert';
-import sortFixedLengthTuples from './sortFixedLengthTuples';
-import sortArbitraryTuples from './sortArbitraryTuples';
+import sortFixedLengthTuples from '../core/sortFixedLengthTuples';
+import sortArbitraryTuples from '../core/sortArbitraryTuples';
 
 const sort = (k, M, tuples) => {
 	assert(Number.isInteger(k));

src/array/api/sortUint32.js

@@ -0,0 +1,20 @@
+import sort from './sort';
+
+const sortUint32 = (array) => {
+	const k = 4; // TODO make it depend on array.length
+	const M = 256;
+	// TODO avoid copying back and forth
+	const tuples = Array.prototype.map.call(array, (x) => [
+		(x & 0xff000000) >>> 24,
+		(x & 0xff0000) >>> 16,
+		(x & 0xff00) >>> 8,
+		(x & 0xff) >>> 0
+	]);
+	const output = sort(k, M, tuples);
+	return Array.prototype.map.call(
+		output,
+		([a, b, c, d]) => ((a << 24) | (b << 16) | (c << 8) | d) >>> 0
+	);
+};
+
+export default sortUint32;