test: define MSDRadixSort tests

Author: kam-zhan-yue

package.json

@@ -14,6 +14,7 @@
     "start:default": "export SET NODE_OPTIONS=--openssl-legacy-provider && react-scripts start",
     "start:win32": "SET NODE_OPTIONS=--openssl-legacy-provider && react-scripts start",
     "test": "react-scripts test",
+    "test-msdrs": "npm test -- ./src/algorithms/controllers/MSDRadixSort.test.js",
     "test-uf": "npm test -- ./src/algorithms/controllers/unionFind.test.js",
     "test-234t": "npm test -- ./src/algorithms/controllers/TTFTree.test.js"
   },

src/algorithms/controllers/MSDRadixSort.test.js

@@ -0,0 +1,43 @@
+/* The purpose of the test here is to detect whether the correct result is generated
+   under the legal input, not to test its robustness, because this is not considered
+   in the implementation process of the algorithm.
+*/
+
+/* eslint-disable no-undef */
+
+import rexSort from './MSDRadixSort';
+
+// Simple stub for the chunker
+const chunker = {
+  add: () => {},
+};
+
+describe('rexsort', () => {
+  it('sorts empty array', () => {
+    expect(rexSort.run(chunker, { nodes: [] })).toEqual([]);
+  });
+  it('sorts single element', () => {
+    expect(rexSort.run(chunker, { nodes: [4] })).toEqual([4]);
+  });
+  it('sorts two values', () => {
+    expect(rexSort.run(chunker, { nodes: [1, 2] })).toEqual([1, 2]);
+  });
+  it('sorts two values in reverse', () => {
+    expect(rexSort.run(chunker, { nodes: [2, 1] })).toEqual([1, 2]);
+  });
+  it('sorts odd list', () => {
+    expect(rexSort.run(chunker, { nodes: [1, 4, 3] })).toEqual([1, 3, 4]);
+  });
+  it('sorts even list', () => {
+    expect(rexSort.run(chunker, { nodes: [1, 4, 3, 2] })).toEqual([1, 2, 3, 4]);
+  });
+  it('sorts ordered elements', () => {
+    expect(rexSort.run(chunker, { nodes: [1, 2, 3, 4, 5] })).toEqual([1, 2, 3, 4, 5]);
+  });
+  it('sorts reversed elements', () => {
+    expect(rexSort.run(chunker, { nodes: [5, 4, 3, 2, 1] })).toEqual([1, 2, 3, 4, 5]);
+  });
+  it('sorts list with duplicates', () => {
+    expect(rexSort.run(chunker, { nodes: [1, 3, 2, 5, 3, 2] })).toEqual([1, 2, 2, 3, 3, 5]);
+  });
+});

src/algorithms/controllers/collapseChunkPlugin.js

@@ -11,8 +11,8 @@ const importsThis = ['quickSort', 'quickSortM3', 'msort_arr_td',
 
 // eslint-disable-next-line import/no-cycle
 // See also accompanying mods/hooks in src/context/GlobalState.js and
-// src/context/actions.js 
-import { GlobalActions } from '../../context/actions';
+// src/context/actions.js
+// import { GlobalActions } from '../../context/actions';
 
 // not sure if finding the running algorithm needs such complex code, but this
 // seems to work...
@@ -57,4 +57,3 @@ export function onCollapseChange(chunker) {
   if (!importsThis.includes(alg_name)) return;
   chunker.refresh();
 }
-