feat(patterns): For containerHasSplit(copyArray, ...), scan from the start

Ref #3065 (comment)

Author: gibson042

packages/patterns/src/patterns/patternMatchers.js

@@ -1326,27 +1326,26 @@ const makePatternKit = () => {
    * @param {Pattern} elementPatt
    * @param {bigint} bound Must be >= 1n
    * @param {Rejector} reject
-   * @param {T[]} [inResults]
-   * @param {T[]} [outResults]
+   * @param {T[] | undefined} inResults
+   * @param {T[] | undefined} outResults
+   * @param {-1 | 1} direction -1 for picking from the end (which gives
+   * intuitive results with descending lexicographic CopySet payloads); 1 for
+   * picking from the start (which gives intuitive results with other arrays)
    * @returns {boolean}
    */
   const confirmElementsHasSplit = (
     elements,
     elementPatt,
     bound,
     reject,
-    inResults = undefined,
-    outResults = undefined,
+    inResults,
+    outResults,
+    direction,
   ) => {
     let inCount = 0n;
-    // Since this feature is motivated by ERTP's use on
-    // non-fungible (`set`, `copySet`) amounts,
-    // their arrays store their elements in decending lexicographic order.
-    // But this function has to make some choice amoung equally good minimal
-    // results. It is more intuitive for the choice to be the first `bound`
-    // matching elements in ascending lexicigraphic order, rather than
-    // decending. Thus we iterate `elements` in reverse order.
-    for (let i = elements.length - 1; i >= 0; i -= 1) {
+    const firstIndex = direction === -1 ? elements.length - 1 : 0;
+    const stopIndex = direction === -1 ? -1 : elements.length;
+    for (let i = firstIndex; i !== stopIndex; i += direction) {
       const element = elements[i];
       if (inCount >= bound) {
         if (!outResults) break;
@@ -1446,6 +1445,7 @@ const makePatternKit = () => {
             reject,
             inResults,
             outResults,
+            1,
           ) && [harden(inResults), harden(outResults)]
         );
       }
@@ -1458,6 +1458,7 @@ const makePatternKit = () => {
             reject,
             inResults,
             outResults,
+            -1,
           ) && [
             inResults && makeCopySet(inResults),
             outResults && makeCopySet(outResults),

packages/patterns/test/containerHasSplit.test.js

@@ -82,16 +82,16 @@ const testContainerHasSplit = test.macro((t, config) => {
     specimen,
     pattern: M.string(),
     bound: 1n,
-    expectAccepted: ['bar'],
-    expectRejected: [2, 'foo', 1],
+    expectAccepted: ['foo'],
+    expectRejected: [1, 2, 'bar'],
   });
 
   test('split first two matches from copyArray', testContainerHasSplit, {
     specimen,
     pattern: M.string(),
     bound: 2n,
-    expectAccepted: ['bar', 'foo'],
-    expectRejected: [2, 1],
+    expectAccepted: ['foo', 'bar'],
+    expectRejected: [1, 2],
   });
 
   test('fail against copyArray', testContainerHasSplit, {