@fable-org/fable-library-js 2.0.0-beta.3 → 2.0.0-beta.5

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 { toString, Record } from "./Types.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 {
@@ -1394,17 +1395,14 @@ export class FSharpSet {
         const this$ = this;
         return FSharpSet__ComputeHashCode(this$) | 0;
     }
-    Equals(that) {
-        let that_1;
+    Equals(other) {
+        let that = undefined;
         const this$ = this;
-        return (that instanceof FSharpSet) && ((that_1 = that, SetTreeModule_compare(FSharpSet__get_Comparer(this$), FSharpSet__get_Tree(this$), FSharpSet__get_Tree(that_1)) === 0));
+        return (other instanceof FSharpSet) && ((that = other, SetTreeModule_compare(FSharpSet__get_Comparer(this$), FSharpSet__get_Tree(this$), FSharpSet__get_Tree(that)) === 0));
     }
     toString() {
         const this$ = this;
-        return ("set [" + join("; ", map_1((x) => {
-            let copyOfStruct = x;
-            return toString(copyOfStruct);
-        }, this$))) + "]";
+        return ("set [" + join("; ", this$)) + "]";
     }
     get [Symbol.toStringTag]() {
         return "FSharpSet";
@@ -1413,18 +1411,19 @@ export class FSharpSet {
         const this$ = this;
         return Array.from(this$);
     }
-    CompareTo(that) {
-        const s = this;
-        return SetTreeModule_compare(FSharpSet__get_Comparer(s), FSharpSet__get_Tree(s), FSharpSet__get_Tree(that)) | 0;
+    CompareTo(other) {
+        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;
@@ -1462,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) {

package/String.js

@@ -2,22 +2,31 @@ import { toString as dateToString } from "./Date.js";
 import { compare as numericCompare, isNumeric, isIntegral, multiply, toExponential, toFixed, toHex, toPrecision } from "./Numeric.js";
 import { escape } from "./RegExp.js";
 import { toString } from "./Types.js";
+import { Exception } from "./Util.js";
 const fsFormatRegExp = /(^|[^%])%([0+\- ]*)(\*|\d+)?(?:\.(\d+))?(\w)/g;
 const interpolateRegExp = /(?:(^|[^%])%([0+\- ]*)(\d+)?(?:\.(\d+))?(\w))?%P\(\)/g;
 const formatRegExp = /\{(\d+)(,-?\d+)?(?:\:([a-zA-Z])(\d{0,2})|\:(.+?))?\}/g;
 function isLessThan(x, y) {
     return numericCompare(x, y) < 0;
 }
+export const StringComparison = {
+    CurrentCulture: 0,
+    CurrentCultureIgnoreCase: 1,
+    InvariantCulture: 2,
+    InvariantCultureIgnoreCase: 3,
+    Ordinal: 4,
+    OrdinalIgnoreCase: 5,
+};
 function cmp(x, y, ic) {
     function isIgnoreCase(i) {
         return i === true ||
-            i === 1 /* StringComparison.CurrentCultureIgnoreCase */ ||
-            i === 3 /* StringComparison.InvariantCultureIgnoreCase */ ||
-            i === 5 /* StringComparison.OrdinalIgnoreCase */;
+            i === StringComparison.CurrentCultureIgnoreCase ||
+            i === StringComparison.InvariantCultureIgnoreCase ||
+            i === StringComparison.OrdinalIgnoreCase;
     }
     function isOrdinal(i) {
-        return i === 4 /* StringComparison.Ordinal */ ||
-            i === 5 /* StringComparison.OrdinalIgnoreCase */;
+        return i === StringComparison.Ordinal ||
+            i === StringComparison.OrdinalIgnoreCase;
     }
     if (x == null) {
         return y == null ? 0 : -1;
@@ -45,33 +54,33 @@ export function compare(...args) {
         case 2: return cmp(args[0], args[1], false);
         case 3: return cmp(args[0], args[1], args[2]);
         case 4: return cmp(args[0], args[1], args[2] === true);
-        case 5: return cmp(args[0].substr(args[1], args[4]), args[2].substr(args[3], args[4]), false);
-        case 6: return cmp(args[0].substr(args[1], args[4]), args[2].substr(args[3], args[4]), args[5]);
-        case 7: return cmp(args[0].substr(args[1], args[4]), args[2].substr(args[3], args[4]), args[5] === true);
-        default: throw new Error("String.compare: Unsupported number of parameters");
+        case 5: return cmp(args[0].slice(args[1], args[1] + args[4]), args[2].slice(args[3], args[3] + args[4]), false);
+        case 6: return cmp(args[0].slice(args[1], args[1] + args[4]), args[2].slice(args[3], args[3] + args[4]), args[5]);
+        case 7: return cmp(args[0].slice(args[1], args[1] + args[4]), args[2].slice(args[3], args[3] + args[4]), args[5] === true);
+        default: throw new Exception("String.compare: Unsupported number of parameters");
     }
 }
 export function compareOrdinal(x, y) {
-    return cmp(x, y, 4 /* StringComparison.Ordinal */);
+    return cmp(x, y, StringComparison.Ordinal);
 }
 export function compareTo(x, y) {
-    return cmp(x, y, 0 /* StringComparison.CurrentCulture */);
+    return cmp(x, y, StringComparison.CurrentCulture);
 }
 export function startsWith(str, pattern, ic) {
-    if (ic === 4 /* StringComparison.Ordinal */) { // to avoid substring allocation
+    if (ic === StringComparison.Ordinal) { // to avoid substring allocation
         return str.startsWith(pattern);
     }
     if (str.length >= pattern.length) {
-        return cmp(str.substr(0, pattern.length), pattern, ic) === 0;
+        return cmp(str.slice(0, pattern.length), pattern, ic) === 0;
     }
     return false;
 }
 export function endsWith(str, pattern, ic) {
-    if (ic === 4 /* StringComparison.Ordinal */) { // to avoid substring allocation
+    if (ic === StringComparison.Ordinal) { // to avoid substring allocation
         return str.endsWith(pattern);
     }
     if (str.length >= pattern.length) {
-        return cmp(str.substr(str.length - pattern.length, pattern.length), pattern, ic) === 0;
+        return cmp(str.slice(-pattern.length), pattern, ic) === 0;
     }
     return false;
 }
@@ -81,14 +90,14 @@ export function indexOfAny(str, anyOf, ...args) {
     }
     const startIndex = (args.length > 0) ? args[0] : 0;
     if (startIndex < 0) {
-        throw new Error("Start index cannot be negative");
+        throw new Exception("Start index cannot be negative");
     }
     const length = (args.length > 1) ? args[1] : str.length - startIndex;
     if (length < 0) {
-        throw new Error("Length cannot be negative");
+        throw new Exception("Length cannot be negative");
     }
     if (startIndex + length > str.length) {
-        throw new Error("Invalid startIndex and length");
+        throw new Exception("Invalid startIndex and length");
     }
     const endIndex = startIndex + length;
     const anyOfAsStr = "".concat.apply("", anyOf);
@@ -143,7 +152,7 @@ export function toText(arg) {
 }
 export function toFail(arg) {
     return continuePrint((x) => {
-        throw new Error(x);
+        throw new Exception(x);
     }, arg);
 }
 function formatReplacement(rep, flags, padLength, precision, format) {
@@ -230,7 +239,7 @@ function createPrinter(cont, _strParts, _matches, _result = "", padArg = -1) {
             }
             else if (padLength === "*") {
                 if (arg < 0) {
-                    throw new Error("Non-negative number required");
+                    throw new Exception("Non-negative number required");
                 }
                 padArg = arg;
                 continue;
@@ -299,7 +308,7 @@ export function format(str, ...args) {
     }
     return str2.replace(formatRegExp, (_, idx, padLength, format, precision, pattern) => {
         if (idx < 0 || idx >= args.length) {
-            throw new Error("Index must be greater or equal to zero and less than the arguments' length.");
+            throw new Exception("Index must be greater or equal to zero and less than the arguments' length.");
         }
         let rep = args[idx];
         let parts;
@@ -309,7 +318,7 @@ export function format(str, ...args) {
                 case "b":
                 case "B":
                     if (!isIntegral(rep)) {
-                        throw new Error("Format specifier was invalid.");
+                        throw new Exception("Format specifier was invalid.");
                     }
                     rep = (rep >>> 0).toString(2).replace(/^0+/, "").padStart(precision || 1, "0");
                     break;
@@ -330,7 +339,7 @@ export function format(str, ...args) {
                 case "d":
                 case "D":
                     if (!isIntegral(rep)) {
-                        throw new Error("Format specifier was invalid.");
+                        throw new Exception("Format specifier was invalid.");
                     }
                     rep = String(rep);
                     if (precision != null) {
@@ -377,11 +386,11 @@ export function format(str, ...args) {
                     break;
                 case "r":
                 case "R":
-                    throw new Error("The round-trip format is not supported by Fable");
+                    throw new Exception("The round-trip format is not supported by Fable");
                 case "x":
                 case "X":
                     if (!isIntegral(rep)) {
-                        throw new Error("Format specifier was invalid.");
+                        throw new Exception("Format specifier was invalid.");
                     }
                     precision = precision != null ? precision : 2;
                     rep = padLeft(toHex(rep), precision, "0");
@@ -393,7 +402,7 @@ export function format(str, ...args) {
                     // If we have format and were not able to handle it throw
                     // See: https://learn.microsoft.com/en-us/dotnet/standard/base-types/standard-numeric-format-strings#standard-format-specifiers
                     if (format) {
-                        throw new Error("Format specifier was invalid.");
+                        throw new Exception("Format specifier was invalid.");
                     }
                     if (pattern) {
                         let sign = "";
@@ -446,7 +455,7 @@ export function format(str, ...args) {
 }
 export function initialize(n, f) {
     if (n < 0) {
-        throw new Error("String length must be non-negative");
+        throw new Exception("String length must be non-negative");
     }
     const xs = new Array(n);
     for (let i = 0; i < n; i++) {
@@ -456,7 +465,7 @@ export function initialize(n, f) {
 }
 export function insert(str, startIndex, value) {
     if (startIndex < 0 || startIndex > str.length) {
-        throw new Error("startIndex is negative or greater than the length of this instance.");
+        throw new Exception("startIndex is negative or greater than the length of this instance.");
     }
     return str.substring(0, startIndex) + value + str.substring(startIndex);
 }
@@ -480,12 +489,12 @@ export function join(delimiter, xs) {
 export function joinWithIndices(delimiter, xs, startIndex, count) {
     const endIndexPlusOne = startIndex + count;
     if (endIndexPlusOne > xs.length) {
-        throw new Error("Index and count must refer to a location within the buffer.");
+        throw new Exception("Index and count must refer to a location within the buffer.");
     }
     return xs.slice(startIndex, endIndexPlusOne).join(delimiter);
 }
 function notSupported(name) {
-    throw new Error("The environment doesn't support '" + name + "', please use a polyfill.");
+    throw new Exception("The environment doesn't support '" + name + "', please use a polyfill.");
 }
 export function toBase64String(inArray) {
     let str = "";
@@ -518,10 +527,10 @@ export function padRight(str, len, ch) {
 }
 export function remove(str, startIndex, count) {
     if (startIndex >= str.length) {
-        throw new Error("startIndex must be less than length of string");
+        throw new Exception("startIndex must be less than length of string");
     }
     if (typeof count === "number" && (startIndex + count) > str.length) {
-        throw new Error("Index and count must refer to a location within the string.");
+        throw new Exception("Index and count must refer to a location within the string.");
     }
     return str.slice(0, startIndex) + (typeof count === "number" ? str.substr(startIndex + count) : "");
 }
@@ -533,7 +542,7 @@ export function replicate(n, x) {
 }
 export function getCharAtIndex(input, index) {
     if (index < 0 || index >= input.length) {
-        throw new Error("Index was outside the bounds of the array.");
+        throw new Exception("Index was outside the bounds of the array.");
     }
     return input[index];
 }
@@ -541,7 +550,7 @@ export function split(str, splitters, count, options) {
     count = typeof count === "number" ? count : undefined;
     options = typeof options === "number" ? options : 0;
     if (count && count < 0) {
-        throw new Error("Count cannot be less than zero");
+        throw new Exception("Count cannot be less than zero");
     }
     if (count === 0) {
         return [];
@@ -602,7 +611,7 @@ export function filter(pred, x) {
 }
 export function substring(str, startIndex, length) {
     if ((startIndex + (length || 0) > str.length)) {
-        throw new Error("Invalid startIndex and/or length");
+        throw new Exception("Invalid startIndex and/or length");
     }
     return length != null ? str.substr(startIndex, length) : str.substr(startIndex);
 }

package/System.Collections.Generic.js

@@ -1,15 +1,31 @@
-import { disposeSafe, defaultOf, toIterator, getEnumerator, structuralHash, equals as equals_1, compare } from "./Util.js";
+import { disposeSafe, defaultOf, toIterator, getEnumerator, structuralHash, equals as equals_1, compare, Exception } from "./Util.js";
 import { class_type } from "./Reflection.js";
+import { SR_Arg_KeyNotFound } from "./Global.js";
 import { toArray, empty, singleton, append, enumerateWhile, delay } from "./Seq.js";
 import { setItem, initialize, copyTo, fill, item as item_1 } from "./Array.js";
 import { max } from "./Double.js";
+import { ArgumentOutOfRangeException_$ctor_Z721C83C5 } from "./System.js";
+export class KeyNotFoundException extends Exception {
+    constructor(message) {
+        super(message);
+    }
+}
+export function KeyNotFoundException_$reflection() {
+    return class_type("System.Collections.Generic.KeyNotFoundException", undefined, KeyNotFoundException, class_type("System.Exception"));
+}
+export function KeyNotFoundException_$ctor_Z721C83C5(message) {
+    return new KeyNotFoundException(message);
+}
+export function KeyNotFoundException_$ctor() {
+    return KeyNotFoundException_$ctor_Z721C83C5(SR_Arg_KeyNotFound);
+}
 export class Comparer$1 {
     constructor(comparison) {
         this.comparison = comparison;
     }
     Compare(x, y) {
         const _ = this;
-        return _.comparison(x, y) | 0;
+        return ((x == null) ? ((y == null) ? 0 : -1) : ((y == null) ? 1 : _.comparison(x, y))) | 0;
     }
 }
 export function Comparer$1_$reflection(gen0) {
@@ -34,7 +50,7 @@ export class EqualityComparer$1 {
     }
     Equals(x, y) {
         const _ = this;
-        return _.equals(x, y);
+        return (x == null) ? (y == null) : ((y == null) ? false : _.equals(x, y));
     }
     GetHashCode(x) {
         const _ = this;
@@ -191,7 +207,7 @@ function Queue$1_$ctor_Z3B4C077E(initialContents, initialCount) {
 }
 export function Queue$1_$ctor_Z524259A4(initialCapacity) {
     if (initialCapacity < 0) {
-        throw new Error("capacity is less than 0");
+        throw ArgumentOutOfRangeException_$ctor_Z721C83C5("capacity is less than 0");
     }
     return Queue$1_$ctor_Z3B4C077E(fill(new Array(initialCapacity), 0, initialCapacity, null), 0);
 }
@@ -215,7 +231,7 @@ export function Queue$1__Enqueue_2B595(_, value) {
 }
 export function Queue$1__Dequeue(_) {
     if (_.count === 0) {
-        throw new Error("Queue is empty");
+        throw new Exception("Queue is empty");
     }
     const value = item_1(_.head, _.contents);
     _.head = (((_.head + 1) % Queue$1__size(_)) | 0);
@@ -224,7 +240,7 @@ export function Queue$1__Dequeue(_) {
 }
 export function Queue$1__Peek(_) {
     if (_.count === 0) {
-        throw new Error("Queue is empty");
+        throw new Exception("Queue is empty");
     }
     return item_1(_.head, _.contents);
 }

package/System.Text.js

@@ -1,7 +1,7 @@
 import { replace, format, replicate, substring, isNullOrEmpty, join } from "./String.js";
 import { class_type } from "./Reflection.js";
-import { clear, int32ToString } from "./Util.js";
 import { toString } from "./Types.js";
+import { Exception, clear, int32ToString } from "./Util.js";
 export class StringBuilder {
     constructor(value, capacity) {
         this.buf = [];
@@ -30,11 +30,11 @@ export function StringBuilder_$ctor() {
     return StringBuilder_$ctor_Z18115A39("", 16);
 }
 export function StringBuilder__Append_Z721C83C5(x, s) {
-    void (x.buf.push(s));
+    void (x.buf.push(toString(s)));
     return x;
 }
 export function StringBuilder__Append_487EF8FB(x, s, startIndex, count) {
-    void (x.buf.push(substring(s, startIndex, count)));
+    void (x.buf.push(substring(toString(s), startIndex, count)));
     return x;
 }
 export function StringBuilder__Append_244C7CD6(x, c) {
@@ -67,7 +67,7 @@ export function StringBuilder__Append_Z372E4D23(x, cs) {
     return x;
 }
 export function StringBuilder__Append_43A65C09(x, s) {
-    void (x.buf.push(toString(s)));
+    void (x.buf.push(s.toString()));
     return x;
 }
 export function StringBuilder__AppendFormat_433E080(x, fmt, o) {
@@ -123,7 +123,7 @@ export function StringBuilder__get_Chars_Z524259A4(x, index) {
         len = ((len + x.buf[i].length) | 0);
     }
     if (((index < 0) ? true : (i < 0)) ? true : (i >= x.buf.length)) {
-        throw new Error("Index was outside the bounds of the array");
+        throw new Exception("Index was outside the bounds of the array");
     }
     else {
         const pos = ((len - index) - 1) | 0;
@@ -138,7 +138,7 @@ export function StringBuilder__set_Chars_413E0D0A(x, index, value) {
         len = ((len + x.buf[i].length) | 0);
     }
     if (((index < 0) ? true : (i < 0)) ? true : (i >= x.buf.length)) {
-        throw new Error("Index was outside the bounds of the array");
+        throw new Exception("Index was outside the bounds of the array");
     }
     else {
         const pos = ((len - index) - 1) | 0;
@@ -152,7 +152,7 @@ export function StringBuilder__Replace_Z766F94C0(x, oldValue, newValue) {
     return x;
 }
 export function StringBuilder__Replace_Z384F8060(x, oldValue, newValue) {
-    const str = replace(toString(x), oldValue, newValue);
+    const str = replace(x.toString(), oldValue, newValue);
     return StringBuilder__Append_Z721C83C5(StringBuilder__Clear(x), str);
 }
 export function StringBuilder__get_Length(x) {
@@ -163,5 +163,5 @@ export function StringBuilder__get_Length(x) {
     return len | 0;
 }
 export function StringBuilder__ToString_Z37302880(x, firstIndex, length) {
-    return substring(toString(x), firstIndex, length);
+    return substring(x.toString(), firstIndex, length);
 }