@nfdi4plants/arctrl 3.2.3 → 3.3.0

package/dist/ts/node_modules/@fable-org/fable-library-ts/Seq.js

@@ -1,18 +1,19 @@
-import { NotSupportedException_$ctor_Z721C83C5, InvalidOperationException_$ctor_Z721C83C5 } from './System.js';
-import { getEnumerator, disposeSafe, toIterator, isArrayLike, isDisposable, Exception, clear } from './Util.js';
+import { NotSupportedException_$ctor_Z721C83C5, InvalidOperationException_$ctor_Z721C83C5, ArgumentOutOfRangeException_$ctor_Z721C83C5 } from './System.js';
+import { getEnumerator, disposeSafe, toIterator, isArrayLike, isDisposable, clear } from './Util.js';
 import { toString } from './Types.js';
 import { class_type } from './Reflection.js';
 import { value, some } from './Option.js';
 import { KeyNotFoundException_$ctor_Z721C83C5 } from './System.Collections.Generic.js';
-import { Operators_NullArgCheck, Operators_Lock } from './FSharp.Core.js';
-import { singleton as singleton$1, tryFindBack as tryFindBack$1, tryFindIndexBack as tryFindIndexBack$1, foldBack as foldBack$1, item as item$1, tryHead as tryHead$1, tryItem as tryItem$1, mapFold as mapFold$1, mapFoldBack as mapFoldBack$1, reverse as reverse$1, scanBack as scanBack$1, pairwise as pairwise$1, splitInto as splitInto$1, windowed as windowed$1, map as map$1, transpose as transpose$1, permute as permute$1, chunkBySize as chunkBySize$1, randomShuffleInPlaceBy, randomChoiceBy as randomChoiceBy$1, randomChoiceWith as randomChoiceWith$1, randomChoice as randomChoice$1, randomChoicesBy as randomChoicesBy$1, randomSampleBy as randomSampleBy$1 } from './Array.js';
+import { Operators_NullArgCheck, Operators_InvalidArg, Operators_Lock, Operators_InvalidOp } from './FSharp.Core.js';
+import { singleton as singleton$1, tryFindBack as tryFindBack$1, tryFindIndexBack as tryFindIndexBack$1, foldBack as foldBack$1, item as item$1, tryHead as tryHead$1, tryItem as tryItem$1, mapFold as mapFold$1, mapFoldBack as mapFoldBack$1, reduceBack as reduceBack$1, reverse as reverse$1, scanBack as scanBack$1, pairwise as pairwise$1, splitInto as splitInto$1, windowed as windowed$1, permute as permute$1, chunkBySize as chunkBySize$1, randomShuffleInPlaceBy, randomChoiceBy as randomChoiceBy$1, randomChoiceWith as randomChoiceWith$1, randomChoice as randomChoice$1, randomChoicesBy as randomChoicesBy$1, randomSampleBy as randomSampleBy$1 } from './Array.js';
 import { FSharpList, toArray as toArray$1, ofArray as ofArray$1, ofSeq as ofSeq$1, tryHead as tryHead$2, isEmpty as isEmpty$1, tryItem as tryItem$2, length as length$1 } from './List.js';
 import { min as min$1 } from './Double.js';
-import { SR_indexOutOfBounds } from './Global.js';
+import { SR_inputMustBeNonNegative, SR_indexOutOfBounds } from './Global.js';
 import { nonSeeded } from './Random.js';
 
 const SR_enumerationAlreadyFinished = "Enumeration already finished.";
 const SR_enumerationNotStarted = "Enumeration has not started. Call MoveNext.";
+const SR_inputMustBePositive = "The input must be positive.";
 const SR_inputSequenceEmpty = "The input sequence was empty.";
 const SR_inputSequenceTooLong = "The input sequence contains more than one element.";
 const SR_keyNotFoundAlt = "An index satisfying the predicate was not found in the collection.";
@@ -116,7 +117,7 @@ function Enumerator_concat(sources) {
   const finish = () => {
     finished = true;
     if (innerOpt != null) {
-      const inner = value(innerOpt);
+      const inner = innerOpt;
       try {
         disposeSafe(inner);
       } finally {
@@ -124,7 +125,7 @@ function Enumerator_concat(sources) {
       }
     }
     if (outerOpt != null) {
-      const outer = value(outerOpt);
+      const outer = outerOpt;
       try {
         disposeSafe(outer);
       } finally {
@@ -157,7 +158,7 @@ function Enumerator_concat(sources) {
         const innerOpt_1 = innerOpt;
         if (outerOpt_1 != null) {
           if (innerOpt_1 != null) {
-            const inner_1 = value(innerOpt_1);
+            const inner_1 = innerOpt_1;
             if (inner_1["System.Collections.IEnumerator.MoveNext"]()) {
               curr = some(inner_1["System.Collections.Generic.IEnumerator`1.get_Current"]());
               res = true;
@@ -169,7 +170,7 @@ function Enumerator_concat(sources) {
               }
             }
           } else {
-            const outer_1 = value(outerOpt_1);
+            const outer_1 = outerOpt_1;
             if (outer_1["System.Collections.IEnumerator.MoveNext"]()) {
               const ie = outer_1["System.Collections.Generic.IEnumerator`1.get_Current"]();
               innerOpt = (copyOfStruct = ie, getEnumerator(copyOfStruct));
@@ -259,8 +260,8 @@ function Enumerator_unfold(f, state) {
   let acc = state;
   return Enumerator_FromFunctions$1_$ctor_58C54629(() => {
     if (curr != null) {
-      const x = value(curr)[0];
-      value(curr)[1];
+      const x = curr[0];
+      curr[1];
       return x;
     } else {
       return Enumerator_notStarted();
@@ -268,8 +269,8 @@ function Enumerator_unfold(f, state) {
   }, () => {
     curr = f(acc);
     if (curr != null) {
-      value(curr)[0];
-      const st_1 = value(curr)[1];
+      curr[0];
+      const st_1 = curr[1];
       acc = st_1;
       return true;
     } else {
@@ -306,11 +307,21 @@ function ofArray(arr) {
   return arr;
 }
 function toArray(xs) {
-  if (xs instanceof FSharpList) {
-    const a = xs;
-    return toArray$1(a);
-  } else {
+  if (isArrayLike(xs)) {
     return Array.from(xs);
+  } else if (xs instanceof FSharpList) {
+    return toArray$1(xs);
+  } else {
+    const res = [];
+    const e = getEnumerator(xs);
+    try {
+      while (e["System.Collections.IEnumerator.MoveNext"]()) {
+        void res.push(e["System.Collections.Generic.IEnumerator`1.get_Current"]());
+      }
+      return res.slice();
+    } finally {
+      disposeSafe(e);
+    }
   }
 }
 function ofList(xs) {
@@ -444,7 +455,7 @@ function enumerateTryWith(source, catchFilter, catchHandler) {
           e = en_1;
           en_2 = en_1;
         } else {
-          en_2 = value(e);
+          en_2 = e;
         }
         if (en_2["System.Collections.IEnumerator.MoveNext"]()) {
           curr = some(en_2["System.Collections.Generic.IEnumerator`1.get_Current"]());
@@ -460,7 +471,7 @@ function enumerateTryWith(source, catchFilter, catchHandler) {
             caught = true;
             if (e == null) {
             } else {
-              const en_3 = value(e);
+              const en_3 = e;
               try {
                 disposeSafe(en_3);
               } catch (matchValue_1) {
@@ -500,7 +511,7 @@ function enumerateTryWith(source, catchFilter, catchHandler) {
     }, () => {
       if (e == null) {
       } else {
-        disposeSafe(value(e));
+        disposeSafe(e);
       }
     });
   });
@@ -549,12 +560,12 @@ function exactlyOne(xs) {
     if (e["System.Collections.IEnumerator.MoveNext"]()) {
       const v = e["System.Collections.Generic.IEnumerator`1.get_Current"]();
       if (e["System.Collections.IEnumerator.MoveNext"]()) {
-        throw new Exception(SR_inputSequenceTooLong + " (Parameter 'source')");
+        throw Operators_InvalidArg("source", SR_inputSequenceTooLong);
       } else {
         return v;
       }
     } else {
-      throw new Exception(SR_inputSequenceEmpty + " (Parameter 'source')");
+      throw Operators_InvalidArg("source", SR_inputSequenceEmpty);
     }
   } finally {
     disposeSafe(e);
@@ -638,7 +649,7 @@ function findIndex(predicate, xs) {
     indexNotFound();
     return -1;
   } else {
-    return value(matchValue) | 0;
+    return matchValue | 0;
   }
 }
 function tryFindIndexBack(predicate, xs) {
@@ -650,7 +661,7 @@ function findIndexBack(predicate, xs) {
     indexNotFound();
     return -1;
   } else {
-    return value(matchValue) | 0;
+    return matchValue | 0;
   }
 }
 function fold(folder, state, xs) {
@@ -718,12 +729,15 @@ function tryHead(xs) {
 function head(xs) {
   const matchValue = tryHead(xs);
   if (matchValue == null) {
-    throw new Exception(SR_inputSequenceEmpty + " (Parameter 'source')");
+    throw Operators_InvalidArg("source", SR_inputSequenceEmpty);
   } else {
     return value(matchValue);
   }
 }
 function initialize(count, f) {
+  if (count < 0) {
+    throw Operators_InvalidArg("count", SR_inputMustBeNonNegative);
+  }
   return unfold((i) => i < count ? [f(i), i + 1] : void 0, 0);
 }
 function initializeInfinite(f) {
@@ -776,7 +790,7 @@ function tryItem(index, xs) {
 function item(index, xs) {
   const matchValue = tryItem(index, xs);
   if (matchValue == null) {
-    throw new Exception(SR_notEnoughElements + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_notEnoughElements);
   } else {
     return value(matchValue);
   }
@@ -827,7 +841,7 @@ function tryLast(xs) {
 function last(xs) {
   const matchValue = tryLast(xs);
   if (matchValue == null) {
-    throw new Exception(SR_notEnoughElements + " (Parameter 'source')");
+    throw Operators_InvalidArg("source", SR_notEnoughElements);
   } else {
     return value(matchValue);
   }
@@ -952,7 +966,7 @@ function cache(source) {
       if (enumeratorR != null) {
         if (value(enumeratorR) != null) {
           matchResult = 0;
-          e = value(value(enumeratorR));
+          e = value(enumeratorR);
         } else {
           matchResult = 1;
         }
@@ -982,7 +996,7 @@ function cache(source) {
         }
         if (optEnumerator_2 == null) {
         } else {
-          const enumerator = value(optEnumerator_2);
+          const enumerator = optEnumerator_2;
           if (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
             void prefix.push(enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]());
           } else {
@@ -1050,7 +1064,7 @@ function reduce(folder, xs) {
     if (e["System.Collections.IEnumerator.MoveNext"]()) {
       return loop(e["System.Collections.Generic.IEnumerator`1.get_Current"]());
     } else {
-      throw new Exception(SR_inputSequenceEmpty);
+      throw Operators_InvalidArg("source", SR_inputSequenceEmpty);
     }
   } finally {
     disposeSafe(e);
@@ -1059,12 +1073,15 @@ function reduce(folder, xs) {
 function reduceBack(folder, xs) {
   const arr = toArray(xs);
   if (arr.length > 0) {
-    return arr.reduceRight(folder);
+    return reduceBack$1(folder, arr);
   } else {
-    throw new Exception(SR_inputSequenceEmpty);
+    throw Operators_InvalidArg("source", SR_inputSequenceEmpty);
   }
 }
 function replicate(n, x) {
+  if (n < 0) {
+    throw ArgumentOutOfRangeException_$ctor_Z721C83C5("count");
+  }
   return initialize(n, (_arg) => x);
 }
 function reverse(xs) {
@@ -1088,7 +1105,7 @@ function skip(count, source) {
     try {
       for (let _ = 1; _ <= count; _++) {
         if (!e["System.Collections.IEnumerator.MoveNext"]()) {
-          throw new Exception(SR_notEnoughElements + " (Parameter 'source')");
+          throw Operators_InvalidOp(SR_notEnoughElements);
         }
       }
       return Enumerator_enumerateThenFinally(() => {
@@ -1111,15 +1128,30 @@ function skipWhile(predicate, xs) {
   });
 }
 function tail(xs) {
-  return skip(1, xs);
+  return mkSeq(() => {
+    const e = ofSeq(xs);
+    try {
+      if (!e["System.Collections.IEnumerator.MoveNext"]()) {
+        throw Operators_InvalidArg("source", SR_notEnoughElements);
+      }
+      return Enumerator_enumerateThenFinally(() => {
+      }, e);
+    } catch (matchValue) {
+      disposeSafe(e);
+      throw matchValue;
+    }
+  });
 }
 function take(count, xs) {
+  if (count < 0) {
+    throw Operators_InvalidArg("count", SR_inputMustBeNonNegative);
+  }
   return generateIndexed(() => ofSeq(xs), (i, e) => {
     if (i < count) {
       if (e["System.Collections.IEnumerator.MoveNext"]()) {
         return some(e["System.Collections.Generic.IEnumerator`1.get_Current"]());
       } else {
-        throw new Exception(SR_notEnoughElements + " (Parameter 'source')");
+        throw Operators_InvalidOp(SR_notEnoughElements);
       }
     } else {
       return void 0;
@@ -1154,13 +1186,45 @@ function pairwise(xs) {
   return delay(() => ofArray(pairwise$1(toArray(xs))));
 }
 function splitInto(chunks, xs) {
+  if (chunks < 1) {
+    throw Operators_InvalidArg("count", SR_inputMustBePositive);
+  }
   return delay(() => ofArray(splitInto$1(chunks, toArray(xs))));
 }
 function windowed(windowSize, xs) {
+  if (windowSize < 1) {
+    throw Operators_InvalidArg("windowSize", SR_inputMustBePositive);
+  }
   return delay(() => ofArray(windowed$1(windowSize, toArray(xs))));
 }
 function transpose(xss) {
-  return delay(() => ofArray(map$1(ofArray, transpose$1(map$1(toArray, toArray(xss))))));
+  return delay(() => {
+    const rows = [];
+    const enumerator = getEnumerator(xss);
+    try {
+      while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
+        let i = 0;
+        let enumerator_1;
+        let copyOfStruct = enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]();
+        enumerator_1 = getEnumerator(copyOfStruct);
+        try {
+          while (enumerator_1["System.Collections.IEnumerator.MoveNext"]()) {
+            const x = enumerator_1["System.Collections.Generic.IEnumerator`1.get_Current"]();
+            if (i === rows.length) {
+              void rows.push([]);
+            }
+            void item$1(i, rows).push(x);
+            i = i + 1 | 0;
+          }
+        } finally {
+          disposeSafe(enumerator_1);
+        }
+      }
+    } finally {
+      disposeSafe(enumerator);
+    }
+    return map((row) => row, rows);
+  });
 }
 function sortWith(comparer, xs) {
   return delay(() => {
@@ -1206,7 +1270,7 @@ function average(xs, averager) {
     return averager.Add(acc, x);
   }, averager.GetZero(), xs);
   if (count === 0) {
-    throw new Exception(SR_inputSequenceEmpty + " (Parameter 'source')");
+    throw Operators_InvalidArg("source", SR_inputSequenceEmpty);
   } else {
     return averager.DivideByInt(total, count);
   }
@@ -1218,7 +1282,7 @@ function averageBy(f, xs, averager) {
     return averager.Add(acc, f(x));
   }, averager.GetZero(), xs);
   if (count === 0) {
-    throw new Exception(SR_inputSequenceEmpty + " (Parameter 'source')");
+    throw Operators_InvalidArg("source", SR_inputSequenceEmpty);
   } else {
     return averager.DivideByInt(total, count);
   }
@@ -1227,12 +1291,15 @@ function permute(f, xs) {
   return delay(() => ofArray(permute$1(f, toArray(xs))));
 }
 function chunkBySize(chunkSize, xs) {
+  if (chunkSize < 1) {
+    throw Operators_InvalidArg("chunkSize", SR_inputMustBePositive);
+  }
   return delay(() => ofArray(chunkBySize$1(chunkSize, toArray(xs))));
 }
 function insertAt(index, y, xs) {
   let isDone = false;
   if (index < 0) {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
   }
   return generateIndexed(() => ofSeq(xs), (i, e) => {
     if ((isDone ? true : i < index) && e["System.Collections.IEnumerator.MoveNext"]()) {
@@ -1242,7 +1309,7 @@ function insertAt(index, y, xs) {
       return some(y);
     } else {
       if (!isDone) {
-        throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+        throw Operators_InvalidArg("index", SR_indexOutOfBounds);
       }
       return void 0;
     }
@@ -1253,7 +1320,7 @@ function insertAt(index, y, xs) {
 function insertManyAt(index, ys, xs) {
   let status = -1;
   if (index < 0) {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
   }
   return generateIndexed(() => [ofSeq(xs), ofSeq(ys)], (i, tupledArg) => {
     const e1 = tupledArg[0];
@@ -1277,7 +1344,7 @@ function insertManyAt(index, ys, xs) {
         return some(e1["System.Collections.Generic.IEnumerator`1.get_Current"]());
       } else {
         if (status < 1) {
-          throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+          throw Operators_InvalidArg("index", SR_indexOutOfBounds);
         }
         return void 0;
       }
@@ -1292,7 +1359,7 @@ function insertManyAt(index, ys, xs) {
 function removeAt(index, xs) {
   let isDone = false;
   if (index < 0) {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
   }
   return generateIndexed(() => ofSeq(xs), (i, e) => {
     if ((isDone ? true : i < index) && e["System.Collections.IEnumerator.MoveNext"]()) {
@@ -1302,7 +1369,7 @@ function removeAt(index, xs) {
       return e["System.Collections.IEnumerator.MoveNext"]() ? some(e["System.Collections.Generic.IEnumerator`1.get_Current"]()) : void 0;
     } else {
       if (!isDone) {
-        throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+        throw Operators_InvalidArg("index", SR_indexOutOfBounds);
       }
       return void 0;
     }
@@ -1312,33 +1379,30 @@ function removeAt(index, xs) {
 }
 function removeManyAt(index, count, xs) {
   if (index < 0) {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", "index must be within bounds of the array");
   }
-  return generateIndexed(() => ofSeq(xs), (i, e) => {
-    if (i < index) {
-      if (e["System.Collections.IEnumerator.MoveNext"]()) {
-        return some(e["System.Collections.Generic.IEnumerator`1.get_Current"]());
+  const endIndex = index + count | 0;
+  return delay(() => {
+    let i = -1;
+    return append(filter((_arg) => {
+      i = i + 1 | 0;
+      if (i < index) {
+        return true;
       } else {
-        throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+        return i >= endIndex;
       }
-    } else {
-      if (i === index) {
-        for (let _ = 1; _ <= count; _++) {
-          if (!e["System.Collections.IEnumerator.MoveNext"]()) {
-            throw new Exception(SR_indexOutOfBounds + " (Parameter 'count')");
-          }
-        }
+    }, xs), delay(() => {
+      if (i < index) {
+        throw Operators_InvalidArg("index", "index must be within bounds of the array");
       }
-      return e["System.Collections.IEnumerator.MoveNext"]() ? some(e["System.Collections.Generic.IEnumerator`1.get_Current"]()) : void 0;
-    }
-  }, (e_1) => {
-    disposeSafe(e_1);
+      return empty();
+    }));
   });
 }
 function updateAt(index, y, xs) {
   let isDone = false;
   if (index < 0) {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
   }
   return generateIndexed(() => ofSeq(xs), (i, e) => {
     if ((isDone ? true : i < index) && e["System.Collections.IEnumerator.MoveNext"]()) {
@@ -1348,7 +1412,7 @@ function updateAt(index, y, xs) {
       return some(y);
     } else {
       if (!isDone) {
-        throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+        throw Operators_InvalidArg("index", SR_indexOutOfBounds);
       }
       return void 0;
     }
@@ -1395,4 +1459,4 @@ function randomSample(count, xs) {
   return randomSampleWith(nonSeeded(), count, xs);
 }
 
-export { CachedSeq$1, CachedSeq$1_$ctor_Z7A8347D4, CachedSeq$1_$reflection, CachedSeq$1__Clear, Enumerator_FromFunctions$1, Enumerator_FromFunctions$1_$ctor_58C54629, Enumerator_FromFunctions$1_$reflection, Enumerator_Seq, Enumerator_Seq_$ctor_673A07F2, Enumerator_Seq_$reflection, Enumerator_alreadyFinished, Enumerator_cast, Enumerator_concat, Enumerator_enumerateThenFinally, Enumerator_generateWhileSome, Enumerator_noReset, Enumerator_notStarted, Enumerator_unfold, SR_enumerationAlreadyFinished, SR_enumerationNotStarted, SR_inputSequenceEmpty, SR_inputSequenceTooLong, SR_keyNotFoundAlt, SR_notEnoughElements, SR_resetNotSupported, allPairs, append, average, averageBy, cache, cast, choose, chunkBySize, collect, compareWith, concat, contains, delay, empty, enumerateFromFunctions, enumerateThenFinally, enumerateTryWith, enumerateUsing, enumerateWhile, exactlyOne, exists, exists2, filter, find, findBack, findIndex, findIndexBack, fold, fold2, foldBack, foldBack2, forAll, forAll2, generate, generateIndexed, head, indexNotFound, indexed, initialize, initializeInfinite, insertAt, insertManyAt, isEmpty, item, iterate, iterate2, iterateIndexed, iterateIndexed2, last, length, map, map2, map3, mapFold, mapFoldBack, mapIndexed, mapIndexed2, max, maxBy, min, minBy, mkSeq, ofArray, ofList, ofSeq, pairwise, permute, pick, randomChoice, randomChoiceBy, randomChoiceWith, randomChoices, randomChoicesBy, randomChoicesWith, randomSample, randomSampleBy, randomSampleWith, randomShuffle, randomShuffleBy, randomShuffleWith, readOnly, reduce, reduceBack, removeAt, removeManyAt, replicate, reverse, scan, scanBack, singleton, skip, skipWhile, sort, sortBy, sortByDescending, sortDescending, sortWith, splitInto, sum, sumBy, tail, take, takeWhile, toArray, toList, transpose, truncate, tryExactlyOne, tryFind, tryFindBack, tryFindIndex, tryFindIndexBack, tryHead, tryItem, tryLast, tryPick, unfold, updateAt, where, windowed, zip, zip3 };
+export { CachedSeq$1, CachedSeq$1_$ctor_Z7A8347D4, CachedSeq$1_$reflection, CachedSeq$1__Clear, Enumerator_FromFunctions$1, Enumerator_FromFunctions$1_$ctor_58C54629, Enumerator_FromFunctions$1_$reflection, Enumerator_Seq, Enumerator_Seq_$ctor_673A07F2, Enumerator_Seq_$reflection, Enumerator_alreadyFinished, Enumerator_cast, Enumerator_concat, Enumerator_enumerateThenFinally, Enumerator_generateWhileSome, Enumerator_noReset, Enumerator_notStarted, Enumerator_unfold, SR_enumerationAlreadyFinished, SR_enumerationNotStarted, SR_inputMustBePositive, SR_inputSequenceEmpty, SR_inputSequenceTooLong, SR_keyNotFoundAlt, SR_notEnoughElements, SR_resetNotSupported, allPairs, append, average, averageBy, cache, cast, choose, chunkBySize, collect, compareWith, concat, contains, delay, empty, enumerateFromFunctions, enumerateThenFinally, enumerateTryWith, enumerateUsing, enumerateWhile, exactlyOne, exists, exists2, filter, find, findBack, findIndex, findIndexBack, fold, fold2, foldBack, foldBack2, forAll, forAll2, generate, generateIndexed, head, indexNotFound, indexed, initialize, initializeInfinite, insertAt, insertManyAt, isEmpty, item, iterate, iterate2, iterateIndexed, iterateIndexed2, last, length, map, map2, map3, mapFold, mapFoldBack, mapIndexed, mapIndexed2, max, maxBy, min, minBy, mkSeq, ofArray, ofList, ofSeq, pairwise, permute, pick, randomChoice, randomChoiceBy, randomChoiceWith, randomChoices, randomChoicesBy, randomChoicesWith, randomSample, randomSampleBy, randomSampleWith, randomShuffle, randomShuffleBy, randomShuffleWith, readOnly, reduce, reduceBack, removeAt, removeManyAt, replicate, reverse, scan, scanBack, singleton, skip, skipWhile, sort, sortBy, sortByDescending, sortDescending, sortWith, splitInto, sum, sumBy, tail, take, takeWhile, toArray, toList, transpose, truncate, tryExactlyOne, tryFind, tryFindBack, tryFindIndex, tryFindIndexBack, tryHead, tryItem, tryLast, tryPick, unfold, updateAt, where, windowed, zip, zip3 };

package/dist/ts/node_modules/@fable-org/fable-library-ts/Seq2.js

@@ -32,10 +32,8 @@ function countBy(projection, xs, comparer) {
       while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
         const key = projection(enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]());
         let matchValue;
-        let outArg = 0;
-        matchValue = [tryGetValue(dict, key, new FSharpRef(() => outArg | 0, (v) => {
-          outArg = v | 0;
-        })), outArg];
+        const cell = new FSharpRef(0);
+        matchValue = [tryGetValue(dict, key, cell), cell.contents];
         if (matchValue[0]) {
           dict.set(key, matchValue[1] + 1);
         } else {
@@ -59,10 +57,8 @@ function groupBy(projection, xs, comparer) {
         const x = enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]();
         const key = projection(x);
         let matchValue;
-        let outArg = defaultOf();
-        matchValue = [tryGetValue(dict, key, new FSharpRef(() => outArg, (v) => {
-          outArg = v;
-        })), outArg];
+        const cell = new FSharpRef(defaultOf());
+        matchValue = [tryGetValue(dict, key, cell), cell.contents];
         if (matchValue[0]) {
           void matchValue[1].push(x);
         } else {