missing file added, minor fixes

Author: lee-naish

README.md

@@ -5,7 +5,8 @@
 Welcome to Algorithms In Action!
 
 Here is the [link](https://dev-aia.vercel.app/) to run the algorithm
-visualiser on your browser (hosted on Vercel; the github hosting is
+visualiser on your browser (hosted on Vercel on a hobby account so best
+install it elsewhere for anything more than casual use; the github hosting is
 currently broken for some unknown reason).
 
 

src/algorithms/controllers/msort_arr_td.js

@@ -419,6 +419,7 @@ export function run_msort(is_qs_median_of_3) {
         // recursive call once it has returned plus we need a chunk at
         // this level when the recursive code is collapsed
         chunker.add('sortL', (vis, a, cur_left, cur_mid, cur_right) => {
+          vis.array.set(a, 'msort_arr_td');
           assignVarToA(vis, 'left', cur_left);
           assignVarToA(vis, 'mid', cur_mid);
           assignVarToA(vis, 'right', cur_right);
@@ -433,19 +434,20 @@ export function run_msort(is_qs_median_of_3) {
 
         // dummy chunk before recursive call, as above
         chunker.add('preSortR', (vis, a, cur_left, cur_mid, cur_right) => {
-          vis.array.set(a, 'msort_arr_td');
+          // vis.array.set(a, 'msort_arr_td');
+          for (let i = cur_left; i <= cur_mid; i++) {
+            unhighlight(vis, i, false);
+          }
           assignVarToA(vis, 'left', undefined);
           assignVarToA(vis, 'mid', undefined);
           assignVarToA(vis, 'right', undefined);
-          for (let i = cur_left; i <= cur_mid; i++) {
-            // unhighlight(vis, i, true);
-            // unhighlight(vis, i, false)
-          }
-          // for (let i = cur_mid+1; i <= cur_right; i++) {
+          for (let i = cur_mid+1; i <= cur_right; i++) {
             // highlight(vis, i, true)
-          // }
+          }
           }, [A, left, mid, right], depth);
+
         MergeSort(mid+1, right, depth + 1);
+
         // chunk after recursive call
         chunker.add('sortR', (vis, a, cur_left, cur_mid, cur_right) => {
           assignVarToA(vis, 'left', cur_left);
@@ -636,6 +638,11 @@ cur_max2, cur_bp) => {
             assignVarToA(vis, 'ap2', undefined);
             assignVarToA(vis, 'max2', undefined);
           }
+          // XXX best highlight cur_mid+1..right from previous
+          // recursion level?
+          // for (let i = cur_mid+1; i <= right; i++) {
+            // highlight(vis, i, true)
+          // }
           }, [A, B, left, mid, right], depth);
 
         // chunk after recursive call, as above, after adjusting

src/algorithms/controllers/msort_arr_tdCollapseChunkPlugin.js

@@ -0,0 +1,82 @@
+// XXX Based on Quicksort version
+
+// eslint-disable-next-line import/no-cycle
+// See also accompanying mods/hooks in src/context/GlobalState.js and
+// src/context/actions.js 
+
+/*
+ * @Author: Roden Wild
+ * @Date: 2023-09-02
+ * @FilePath: /src/algorithms/controllers/msort_arr_tdCollapseChunkPlugin.js
+ * @Description: logic for msort_arr_td reachability
+ */
+import { GlobalActions } from '../../context/actions';
+import { triggerButtonClick } from '../parameters/ButtonClickTrigger.js';
+
+// XXX
+const MS_NAME = 'msort_arr_td';
+
+let algorithmGetter = () => null;
+let dispatchGetter = () => null;
+
+function getGlobalAlgorithm() {
+  return algorithmGetter();
+}
+
+// eslint-disable-next-line
+function getGlobalDispatch() {
+  return dispatchGetter();
+}
+
+window.getGlobalAlgorithm = getGlobalAlgorithm;
+export function initGlobalAlgorithmGettermsort_arr_td(getter, dispatchGetterFn) {
+  algorithmGetter = getter;
+  dispatchGetter = dispatchGetterFn;
+}
+
+function isInmsort_arr_td(algorithm) {
+  // eslint-disable-next-line no-param-reassign
+  if (!algorithm) algorithm = getGlobalAlgorithm();
+  return algorithm.id.name === MS_NAME;
+}
+
+export function isMergeCopyExpanded() {
+  const algorithm = getGlobalAlgorithm();
+  if (!isInmsort_arr_td()) return false;
+  // eslint-disable-next-line
+  const { bookmark, pseudocode, collapse } = algorithm;
+  return collapse.msort_arr_td.sort.MergeCopy;
+}
+
+export function isMergeExpanded() {
+  const algorithm = getGlobalAlgorithm();
+  if (!isInmsort_arr_td()) return false;
+  // eslint-disable-next-line
+  const { bookmark, pseudocode, collapse } = algorithm;
+  return collapse.msort_arr_td.sort.Merge;
+}
+
+// checks if either QS recursive call is expanded (needed to determine if i
+// should be displayed)
+export function isRecursionExpanded() {
+  const algorithm = getGlobalAlgorithm();
+  if (!isInmsort_arr_td()) return false;
+  // , playing, chunker
+
+  // eslint-disable-next-line
+  const { bookmark, pseudocode, collapse } = algorithm;
+  return collapse.msort_arr_td.sort.QuicksortFirst ||
+              collapse.msort_arr_td.sort.QuicksortSecond;
+}
+
+// Trigger refresh of display when code is expanded/collapsed.
+// Not so efficient - runs through all the chunks from the start. XXX
+// However, it seems to work and is pretty general - could possibly use it for
+// other algorithms rather than have specific triggers for each algorithm.
+export function onCollapseStateChangemsort_arr_td(chunker) {
+  if (!isInmsort_arr_td()) return false;
+  const algorithm = getGlobalAlgorithm();
+  chunker.refresh();
+  //triggerButtonClick();
+  //GlobalActions.RUN_ALGORITHM(algorithm.state, algorithm.id);
+}