@nfdi4plants/arctrl 3.2.3 → 3.3.0

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

@@ -1,16 +1,18 @@
-import { Exception, defaultOf, copyToArray, getEnumerator, disposeSafe } from './Util.js';
+import { KeyNotFoundException_$ctor_Z721C83C5 } from './System.Collections.Generic.js';
+import { SR_keyNotFoundAlt, SR_inputMustBeNonNegative, SR_notEnoughElements, SR_indexOutOfBounds, SR_inputSequenceEmpty } from './Global.js';
+import { Operators_InvalidArg, Operators_InvalidOp } from './FSharp.Core.js';
 import { Helpers_allocateArrayFromCons } from './Native.js';
+import { defaultOf, int32ToString, getEnumerator, disposeSafe } from './Util.js';
+import { IndexOutOfRangeException_$ctor, ArgumentOutOfRangeException_$ctor_Z384F8060, ArgumentException_$ctor_Z721C83C5 } from './System.js';
 import { some, defaultArg, value } from './Option.js';
 import { max as max$1, min as min$1 } from './Double.js';
-import { SR_indexOutOfBounds, SR_Arg_ArgumentOutOfRangeException, SR_inputSequenceEmpty, SR_inputMustBeNonNegative, SR_notEnoughElements } from './Global.js';
-import { Operators_IsNull } from './FSharp.Core.js';
 import { nonSeeded } from './Random.js';
 
 function indexNotFound() {
-  throw new Exception("An index satisfying the predicate was not found in the collection.");
+  throw KeyNotFoundException_$ctor_Z721C83C5(SR_keyNotFoundAlt);
 }
-function differentLengths() {
-  throw new Exception("Arrays had different lengths");
+function differentLengths(paramName) {
+  throw Operators_InvalidArg(paramName, "The arrays have different lengths.");
 }
 function append(array1, array2, cons) {
   const len1 = array1.length | 0;
@@ -28,16 +30,34 @@ function filter(predicate, array) {
   return array.filter(predicate);
 }
 function fill(target, targetIndex, count, value) {
+  if (targetIndex < 0) {
+    throw Operators_InvalidArg("targetIndex", SR_inputMustBeNonNegative);
+  }
+  if (count < 0) {
+    throw Operators_InvalidArg("count", SR_inputMustBeNonNegative);
+  }
+  if (count > 0 && targetIndex + count > target.length) {
+    throw IndexOutOfRangeException_$ctor();
+  }
   const start = targetIndex | 0;
   return target.fill(value, start, start + count);
 }
 function getSubArray(array, start, count) {
+  if (start < 0) {
+    throw Operators_InvalidArg("startIndex", SR_inputMustBeNonNegative);
+  }
+  if (count < 0) {
+    throw Operators_InvalidArg("count", SR_inputMustBeNonNegative);
+  }
+  if (start + count > array.length) {
+    throw ArgumentOutOfRangeException_$ctor_Z384F8060("count", "The index is outside the legal range.");
+  }
   const start_1 = start | 0;
   return array.slice(start_1, start_1 + count);
 }
 function last(array) {
   if (array.length === 0) {
-    throw new Exception("The input array was empty (Parameter 'array')");
+    throw Operators_InvalidArg("array", "The input array was empty");
   }
   return item(array.length - 1, array);
 }
@@ -66,7 +86,7 @@ function map(f, source, cons) {
 }
 function mapIndexed2(f, source1, source2, cons) {
   if (source1.length !== source2.length) {
-    throw new Exception("Arrays had different lengths");
+    differentLengths("array1");
   }
   const result = Helpers_allocateArrayFromCons(cons, source1.length);
   for (let i = 0; i <= source1.length - 1; i++) {
@@ -76,7 +96,7 @@ function mapIndexed2(f, source1, source2, cons) {
 }
 function map2(f, source1, source2, cons) {
   if (source1.length !== source2.length) {
-    throw new Exception("Arrays had different lengths");
+    differentLengths("array1");
   }
   const result = Helpers_allocateArrayFromCons(cons, source1.length);
   for (let i = 0; i <= source1.length - 1; i++) {
@@ -86,7 +106,7 @@ function map2(f, source1, source2, cons) {
 }
 function mapIndexed3(f, source1, source2, source3, cons) {
   if (source1.length !== source2.length ? true : source2.length !== source3.length) {
-    throw new Exception("Arrays had different lengths");
+    differentLengths("array1, array2, array3");
   }
   const result = Helpers_allocateArrayFromCons(cons, source1.length);
   for (let i = 0; i <= source1.length - 1; i++) {
@@ -96,7 +116,7 @@ function mapIndexed3(f, source1, source2, source3, cons) {
 }
 function map3(f, source1, source2, source3, cons) {
   if (source1.length !== source2.length ? true : source2.length !== source3.length) {
-    throw new Exception("Arrays had different lengths");
+    differentLengths("array1, array2, array3");
   }
   const result = Helpers_allocateArrayFromCons(cons, source1.length);
   for (let i = 0; i <= source1.length - 1; i++) {
@@ -182,7 +202,7 @@ function where(predicate, array) {
 function indexOf(array, item_1, start, count, eq) {
   let option_1 = void 0;
   const start_1 = defaultArg(start, 0) | 0;
-  const end$0027 = defaultArg((option_1 = count, option_1 != null ? start_1 + value(option_1) : void 0), array.length) | 0;
+  const end$0027 = defaultArg((option_1 = count, option_1 != null ? start_1 + option_1 : void 0), array.length) | 0;
   const loop = (i_mut) => {
     loop:
       while (true) {
@@ -203,6 +223,55 @@ function indexOf(array, item_1, start, count, eq) {
 function contains(value, array, eq) {
   return indexOf(array, value, void 0, void 0, eq) >= 0;
 }
+function binarySearchFrom(array, index, length, value, comparer) {
+  const loop = (lo_mut, hi_mut) => {
+    loop:
+      while (true) {
+        const lo = lo_mut, hi = hi_mut;
+        if (lo > hi) {
+          return ~lo | 0;
+        } else {
+          const i = lo + (hi - lo >> 1) | 0;
+          const c = comparer.Compare(item(i, array), value) | 0;
+          if (c === 0) {
+            return i | 0;
+          } else if (c < 0) {
+            lo_mut = i + 1;
+            hi_mut = hi;
+            continue loop;
+          } else {
+            lo_mut = lo;
+            hi_mut = i - 1;
+            continue loop;
+          }
+        }
+        break;
+      }
+  };
+  return loop(index, index + length - 1) | 0;
+}
+function checkBinarySearchRange(lengthName, array, index, length) {
+  if (index < 0) {
+    throw ArgumentOutOfRangeException_$ctor_Z384F8060("index", "Non-negative number required.");
+  }
+  if (length < 0) {
+    throw ArgumentOutOfRangeException_$ctor_Z384F8060(lengthName, "Non-negative number required.");
+  }
+  if (array.length - index < length) {
+    throw ArgumentException_$ctor_Z721C83C5("Offset and length were out of bounds for the array or count is greater than the number of elements from index to the end of the source collection.");
+  }
+}
+function binarySearch(array, value, comparer) {
+  return binarySearchFrom(array, 0, array.length, value, comparer) | 0;
+}
+function binarySearchRange(array, index, length, value, comparer) {
+  checkBinarySearchRange("length", array, index, length);
+  return binarySearchFrom(array, index, length, value, comparer) | 0;
+}
+function binarySearchRangeCount(array, index, count, value, comparer) {
+  checkBinarySearchRange("count", array, index, count);
+  return binarySearchFrom(array, index, count, value, comparer) | 0;
+}
 function empty(cons) {
   return Helpers_allocateArrayFromCons(cons, 0);
 }
@@ -213,7 +282,7 @@ function singleton(value, cons) {
 }
 function initialize(count, initializer, cons) {
   if (count < 0) {
-    throw new Exception("The input must be non-negative (Parameter 'count')");
+    throw Operators_InvalidArg("count", "The input must be non-negative");
   }
   const result = Helpers_allocateArrayFromCons(cons, count);
   for (let i = 0; i <= count - 1; i++) {
@@ -235,7 +304,7 @@ function pairwise(array) {
 }
 function replicate(count, initial, cons) {
   if (count < 0) {
-    throw new Exception("The input must be non-negative (Parameter 'count')");
+    throw Operators_InvalidArg("count", "The input must be non-negative");
   }
   const result = Helpers_allocateArrayFromCons(cons, count);
   for (let i = 0; i <= result.length - 1; i++) {
@@ -246,8 +315,47 @@ function replicate(count, initial, cons) {
 function copy(array) {
   return array.slice();
 }
+function copyTypedArray(source, sourceIndex, target, targetIndex, count) {
+  target.set(source.subarray(sourceIndex, sourceIndex + count), targetIndex);
+}
+function argumentOutOfRange(paramName, value, requirement) {
+  throw ArgumentOutOfRangeException_$ctor_Z384F8060(paramName, paramName + " ('" + int32ToString(value) + "') must be " + requirement);
+}
 function copyTo(source, sourceIndex, target, targetIndex, count) {
-  copyToArray(source, sourceIndex, target, targetIndex, count);
+  if (count < 0) {
+    argumentOutOfRange("length", count, "a non-negative value.");
+  }
+  if (sourceIndex < 0) {
+    argumentOutOfRange("sourceIndex", sourceIndex, "greater than or equal to '0'.");
+  }
+  if (sourceIndex + count > source.length) {
+    throw Operators_InvalidArg("sourceArray", "Source array was not long enough. Check the source index, length, and the array's lower bounds.");
+  }
+  if (targetIndex < 0) {
+    argumentOutOfRange("destinationIndex", targetIndex, "greater than or equal to '0'.");
+  }
+  if (targetIndex + count > target.length) {
+    throw Operators_InvalidArg("destinationArray", "Destination array was not long enough. Check the destination index, length, and the array's lower bounds.");
+  }
+  if (ArrayBuffer.isView(source) && ArrayBuffer.isView(target)) {
+    copyTypedArray(source, sourceIndex, target, targetIndex, count);
+  } else if (sourceIndex < targetIndex) {
+    for (let i = count - 1; i >= 0; i--) {
+      const index_1 = targetIndex + i | 0;
+      let item_1;
+      const index = sourceIndex + i | 0;
+      item_1 = source[index];
+      target[index_1] = item_1;
+    }
+  } else {
+    for (let i_1 = 0; i_1 <= count - 1; i_1++) {
+      const index_3 = targetIndex + i_1 | 0;
+      let item_2;
+      const index_2 = sourceIndex + i_1 | 0;
+      item_2 = source[index_2];
+      target[index_3] = item_2;
+    }
+  }
 }
 function reverse(array) {
   const array_2 = array.slice();
@@ -271,7 +379,7 @@ function scanBack(folder, array, state, cons) {
 }
 function skip(count, array, cons) {
   if (count > array.length) {
-    throw new Exception("count is greater than array length (Parameter 'count')");
+    throw ArgumentOutOfRangeException_$ctor_Z384F8060("count", "The index is outside the legal range.");
   }
   if (count === array.length) {
     return Helpers_allocateArrayFromCons(cons, 0);
@@ -294,10 +402,10 @@ function skipWhile(predicate, array, cons) {
 }
 function take(count, array, cons) {
   if (count < 0) {
-    throw new Exception("The input must be non-negative (Parameter 'count')");
+    throw Operators_InvalidArg("count", "The input must be non-negative");
   }
   if (count > array.length) {
-    throw new Exception("count is greater than array length (Parameter 'count')");
+    throw Operators_InvalidOp(SR_notEnoughElements);
   }
   if (count === 0) {
     return Helpers_allocateArrayFromCons(cons, 0);
@@ -586,7 +694,7 @@ function iterateIndexed(action, array) {
 }
 function iterate2(action, array1, array2) {
   if (array1.length !== array2.length) {
-    differentLengths();
+    differentLengths("array1");
   }
   for (let i = 0; i <= array1.length - 1; i++) {
     action(item(i, array1), item(i, array2));
@@ -594,7 +702,7 @@ function iterate2(action, array1, array2) {
 }
 function iterateIndexed2(action, array1, array2) {
   if (array1.length !== array2.length) {
-    differentLengths();
+    differentLengths("array1");
   }
   for (let i = 0; i <= array1.length - 1; i++) {
     action(i, item(i, array1), item(i, array2));
@@ -609,17 +717,19 @@ function forAll(predicate, array) {
 function permute(f, array) {
   const size = array.length | 0;
   const res = array.slice();
-  const checkFlags = new Array(size);
+  let checkFlags;
+  const array_2 = new Array(size);
+  checkFlags = array_2.fill(0, 0, 0 + size);
   iterateIndexed((i, x) => {
     const j = f(i) | 0;
     if (j < 0 ? true : j >= size) {
-      throw new Exception("Not a valid permutation");
+      throw Operators_InvalidArg("indexMap", "The function did not compute a permutation.");
     }
     setItem(res, j, x);
     setItem(checkFlags, j, 1);
   }, array);
   if (!checkFlags.every((y) => 1 === y)) {
-    throw new Exception("Not a valid permutation");
+    throw Operators_InvalidArg("indexMap", "The function did not compute a permutation.");
   }
   return res;
 }
@@ -682,8 +792,8 @@ function unfold(generator, state) {
         const state_1 = state_1_mut;
         const matchValue = generator(state_1);
         if (matchValue != null) {
-          const x = value(matchValue)[0];
-          const s = value(matchValue)[1];
+          const x = matchValue[0];
+          const s = matchValue[1];
           res.push(x);
           state_1_mut = s;
           continue loop;
@@ -718,7 +828,7 @@ function unzip3(array) {
 }
 function zip(array1, array2) {
   if (array1.length !== array2.length) {
-    differentLengths();
+    differentLengths("array1");
   }
   const result = new Array(array1.length);
   for (let i = 0; i <= array1.length - 1; i++) {
@@ -728,7 +838,7 @@ function zip(array1, array2) {
 }
 function zip3(array1, array2, array3) {
   if (array1.length !== array2.length ? true : array2.length !== array3.length) {
-    differentLengths();
+    differentLengths("array1, array2, array3");
   }
   const result = new Array(array1.length);
   for (let i = 0; i <= array1.length - 1; i++) {
@@ -738,7 +848,7 @@ function zip3(array1, array2, array3) {
 }
 function chunkBySize(chunkSize, array) {
   if (chunkSize < 1) {
-    throw new Exception("The input must be positive. (Parameter 'size')");
+    throw Operators_InvalidArg("chunkSize", "The input must be positive.");
   }
   const result = [];
   if (array.length > 0) {
@@ -753,19 +863,22 @@ function chunkBySize(chunkSize, array) {
   return result;
 }
 function splitAt(index, array) {
-  if (index < 0 ? true : index > array.length) {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+  if (index < 0) {
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
+  }
+  if (index > array.length) {
+    throw Operators_InvalidOp(SR_notEnoughElements);
   }
   return [array.slice(0, 0 + index), array.slice(index)];
 }
 function compareWith(comparer, source1, source2) {
-  if (Operators_IsNull(source1)) {
-    if (Operators_IsNull(source2)) {
+  if (source1 == null) {
+    if (source2 == null) {
       return 0;
     } else {
       return -1;
     }
-  } else if (Operators_IsNull(source2)) {
+  } else if (source2 == null) {
     return 1;
   } else {
     const len1 = source1.length | 0;
@@ -789,13 +902,13 @@ function compareWith(comparer, source1, source2) {
   }
 }
 function compareTo(comparer, source1, source2) {
-  if (Operators_IsNull(source1)) {
-    if (Operators_IsNull(source2)) {
+  if (source1 == null) {
+    if (source2 == null) {
       return 0;
     } else {
       return -1;
     }
-  } else if (Operators_IsNull(source2)) {
+  } else if (source2 == null) {
     return 1;
   } else {
     const len1 = source1.length | 0;
@@ -816,13 +929,13 @@ function compareTo(comparer, source1, source2) {
   }
 }
 function equalsWith(equals, source1, source2) {
-  if (Operators_IsNull(source1)) {
-    if (Operators_IsNull(source2)) {
+  if (source1 == null) {
+    if (source2 == null) {
       return true;
     } else {
       return false;
     }
-  } else if (Operators_IsNull(source2)) {
+  } else if (source2 == null) {
     return false;
   } else {
     let i = 0;
@@ -847,9 +960,9 @@ function exactlyOne(array) {
     case 1:
       return item(0, array);
     case 0:
-      throw new Exception("The input sequence was empty (Parameter 'array')");
+      throw Operators_InvalidArg("array", "The input sequence was empty");
     default:
-      throw new Exception("Input array too long (Parameter 'array')");
+      throw Operators_InvalidArg("array", "Input array too long");
   }
 }
 function tryExactlyOne(array) {
@@ -861,7 +974,7 @@ function tryExactlyOne(array) {
 }
 function head(array) {
   if (array.length === 0) {
-    throw new Exception("The input array was empty (Parameter 'array')");
+    throw Operators_InvalidArg("array", "The input array was empty");
   } else {
     return item(0, array);
   }
@@ -875,20 +988,21 @@ function tryHead(array) {
 }
 function tail(array) {
   if (array.length === 0) {
-    throw new Exception("Not enough elements (Parameter 'array')");
+    throw Operators_InvalidArg("array", "Not enough elements");
   }
   return array.slice(1);
 }
 function item(index, array) {
-  if (index < 0 ? true : index >= array.length) {
-    throw new Exception("Index was outside the bounds of the array. (Parameter 'index')");
+  const value = array[index];
+  if (value === void 0 && (index < 0 ? true : index >= array.length)) {
+    throw Operators_InvalidArg("index", "Index was outside the bounds of the array.");
   } else {
-    return array[index];
+    return value;
   }
 }
 function setItem(array, index, value) {
   if (index < 0 ? true : index >= array.length) {
-    throw new Exception("Index was outside the bounds of the array. (Parameter 'index')");
+    throw Operators_InvalidArg("index", "Index was outside the bounds of the array.");
   } else {
     array[index] = value;
   }
@@ -909,7 +1023,7 @@ function foldBack(folder, array, state) {
 function foldIndexed2(folder, state, array1, array2) {
   let acc = state;
   if (array1.length !== array2.length) {
-    throw new Exception("Arrays have different lengths");
+    differentLengths("array1");
   }
   for (let i = 0; i <= array1.length - 1; i++) {
     acc = folder(i, acc, item(i, array1), item(i, array2));
@@ -922,7 +1036,7 @@ function fold2(folder, state, array1, array2) {
 function foldBackIndexed2(folder, array1, array2, state) {
   let acc = state;
   if (array1.length !== array2.length) {
-    differentLengths();
+    differentLengths("array1");
   }
   const size = array1.length | 0;
   for (let i = 1; i <= size; i++) {
@@ -935,14 +1049,14 @@ function foldBack2(f, array1, array2, state) {
 }
 function reduce(reduction, array) {
   if (array.length === 0) {
-    throw new Exception("The input array was empty");
+    throw Operators_InvalidArg("array", "The input array was empty");
   }
   const reduction_1 = reduction;
   return array.reduce(reduction_1);
 }
 function reduceBack(reduction, array) {
   if (array.length === 0) {
-    throw new Exception("The input array was empty");
+    throw Operators_InvalidArg("array", "The input array was empty");
   }
   const reduction_1 = reduction;
   return array.reduceRight(reduction_1);
@@ -990,7 +1104,7 @@ function existsOffset2(predicate_mut, array1_mut, array2_mut, index_mut) {
 }
 function exists2(predicate, array1, array2) {
   if (array1.length !== array2.length) {
-    differentLengths();
+    differentLengths("array1");
   }
   return existsOffset2(predicate, array1, array2, 0);
 }
@@ -1022,7 +1136,7 @@ function min(xs, comparer) {
 }
 function average(array, averager) {
   if (array.length === 0) {
-    throw new Exception("The input array was empty (Parameter 'array')");
+    throw Operators_InvalidArg("array", "The input array was empty");
   }
   let total = averager.GetZero();
   for (let i = 0; i <= array.length - 1; i++) {
@@ -1032,7 +1146,7 @@ function average(array, averager) {
 }
 function averageBy(projection, array, averager) {
   if (array.length === 0) {
-    throw new Exception("The input array was empty (Parameter 'array')");
+    throw Operators_InvalidArg("array", "The input array was empty");
   }
   let total = averager.GetZero();
   for (let i = 0; i <= array.length - 1; i++) {
@@ -1042,7 +1156,7 @@ function averageBy(projection, array, averager) {
 }
 function windowed(windowSize, source) {
   if (windowSize <= 0) {
-    throw new Exception("windowSize must be positive");
+    throw Operators_InvalidArg("windowSize", "The input must be positive.");
   }
   let res;
   const len = max$1(0, source.length - windowSize + 1) | 0;
@@ -1054,7 +1168,7 @@ function windowed(windowSize, source) {
 }
 function splitInto(chunks, array) {
   if (chunks < 1) {
-    throw new Exception("The input must be positive. (Parameter 'chunks')");
+    throw Operators_InvalidArg("count", "The input must be positive.");
   }
   const result = [];
   if (array.length > 0) {
@@ -1080,7 +1194,7 @@ function transpose(arrays, cons) {
     const firstArray = item(0, arrays_1);
     const lenInner = firstArray.length | 0;
     if (!forAll((a) => a.length === lenInner, arrays_1)) {
-      differentLengths();
+      differentLengths("array.[0]");
     }
     const result = new Array(lenInner);
     for (let i = 0; i <= lenInner - 1; i++) {
@@ -1095,7 +1209,7 @@ function transpose(arrays, cons) {
 function insertAt(index, y, xs, cons) {
   const len = xs.length | 0;
   if (index < 0 ? true : index > len) {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
   }
   const target = Helpers_allocateArrayFromCons(cons, len + 1);
   for (let i = 0; i <= index - 1; i++) {
@@ -1110,7 +1224,7 @@ function insertAt(index, y, xs, cons) {
 function insertManyAt(index, ys, xs, cons) {
   const len = xs.length | 0;
   if (index < 0 ? true : index > len) {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
   }
   const ys_1 = Array.from(ys);
   const len2 = ys_1.length | 0;
@@ -1131,7 +1245,7 @@ function randomShuffleInPlaceBy(randomizer, xs) {
   for (let i = len - 1; i >= 1; i--) {
     const r = randomizer();
     if (r < 0 ? true : r >= 1) {
-      throw new Exception(SR_Arg_ArgumentOutOfRangeException + " (Parameter 'randomizer')");
+      throw ArgumentOutOfRangeException_$ctor_Z384F8060("randomizer", "The index is outside the legal range.");
     }
     const j = ~~(r * (i + 1)) | 0;
     const tmp = item(i, xs);
@@ -1158,12 +1272,12 @@ function randomShuffle(xs) {
 }
 function randomChoiceBy(randomizer, xs) {
   if (isEmpty(xs)) {
-    throw new Exception(SR_inputSequenceEmpty + " (Parameter 'source')");
+    throw Operators_InvalidArg("source", SR_inputSequenceEmpty);
   }
   const len = xs.length | 0;
   const r = randomizer();
   if (r < 0 ? true : r >= 1) {
-    throw new Exception(SR_Arg_ArgumentOutOfRangeException + " (Parameter 'randomizer')");
+    throw ArgumentOutOfRangeException_$ctor_Z384F8060("randomizer", "The index is outside the legal range.");
   }
   return item(~~(r * len), xs);
 }
@@ -1175,16 +1289,16 @@ function randomChoice(xs) {
 }
 function randomChoicesBy(randomizer, count, xs, cons) {
   if (count < 0) {
-    throw new Exception(SR_inputMustBeNonNegative + " (Parameter 'count')");
+    throw Operators_InvalidArg("count", SR_inputMustBeNonNegative);
   }
   if (count > 0 && isEmpty(xs)) {
-    throw new Exception(SR_inputSequenceEmpty + " (Parameter 'source')");
+    throw Operators_InvalidArg("source", SR_inputSequenceEmpty);
   }
   const len = xs.length | 0;
   return initialize(count, (_arg) => {
     const r = randomizer();
     if (r < 0 ? true : r >= 1) {
-      throw new Exception(SR_Arg_ArgumentOutOfRangeException + " (Parameter 'randomizer')");
+      throw ArgumentOutOfRangeException_$ctor_Z384F8060("randomizer", "The index is outside the legal range.");
     }
     return item(~~(r * len), xs);
   }, cons);
@@ -1197,20 +1311,20 @@ function randomChoices(count, xs, cons) {
 }
 function randomSampleBy(randomizer, count, xs) {
   if (count < 0) {
-    throw new Exception(SR_inputMustBeNonNegative + " (Parameter 'count')");
+    throw Operators_InvalidArg("count", SR_inputMustBeNonNegative);
   }
   const arr = copy(xs);
   const len = arr.length | 0;
   if (len === 0 && count > 0) {
-    throw new Exception(SR_inputSequenceEmpty + " (Parameter 'source')");
+    throw Operators_InvalidArg("source", SR_inputSequenceEmpty);
   }
   if (count > len) {
-    throw new Exception(SR_notEnoughElements + " (Parameter 'count')");
+    throw Operators_InvalidArg("count", SR_notEnoughElements);
   }
   for (let i = 0; i <= count - 1; i++) {
     const r = randomizer();
     if (r < 0 ? true : r >= 1) {
-      throw new Exception(SR_Arg_ArgumentOutOfRangeException + " (Parameter 'randomizer')");
+      throw ArgumentOutOfRangeException_$ctor_Z384F8060("randomizer", "The index is outside the legal range.");
     }
     const j = i + ~~(r * (len - i)) | 0;
     const tmp = item(i, arr);
@@ -1227,7 +1341,7 @@ function randomSample(count, xs) {
 }
 function removeAt(index, xs) {
   if (index < 0 ? true : index >= xs.length) {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
   }
   let i = -1;
   return filter((_arg) => {
@@ -1236,34 +1350,23 @@ function removeAt(index, xs) {
   }, xs);
 }
 function removeManyAt(index, count, xs) {
+  if ((index < 0 ? true : index > xs.length - count) ? true : index > xs.length) {
+    throw Operators_InvalidArg("index", "index must be within bounds of the array");
+  }
   let i = -1;
-  let status = -1;
-  const ys = filter((_arg) => {
+  return 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 >= index + count;
     }
   }, 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") + "')"));
-  }
-  return ys;
 }
 function updateAt(index, y, xs, cons) {
   const len = xs.length | 0;
   if (index < 0 ? true : index >= len) {
-    throw new Exception(SR_indexOutOfBounds + " (Parameter 'index')");
+    throw Operators_InvalidArg("index", SR_indexOutOfBounds);
   }
   const target = Helpers_allocateArrayFromCons(cons, len);
   for (let i = 0; i <= len - 1; i++) {
@@ -1274,10 +1377,10 @@ function updateAt(index, y, xs, cons) {
 function resize(xs, newSize, zero, cons) {
   let array = void 0, array_1 = void 0, start_2 = void 0, count_2 = void 0;
   if (newSize < 0) {
-    throw new Exception("The input must be non-negative. (Parameter 'newSize')");
+    throw Operators_InvalidArg("newSize", "The input must be non-negative.");
   }
   const zero_1 = defaultArg(zero, defaultOf());
-  if (Operators_IsNull(xs.contents)) {
+  if (xs.contents == null) {
     xs.contents = (array = Helpers_allocateArrayFromCons(cons, newSize), array.fill(zero_1, 0, 0 + newSize));
   } else {
     const len = xs.contents.length | 0;
@@ -1293,4 +1396,4 @@ function resize(xs, newSize, zero, cons) {
   }
 }
 
-export { addInPlace, addRangeInPlace, allPairs, append, average, averageBy, choose, chunkBySize, collect, compareTo, compareWith, concat, contains, copy, copyTo, empty, equalsWith, exactlyOne, exists, exists2, existsOffset, existsOffset2, fill, filter, find, findAll, findBack, findIndex, findIndexBack, findLastIndex, fold, fold2, foldBack, foldBack2, foldBackIndexed, foldBackIndexed2, foldIndexed, foldIndexed2, forAll, forAll2, getRange, getSubArray, head, indexOf, indexed, initialize, insertAt, insertManyAt, insertRangeInPlace, isEmpty, item, iterate, iterate2, iterateIndexed, iterateIndexed2, last, map, map2, map3, mapFold, mapFoldBack, mapIndexed, mapIndexed2, mapIndexed3, max, maxBy, min, minBy, pairwise, partition, permute, pick, randomChoice, randomChoiceBy, randomChoiceWith, randomChoices, randomChoicesBy, randomChoicesWith, randomSample, randomSampleBy, randomSampleWith, randomShuffle, randomShuffleBy, randomShuffleInPlace, randomShuffleInPlaceBy, randomShuffleInPlaceWith, randomShuffleWith, reduce, reduceBack, removeAllInPlace, removeAt, removeInPlace, removeManyAt, replicate, resize, reverse, scan, scanBack, setItem, setSlice, singleton, skip, skipWhile, sort, sortBy, sortByDescending, sortDescending, sortInPlace, sortInPlaceBy, sortWith, splitAt, splitInto, sum, sumBy, tail, take, takeWhile, transpose, truncate, tryExactlyOne, tryFind, tryFindBack, tryFindIndex, tryFindIndexBack, tryHead, tryItem, tryLast, tryPick, unfold, unzip, unzip3, updateAt, where, windowed, zip, zip3 };
+export { addInPlace, addRangeInPlace, allPairs, append, average, averageBy, binarySearch, binarySearchRange, binarySearchRangeCount, choose, chunkBySize, collect, compareTo, compareWith, concat, contains, copy, copyTo, empty, equalsWith, exactlyOne, exists, exists2, existsOffset, existsOffset2, fill, filter, find, findAll, findBack, findIndex, findIndexBack, findLastIndex, fold, fold2, foldBack, foldBack2, foldBackIndexed, foldBackIndexed2, foldIndexed, foldIndexed2, forAll, forAll2, getRange, getSubArray, head, indexOf, indexed, initialize, insertAt, insertManyAt, insertRangeInPlace, isEmpty, item, iterate, iterate2, iterateIndexed, iterateIndexed2, last, map, map2, map3, mapFold, mapFoldBack, mapIndexed, mapIndexed2, mapIndexed3, max, maxBy, min, minBy, pairwise, partition, permute, pick, randomChoice, randomChoiceBy, randomChoiceWith, randomChoices, randomChoicesBy, randomChoicesWith, randomSample, randomSampleBy, randomSampleWith, randomShuffle, randomShuffleBy, randomShuffleInPlace, randomShuffleInPlaceBy, randomShuffleInPlaceWith, randomShuffleWith, reduce, reduceBack, removeAllInPlace, removeAt, removeInPlace, removeManyAt, replicate, resize, reverse, scan, scanBack, setItem, setSlice, singleton, skip, skipWhile, sort, sortBy, sortByDescending, sortDescending, sortInPlace, sortInPlaceBy, sortWith, splitAt, splitInto, sum, sumBy, tail, take, takeWhile, transpose, truncate, tryExactlyOne, tryFind, tryFindBack, tryFindIndex, tryFindIndexBack, tryHead, tryItem, tryLast, tryPick, unfold, unzip, unzip3, updateAt, where, windowed, zip, zip3 };