@nfdi4plants/arctrl 3.2.2 → 3.3.0

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

@@ -1,15 +1,16 @@
-import { getEnumerator, disposeSafe, equals, structuralHash, compare, toIterator, defaultOf, Exception, isArrayLike } from './Util.js';
-import { Record, toString } from './Types.js';
-import { value, some, defaultArg } from './Option.js';
-import { record_type, option_type, class_type } from './Reflection.js';
-import { SR_inputWasEmpty, SR_indexOutOfBounds, SR_keyNotFoundAlt, SR_differentLengths, SR_notEnoughElements, SR_inputMustBeNonNegative, SR_inputSequenceEmpty, SR_inputSequenceTooLong } from './Global.js';
+import { getEnumerator, disposeSafe, equals, structuralHash, compare, toIterator, defaultOf, isArrayLike } from './Util.js';
+import { toString } from './Types.js';
+import { some, value, defaultArg } from './Option.js';
+import { class_type } from './Reflection.js';
+import { Operators_InvalidOp, Operators_InvalidArg } from './FSharp.Core.js';
+import { SR_inputWasEmpty, SR_indexOutOfBounds, SR_keyNotFoundAlt, SR_inputMustBeNonNegative, SR_inputSequenceEmpty, SR_notEnoughElements, SR_inputSequenceTooLong } from './Global.js';
 import { KeyNotFoundException_$ctor_Z721C83C5 } from './System.Collections.Generic.js';
 import { fill, setItem, foldBack as foldBack$1, foldBack2 as foldBack2$1, item as item$1, scanBack as scanBack$1, tryFindBack as tryFindBack$1, tryFindIndexBack as tryFindIndexBack$1, permute as permute$1, map as map$1, chunkBySize as chunkBySize$1, pairwise as pairwise$1, windowed as windowed$1, splitInto as splitInto$1, transpose as transpose$1, randomShuffleInPlaceBy, randomChoiceBy as randomChoiceBy$1, randomChoicesBy as randomChoicesBy$1, randomSampleBy as randomSampleBy$1 } from './Array.js';
+import { ArgumentOutOfRangeException_$ctor_Z384F8060 } from './System.js';
 import { nonSeeded } from './Random.js';
 
-class FSharpList extends Record {
+class FSharpList {
   constructor(head2, tail2) {
-    super();
     this.head = head2;
     this.tail = tail2;
   }
@@ -44,8 +45,8 @@ class FSharpList extends Record {
             const matchValue_1 = ys_1.tail;
             if (matchValue != null) {
               if (matchValue_1 != null) {
-                const xt = value(matchValue);
-                const yt = value(matchValue_1);
+                const xt = matchValue;
+                const yt = matchValue_1;
                 if (equals(xs_1.head, ys_1.head)) {
                   xs_1_mut = xt;
                   ys_1_mut = yt;
@@ -77,7 +78,7 @@ class FSharpList extends Record {
           const i = i_mut, h = h_mut, xs_1 = xs_1_mut;
           const matchValue = xs_1.tail;
           if (matchValue != null) {
-            const t = value(matchValue);
+            const t = matchValue;
             if (i > 18) {
               return h | 0;
             } else {
@@ -110,8 +111,8 @@ class FSharpList extends Record {
             const matchValue_1 = ys_1.tail;
             if (matchValue != null) {
               if (matchValue_1 != null) {
-                const xt = value(matchValue);
-                const yt = value(matchValue_1);
+                const xt = matchValue;
+                const yt = matchValue_1;
                 const c = compare(xs_1.head, ys_1.head) | 0;
                 if (c === 0) {
                   xs_1_mut = xt;
@@ -149,7 +150,7 @@ class FSharpList extends Record {
   }
 }
 function FSharpList_$reflection(gen0) {
-  return record_type("ListModule.FSharpList", [gen0], FSharpList, () => [["head", gen0], ["tail", option_type(FSharpList_$reflection(gen0))]]);
+  return class_type("ListModule.FSharpList", [gen0], FSharpList);
 }
 class ListEnumerator$1 {
   constructor(xs) {
@@ -169,7 +170,7 @@ class ListEnumerator$1 {
     const _ = this;
     const matchValue = _.it.tail;
     if (matchValue != null) {
-      const t = value(matchValue);
+      const t = matchValue;
       _.current = _.it.head;
       _.it = t;
       return true;
@@ -191,11 +192,8 @@ function ListEnumerator$1_$reflection(gen0) {
 function ListEnumerator$1_$ctor_3002E699(xs) {
   return new ListEnumerator$1(xs);
 }
-function FSharpList_get_Empty() {
-  return new FSharpList(defaultOf(), void 0);
-}
-function FSharpList_Cons_305B8EAC(x, xs) {
-  return new FSharpList(x, xs);
+function FSharpList_$ctor_Z23DD7291(head_1, tail_1) {
+  return new FSharpList(head_1, tail_1);
 }
 function FSharpList__get_IsEmpty(xs) {
   return xs.tail == null;
@@ -208,7 +206,7 @@ function FSharpList__get_Length(xs) {
         const matchValue = xs_1.tail;
         if (matchValue != null) {
           i_mut = i + 1;
-          xs_1_mut = value(matchValue);
+          xs_1_mut = matchValue;
           continue loop;
         } else {
           return i | 0;
@@ -223,15 +221,15 @@ function FSharpList__get_Head(xs) {
   if (matchValue != null) {
     return xs.head;
   } else {
-    throw new Exception(SR_inputWasEmpty + " (Parameter 'list')");
+    throw Operators_InvalidOp(SR_inputWasEmpty);
   }
 }
 function FSharpList__get_Tail(xs) {
   const matchValue = xs.tail;
   if (matchValue != null) {
-    return value(matchValue);
+    return matchValue;
   } else {
-    throw new Exception(SR_inputWasEmpty + " (Parameter 'list')");
+    throw Operators_InvalidOp(SR_inputWasEmpty);
   }
 }
 function FSharpList__get_Item_Z524259A4(xs, index) {
@@ -241,7 +239,7 @@ function FSharpList__get_Item_Z524259A4(xs, index) {
         const i = i_mut, xs_1 = xs_1_mut;
         const matchValue = xs_1.tail;
         if (matchValue != null) {
-          const t = value(matchValue);
+          const t = matchValue;
           if (i === index) {
             return xs_1.head;
           } else {
@@ -250,24 +248,28 @@ function FSharpList__get_Item_Z524259A4(xs, index) {
             continue loop;
           }
         } else {
-          throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+          throw Operators_InvalidArg("index", SR_indexOutOfBounds);
         }
         break;
       }
   };
   return loop(0, xs);
 }
+const emptyNode = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
+function empty() {
+  return emptyNode;
+}
 function indexNotFound() {
   throw KeyNotFoundException_$ctor_Z721C83C5(SR_keyNotFoundAlt);
 }
-function empty() {
-  return FSharpList_get_Empty();
+function differentLengths(paramName) {
+  throw Operators_InvalidArg(paramName, "The lists had different lengths.");
 }
 function cons(x, xs) {
-  return FSharpList_Cons_305B8EAC(x, xs);
+  return FSharpList_$ctor_Z23DD7291(x, xs);
 }
 function singleton(x) {
-  return FSharpList_Cons_305B8EAC(x, FSharpList_get_Empty());
+  return FSharpList_$ctor_Z23DD7291(x, empty());
 }
 function isEmpty(xs) {
   return FSharpList__get_IsEmpty(xs);
@@ -276,7 +278,12 @@ function length(xs) {
   return FSharpList__get_Length(xs) | 0;
 }
 function head(xs) {
-  return FSharpList__get_Head(xs);
+  const matchValue = xs.tail;
+  if (matchValue != null) {
+    return xs.head;
+  } else {
+    throw Operators_InvalidArg("list", SR_inputWasEmpty);
+  }
 }
 function tryHead(xs) {
   if (FSharpList__get_IsEmpty(xs)) {
@@ -286,7 +293,12 @@ function tryHead(xs) {
   }
 }
 function tail(xs) {
-  return FSharpList__get_Tail(xs);
+  const matchValue = xs.tail;
+  if (matchValue != null) {
+    return matchValue;
+  } else {
+    throw Operators_InvalidArg("list", SR_inputWasEmpty);
+  }
 }
 function tryLast(xs_mut) {
   tryLast:
@@ -309,7 +321,7 @@ function tryLast(xs_mut) {
 function last(xs) {
   const matchValue = tryLast(xs);
   if (matchValue == null) {
-    throw new Exception(SR_inputWasEmpty);
+    throw Operators_InvalidArg("list", SR_inputWasEmpty);
   } else {
     return value(matchValue);
   }
@@ -373,7 +385,7 @@ function fold(folder, state, xs) {
   return acc;
 }
 function reverse(xs) {
-  return fold((acc, x) => FSharpList_Cons_305B8EAC(x, acc), FSharpList_get_Empty(), xs);
+  return fold((acc, x) => FSharpList_$ctor_Z23DD7291(x, acc), empty(), xs);
 }
 function foldBack(folder, xs, state) {
   return foldBack$1(folder, toArray(xs), state);
@@ -405,10 +417,20 @@ function fold2(folder, state, xs, ys) {
     xs_1 = FSharpList__get_Tail(xs_1);
     ys_1 = FSharpList__get_Tail(ys_1);
   }
+  if (!FSharpList__get_IsEmpty(xs_1)) {
+    differentLengths("list2");
+  } else if (!FSharpList__get_IsEmpty(ys_1)) {
+    differentLengths("list1");
+  }
   return acc;
 }
 function foldBack2(folder, xs, ys, state) {
-  return foldBack2$1(folder, toArray(xs), toArray(ys), state);
+  const xs_1 = toArray(xs);
+  const ys_1 = toArray(ys);
+  if (xs_1.length !== ys_1.length) {
+    differentLengths(xs_1.length === 0 ? "list1" : ys_1.length === 0 ? "list2" : "list1, list2");
+  }
+  return foldBack2$1(folder, xs_1, ys_1, state);
 }
 function unfold(generator, state) {
   const loop = (acc_mut, node_mut) => {
@@ -418,8 +440,8 @@ function unfold(generator, state) {
         let t = void 0;
         const matchValue = generator(acc);
         if (matchValue != null) {
-          acc_mut = value(matchValue)[1];
-          node_mut = (t = new FSharpList(value(matchValue)[0], void 0), node.tail = t, t);
+          acc_mut = matchValue[1];
+          node_mut = (t = FSharpList_$ctor_Z23DD7291(matchValue[0], void 0), node.tail = t, t);
           continue loop;
         } else {
           return node;
@@ -427,9 +449,9 @@ function unfold(generator, state) {
         break;
       }
   };
-  const root = FSharpList_get_Empty();
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   const node_1 = loop(state, root);
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   node_1.tail = t_2;
   return FSharpList__get_Tail(root);
 }
@@ -461,12 +483,12 @@ function toSeq(xs) {
 function ofArrayWithTail(xs, tail_1) {
   let res = tail_1;
   for (let i = xs.length - 1; i >= 0; i--) {
-    res = FSharpList_Cons_305B8EAC(item$1(i, xs), res);
+    res = FSharpList_$ctor_Z23DD7291(item$1(i, xs), res);
   }
   return res;
 }
 function ofArray(xs) {
-  return ofArrayWithTail(xs, FSharpList_get_Empty());
+  return ofArrayWithTail(xs, empty());
 }
 function ofSeq(xs) {
   if (isArrayLike(xs)) {
@@ -474,30 +496,30 @@ function ofSeq(xs) {
   } else if (xs instanceof FSharpList) {
     return xs;
   } else {
-    const root = FSharpList_get_Empty();
+    const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
     let node = root;
     const enumerator = getEnumerator(xs);
     try {
       while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
         let xs_3 = void 0, t = void 0;
-        const x = enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]();
-        node = (xs_3 = node, t = new FSharpList(x, void 0), xs_3.tail = t, t);
+        const x_1 = enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]();
+        node = (xs_3 = node, t = FSharpList_$ctor_Z23DD7291(x_1, void 0), xs_3.tail = t, t);
       }
     } finally {
       disposeSafe(enumerator);
     }
     const xs_5 = node;
-    const t_2 = FSharpList_get_Empty();
+    const t_2 = empty();
     xs_5.tail = t_2;
     return FSharpList__get_Tail(root);
   }
 }
 function concat(lists) {
-  const root = FSharpList_get_Empty();
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   let node = root;
   const action = (xs) => {
-    node = fold((acc, x) => {
-      const t = new FSharpList(x, void 0);
+    node = fold((acc, x_1) => {
+      const t = FSharpList_$ctor_Z23DD7291(x_1, void 0);
       acc.tail = t;
       return t;
     }, node, xs);
@@ -518,14 +540,14 @@ function concat(lists) {
     }
   }
   const xs_6 = node;
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   xs_6.tail = t_2;
   return FSharpList__get_Tail(root);
 }
 function scan(folder, state, xs) {
-  const root = FSharpList_get_Empty();
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   let node;
-  const t = new FSharpList(state, void 0);
+  const t = FSharpList_$ctor_Z23DD7291(state, void 0);
   root.tail = t;
   node = t;
   let acc = state;
@@ -533,11 +555,11 @@ function scan(folder, state, xs) {
   while (!FSharpList__get_IsEmpty(xs_3)) {
     let xs_4 = void 0, t_2 = void 0;
     acc = folder(acc, FSharpList__get_Head(xs_3));
-    node = (xs_4 = node, t_2 = new FSharpList(acc, void 0), xs_4.tail = t_2, t_2);
+    node = (xs_4 = node, t_2 = FSharpList_$ctor_Z23DD7291(acc, void 0), xs_4.tail = t_2, t_2);
     xs_3 = FSharpList__get_Tail(xs_3);
   }
   const xs_6 = node;
-  const t_4 = FSharpList_get_Empty();
+  const t_4 = empty();
   xs_6.tail = t_4;
   return FSharpList__get_Tail(root);
 }
@@ -545,45 +567,55 @@ function scanBack(folder, xs, state) {
   return ofArray(scanBack$1(folder, toArray(xs), state));
 }
 function append(xs, ys) {
-  return fold((acc, x) => FSharpList_Cons_305B8EAC(x, acc), ys, reverse(xs));
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
+  let node = root;
+  let rest = xs;
+  while (rest.tail != null) {
+    let xs_1 = void 0, t = void 0;
+    node = (xs_1 = node, t = FSharpList_$ctor_Z23DD7291(rest.head, void 0), xs_1.tail = t, t);
+    rest = rest.tail;
+  }
+  const xs_3 = node;
+  xs_3.tail = ys;
+  return FSharpList__get_Tail(root);
 }
 function collect(mapping, xs) {
-  const root = FSharpList_get_Empty();
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   let node = root;
   let ys = xs;
   while (!FSharpList__get_IsEmpty(ys)) {
     let zs = mapping(FSharpList__get_Head(ys));
     while (!FSharpList__get_IsEmpty(zs)) {
       let xs_1 = void 0, t = void 0;
-      node = (xs_1 = node, t = new FSharpList(FSharpList__get_Head(zs), void 0), xs_1.tail = t, t);
+      node = (xs_1 = node, t = FSharpList_$ctor_Z23DD7291(FSharpList__get_Head(zs), void 0), xs_1.tail = t, t);
       zs = FSharpList__get_Tail(zs);
     }
     ys = FSharpList__get_Tail(ys);
   }
   const xs_3 = node;
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   xs_3.tail = t_2;
   return FSharpList__get_Tail(root);
 }
 function mapIndexed(mapping, xs) {
-  const root = FSharpList_get_Empty();
-  const node = foldIndexed((i, acc, x) => {
-    const t = new FSharpList(mapping(i, x), void 0);
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
+  const node = foldIndexed((i, acc, x_1) => {
+    const t = FSharpList_$ctor_Z23DD7291(mapping(i, x_1), void 0);
     acc.tail = t;
     return t;
   }, root, xs);
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   node.tail = t_2;
   return FSharpList__get_Tail(root);
 }
 function map(mapping, xs) {
-  const root = FSharpList_get_Empty();
-  const node = fold((acc, x) => {
-    const t = new FSharpList(mapping(x), void 0);
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
+  const node = fold((acc, x_1) => {
+    const t = FSharpList_$ctor_Z23DD7291(mapping(x_1), void 0);
     acc.tail = t;
     return t;
   }, root, xs);
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   node.tail = t_2;
   return FSharpList__get_Tail(root);
 }
@@ -591,13 +623,13 @@ function indexed(xs) {
   return mapIndexed((i, x) => [i, x], xs);
 }
 function map2(mapping, xs, ys) {
-  const root = FSharpList_get_Empty();
-  const node = fold2((acc, x, y) => {
-    const t = new FSharpList(mapping(x, y), void 0);
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
+  const node = fold2((acc, x_1, y) => {
+    const t = FSharpList_$ctor_Z23DD7291(mapping(x_1, y), void 0);
     acc.tail = t;
     return t;
   }, root, xs, ys);
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   node.tail = t_2;
   return FSharpList__get_Tail(root);
 }
@@ -608,10 +640,15 @@ function mapIndexed2(mapping, xs, ys) {
         const i = i_mut, acc = acc_mut, xs_1 = xs_1_mut, ys_1 = ys_1_mut;
         let t = void 0;
         if (FSharpList__get_IsEmpty(xs_1) ? true : FSharpList__get_IsEmpty(ys_1)) {
+          if (!FSharpList__get_IsEmpty(xs_1)) {
+            differentLengths("list2");
+          } else if (!FSharpList__get_IsEmpty(ys_1)) {
+            differentLengths("list1");
+          }
           return acc;
         } else {
           i_mut = i + 1;
-          acc_mut = (t = new FSharpList(mapping(i, FSharpList__get_Head(xs_1), FSharpList__get_Head(ys_1)), void 0), acc.tail = t, t);
+          acc_mut = (t = FSharpList_$ctor_Z23DD7291(mapping(i, FSharpList__get_Head(xs_1), FSharpList__get_Head(ys_1)), void 0), acc.tail = t, t);
           xs_1_mut = FSharpList__get_Tail(xs_1);
           ys_1_mut = FSharpList__get_Tail(ys_1);
           continue loop;
@@ -619,9 +656,9 @@ function mapIndexed2(mapping, xs, ys) {
         break;
       }
   };
-  const root = FSharpList_get_Empty();
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   const node_1 = loop(0, root, xs, ys);
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   node_1.tail = t_2;
   return FSharpList__get_Tail(root);
 }
@@ -632,9 +669,12 @@ function map3(mapping, xs, ys, zs) {
         const acc = acc_mut, xs_1 = xs_1_mut, ys_1 = ys_1_mut, zs_1 = zs_1_mut;
         let t = void 0;
         if ((FSharpList__get_IsEmpty(xs_1) ? true : FSharpList__get_IsEmpty(ys_1)) ? true : FSharpList__get_IsEmpty(zs_1)) {
+          if (!(FSharpList__get_IsEmpty(xs_1) && FSharpList__get_IsEmpty(ys_1) && FSharpList__get_IsEmpty(zs_1))) {
+            differentLengths("list1, list2, list3");
+          }
           return acc;
         } else {
-          acc_mut = (t = new FSharpList(mapping(FSharpList__get_Head(xs_1), FSharpList__get_Head(ys_1), FSharpList__get_Head(zs_1)), void 0), acc.tail = t, t);
+          acc_mut = (t = FSharpList_$ctor_Z23DD7291(mapping(FSharpList__get_Head(xs_1), FSharpList__get_Head(ys_1), FSharpList__get_Head(zs_1)), void 0), acc.tail = t, t);
           xs_1_mut = FSharpList__get_Tail(xs_1);
           ys_1_mut = FSharpList__get_Tail(ys_1);
           zs_1_mut = FSharpList__get_Tail(zs_1);
@@ -643,20 +683,20 @@ function map3(mapping, xs, ys, zs) {
         break;
       }
   };
-  const root = FSharpList_get_Empty();
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   const node_1 = loop(root, xs, ys, zs);
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   node_1.tail = t_2;
   return FSharpList__get_Tail(root);
 }
 function mapFold(mapping, state, xs) {
-  const root = FSharpList_get_Empty();
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   const patternInput_1 = fold((tupledArg, x) => {
     let t = void 0;
     const patternInput = mapping(tupledArg[1], x);
-    return [(t = new FSharpList(patternInput[0], void 0), tupledArg[0].tail = t, t), patternInput[1]];
+    return [(t = FSharpList_$ctor_Z23DD7291(patternInput[0], void 0), tupledArg[0].tail = t, t), patternInput[1]];
   }, [root, state], xs);
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   patternInput_1[0].tail = t_2;
   return [FSharpList__get_Tail(root), patternInput_1[1]];
 }
@@ -739,7 +779,7 @@ function findIndex(f, xs) {
     indexNotFound();
     return -1;
   } else {
-    return value(matchValue) | 0;
+    return matchValue | 0;
   }
 }
 function tryFindIndexBack(f, xs) {
@@ -751,7 +791,7 @@ function findIndexBack(f, xs) {
     indexNotFound();
     return -1;
   } else {
-    return value(matchValue) | 0;
+    return matchValue | 0;
   }
 }
 function tryItem(n, xs) {
@@ -777,53 +817,53 @@ function item(n, xs) {
   return FSharpList__get_Item_Z524259A4(xs, n);
 }
 function filter(f, xs) {
-  const root = FSharpList_get_Empty();
-  const node = fold((acc, x) => {
-    if (f(x)) {
-      const t = new FSharpList(x, void 0);
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
+  const node = fold((acc, x_1) => {
+    if (f(x_1)) {
+      const t = FSharpList_$ctor_Z23DD7291(x_1, void 0);
       acc.tail = t;
       return t;
     } else {
       return acc;
     }
   }, root, xs);
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   node.tail = t_2;
   return FSharpList__get_Tail(root);
 }
 function partition(f, xs) {
-  const matchValue = FSharpList_get_Empty();
-  const root2 = FSharpList_get_Empty();
+  const matchValue = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
+  const root2 = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   const root1 = matchValue;
-  const patternInput_1 = fold((tupledArg, x) => {
+  const patternInput_1 = fold((tupledArg, x_2) => {
     let t = void 0, t_2 = void 0;
     const lacc = tupledArg[0];
     const racc = tupledArg[1];
-    if (f(x)) {
-      return [(t = new FSharpList(x, void 0), lacc.tail = t, t), racc];
+    if (f(x_2)) {
+      return [(t = FSharpList_$ctor_Z23DD7291(x_2, void 0), lacc.tail = t, t), racc];
     } else {
-      return [lacc, (t_2 = new FSharpList(x, void 0), racc.tail = t_2, t_2)];
+      return [lacc, (t_2 = FSharpList_$ctor_Z23DD7291(x_2, void 0), racc.tail = t_2, t_2)];
     }
   }, [root1, root2], xs);
-  const t_4 = FSharpList_get_Empty();
+  const t_4 = empty();
   patternInput_1[0].tail = t_4;
-  const t_5 = FSharpList_get_Empty();
+  const t_5 = empty();
   patternInput_1[1].tail = t_5;
   return [FSharpList__get_Tail(root1), FSharpList__get_Tail(root2)];
 }
 function choose(f, xs) {
-  const root = FSharpList_get_Empty();
-  const node = fold((acc, x) => {
-    const matchValue = f(x);
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
+  const node = fold((acc, x_1) => {
+    const matchValue = f(x_1);
     if (matchValue == null) {
       return acc;
     } else {
-      const t = new FSharpList(value(matchValue), void 0);
+      const t = FSharpList_$ctor_Z23DD7291(value(matchValue), void 0);
       acc.tail = t;
       return t;
     }
   }, root, xs);
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   node.tail = t_2;
   return FSharpList__get_Tail(root);
 }
@@ -831,14 +871,17 @@ function contains(value, xs, eq) {
   return tryFindIndex((v) => eq.Equals(value, v), xs) != null;
 }
 function initialize(n, f) {
-  const root = FSharpList_get_Empty();
+  if (n < 0) {
+    throw Operators_InvalidArg("count", SR_inputMustBeNonNegative);
+  }
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   let node = root;
   for (let i = 0; i <= n - 1; i++) {
     let xs = void 0, t = void 0;
-    node = (xs = node, t = new FSharpList(f(i), void 0), xs.tail = t, t);
+    node = (xs = node, t = FSharpList_$ctor_Z23DD7291(f(i), void 0), xs.tail = t, t);
   }
   const xs_2 = node;
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   xs_2.tail = t_2;
   return FSharpList__get_Tail(root);
 }
@@ -847,14 +890,14 @@ function replicate(n, x) {
 }
 function reduce(f, xs) {
   if (FSharpList__get_IsEmpty(xs)) {
-    throw new Exception(SR_inputWasEmpty);
+    throw Operators_InvalidArg("list", SR_inputWasEmpty);
   } else {
     return fold(f, head(xs), tail(xs));
   }
 }
 function reduceBack(f, xs) {
   if (FSharpList__get_IsEmpty(xs)) {
-    throw new Exception(SR_inputWasEmpty);
+    throw Operators_InvalidArg("list", SR_inputWasEmpty);
   } else {
     return foldBack(f, tail(xs), head(xs));
   }
@@ -862,8 +905,30 @@ function reduceBack(f, xs) {
 function forAll(f, xs) {
   return fold((acc, x) => acc && f(x), true, xs);
 }
-function forAll2(f, xs, ys) {
-  return fold2((acc, x, y) => acc && f(x, y), true, xs, ys);
+function forAll2(f_mut, xs_mut, ys_mut) {
+  forAll2:
+    while (true) {
+      const f = f_mut, xs = xs_mut, ys = ys_mut;
+      const matchValue = FSharpList__get_IsEmpty(xs);
+      const matchValue_1 = FSharpList__get_IsEmpty(ys);
+      if (matchValue) {
+        if (matchValue_1) {
+          return true;
+        } else {
+          return differentLengths("list1");
+        }
+      } else if (matchValue_1) {
+        return differentLengths("list2");
+      } else if (f(FSharpList__get_Head(xs), FSharpList__get_Head(ys))) {
+        f_mut = f;
+        xs_mut = FSharpList__get_Tail(xs);
+        ys_mut = FSharpList__get_Tail(ys);
+        continue forAll2;
+      } else {
+        return false;
+      }
+      break;
+    }
 }
 function exists(f, xs) {
   return tryFindIndex(f, xs) != null;
@@ -899,16 +964,16 @@ function exists2(f_mut, xs_mut, ys_mut) {
             continue exists2;
           }
         default:
-          throw new Exception(SR_differentLengths + " (Parameter 'list2')");
+          return differentLengths("list2");
       }
       break;
     }
 }
 function unzip(xs) {
-  return foldBack((tupledArg, tupledArg_1) => [FSharpList_Cons_305B8EAC(tupledArg[0], tupledArg_1[0]), FSharpList_Cons_305B8EAC(tupledArg[1], tupledArg_1[1])], xs, [FSharpList_get_Empty(), FSharpList_get_Empty()]);
+  return foldBack((tupledArg, tupledArg_1) => [FSharpList_$ctor_Z23DD7291(tupledArg[0], tupledArg_1[0]), FSharpList_$ctor_Z23DD7291(tupledArg[1], tupledArg_1[1])], xs, [empty(), empty()]);
 }
 function unzip3(xs) {
-  return foldBack((tupledArg, tupledArg_1) => [FSharpList_Cons_305B8EAC(tupledArg[0], tupledArg_1[0]), FSharpList_Cons_305B8EAC(tupledArg[1], tupledArg_1[1]), FSharpList_Cons_305B8EAC(tupledArg[2], tupledArg_1[2])], xs, [FSharpList_get_Empty(), FSharpList_get_Empty(), FSharpList_get_Empty()]);
+  return foldBack((tupledArg, tupledArg_1) => [FSharpList_$ctor_Z23DD7291(tupledArg[0], tupledArg_1[0]), FSharpList_$ctor_Z23DD7291(tupledArg[1], tupledArg_1[1]), FSharpList_$ctor_Z23DD7291(tupledArg[2], tupledArg_1[2])], xs, [empty(), empty(), empty()]);
 }
 function zip(xs, ys) {
   return map2((x, y) => [x, y], xs, ys);
@@ -952,6 +1017,9 @@ function min(xs, comparer) {
   return reduce((x, y) => comparer.Compare(y, x) > 0 ? x : y, xs);
 }
 function average(xs, averager) {
+  if (FSharpList__get_IsEmpty(xs)) {
+    throw Operators_InvalidArg("source", SR_inputSequenceEmpty);
+  }
   let count = 0;
   const total = fold((acc, x) => {
     count = count + 1 | 0;
@@ -960,6 +1028,9 @@ function average(xs, averager) {
   return averager.DivideByInt(total, count);
 }
 function averageBy(f, xs, averager) {
+  if (FSharpList__get_IsEmpty(xs)) {
+    throw Operators_InvalidArg("source", SR_inputSequenceEmpty);
+  }
   let count = 0;
   const total = fold((acc, x) => {
     count = count + 1 | 0;
@@ -974,16 +1045,16 @@ function chunkBySize(chunkSize, xs) {
   return ofArray(map$1(ofArray, chunkBySize$1(chunkSize, toArray(xs))));
 }
 function allPairs(xs, ys) {
-  const root = FSharpList_get_Empty();
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   let node = root;
-  iterate((x) => {
+  iterate((x_1) => {
     iterate((y) => {
       let xs_1 = void 0, t = void 0;
-      node = (xs_1 = node, t = new FSharpList([x, y], void 0), xs_1.tail = t, t);
+      node = (xs_1 = node, t = FSharpList_$ctor_Z23DD7291([x_1, y], void 0), xs_1.tail = t, t);
     }, ys);
   }, xs);
   const xs_3 = node;
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   xs_3.tail = t_2;
   return FSharpList__get_Tail(root);
 }
@@ -994,7 +1065,7 @@ function skip(count_mut, xs_mut) {
       if (count <= 0) {
         return xs;
       } else if (FSharpList__get_IsEmpty(xs)) {
-        throw new Exception(SR_notEnoughElements + " (Parameter 'list')");
+        throw ArgumentOutOfRangeException_$ctor_Z384F8060("count", "The index is outside the legal range.");
       } else {
         count_mut = count - 1;
         xs_mut = FSharpList__get_Tail(xs);
@@ -1021,7 +1092,7 @@ function skipWhile(predicate_mut, xs_mut) {
 }
 function take(count, xs) {
   if (count < 0) {
-    throw new Exception(SR_inputMustBeNonNegative + " (Parameter 'count')");
+    throw Operators_InvalidArg("count", SR_inputMustBeNonNegative);
   }
   const loop = (i_mut, acc_mut, xs_1_mut) => {
     loop:
@@ -1031,19 +1102,19 @@ function take(count, xs) {
         if (i <= 0) {
           return acc;
         } else if (FSharpList__get_IsEmpty(xs_1)) {
-          throw new Exception(SR_notEnoughElements + " (Parameter 'list')");
+          throw Operators_InvalidOp(SR_notEnoughElements);
         } else {
           i_mut = i - 1;
-          acc_mut = (t = new FSharpList(FSharpList__get_Head(xs_1), void 0), acc.tail = t, t);
+          acc_mut = (t = FSharpList_$ctor_Z23DD7291(FSharpList__get_Head(xs_1), void 0), acc.tail = t, t);
           xs_1_mut = FSharpList__get_Tail(xs_1);
           continue loop;
         }
         break;
       }
   };
-  const root = FSharpList_get_Empty();
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   const node = loop(count, root, xs);
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   node.tail = t_2;
   return FSharpList__get_Tail(root);
 }
@@ -1058,16 +1129,16 @@ function takeWhile(predicate, xs) {
         } else if (!predicate(FSharpList__get_Head(xs_1))) {
           return acc;
         } else {
-          acc_mut = (t = new FSharpList(FSharpList__get_Head(xs_1), void 0), acc.tail = t, t);
+          acc_mut = (t = FSharpList_$ctor_Z23DD7291(FSharpList__get_Head(xs_1), void 0), acc.tail = t, t);
           xs_1_mut = FSharpList__get_Tail(xs_1);
           continue loop;
         }
         break;
       }
   };
-  const root = FSharpList_get_Empty();
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   const node = loop(root, xs);
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   node.tail = t_2;
   return FSharpList__get_Tail(root);
 }
@@ -1083,16 +1154,16 @@ function truncate(count, xs) {
           return acc;
         } else {
           i_mut = i - 1;
-          acc_mut = (t = new FSharpList(FSharpList__get_Head(xs_1), void 0), acc.tail = t, t);
+          acc_mut = (t = FSharpList_$ctor_Z23DD7291(FSharpList__get_Head(xs_1), void 0), acc.tail = t, t);
           xs_1_mut = FSharpList__get_Tail(xs_1);
           continue loop;
         }
         break;
       }
   };
-  const root = FSharpList_get_Empty();
+  const root = FSharpList_$ctor_Z23DD7291(defaultOf(), void 0);
   const node = loop(count, root, xs);
-  const t_2 = FSharpList_get_Empty();
+  const t_2 = empty();
   node.tail = t_2;
   return FSharpList__get_Tail(root);
 }
@@ -1105,27 +1176,27 @@ function getSlice(startIndex, endIndex, xs) {
   const index_1 = defaultArg(endIndex, len - 1) | 0;
   endIndex_1 = index_1 >= len ? len - 1 : index_1;
   if (endIndex_1 < startIndex_1) {
-    return FSharpList_get_Empty();
+    return empty();
   } else {
     return take(endIndex_1 - startIndex_1 + 1, skip(startIndex_1, xs));
   }
 }
 function splitAt(index, xs) {
   if (index < 0) {
-    throw new Exception(SR_inputMustBeNonNegative + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_inputMustBeNonNegative);
   }
   if (index > FSharpList__get_Length(xs)) {
-    throw new Exception(SR_notEnoughElements + " (Parameter 'index')");
+    throw Operators_InvalidOp(SR_notEnoughElements);
   }
   return [take(index, xs), skip(index, xs)];
 }
 function exactlyOne(xs) {
   if (FSharpList__get_IsEmpty(xs)) {
-    throw new Exception(SR_inputSequenceEmpty + " (Parameter 'list')");
+    throw Operators_InvalidArg("list", SR_inputSequenceEmpty);
   } else if (FSharpList__get_IsEmpty(FSharpList__get_Tail(xs))) {
     return FSharpList__get_Head(xs);
   } else {
-    throw new Exception(SR_inputSequenceTooLong + " (Parameter 'list')");
+    throw Operators_InvalidArg("list", SR_inputSequenceTooLong);
   }
 }
 function tryExactlyOne(xs) {
@@ -1157,13 +1228,13 @@ function insertAt(index, y, xs) {
     i = i + 1 | 0;
     if (i === index) {
       isDone = true;
-      return FSharpList_Cons_305B8EAC(x, FSharpList_Cons_305B8EAC(y, acc));
+      return FSharpList_$ctor_Z23DD7291(x, FSharpList_$ctor_Z23DD7291(y, acc));
     } else {
-      return FSharpList_Cons_305B8EAC(x, acc);
+      return FSharpList_$ctor_Z23DD7291(x, acc);
     }
-  }, FSharpList_get_Empty(), xs);
-  return reverse(isDone ? result : i + 1 === index ? FSharpList_Cons_305B8EAC(y, result) : (() => {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+  }, empty(), xs);
+  return reverse(isDone ? result : i + 1 === index ? FSharpList_$ctor_Z23DD7291(y, result) : (() => {
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
   })());
 }
 function insertManyAt(index, ys, xs) {
@@ -1174,13 +1245,13 @@ function insertManyAt(index, ys, xs) {
     i = i + 1 | 0;
     if (i === index) {
       isDone = true;
-      return FSharpList_Cons_305B8EAC(x, append(ys_1, acc));
+      return FSharpList_$ctor_Z23DD7291(x, append(ys_1, acc));
     } else {
-      return FSharpList_Cons_305B8EAC(x, acc);
+      return FSharpList_$ctor_Z23DD7291(x, acc);
     }
-  }, FSharpList_get_Empty(), xs);
+  }, empty(), xs);
   return reverse(isDone ? result : i + 1 === index ? append(ys_1, result) : (() => {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
   })());
 }
 function removeAt(index, xs) {
@@ -1196,32 +1267,26 @@ function removeAt(index, xs) {
     }
   }, xs);
   if (!isDone) {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
   }
   return ys;
 }
 function removeManyAt(index, count, xs) {
+  if (index < 0) {
+    throw Operators_InvalidArg("index", "index must be within bounds of the list");
+  }
+  const endIndex = index + count | 0;
   let i = -1;
-  let status = -1;
   const ys = filter((_arg) => {
     i = i + 1 | 0;
-    if (i === index) {
-      status = 0;
-      return false;
-    } else if (i > index) {
-      if (i < index + count) {
-        return false;
-      } else {
-        status = 1;
-        return true;
-      }
-    } else {
+    if (i < index) {
       return true;
+    } else {
+      return i >= endIndex;
     }
   }, xs);
-  const status_1 = (status === 0 && i + 1 === index + count ? 1 : status) | 0;
-  if (status_1 < 1) {
-    throw new Exception(SR_indexOutOfBounds + (" (Parameter '" + (status_1 < 0 ? "index" : "count") + "')"));
+  if (endIndex > i + 1) {
+    throw Operators_InvalidArg("index", "index must be within bounds of the list");
   }
   return ys;
 }
@@ -1236,7 +1301,7 @@ function updateAt(index, y, xs) {
     }
   }, xs);
   if (!isDone) {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
   }
   return ys;
 }
@@ -1279,4 +1344,4 @@ function randomSample(count, xs) {
   return randomSampleWith(nonSeeded(), count, xs);
 }
 
-export { FSharpList, FSharpList_$reflection, FSharpList_Cons_305B8EAC, FSharpList__get_Head, FSharpList__get_IsEmpty, FSharpList__get_Item_Z524259A4, FSharpList__get_Length, FSharpList__get_Tail, FSharpList_get_Empty, ListEnumerator$1, ListEnumerator$1_$ctor_3002E699, ListEnumerator$1_$reflection, allPairs, append, average, averageBy, choose, chunkBySize, collect, compareWith, concat, cons, contains, empty, exactlyOne, exists, exists2, filter, find, findBack, findIndex, findIndexBack, fold, fold2, foldBack, foldBack2, foldIndexed, forAll, forAll2, getSlice, head, indexNotFound, indexed, initialize, insertAt, insertManyAt, isEmpty, item, iterate, iterate2, iterateIndexed, iterateIndexed2, last, length, map, map2, map3, mapFold, mapFoldBack, mapIndexed, mapIndexed2, max, maxBy, min, minBy, ofArray, ofArrayWithTail, ofSeq, pairwise, partition, permute, pick, randomChoice, randomChoiceBy, randomChoiceWith, randomChoices, randomChoicesBy, randomChoicesWith, randomSample, randomSampleBy, randomSampleWith, randomShuffle, randomShuffleBy, randomShuffleWith, reduce, reduceBack, removeAt, removeManyAt, replicate, reverse, scan, scanBack, singleton, skip, skipWhile, sort, sortBy, sortByDescending, sortDescending, sortWith, splitAt, splitInto, sum, sumBy, tail, take, takeWhile, toArray, toSeq, transpose, truncate, tryExactlyOne, tryFind, tryFindBack, tryFindIndex, tryFindIndexBack, tryHead, tryItem, tryLast, tryPick, unfold, unzip, unzip3, updateAt, where, windowed, zip, zip3 };
+export { FSharpList, FSharpList_$ctor_Z23DD7291, FSharpList_$reflection, FSharpList__get_Head, FSharpList__get_IsEmpty, FSharpList__get_Item_Z524259A4, FSharpList__get_Length, FSharpList__get_Tail, ListEnumerator$1, ListEnumerator$1_$ctor_3002E699, ListEnumerator$1_$reflection, allPairs, append, average, averageBy, choose, chunkBySize, collect, compareWith, concat, cons, contains, empty, exactlyOne, exists, exists2, filter, find, findBack, findIndex, findIndexBack, fold, fold2, foldBack, foldBack2, foldIndexed, forAll, forAll2, getSlice, head, indexNotFound, indexed, initialize, insertAt, insertManyAt, isEmpty, item, iterate, iterate2, iterateIndexed, iterateIndexed2, last, length, map, map2, map3, mapFold, mapFoldBack, mapIndexed, mapIndexed2, max, maxBy, min, minBy, ofArray, ofArrayWithTail, ofSeq, pairwise, partition, permute, pick, randomChoice, randomChoiceBy, randomChoiceWith, randomChoices, randomChoicesBy, randomChoicesWith, randomSample, randomSampleBy, randomSampleWith, randomShuffle, randomShuffleBy, randomShuffleWith, reduce, reduceBack, removeAt, removeManyAt, replicate, reverse, scan, scanBack, singleton, skip, skipWhile, sort, sortBy, sortByDescending, sortDescending, sortWith, splitAt, splitInto, sum, sumBy, tail, take, takeWhile, toArray, toSeq, transpose, truncate, tryExactlyOne, tryFind, tryFindBack, tryFindIndex, tryFindIndexBack, tryHead, tryItem, tryLast, tryPick, unfold, unzip, unzip3, updateAt, where, windowed, zip, zip3 };