@fable-org/fable-library-js 2.0.0-beta.4 → 2.0.0-beta.6

package/Seq.js

@@ -1,7 +1,9 @@
-import { clear, isDisposable, isArrayLike, toIterator, disposeSafe, getEnumerator } from "./Util.js";
+import { InvalidOperationException_$ctor_Z721C83C5, NotSupportedException_$ctor_Z721C83C5 } from "./System.js";
+import { clear, Exception, isDisposable, isArrayLike, toIterator, disposeSafe, getEnumerator } from "./Util.js";
 import { toString } from "./Types.js";
 import { class_type } from "./Reflection.js";
 import { some, value as value_1 } from "./Option.js";
+import { KeyNotFoundException_$ctor_Z721C83C5 } from "./System.Collections.Generic.js";
 import { Operators_Lock, Operators_NullArgCheck } from "./FSharp.Core.js";
 import { chunkBySize as chunkBySize_1, permute as permute_1, transpose as transpose_1, map as map_1, windowed as windowed_1, splitInto as splitInto_1, pairwise as pairwise_1, scanBack as scanBack_1, reverse as reverse_1, mapFoldBack as mapFoldBack_1, mapFold as mapFold_1, tryItem as tryItem_1, tryHead as tryHead_1, foldBack2 as foldBack2_1, foldBack as foldBack_1, tryFindIndexBack as tryFindIndexBack_1, tryFindBack as tryFindBack_1, singleton as singleton_1 } from "./Array.js";
 import { length as length_1, tryItem as tryItem_2, isEmpty as isEmpty_1, tryHead as tryHead_2, ofSeq as ofSeq_1, ofArray as ofArray_1, toArray as toArray_1, FSharpList } from "./List.js";
@@ -14,13 +16,13 @@ export const SR_keyNotFoundAlt = "An index satisfying the predicate was not foun
 export const SR_notEnoughElements = "The input sequence has an insufficient number of elements.";
 export const SR_resetNotSupported = "Reset is not supported on this enumerator.";
 export function Enumerator_noReset() {
-    throw new Error(SR_resetNotSupported);
+    throw NotSupportedException_$ctor_Z721C83C5(SR_resetNotSupported);
 }
 export function Enumerator_notStarted() {
-    throw new Error(SR_enumerationNotStarted);
+    throw InvalidOperationException_$ctor_Z721C83C5(SR_enumerationNotStarted);
 }
 export function Enumerator_alreadyFinished() {
-    throw new Error(SR_enumerationAlreadyFinished);
+    throw InvalidOperationException_$ctor_Z721C83C5(SR_enumerationAlreadyFinished);
 }
 export class Enumerator_Seq {
     constructor(f) {
@@ -153,7 +155,7 @@ export function Enumerator_concat(sources) {
         else {
             let res = undefined;
             while (res == null) {
-                let copyOfStruct;
+                let copyOfStruct = undefined;
                 const outerOpt_1 = outerOpt;
                 const innerOpt_1 = innerOpt;
                 if (outerOpt_1 != null) {
@@ -294,7 +296,7 @@ export function Enumerator_unfold(f, state) {
     });
 }
 export function indexNotFound() {
-    throw new Error(SR_keyNotFoundAlt);
+    throw KeyNotFoundException_$ctor_Z721C83C5(SR_keyNotFoundAlt);
 }
 export function mkSeq(f) {
     return Enumerator_Seq_$ctor_673A07F2(f);
@@ -501,14 +503,14 @@ export 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 Error((SR_inputSequenceTooLong + "\\nParameter name: ") + "source");
+                throw new Exception((SR_inputSequenceTooLong + "\\nParameter name: ") + "source");
             }
             else {
                 return v;
             }
         }
         else {
-            throw new Error((SR_inputSequenceEmpty + "\\nParameter name: ") + "source");
+            throw new Exception((SR_inputSequenceEmpty + "\\nParameter name: ") + "source");
         }
     }
     finally {
@@ -681,7 +683,7 @@ export function tryHead(xs) {
 export function head(xs) {
     const matchValue = tryHead(xs);
     if (matchValue == null) {
-        throw new Error((SR_inputSequenceEmpty + "\\nParameter name: ") + "source");
+        throw new Exception((SR_inputSequenceEmpty + "\\nParameter name: ") + "source");
     }
     else {
         return value_1(matchValue);
@@ -747,7 +749,7 @@ export function tryItem(index, xs) {
 export function item(index, xs) {
     const matchValue = tryItem(index, xs);
     if (matchValue == null) {
-        throw new Error((SR_notEnoughElements + "\\nParameter name: ") + "index");
+        throw new Exception((SR_notEnoughElements + "\\nParameter name: ") + "index");
     }
     else {
         return value_1(matchValue);
@@ -800,7 +802,7 @@ export function tryLast(xs) {
 export function last(xs) {
     const matchValue = tryLast(xs);
     if (matchValue == null) {
-        throw new Error((SR_notEnoughElements + "\\nParameter name: ") + "source");
+        throw new Exception((SR_notEnoughElements + "\\nParameter name: ") + "source");
     }
     else {
         return value_1(matchValue);
@@ -929,7 +931,7 @@ export function cache(source) {
     return CachedSeq$1_$ctor_Z7A8347D4(() => {
         Operators_Lock(prefix, () => {
             clear(prefix);
-            let matchResult, e;
+            let matchResult = undefined, e = undefined;
             if (enumeratorR != null) {
                 if (value_1(enumeratorR) != null) {
                     matchResult = 0;
@@ -1041,7 +1043,7 @@ export function reduce(folder, xs) {
             return loop(e["System.Collections.Generic.IEnumerator`1.get_Current"]());
         }
         else {
-            throw new Error(SR_inputSequenceEmpty);
+            throw new Exception(SR_inputSequenceEmpty);
         }
     }
     finally {
@@ -1054,7 +1056,7 @@ export function reduceBack(folder, xs) {
         return arr.reduceRight(folder);
     }
     else {
-        throw new Error(SR_inputSequenceEmpty);
+        throw new Exception(SR_inputSequenceEmpty);
     }
 }
 export function replicate(n, x) {
@@ -1081,7 +1083,7 @@ export function skip(count, source) {
         try {
             for (let _ = 1; _ <= count; _++) {
                 if (!e["System.Collections.IEnumerator.MoveNext"]()) {
-                    throw new Error((SR_notEnoughElements + "\\nParameter name: ") + "source");
+                    throw new Exception((SR_notEnoughElements + "\\nParameter name: ") + "source");
                 }
             }
             return Enumerator_enumerateThenFinally(() => {
@@ -1114,7 +1116,7 @@ export function take(count, xs) {
                 return some(e["System.Collections.Generic.IEnumerator`1.get_Current"]());
             }
             else {
-                throw new Error((SR_notEnoughElements + "\\nParameter name: ") + "source");
+                throw new Exception((SR_notEnoughElements + "\\nParameter name: ") + "source");
             }
         }
         else {
@@ -1202,7 +1204,7 @@ export function average(xs, averager) {
         return averager.Add(acc, x);
     }, averager.GetZero(), xs);
     if (count === 0) {
-        throw new Error((SR_inputSequenceEmpty + "\\nParameter name: ") + "source");
+        throw new Exception((SR_inputSequenceEmpty + "\\nParameter name: ") + "source");
     }
     else {
         return averager.DivideByInt(total, count);
@@ -1215,7 +1217,7 @@ export function averageBy(f, xs, averager) {
         return averager.Add(acc, f(x));
     }, averager.GetZero(), xs);
     if (count === 0) {
-        throw new Error((SR_inputSequenceEmpty + "\\nParameter name: ") + "source");
+        throw new Exception((SR_inputSequenceEmpty + "\\nParameter name: ") + "source");
     }
     else {
         return averager.DivideByInt(total, count);
@@ -1230,7 +1232,7 @@ export function chunkBySize(chunkSize, xs) {
 export function insertAt(index, y, xs) {
     let isDone = false;
     if (index < 0) {
-        throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+        throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
     }
     return generateIndexed(() => ofSeq(xs), (i, e) => {
         if ((isDone ? true : (i < index)) && e["System.Collections.IEnumerator.MoveNext"]()) {
@@ -1242,7 +1244,7 @@ export function insertAt(index, y, xs) {
         }
         else {
             if (!isDone) {
-                throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+                throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
             }
             return undefined;
         }
@@ -1253,7 +1255,7 @@ export function insertAt(index, y, xs) {
 export function insertManyAt(index, ys, xs) {
     let status = -1;
     if (index < 0) {
-        throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+        throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
     }
     return generateIndexed(() => [ofSeq(xs), ofSeq(ys)], (i, tupledArg) => {
         const e1 = tupledArg[0];
@@ -1280,7 +1282,7 @@ export function insertManyAt(index, ys, xs) {
             }
             else {
                 if (status < 1) {
-                    throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+                    throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
                 }
                 return undefined;
             }
@@ -1296,7 +1298,7 @@ export function insertManyAt(index, ys, xs) {
 export function removeAt(index, xs) {
     let isDone = false;
     if (index < 0) {
-        throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+        throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
     }
     return generateIndexed(() => ofSeq(xs), (i, e) => {
         if ((isDone ? true : (i < index)) && e["System.Collections.IEnumerator.MoveNext"]()) {
@@ -1308,7 +1310,7 @@ export function removeAt(index, xs) {
         }
         else {
             if (!isDone) {
-                throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+                throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
             }
             return undefined;
         }
@@ -1318,7 +1320,7 @@ export function removeAt(index, xs) {
 }
 export function removeManyAt(index, count, xs) {
     if (index < 0) {
-        throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+        throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
     }
     return generateIndexed(() => ofSeq(xs), (i, e) => {
         if (i < index) {
@@ -1326,14 +1328,14 @@ export function removeManyAt(index, count, xs) {
                 return some(e["System.Collections.Generic.IEnumerator`1.get_Current"]());
             }
             else {
-                throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+                throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
             }
         }
         else {
             if (i === index) {
                 for (let _ = 1; _ <= count; _++) {
                     if (!e["System.Collections.IEnumerator.MoveNext"]()) {
-                        throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "count");
+                        throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "count");
                     }
                 }
             }
@@ -1346,7 +1348,7 @@ export function removeManyAt(index, count, xs) {
 export function updateAt(index, y, xs) {
     let isDone = false;
     if (index < 0) {
-        throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+        throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
     }
     return generateIndexed(() => ofSeq(xs), (i, e) => {
         if ((isDone ? true : (i < index)) && e["System.Collections.IEnumerator.MoveNext"]()) {
@@ -1358,7 +1360,7 @@ export function updateAt(index, y, xs) {
         }
         else {
             if (!isDone) {
-                throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+                throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
             }
             return undefined;
         }

package/Set.js

@@ -1,10 +1,11 @@
 import { record_type, bool_type, list_type, option_type, class_type } from "./Reflection.js";
 import { some, value as value_3 } from "./Option.js";
-import { structuralHash, toIterator, disposeSafe, getEnumerator, isArrayLike } from "./Util.js";
+import { structuralHash, toIterator, disposeSafe, getEnumerator, isArrayLike, Exception } from "./Util.js";
 import { Record } from "./Types.js";
 import { fold as fold_2, cons, singleton as singleton_1, empty as empty_1, ofArrayWithTail, tail, head, isEmpty as isEmpty_1, FSharpList } from "./List.js";
 import { fold as fold_1, fill, setItem } from "./Array.js";
 import { join } from "./String.js";
+import { NotSupportedException_$ctor_Z721C83C5 } from "./System.js";
 import { exists as exists_1, cache, forAll as forAll_1, fold as fold_3, reduce, iterate as iterate_1, map as map_1 } from "./Seq.js";
 import { HashSet__get_Comparer, HashSet_$ctor_Z6150332D, HashSet } from "./MutableSet.js";
 export class SetTreeLeaf$1 {
@@ -72,7 +73,7 @@ export function SetTreeModule_count(s) {
     return SetTreeModule_countAux(s, 0) | 0;
 }
 export function SetTreeModule_mk(l, k, r) {
-    let tn, tn_1;
+    let tn = undefined, tn_1 = undefined;
     let hl;
     const t = l;
     if (t != null) {
@@ -100,7 +101,7 @@ export function SetTreeModule_mk(l, k, r) {
     }
 }
 export function SetTreeModule_rebalance(t1, v, t2) {
-    let tn, tn_1, t_2, t2_3, tn_2, t_3, t2_4, tn_3;
+    let tn = undefined, tn_1 = undefined, t_2 = undefined, t2_3 = undefined, tn_2 = undefined, t_3 = undefined, t2_4 = undefined, tn_3 = undefined;
     let t1h;
     const t = t1;
     if (t != null) {
@@ -130,7 +131,7 @@ export function SetTreeModule_rebalance(t1, v, t2) {
                     return SetTreeModule_mk(SetTreeModule_mk(t1, v, SetTreeNode$1__get_Left(t2l)), SetTreeLeaf$1__get_Key(t2l), SetTreeModule_mk(SetTreeNode$1__get_Right(t2l), SetTreeLeaf$1__get_Key(t2$0027), SetTreeNode$1__get_Right(t2$0027)));
                 }
                 else {
-                    throw new Error("internal error: Set.rebalance");
+                    throw new Exception("internal error: Set.rebalance");
                 }
             }
             else {
@@ -138,7 +139,7 @@ export function SetTreeModule_rebalance(t1, v, t2) {
             }
         }
         else {
-            throw new Error("internal error: Set.rebalance");
+            throw new Exception("internal error: Set.rebalance");
         }
     }
     else if (t1h > (t2h + 2)) {
@@ -152,7 +153,7 @@ export function SetTreeModule_rebalance(t1, v, t2) {
                     return SetTreeModule_mk(SetTreeModule_mk(SetTreeNode$1__get_Left(t1$0027), SetTreeLeaf$1__get_Key(t1$0027), SetTreeNode$1__get_Left(t1r)), SetTreeLeaf$1__get_Key(t1r), SetTreeModule_mk(SetTreeNode$1__get_Right(t1r), v, t2));
                 }
                 else {
-                    throw new Error("internal error: Set.rebalance");
+                    throw new Exception("internal error: Set.rebalance");
                 }
             }
             else {
@@ -160,7 +161,7 @@ export function SetTreeModule_rebalance(t1, v, t2) {
             }
         }
         else {
-            throw new Error("internal error: Set.rebalance");
+            throw new Exception("internal error: Set.rebalance");
         }
     }
     else {
@@ -288,7 +289,7 @@ export function SetTreeModule_spliceOutSuccessor(t) {
         }
     }
     else {
-        throw new Error("internal error: Set.spliceOutSuccessor");
+        throw new Exception("internal error: Set.spliceOutSuccessor");
     }
 }
 export function SetTreeModule_remove(comparer, k, t) {
@@ -730,7 +731,7 @@ export function SetTreeModule_maximumElementOpt(t) {
 export function SetTreeModule_minimumElement(s) {
     const matchValue = SetTreeModule_minimumElementOpt(s);
     if (matchValue == null) {
-        throw new Error("Set contains no elements");
+        throw new Exception("Set contains no elements");
     }
     else {
         return value_3(matchValue);
@@ -739,7 +740,7 @@ export function SetTreeModule_minimumElement(s) {
 export function SetTreeModule_maximumElement(s) {
     const matchValue = SetTreeModule_maximumElementOpt(s);
     if (matchValue == null) {
-        throw new Error("Set contains no elements");
+        throw new Exception("Set contains no elements");
     }
     else {
         return value_3(matchValue);
@@ -787,10 +788,10 @@ export function SetTreeModule_mkIterator(s) {
     return new SetTreeModule_SetIterator$1(SetTreeModule_collapseLHS(singleton_1(s)), false);
 }
 export function SetTreeModule_notStarted() {
-    throw new Error("Enumeration not started");
+    throw new Exception("Enumeration not started");
 }
 export function SetTreeModule_alreadyFinished() {
-    throw new Error("Enumeration already started");
+    throw new Exception("Enumeration already started");
 }
 export function SetTreeModule_current(i) {
     if (i.started) {
@@ -803,7 +804,7 @@ export function SetTreeModule_current(i) {
             return SetTreeLeaf$1__get_Key(t);
         }
         else {
-            throw new Error("Please report error: Set iterator, unexpected stack for current");
+            throw new Exception("Please report error: Set iterator, unexpected stack for current");
         }
     }
     else {
@@ -817,7 +818,7 @@ export function SetTreeModule_moveNext(i) {
             if (head(matchValue) != null) {
                 const t = value_3(head(matchValue));
                 if (t instanceof SetTreeNode$1) {
-                    throw new Error("Please report error: Set iterator, unexpected stack for moveNext");
+                    throw new Exception("Please report error: Set iterator, unexpected stack for moveNext");
                 }
                 else {
                     i.stack = SetTreeModule_collapseLHS(tail(matchValue));
@@ -825,7 +826,7 @@ export function SetTreeModule_moveNext(i) {
                 }
             }
             else {
-                throw new Error("Please report error: Set iterator, unexpected stack for moveNext");
+                throw new Exception("Please report error: Set iterator, unexpected stack for moveNext");
             }
         }
         else {
@@ -886,7 +887,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                         }
                                     }
                                     else {
-                                        let matchResult, t1_6, x1_4, t2_6, x2_4;
+                                        let matchResult = undefined, t1_6 = undefined, x1_4 = undefined, t2_6 = undefined, x2_4 = undefined;
                                         if (!isEmpty_1(l1)) {
                                             if (head(l1) != null) {
                                                 matchResult = 0;
@@ -950,7 +951,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                                     continue SetTreeModule_compareStacks;
                                                 }
                                             default:
-                                                throw new Error("unexpected state in SetTree.compareStacks");
+                                                throw new Exception("unexpected state in SetTree.compareStacks");
                                         }
                                     }
                                 }
@@ -968,7 +969,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                 }
                             }
                             else {
-                                let matchResult_1, t1_7, x1_5, t2_7, x2_5;
+                                let matchResult_1 = undefined, t1_7 = undefined, x1_5 = undefined, t2_7 = undefined, x2_5 = undefined;
                                 if (!isEmpty_1(l1)) {
                                     if (head(l1) != null) {
                                         matchResult_1 = 0;
@@ -1032,7 +1033,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                             continue SetTreeModule_compareStacks;
                                         }
                                     default:
-                                        throw new Error("unexpected state in SetTree.compareStacks");
+                                        throw new Exception("unexpected state in SetTree.compareStacks");
                                 }
                             }
                         }
@@ -1051,7 +1052,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                 }
                             }
                             else {
-                                let matchResult_2, t1_8, x1_6, t2_8, x2_6;
+                                let matchResult_2 = undefined, t1_8 = undefined, x1_6 = undefined, t2_8 = undefined, x2_6 = undefined;
                                 if (!isEmpty_1(l1)) {
                                     if (head(l1) != null) {
                                         matchResult_2 = 0;
@@ -1115,7 +1116,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                             continue SetTreeModule_compareStacks;
                                         }
                                     default:
-                                        throw new Error("unexpected state in SetTree.compareStacks");
+                                        throw new Exception("unexpected state in SetTree.compareStacks");
                                 }
                             }
                         }
@@ -1134,7 +1135,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                     }
                     else {
                         const x2 = value_3(head(l2));
-                        let matchResult_3, t1_2, x1, t2_2, x2_1;
+                        let matchResult_3 = undefined, t1_2 = undefined, x1 = undefined, t2_2 = undefined, x2_1 = undefined;
                         if (!isEmpty_1(l1)) {
                             if (head(l1) != null) {
                                 matchResult_3 = 0;
@@ -1198,13 +1199,13 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                     continue SetTreeModule_compareStacks;
                                 }
                             default:
-                                throw new Error("unexpected state in SetTree.compareStacks");
+                                throw new Exception("unexpected state in SetTree.compareStacks");
                         }
                     }
                 }
                 else if (head(l1) != null) {
                     const x1_1 = value_3(head(l1));
-                    let matchResult_4, t1_4, x1_2, t2_4, x2_2;
+                    let matchResult_4 = undefined, t1_4 = undefined, x1_2 = undefined, t2_4 = undefined, x2_2 = undefined;
                     if (!isEmpty_1(l1)) {
                         if (head(l1) != null) {
                             matchResult_4 = 0;
@@ -1268,7 +1269,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                 continue SetTreeModule_compareStacks;
                             }
                         default:
-                            throw new Error("unexpected state in SetTree.compareStacks");
+                            throw new Exception("unexpected state in SetTree.compareStacks");
                     }
                 }
                 else {
@@ -1395,7 +1396,7 @@ export class FSharpSet {
         return FSharpSet__ComputeHashCode(this$) | 0;
     }
     Equals(other) {
-        let that;
+        let that = undefined;
         const this$ = this;
         return (other instanceof FSharpSet) && ((that = other, SetTreeModule_compare(FSharpSet__get_Comparer(this$), FSharpSet__get_Tree(this$), FSharpSet__get_Tree(that)) === 0));
     }
@@ -1411,18 +1412,18 @@ export class FSharpSet {
         return Array.from(this$);
     }
     CompareTo(other) {
-        let that;
+        let that = undefined;
         const this$ = this;
         return ((other instanceof FSharpSet) ? ((that = other, SetTreeModule_compare(FSharpSet__get_Comparer(this$), FSharpSet__get_Tree(this$), FSharpSet__get_Tree(that)))) : 1) | 0;
     }
     "System.Collections.Generic.ICollection`1.Add2B595"(x) {
-        throw new Error("ReadOnlyCollection");
+        throw NotSupportedException_$ctor_Z721C83C5("ReadOnlyCollection");
     }
     "System.Collections.Generic.ICollection`1.Clear"() {
-        throw new Error("ReadOnlyCollection");
+        throw NotSupportedException_$ctor_Z721C83C5("ReadOnlyCollection");
     }
     "System.Collections.Generic.ICollection`1.Remove2B595"(x) {
-        throw new Error("ReadOnlyCollection");
+        throw NotSupportedException_$ctor_Z721C83C5("ReadOnlyCollection");
     }
     "System.Collections.Generic.ICollection`1.Contains2B595"(x) {
         const s = this;
@@ -1460,14 +1461,14 @@ export class FSharpSet {
     }
     add(k) {
         const s = this;
-        throw new Error("Set cannot be mutated");
+        throw new Exception("Set cannot be mutated");
         return s;
     }
     clear() {
-        throw new Error("Set cannot be mutated");
+        throw new Exception("Set cannot be mutated");
     }
     delete(k) {
-        throw new Error("Set cannot be mutated");
+        throw new Exception("Set cannot be mutated");
         return false;
     }
     has(k) {