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

package/MailboxProcessor.js

@@ -1,6 +1,7 @@
 import { defaultCancellationToken } from "./Async.js";
 import { fromContinuations } from "./Async.js";
 import { startImmediate } from "./Async.js";
+import { Exception } from "./Util.js";
 class QueueCell {
     constructor(message) {
         this.value = message;
@@ -54,7 +55,7 @@ export function startInstance($this) {
 export function receive($this) {
     return fromContinuations((conts) => {
         if ($this.continuation) {
-            throw new Error("Receive can only be called once!");
+            throw new Exception("Receive can only be called once!");
         }
         $this.continuation = conts[0];
         __processEvents($this);

package/Map.js

@@ -1,11 +1,13 @@
 import { record_type, bool_type, list_type, option_type, class_type } from "./Reflection.js";
 import { some, value as value_1 } from "./Option.js";
-import { structuralHash, compare, toIterator, equals, disposeSafe, getEnumerator, isArrayLike } from "./Util.js";
+import { structuralHash, compare, toIterator, equals, disposeSafe, getEnumerator, isArrayLike, Exception } from "./Util.js";
+import { KeyNotFoundException_$ctor } from "./System.Collections.Generic.js";
 import { singleton, ofArrayWithTail, head, tail, isEmpty as isEmpty_1, fold as fold_1, empty as empty_1, FSharpList, cons } from "./List.js";
 import { map as map_2, item, fill, setItem } from "./Array.js";
 import { Record } from "./Types.js";
 import { tryPick as tryPick_1, pick as pick_1, iterate as iterate_1, compareWith, map as map_1, unfold } from "./Seq.js";
 import { format, join } from "./String.js";
+import { NotSupportedException_$ctor_Z721C83C5 } from "./System.js";
 export class MapTreeLeaf$2 {
     constructor(k, v) {
         this.k = k;
@@ -75,7 +77,7 @@ export function MapTreeModule_size(x) {
     return MapTreeModule_sizeAux(0, x) | 0;
 }
 export function MapTreeModule_mk(l, k, v, r) {
-    let mn, mn_1;
+    let mn = undefined, mn_1 = undefined;
     let hl;
     const m = l;
     if (m != null) {
@@ -103,7 +105,7 @@ export function MapTreeModule_mk(l, k, v, r) {
     }
 }
 export function MapTreeModule_rebalance(t1, k, v, t2) {
-    let mn, mn_1, m_2, m2_2, mn_2, m_3, m2_3, mn_3;
+    let mn = undefined, mn_1 = undefined, m_2 = undefined, m2_2 = undefined, mn_2 = undefined, m_3 = undefined, m2_3 = undefined, mn_3 = undefined;
     let t1h;
     const m = t1;
     if (m != null) {
@@ -133,7 +135,7 @@ export function MapTreeModule_rebalance(t1, k, v, t2) {
                     return MapTreeModule_mk(MapTreeModule_mk(t1, k, v, MapTreeNode$2__get_Left(t2l)), MapTreeLeaf$2__get_Key(t2l), MapTreeLeaf$2__get_Value(t2l), MapTreeModule_mk(MapTreeNode$2__get_Right(t2l), MapTreeLeaf$2__get_Key(t2$0027), MapTreeLeaf$2__get_Value(t2$0027), MapTreeNode$2__get_Right(t2$0027)));
                 }
                 else {
-                    throw new Error("internal error: Map.rebalance");
+                    throw new Exception("internal error: Map.rebalance");
                 }
             }
             else {
@@ -141,7 +143,7 @@ export function MapTreeModule_rebalance(t1, k, v, t2) {
             }
         }
         else {
-            throw new Error("internal error: Map.rebalance");
+            throw new Exception("internal error: Map.rebalance");
         }
     }
     else if (t1h > (t2h + 2)) {
@@ -155,7 +157,7 @@ export function MapTreeModule_rebalance(t1, k, v, t2) {
                     return MapTreeModule_mk(MapTreeModule_mk(MapTreeNode$2__get_Left(t1$0027), MapTreeLeaf$2__get_Key(t1$0027), MapTreeLeaf$2__get_Value(t1$0027), MapTreeNode$2__get_Left(t1r)), MapTreeLeaf$2__get_Key(t1r), MapTreeLeaf$2__get_Value(t1r), MapTreeModule_mk(MapTreeNode$2__get_Right(t1r), k, v, t2));
                 }
                 else {
-                    throw new Error("internal error: Map.rebalance");
+                    throw new Exception("internal error: Map.rebalance");
                 }
             }
             else {
@@ -163,7 +165,7 @@ export function MapTreeModule_rebalance(t1, k, v, t2) {
             }
         }
         else {
-            throw new Error("internal error: Map.rebalance");
+            throw new Exception("internal error: Map.rebalance");
         }
     }
     else {
@@ -229,7 +231,7 @@ export function MapTreeModule_tryFind(comparer_mut, k_mut, m_mut) {
 export function MapTreeModule_find(comparer, k, m) {
     const matchValue = MapTreeModule_tryFind(comparer, k, m);
     if (matchValue == null) {
-        throw new Error();
+        throw KeyNotFoundException_$ctor();
     }
     else {
         return value_1(matchValue);
@@ -327,7 +329,7 @@ export function MapTreeModule_spliceOutSuccessor(m) {
         }
     }
     else {
-        throw new Error("internal error: Map.spliceOutSuccessor");
+        throw new Exception("internal error: Map.spliceOutSuccessor");
     }
 }
 export function MapTreeModule_remove(comparer, k, m) {
@@ -846,10 +848,10 @@ export function MapTreeModule_mkIterator(m) {
     return new MapTreeModule_MapIterator$2(MapTreeModule_collapseLHS(singleton(m)), false);
 }
 export function MapTreeModule_notStarted() {
-    throw new Error("enumeration not started");
+    throw new Exception("enumeration not started");
 }
 export function MapTreeModule_alreadyFinished() {
-    throw new Error("enumeration already finished");
+    throw new Exception("enumeration already finished");
 }
 export function MapTreeModule_current(i) {
     if (i.started) {
@@ -858,14 +860,14 @@ export function MapTreeModule_current(i) {
             if (head(matchValue) != null) {
                 const m = value_1(head(matchValue));
                 if (m instanceof MapTreeNode$2) {
-                    throw new Error("Please report error: Map iterator, unexpected stack for current");
+                    throw new Exception("Please report error: Map iterator, unexpected stack for current");
                 }
                 else {
                     return [MapTreeLeaf$2__get_Key(m), MapTreeLeaf$2__get_Value(m)];
                 }
             }
             else {
-                throw new Error("Please report error: Map iterator, unexpected stack for current");
+                throw new Exception("Please report error: Map iterator, unexpected stack for current");
             }
         }
         else {
@@ -883,7 +885,7 @@ export function MapTreeModule_moveNext(i) {
             if (head(matchValue) != null) {
                 const m = value_1(head(matchValue));
                 if (m instanceof MapTreeNode$2) {
-                    throw new Error("Please report error: Map iterator, unexpected stack for moveNext");
+                    throw new Exception("Please report error: Map iterator, unexpected stack for moveNext");
                 }
                 else {
                     i.stack = MapTreeModule_collapseLHS(tail(matchValue));
@@ -891,7 +893,7 @@ export function MapTreeModule_moveNext(i) {
                 }
             }
             else {
-                throw new Error("Please report error: Map iterator, unexpected stack for moveNext");
+                throw new Exception("Please report error: Map iterator, unexpected stack for moveNext");
             }
         }
         else {
@@ -937,7 +939,7 @@ export function MapTreeModule_leftmost(m_mut) {
         const m = m_mut;
         if (m != null) {
             const m2 = value_1(m);
-            let matchResult, nd_1;
+            let matchResult = undefined, nd_1 = undefined;
             if (m2 instanceof MapTreeNode$2) {
                 if (MapTreeNode$2__get_Height(m2) > 1) {
                     matchResult = 0;
@@ -964,7 +966,7 @@ export function MapTreeModule_leftmost(m_mut) {
             }
         }
         else {
-            throw new Error();
+            throw KeyNotFoundException_$ctor();
         }
         break;
     }
@@ -974,7 +976,7 @@ export function MapTreeModule_rightmost(m_mut) {
         const m = m_mut;
         if (m != null) {
             const m2 = value_1(m);
-            let matchResult, nd_1;
+            let matchResult = undefined, nd_1 = undefined;
             if (m2 instanceof MapTreeNode$2) {
                 if (MapTreeNode$2__get_Height(m2) > 1) {
                     matchResult = 0;
@@ -1001,7 +1003,7 @@ export function MapTreeModule_rightmost(m_mut) {
             }
         }
         else {
-            throw new Error();
+            throw KeyNotFoundException_$ctor();
         }
         break;
     }
@@ -1015,13 +1017,13 @@ export class FSharpMap {
         const this$ = this;
         return FSharpMap__ComputeHashCode(this$) | 0;
     }
-    Equals(that) {
+    Equals(other) {
         const this$ = this;
-        if (that instanceof FSharpMap) {
-            const that_1 = that;
+        if (other instanceof FSharpMap) {
+            const that = other;
             const e1 = getEnumerator(this$);
             try {
-                const e2 = getEnumerator(that_1);
+                const e2 = getEnumerator(that);
                 try {
                     const loop = () => {
                         const m1 = e1["System.Collections.IEnumerator.MoveNext"]();
@@ -1080,27 +1082,22 @@ export class FSharpMap {
         const _ = this;
         return MapTreeModule_mkIEnumerator(_.tree);
     }
-    CompareTo(obj) {
-        const m = this;
-        if (obj instanceof FSharpMap) {
-            const m2 = obj;
-            return compareWith((kvp1, kvp2) => {
-                const c = m.comparer.Compare(kvp1[0], kvp2[0]) | 0;
-                return ((c !== 0) ? c : compare(kvp1[1], kvp2[1])) | 0;
-            }, m, m2) | 0;
-        }
-        else {
-            throw new Error("not comparable\\nParameter name: obj");
-        }
+    CompareTo(other) {
+        let that = undefined;
+        const this$ = this;
+        return ((other instanceof FSharpMap) ? ((that = other, compareWith((kvp1, kvp2) => {
+            const c = this$.comparer.Compare(kvp1[0], kvp2[0]) | 0;
+            return ((c !== 0) ? c : compare(kvp1[1], kvp2[1])) | 0;
+        }, this$, that))) : 1) | 0;
     }
     "System.Collections.Generic.ICollection`1.Add2B595"(x) {
-        throw new Error("Map cannot be mutated");
+        throw NotSupportedException_$ctor_Z721C83C5("Map cannot be mutated");
     }
     "System.Collections.Generic.ICollection`1.Clear"() {
-        throw new Error("Map cannot be mutated");
+        throw NotSupportedException_$ctor_Z721C83C5("Map cannot be mutated");
     }
     "System.Collections.Generic.ICollection`1.Remove2B595"(x) {
-        throw new Error("Map cannot be mutated");
+        throw NotSupportedException_$ctor_Z721C83C5("Map cannot be mutated");
     }
     "System.Collections.Generic.ICollection`1.Contains2B595"(x) {
         const m = this;
@@ -1126,10 +1123,10 @@ export class FSharpMap {
         return FSharpMap__get_Count(m) | 0;
     }
     clear() {
-        throw new Error("Map cannot be mutated");
+        throw new Exception("Map cannot be mutated");
     }
     delete(_arg) {
-        throw new Error("Map cannot be mutated");
+        throw new Exception("Map cannot be mutated");
         return false;
     }
     entries() {
@@ -1150,7 +1147,7 @@ export class FSharpMap {
     }
     set(k, v) {
         const m = this;
-        throw new Error("Map cannot be mutated");
+        throw new Exception("Map cannot be mutated");
         return m;
     }
     values() {
@@ -1312,7 +1309,7 @@ export function pick(chooser, table) {
         return value_1(matchValue);
     }
     else {
-        throw new Error();
+        throw KeyNotFoundException_$ctor();
     }
 }
 export function exists(predicate, table) {

package/MapUtil.js

@@ -1,4 +1,4 @@
-import { equals } from "./Util.js";
+import { Exception, equals } from "./Util.js";
 import { Union } from "./Types.js";
 const CaseRules = {
     None: 0,
@@ -34,7 +34,7 @@ export function keyValueList(fields, caseRule = CaseRules.None) {
     const obj = {};
     const definedCaseRule = caseRule;
     function fail(kvPair) {
-        throw new Error("Cannot infer key and value of " + String(kvPair));
+        throw new Exception("Cannot infer key and value of " + String(kvPair));
     }
     function assign(key, caseRule, value) {
         key = changeCase(key, caseRule);
@@ -108,7 +108,7 @@ export function tryAddToDict(dict, k, v) {
 }
 export function addToDict(dict, k, v) {
     if (dict.has(k)) {
-        throw new Error("An item with the same key has already been added. Key: " + k);
+        throw new Exception("An item with the same key has already been added. Key: " + k);
     }
     dict.set(k, v);
 }
@@ -117,7 +117,7 @@ export function getItemFromDict(map, key) {
         return map.get(key);
     }
     else {
-        throw new Error(`The given key '${key}' was not present in the dictionary.`);
+        throw new Exception(`The given key '${key}' was not present in the dictionary.`);
     }
 }
 export function getItemFromDictOrCreate(map, key, createValue) {

package/MutableMap.js

@@ -5,6 +5,8 @@ import { setItem } from "./Array.js";
 import { FSharpRef } from "./Types.js";
 import { class_type } from "./Reflection.js";
 import { getItemFromDict, tryGetValue } from "./MapUtil.js";
+import { KeyNotFoundException_$ctor_Z721C83C5 } from "./System.Collections.Generic.js";
+import { ArgumentException_$ctor_Z721C83C5 } from "./System.js";
 import { format } from "./String.js";
 export class Dictionary {
     constructor(pairs, comparer) {
@@ -53,11 +55,11 @@ export class Dictionary {
     "System.Collections.Generic.ICollection`1.Contains2B595"(item) {
         const this$ = this;
         const matchValue = Dictionary__TryFind_2B595(this$, item[0]);
-        let matchResult, p_1;
+        let matchResult = undefined, pair_1 = undefined;
         if (matchValue != null) {
             if (equals(value_1(matchValue)[1], item[1])) {
                 matchResult = 0;
-                p_1 = value_1(matchValue);
+                pair_1 = value_1(matchValue);
             }
             else {
                 matchResult = 1;
@@ -89,14 +91,24 @@ export class Dictionary {
     "System.Collections.Generic.ICollection`1.Remove2B595"(item) {
         const this$ = this;
         const matchValue = Dictionary__TryFind_2B595(this$, item[0]);
+        let matchResult = undefined, pair_1 = undefined;
         if (matchValue != null) {
             if (equals(value_1(matchValue)[1], item[1])) {
-                Dictionary__Remove_2B595(this$, item[0]);
+                matchResult = 0;
+                pair_1 = value_1(matchValue);
+            }
+            else {
+                matchResult = 1;
             }
-            return true;
         }
         else {
-            return false;
+            matchResult = 1;
+        }
+        switch (matchResult) {
+            case 0:
+                return Dictionary__Remove_2B595(this$, item[0]);
+            default:
+                return false;
         }
     }
     "System.Collections.Generic.IDictionary`2.Add5BDDA1"(key, value) {
@@ -205,7 +217,7 @@ function Dictionary__TryFindIndex_2B595(this$, k) {
 }
 export function Dictionary__TryFind_2B595(this$, k) {
     const matchValue = Dictionary__TryFindIndex_2B595(this$, k);
-    let matchResult;
+    let matchResult = undefined;
     if (matchValue[0]) {
         if (matchValue[2] > -1) {
             matchResult = 0;
@@ -250,7 +262,7 @@ export function Dictionary__get_Item_2B595(this$, k) {
         return value_1(matchValue)[1];
     }
     else {
-        throw new Error("The item was not found in collection");
+        throw KeyNotFoundException_$ctor_Z721C83C5("The item was not found in collection");
     }
 }
 export function Dictionary__set_Item_5BDDA1(this$, k, v) {
@@ -271,7 +283,7 @@ export function Dictionary__Add_5BDDA1(this$, k, v) {
     const matchValue = Dictionary__TryFindIndex_2B595(this$, k);
     if (matchValue[0]) {
         if (matchValue[2] > -1) {
-            throw new Error(format("An item with the same key has already been added. Key: {0}", k));
+            throw ArgumentException_$ctor_Z721C83C5(format("An item with the same key has already been added. Key: {0}", k));
         }
         else {
             const value = void (getItemFromDict(this$.hashMap, matchValue[1]).push([k, v]));
@@ -283,7 +295,7 @@ export function Dictionary__Add_5BDDA1(this$, k, v) {
 }
 export function Dictionary__ContainsKey_2B595(this$, k) {
     const matchValue = Dictionary__TryFindIndex_2B595(this$, k);
-    let matchResult;
+    let matchResult = undefined;
     if (matchValue[0]) {
         if (matchValue[2] > -1) {
             matchResult = 0;
@@ -304,7 +316,7 @@ export function Dictionary__ContainsKey_2B595(this$, k) {
 }
 export function Dictionary__Remove_2B595(this$, k) {
     const matchValue = Dictionary__TryFindIndex_2B595(this$, k);
-    let matchResult;
+    let matchResult = undefined;
     if (matchValue[0]) {
         if (matchValue[2] > -1) {
             matchResult = 0;

package/MutableSet.js

@@ -132,7 +132,7 @@ function HashSet__TryFindIndex_2B595(this$, k) {
 }
 function HashSet__TryFind_2B595(this$, k) {
     const matchValue = HashSet__TryFindIndex_2B595(this$, k);
-    let matchResult;
+    let matchResult = undefined;
     if (matchValue[0]) {
         if (matchValue[2] > -1) {
             matchResult = 0;
@@ -189,7 +189,7 @@ export function HashSet__Add_2B595(this$, k) {
 }
 export function HashSet__Contains_2B595(this$, k) {
     const matchValue = HashSet__TryFindIndex_2B595(this$, k);
-    let matchResult;
+    let matchResult = undefined;
     if (matchValue[0]) {
         if (matchValue[2] > -1) {
             matchResult = 0;
@@ -210,7 +210,7 @@ export function HashSet__Contains_2B595(this$, k) {
 }
 export function HashSet__Remove_2B595(this$, k) {
     const matchValue = HashSet__TryFindIndex_2B595(this$, k);
-    let matchResult;
+    let matchResult = undefined;
     if (matchValue[0]) {
         if (matchValue[2] > -1) {
             matchResult = 0;

package/Native.js

@@ -1,8 +1,14 @@
 export function Helpers_allocateArrayFromCons(cons, len) {
-    if ((typeof cons) === "function") {
-        return new cons(len);
+    if (cons == null) {
+        return new Array(len);
     }
     else {
-        return new Array(len);
+        const cons_1 = cons;
+        if ((typeof cons_1) === "function") {
+            return new cons_1(len);
+        }
+        else {
+            return new Array(len);
+        }
     }
 }

package/Option.js

@@ -1,4 +1,4 @@
-import { structuralHash, equals, compare } from "./Util.js";
+import { Exception, structuralHash, equals, compare } from "./Util.js";
 // Using a class here for better compatibility with TS files importing Some
 export class Some {
     constructor(value) {
@@ -31,9 +31,17 @@ export class Some {
         }
     }
 }
+export function nonNullValue(x) {
+    if (x == null) {
+        throw new Exception("Nullable has no value");
+    }
+    else {
+        return x;
+    }
+}
 export function value(x) {
     if (x == null) {
-        throw new Error("Option has no value");
+        throw new Exception("Option has no value");
     }
     else {
         return x instanceof Some ? x.value : x;

package/Random.js

@@ -1,19 +1,20 @@
+import { ArgumentNullException_$ctor_Z721C83C5, ArgumentOutOfRangeException_$ctor_Z721C83C5 } from "./System.js";
+import { Operators_IsNull } from "./FSharp.Core.js";
 import { class_type } from "./Reflection.js";
 import { fromFloat64, op_Addition, toInt32_unchecked, toFloat64, compare, fromInt32, toInt64_unchecked } from "./BigInt.js";
-import { Operators_IsNull } from "./FSharp.Core.js";
-import { item, fill, setItem } from "./Array.js";
+import { item, setItem } from "./Array.js";
 function Native_random() {
     return Math.random();
 }
-function Native_randomNext(min, max) {
-    if (max < min) {
-        throw new Error("minValue must be less than maxValue");
+function Native_randomNext(minValue, maxValue) {
+    if (maxValue < minValue) {
+        throw ArgumentOutOfRangeException_$ctor_Z721C83C5("minValue must be less than maxValue");
     }
-    return Math.floor(Math.random() * (max - min)) + min;
+    return Math.floor(Math.random() * (maxValue - minValue)) + minValue;
 }
 function Native_randomBytes(buffer) {
-    if (buffer == null) {
-        throw new Error("Buffer cannot be null");
+    if (Operators_IsNull(buffer)) {
+        throw ArgumentNullException_$ctor_Z721C83C5("buffer");
     }
     for (let i = 0; i < buffer.length; i += 6) {
         // Pick random 48-bit number. Fill buffer in 2 24-bit chunks to avoid bitwise truncation.
@@ -59,7 +60,7 @@ export class Seeded {
         this.MBIG = 2147483647;
         this.inext = 0;
         this.inextp = 0;
-        this.seedArray = fill(new Array(56), 0, 56, 0);
+        this.seedArray = (new Int32Array(56));
         let ii = 0;
         let mj = 0;
         let mk = 0;
@@ -94,14 +95,14 @@ export class Seeded {
     Next1(maxValue) {
         const this$ = this;
         if (maxValue < 0) {
-            throw new Error("maxValue must be positive");
+            throw ArgumentOutOfRangeException_$ctor_Z721C83C5("maxValue must be positive");
         }
         return ~~(Seeded__Sample(this$) * maxValue) | 0;
     }
     Next2(minValue, maxValue) {
         const this$ = this;
         if (minValue > maxValue) {
-            throw new Error("minValue must be less than maxValue");
+            throw ArgumentOutOfRangeException_$ctor_Z721C83C5("minValue must be less than maxValue");
         }
         const range = toInt64_unchecked(fromInt32(maxValue - minValue));
         return ((compare(range, toInt64_unchecked(fromInt32(2147483647))) <= 0) ? (~~(Seeded__Sample(this$) * toFloat64(range)) + minValue) : ~~toInt32_unchecked(toInt64_unchecked(op_Addition(toInt64_unchecked(fromFloat64(Seeded__GetSampleForLargeRange(this$) * toFloat64(range))), toInt64_unchecked(fromInt32(minValue)))))) | 0;
@@ -113,7 +114,7 @@ export class Seeded {
     NextBytes(buffer) {
         const this$ = this;
         if (Operators_IsNull(buffer)) {
-            throw new Error("buffer");
+            throw ArgumentNullException_$ctor_Z721C83C5("buffer");
         }
         for (let i = 0; i <= (buffer.length - 1); i++) {
             setItem(buffer, i, (Seeded__InternalSample(this$) % (~~255 + 1)) & 0xFF);

package/Range.js

@@ -1,11 +1,11 @@
-import { compare } from "./Util.js";
+import { Exception, compare } from "./Util.js";
 import { unfold, delay } from "./Seq.js";
 import { toUInt64_unchecked, toInt64_unchecked, op_Addition, fromZero } from "./BigInt.js";
 import { op_Addition as op_Addition_1, fromParts } from "./Decimal.js";
 export function makeRangeStepFunction(step, stop, zero, add) {
     const stepComparedWithZero = compare(step, zero) | 0;
     if (stepComparedWithZero === 0) {
-        throw new Error("The step of a range cannot be zero");
+        throw new Exception("The step of a range cannot be zero");
     }
     const stepGreaterThanZero = stepComparedWithZero > 0;
     return (x) => {