@fable-org/fable-library-js 1.4.0 → 1.4.2

package/Array.js

@@ -41,7 +41,7 @@ export function last(array) {
 }
 export function tryLast(array) {
     if (array.length === 0) {
-        return void 0;
+        return undefined;
     }
     else {
         return some(item_2(array.length - 1, array));
@@ -202,7 +202,7 @@ export function indexOf(array, item_1, start, count, eq) {
     return loop(start_1) | 0;
 }
 export function contains(value, array, eq) {
-    return indexOf(array, value, void 0, void 0, eq) >= 0;
+    return indexOf(array, value, undefined, undefined, eq) >= 0;
 }
 export function empty(cons) {
     return Helpers_allocateArrayFromCons(cons, 0);
@@ -353,7 +353,7 @@ export function insertRangeInPlace(index, range, array) {
     }
 }
 export function removeInPlace(item_1, array, eq) {
-    const i = indexOf(array, item_1, void 0, void 0, eq) | 0;
+    const i = indexOf(array, item_1, undefined, undefined, eq) | 0;
     if (i > -1) {
         array.splice(i, 1);
         return true;
@@ -421,7 +421,7 @@ export function tryFindIndex(predicate, array) {
         return matchValue;
     }
     else {
-        return void 0;
+        return undefined;
     }
 }
 export function pick(chooser, array) {
@@ -451,7 +451,7 @@ export function tryPick(chooser, array) {
         loop: while (true) {
             const i = i_mut;
             if (i >= array.length) {
-                return void 0;
+                return undefined;
             }
             else {
                 const matchValue = chooser(item_2(i, array));
@@ -492,7 +492,7 @@ export function tryFindBack(predicate, array) {
         loop: while (true) {
             const i = i_mut;
             if (i < 0) {
-                return void 0;
+                return undefined;
             }
             else if (predicate(item_2(i, array))) {
                 return some(item_2(i, array));
@@ -550,7 +550,7 @@ export function tryFindIndexBack(predicate, array) {
         loop: while (true) {
             const i = i_mut;
             if (i < 0) {
-                return void 0;
+                return undefined;
             }
             else if (predicate(item_2(i, array))) {
                 return i;
@@ -887,7 +887,7 @@ export function tryExactlyOne(array) {
         return some(item_2(0, array));
     }
     else {
-        return void 0;
+        return undefined;
     }
 }
 export function head(array) {
@@ -900,7 +900,7 @@ export function head(array) {
 }
 export function tryHead(array) {
     if (array.length === 0) {
-        return void 0;
+        return undefined;
     }
     else {
         return some(item_2(0, array));
@@ -930,7 +930,7 @@ export function setItem(array, index, value) {
 }
 export function tryItem(index, array) {
     if ((index < 0) ? true : (index >= array.length)) {
-        return void 0;
+        return undefined;
     }
     else {
         return some(array[index]);

package/BigInt.js

@@ -111,10 +111,11 @@ export function toFloat16(x) { return Number(x); }
 export function toFloat32(x) { return Number(x); }
 export function toFloat64(x) { return Number(x); }
 export function toDecimal(x) {
-    const low = Number(BigInt.asUintN(32, x));
-    const mid = Number(BigInt.asUintN(32, x >> 32n));
-    const high = Number(BigInt.asUintN(32, x >> 64n));
     const isNegative = x < zero;
+    const bits = abs(x);
+    const low = Number(BigInt.asUintN(32, bits));
+    const mid = Number(BigInt.asUintN(32, bits >> 32n));
+    const high = Number(BigInt.asUintN(32, bits >> 64n));
     const scale = 0;
     return fromParts(low, mid, high, isNegative, scale);
 }

package/CHANGELOG.md

@@ -7,7 +7,19 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## Unreleased
 
-## 1.4.0 - 2024-03-18
+## 1.4.2 - 2024-06-13
+
+### Fixed
+
+* [JS/TS] Fixed BigInt.ToDecimal with negative values (#3500) (by @ncave)
+
+## 1.4.1 - 2024-06-13
+
+### Fixed
+
+* [JS/TS] Fixed DateTime.MinValue, DateTime.MaxValue (#3836) (by @ncave)
+
+## 1.4.0 - 2024-03-20
 
 ### Added
 

package/Choice.js

@@ -171,7 +171,7 @@ export function Choice_tryValueIfChoice1Of2(x) {
         return some(x.fields[0]);
     }
     else {
-        return void 0;
+        return undefined;
     }
 }
 export function Choice_tryValueIfChoice2Of2(x) {
@@ -179,6 +179,6 @@ export function Choice_tryValueIfChoice2Of2(x) {
         return some(x.fields[0]);
     }
     else {
-        return void 0;
+        return undefined;
     }
 }

package/Date.js

@@ -82,10 +82,10 @@ function dateToStringWithCustomFormat(date, format, utc) {
                 cursorPos += tokenLength;
                 switch (tokenLength) {
                     case 1:
-                        result += localizedDate.getDate();
+                        result += day(localizedDate);
                         break;
                     case 2:
-                        result += padWithZeros(localizedDate.getDate(), 2);
+                        result += padWithZeros(day(localizedDate), 2);
                         break;
                     case 3:
                         result += shortDays[dayOfWeek(localizedDate)];
@@ -469,11 +469,11 @@ export function getTicks(date) {
 }
 export function minValue() {
     // This is "0001-01-01T00:00:00.000Z", actual JS min value is -8640000000000000
-    return DateTime(-62135596800000, 0 /* DateKind.Unspecified */);
+    return DateTime(-62135596800000, 1 /* DateKind.UTC */);
 }
 export function maxValue() {
     // This is "9999-12-31T23:59:59.999Z", actual JS max value is 8640000000000000
-    return DateTime(253402300799999, 0 /* DateKind.Unspecified */);
+    return DateTime(253402300799999, 1 /* DateKind.UTC */);
 }
 export function parseRaw(input) {
     function fail() {

package/List.js

@@ -178,7 +178,7 @@ export function ListEnumerator$1_$ctor_3002E699(xs) {
     return new ListEnumerator$1(xs);
 }
 export function FSharpList_get_Empty() {
-    return new FSharpList(defaultOf(), void 0);
+    return new FSharpList(defaultOf(), undefined);
 }
 export function FSharpList_Cons_305B8EAC(x, xs) {
     return new FSharpList(x, xs);
@@ -268,7 +268,7 @@ export function head(xs) {
 }
 export function tryHead(xs) {
     if (FSharpList__get_IsEmpty(xs)) {
-        return void 0;
+        return undefined;
     }
     else {
         return some(FSharpList__get_Head(xs));
@@ -281,7 +281,7 @@ export function tryLast(xs_mut) {
     tryLast: while (true) {
         const xs = xs_mut;
         if (FSharpList__get_IsEmpty(xs)) {
-            return void 0;
+            return undefined;
         }
         else {
             const t = FSharpList__get_Tail(xs);
@@ -411,7 +411,7 @@ export function unfold(gen, state) {
             const matchValue = gen(acc);
             if (matchValue != null) {
                 acc_mut = value_1(matchValue)[1];
-                node_mut = ((t = (new FSharpList(value_1(matchValue)[0], void 0)), (node.tail = t, t)));
+                node_mut = ((t = (new FSharpList(value_1(matchValue)[0], undefined)), (node.tail = t, t)));
                 continue loop;
             }
             else {
@@ -429,12 +429,12 @@ export function unfold(gen, state) {
 export function iterate(action, xs) {
     fold((unitVar, x) => {
         action(x);
-    }, void 0, xs);
+    }, undefined, xs);
 }
 export function iterate2(action, xs, ys) {
     fold2((unitVar, x, y) => {
         action(x, y);
-    }, void 0, xs, ys);
+    }, undefined, xs, ys);
 }
 export function iterateIndexed(action, xs) {
     fold((i, x) => {
@@ -476,7 +476,7 @@ export function ofSeq(xs) {
         try {
             while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
                 const x = enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]();
-                node = ((xs_3 = node, (t = (new FSharpList(x, void 0)), (xs_3.tail = t, t))));
+                node = ((xs_3 = node, (t = (new FSharpList(x, undefined)), (xs_3.tail = t, t))));
             }
         }
         finally {
@@ -493,7 +493,7 @@ export function concat(lists) {
     let node = root;
     const action = (xs) => {
         node = fold((acc, x) => {
-            const t = new FSharpList(x, void 0);
+            const t = new FSharpList(x, undefined);
             acc.tail = t;
             return t;
         }, node, xs);
@@ -525,14 +525,14 @@ export function scan(folder, state, xs) {
     let xs_4, t_2;
     const root = FSharpList_get_Empty();
     let node;
-    const t = new FSharpList(state, void 0);
+    const t = new FSharpList(state, undefined);
     root.tail = t;
     node = t;
     let acc = state;
     let xs_3 = xs;
     while (!FSharpList__get_IsEmpty(xs_3)) {
         acc = folder(acc, FSharpList__get_Head(xs_3));
-        node = ((xs_4 = node, (t_2 = (new FSharpList(acc, void 0)), (xs_4.tail = t_2, t_2))));
+        node = ((xs_4 = node, (t_2 = (new FSharpList(acc, undefined)), (xs_4.tail = t_2, t_2))));
         xs_3 = FSharpList__get_Tail(xs_3);
     }
     const xs_6 = node;
@@ -554,7 +554,7 @@ export function collect(mapping, xs) {
     while (!FSharpList__get_IsEmpty(ys)) {
         let zs = mapping(FSharpList__get_Head(ys));
         while (!FSharpList__get_IsEmpty(zs)) {
-            node = ((xs_1 = node, (t = (new FSharpList(FSharpList__get_Head(zs), void 0)), (xs_1.tail = t, t))));
+            node = ((xs_1 = node, (t = (new FSharpList(FSharpList__get_Head(zs), undefined)), (xs_1.tail = t, t))));
             zs = FSharpList__get_Tail(zs);
         }
         ys = FSharpList__get_Tail(ys);
@@ -567,7 +567,7 @@ export function collect(mapping, xs) {
 export function mapIndexed(mapping, xs) {
     const root = FSharpList_get_Empty();
     const node = foldIndexed((i, acc, x) => {
-        const t = new FSharpList(mapping(i, x), void 0);
+        const t = new FSharpList(mapping(i, x), undefined);
         acc.tail = t;
         return t;
     }, root, xs);
@@ -578,7 +578,7 @@ export function mapIndexed(mapping, xs) {
 export function map(mapping, xs) {
     const root = FSharpList_get_Empty();
     const node = fold((acc, x) => {
-        const t = new FSharpList(mapping(x), void 0);
+        const t = new FSharpList(mapping(x), undefined);
         acc.tail = t;
         return t;
     }, root, xs);
@@ -592,7 +592,7 @@ export function indexed(xs) {
 export function map2(mapping, xs, ys) {
     const root = FSharpList_get_Empty();
     const node = fold2((acc, x, y) => {
-        const t = new FSharpList(mapping(x, y), void 0);
+        const t = new FSharpList(mapping(x, y), undefined);
         acc.tail = t;
         return t;
     }, root, xs, ys);
@@ -610,7 +610,7 @@ export function mapIndexed2(mapping, xs, ys) {
             }
             else {
                 i_mut = (i + 1);
-                acc_mut = ((t = (new FSharpList(mapping(i, FSharpList__get_Head(xs_1), FSharpList__get_Head(ys_1)), void 0)), (acc.tail = t, t)));
+                acc_mut = ((t = (new FSharpList(mapping(i, FSharpList__get_Head(xs_1), FSharpList__get_Head(ys_1)), undefined)), (acc.tail = t, t)));
                 xs_1_mut = FSharpList__get_Tail(xs_1);
                 ys_1_mut = FSharpList__get_Tail(ys_1);
                 continue loop;
@@ -633,7 +633,7 @@ export function map3(mapping, xs, ys, zs) {
                 return acc;
             }
             else {
-                acc_mut = ((t = (new FSharpList(mapping(FSharpList__get_Head(xs_1), FSharpList__get_Head(ys_1), FSharpList__get_Head(zs_1)), void 0)), (acc.tail = t, t)));
+                acc_mut = ((t = (new FSharpList(mapping(FSharpList__get_Head(xs_1), FSharpList__get_Head(ys_1), FSharpList__get_Head(zs_1)), undefined)), (acc.tail = t, t)));
                 xs_1_mut = FSharpList__get_Tail(xs_1);
                 ys_1_mut = FSharpList__get_Tail(ys_1);
                 zs_1_mut = FSharpList__get_Tail(zs_1);
@@ -653,7 +653,7 @@ export function mapFold(mapping, state, xs) {
     const patternInput_1 = fold((tupledArg, x) => {
         let t;
         const patternInput = mapping(tupledArg[1], x);
-        return [(t = (new FSharpList(patternInput[0], void 0)), (tupledArg[0].tail = t, t)), patternInput[1]];
+        return [(t = (new FSharpList(patternInput[0], undefined)), (tupledArg[0].tail = t, t)), patternInput[1]];
     }, [root, state], xs);
     const t_2 = FSharpList_get_Empty();
     patternInput_1[0].tail = t_2;
@@ -667,7 +667,7 @@ export function tryPick(f, xs) {
         loop: while (true) {
             const xs_1 = xs_1_mut;
             if (FSharpList__get_IsEmpty(xs_1)) {
-                return void 0;
+                return undefined;
             }
             else {
                 const matchValue = f(FSharpList__get_Head(xs_1));
@@ -694,7 +694,7 @@ export function pick(f, xs) {
     }
 }
 export function tryFind(f, xs) {
-    return tryPick((x) => (f(x) ? some(x) : void 0), xs);
+    return tryPick((x) => (f(x) ? some(x) : undefined), xs);
 }
 export function find(f, xs) {
     const matchValue = tryFind(f, xs);
@@ -722,7 +722,7 @@ export function tryFindIndex(f, xs) {
         loop: while (true) {
             const i = i_mut, xs_1 = xs_1_mut;
             if (FSharpList__get_IsEmpty(xs_1)) {
-                return void 0;
+                return undefined;
             }
             else if (f(FSharpList__get_Head(xs_1))) {
                 return i;
@@ -765,7 +765,7 @@ export function tryItem(n, xs) {
         loop: while (true) {
             const i = i_mut, xs_1 = xs_1_mut;
             if (FSharpList__get_IsEmpty(xs_1)) {
-                return void 0;
+                return undefined;
             }
             else if (i === n) {
                 return some(FSharpList__get_Head(xs_1));
@@ -787,7 +787,7 @@ export function filter(f, xs) {
     const root = FSharpList_get_Empty();
     const node = fold((acc, x) => {
         if (f(x)) {
-            const t = new FSharpList(x, void 0);
+            const t = new FSharpList(x, undefined);
             acc.tail = t;
             return t;
         }
@@ -808,10 +808,10 @@ export function partition(f, xs) {
         const lacc = tupledArg[0];
         const racc = tupledArg[1];
         if (f(x)) {
-            return [(t = (new FSharpList(x, void 0)), (lacc.tail = t, t)), racc];
+            return [(t = (new FSharpList(x, undefined)), (lacc.tail = t, t)), racc];
         }
         else {
-            return [lacc, (t_2 = (new FSharpList(x, void 0)), (racc.tail = t_2, t_2))];
+            return [lacc, (t_2 = (new FSharpList(x, undefined)), (racc.tail = t_2, t_2))];
         }
     }, [root1, root2], xs);
     const t_4 = FSharpList_get_Empty();
@@ -828,7 +828,7 @@ export function choose(f, xs) {
             return acc;
         }
         else {
-            const t = new FSharpList(value_1(matchValue), void 0);
+            const t = new FSharpList(value_1(matchValue), undefined);
             acc.tail = t;
             return t;
         }
@@ -845,7 +845,7 @@ export function initialize(n, f) {
     const root = FSharpList_get_Empty();
     let node = root;
     for (let i = 0; i <= (n - 1); i++) {
-        node = ((xs = node, (t = (new FSharpList(f(i), void 0)), (xs.tail = t, t))));
+        node = ((xs = node, (t = (new FSharpList(f(i), undefined)), (xs.tail = t, t))));
     }
     const xs_2 = node;
     const t_2 = FSharpList_get_Empty();
@@ -994,7 +994,7 @@ export function allPairs(xs, ys) {
     iterate((x) => {
         iterate((y) => {
             let xs_1, t;
-            node = ((xs_1 = node, (t = (new FSharpList([x, y], void 0)), (xs_1.tail = t, t))));
+            node = ((xs_1 = node, (t = (new FSharpList([x, y], undefined)), (xs_1.tail = t, t))));
         }, ys);
     }, xs);
     const xs_3 = node;
@@ -1052,7 +1052,7 @@ export function take(count, xs) {
             }
             else {
                 i_mut = (i - 1);
-                acc_mut = ((t = (new FSharpList(FSharpList__get_Head(xs_1), void 0)), (acc.tail = t, t)));
+                acc_mut = ((t = (new FSharpList(FSharpList__get_Head(xs_1), undefined)), (acc.tail = t, t)));
                 xs_1_mut = FSharpList__get_Tail(xs_1);
                 continue loop;
             }
@@ -1077,7 +1077,7 @@ export function takeWhile(predicate, xs) {
                 return acc;
             }
             else {
-                acc_mut = ((t = (new FSharpList(FSharpList__get_Head(xs_1), void 0)), (acc.tail = t, t)));
+                acc_mut = ((t = (new FSharpList(FSharpList__get_Head(xs_1), undefined)), (acc.tail = t, t)));
                 xs_1_mut = FSharpList__get_Tail(xs_1);
                 continue loop;
             }
@@ -1103,7 +1103,7 @@ export function truncate(count, xs) {
             }
             else {
                 i_mut = (i - 1);
-                acc_mut = ((t = (new FSharpList(FSharpList__get_Head(xs_1), void 0)), (acc.tail = t, t)));
+                acc_mut = ((t = (new FSharpList(FSharpList__get_Head(xs_1), undefined)), (acc.tail = t, t)));
                 xs_1_mut = FSharpList__get_Tail(xs_1);
                 continue loop;
             }
@@ -1156,7 +1156,7 @@ export function tryExactlyOne(xs) {
         return some(FSharpList__get_Head(xs));
     }
     else {
-        return void 0;
+        return undefined;
     }
 }
 export function where(predicate, xs) {

package/Map.js

@@ -48,7 +48,7 @@ export function MapTreeNode$2__get_Height(_) {
     return _.h;
 }
 export function MapTreeModule_empty() {
-    return void 0;
+    return undefined;
 }
 export function MapTreeModule_sizeAux(acc_mut, m_mut) {
     MapTreeModule_sizeAux: while (true) {
@@ -217,11 +217,11 @@ export function MapTreeModule_tryFind(comparer_mut, k_mut, m_mut) {
                 continue MapTreeModule_tryFind;
             }
             else {
-                return void 0;
+                return undefined;
             }
         }
         else {
-            return void 0;
+            return undefined;
         }
         break;
     }
@@ -398,7 +398,7 @@ export function MapTreeModule_change(comparer, k, u, m) {
         else {
             const c_1 = comparer.Compare(k, MapTreeLeaf$2__get_Key(m2)) | 0;
             if (c_1 < 0) {
-                const matchValue_2 = u(void 0);
+                const matchValue_2 = u(undefined);
                 if (matchValue_2 != null) {
                     return MapTreeNode$2_$ctor_Z39DE9543(k, value_1(matchValue_2), MapTreeModule_empty(), m, 2);
                 }
@@ -416,7 +416,7 @@ export function MapTreeModule_change(comparer, k, u, m) {
                 }
             }
             else {
-                const matchValue_4 = u(void 0);
+                const matchValue_4 = u(undefined);
                 if (matchValue_4 != null) {
                     return MapTreeNode$2_$ctor_Z39DE9543(k, value_1(matchValue_4), m, MapTreeModule_empty(), 2);
                 }
@@ -427,7 +427,7 @@ export function MapTreeModule_change(comparer, k, u, m) {
         }
     }
     else {
-        const matchValue = u(void 0);
+        const matchValue = u(undefined);
         if (matchValue != null) {
             return MapTreeLeaf$2_$ctor_5BDDA1(k, value_1(matchValue));
         }
@@ -521,7 +521,7 @@ export function MapTreeModule_tryPickOpt(f_mut, m_mut) {
             }
         }
         else {
-            return void 0;
+            return undefined;
         }
         break;
     }
@@ -928,7 +928,7 @@ export function MapTreeModule_toSeq(s) {
             return [en_1["System.Collections.Generic.IEnumerator`1.get_Current"](), en_1];
         }
         else {
-            return void 0;
+            return undefined;
         }
     }, MapTreeModule_mkIEnumerator(s));
 }
@@ -1346,7 +1346,7 @@ export function findKey(predicate, table) {
             return some(k);
         }
         else {
-            return void 0;
+            return undefined;
         }
     }, table);
 }
@@ -1357,7 +1357,7 @@ export function tryFindKey(predicate, table) {
             return some(k);
         }
         else {
-            return void 0;
+            return undefined;
         }
     }, table);
 }

package/MutableMap.js

@@ -221,7 +221,7 @@ export function Dictionary__TryFind_2B595(this$, k) {
         case 0:
             return getItemFromDict(this$.hashMap, matchValue[1])[matchValue[2]];
         default:
-            return void 0;
+            return undefined;
     }
 }
 export function Dictionary__get_Comparer(this$) {

package/MutableSet.js

@@ -148,7 +148,7 @@ function HashSet__TryFind_2B595(this$, k) {
         case 0:
             return some(getItemFromDict(this$.hashMap, matchValue[1])[matchValue[2]]);
         default:
-            return void 0;
+            return undefined;
     }
 }
 export function HashSet__get_Comparer(this$) {

package/Random.js

@@ -48,7 +48,7 @@ export class NonSeeded {
     }
 }
 export function NonSeeded_$reflection() {
-    return class_type("Random.NonSeeded", void 0, NonSeeded);
+    return class_type("Random.NonSeeded", undefined, NonSeeded);
 }
 export function NonSeeded_$ctor() {
     return new NonSeeded();
@@ -120,7 +120,7 @@ export class Seeded {
     }
 }
 export function Seeded_$reflection() {
-    return class_type("Random.Seeded", void 0, Seeded);
+    return class_type("Random.Seeded", undefined, Seeded);
 }
 export function Seeded_$ctor_Z524259A4(seed) {
     return new Seeded(seed);

package/Range.js

@@ -10,7 +10,7 @@ export function makeRangeStepFunction(step, stop, zero, add) {
     const stepGreaterThanZero = stepComparedWithZero > 0;
     return (x) => {
         const comparedWithLast = compare(x, stop) | 0;
-        return ((stepGreaterThanZero && (comparedWithLast <= 0)) ? true : (!stepGreaterThanZero && (comparedWithLast >= 0))) ? [x, add(x, step)] : void 0;
+        return ((stepGreaterThanZero && (comparedWithLast <= 0)) ? true : (!stepGreaterThanZero && (comparedWithLast >= 0))) ? [x, add(x, step)] : undefined;
     };
 }
 export function integralRangeStep(start, step, stop, zero, add) {
@@ -33,13 +33,13 @@ export function rangeUInt64(start, step, stop) {
     return integralRangeStep(start, step, stop, 0n, (x, y) => toUInt64(op_Addition(x, y)));
 }
 export function rangeChar(start, stop) {
-    const intStop = stop.charCodeAt(0) | 0;
+    const intStop = ~~stop.charCodeAt(0) | 0;
     return delay(() => unfold((c) => {
         if (c <= intStop) {
             return [String.fromCharCode(c), c + 1];
         }
         else {
-            return void 0;
+            return undefined;
         }
-    }, start.charCodeAt(0)));
+    }, ~~start.charCodeAt(0)));
 }

package/Result.js

@@ -152,7 +152,7 @@ export function Result_ToOption(result) {
         return some(result.fields[0]);
     }
     else {
-        return void 0;
+        return undefined;
     }
 }
 export function Result_ToValueOption(result) {
@@ -160,6 +160,6 @@ export function Result_ToValueOption(result) {
         return some(result.fields[0]);
     }
     else {
-        return void 0;
+        return undefined;
     }
 }

package/Seq.js

@@ -100,16 +100,15 @@ export function Enumerator_FromFunctions$1_$ctor_58C54629(current, next, dispose
 }
 export function Enumerator_cast(e) {
     return Enumerator_FromFunctions$1_$ctor_58C54629(() => e["System.Collections.Generic.IEnumerator`1.get_Current"](), () => e["System.Collections.IEnumerator.MoveNext"](), () => {
-        const e_1 = e;
-        disposeSafe(e_1);
+        disposeSafe(e);
     });
 }
 export function Enumerator_concat(sources) {
-    let outerOpt = void 0;
-    let innerOpt = void 0;
+    let outerOpt = undefined;
+    let innerOpt = undefined;
     let started = false;
     let finished = false;
-    let curr = void 0;
+    let curr = undefined;
     const finish = () => {
         finished = true;
         if (innerOpt != null) {
@@ -118,7 +117,7 @@ export function Enumerator_concat(sources) {
                 disposeSafe(inner);
             }
             finally {
-                innerOpt = void 0;
+                innerOpt = undefined;
             }
         }
         if (outerOpt != null) {
@@ -127,7 +126,7 @@ export function Enumerator_concat(sources) {
                 disposeSafe(outer);
             }
             finally {
-                outerOpt = void 0;
+                outerOpt = undefined;
             }
         }
     };
@@ -153,7 +152,7 @@ export function Enumerator_concat(sources) {
             return false;
         }
         else {
-            let res = void 0;
+            let res = undefined;
             while (res == null) {
                 const outerOpt_1 = outerOpt;
                 const innerOpt_1 = innerOpt;
@@ -169,7 +168,7 @@ export function Enumerator_concat(sources) {
                                 disposeSafe(inner_1);
                             }
                             finally {
-                                innerOpt = void 0;
+                                innerOpt = undefined;
                             }
                         }
                     }
@@ -209,7 +208,7 @@ export function Enumerator_enumerateThenFinally(f, e) {
 }
 export function Enumerator_generateWhileSome(openf, compute, closef) {
     let started = false;
-    let curr = void 0;
+    let curr = undefined;
     let state = some(openf());
     const dispose = () => {
         if (state != null) {
@@ -218,7 +217,7 @@ export function Enumerator_generateWhileSome(openf, compute, closef) {
                 closef(x_1);
             }
             finally {
-                state = void 0;
+                state = undefined;
             }
         }
     };
@@ -227,7 +226,7 @@ export function Enumerator_generateWhileSome(openf, compute, closef) {
             dispose();
         }
         finally {
-            curr = void 0;
+            curr = undefined;
         }
     };
     return Enumerator_FromFunctions$1_$ctor_58C54629(() => {
@@ -269,7 +268,7 @@ export function Enumerator_generateWhileSome(openf, compute, closef) {
     }, dispose);
 }
 export function Enumerator_unfold(f, state) {
-    let curr = void 0;
+    let curr = undefined;
     let acc = state;
     return Enumerator_FromFunctions$1_$ctor_58C54629(() => {
         if (curr != null) {
@@ -373,7 +372,7 @@ export function cast(xs) {
 }
 export function choose(chooser, xs) {
     return generate(() => ofSeq(xs), (e) => {
-        let curr = void 0;
+        let curr = undefined;
         while ((curr == null) && e["System.Collections.IEnumerator.MoveNext"]()) {
             curr = chooser(e["System.Collections.Generic.IEnumerator`1.get_Current"]());
         }
@@ -421,7 +420,7 @@ export function contains(value, xs, comparer) {
     }
 }
 export function enumerateFromFunctions(create, moveNext, current) {
-    return generate(create, (x) => (moveNext(x) ? some(current(x)) : void 0), (x_1) => {
+    return generate(create, (x) => (moveNext(x) ? some(current(x)) : undefined), (x_1) => {
         const matchValue = x_1;
         if (isDisposable(matchValue)) {
             const id = matchValue;
@@ -461,7 +460,7 @@ export function enumerateUsing(resource, source) {
     });
 }
 export function enumerateWhile(guard, xs) {
-    return concat(unfold((i) => (guard() ? [xs, i + 1] : void 0), 0));
+    return concat(unfold((i) => (guard() ? [xs, i + 1] : undefined), 0));
 }
 export function filter(f, xs) {
     return choose((x) => {
@@ -469,7 +468,7 @@ export function filter(f, xs) {
             return some(x);
         }
         else {
-            return void 0;
+            return undefined;
         }
     }, xs);
 }
@@ -530,10 +529,10 @@ export function tryExactlyOne(xs) {
     try {
         if (e["System.Collections.IEnumerator.MoveNext"]()) {
             const v = e["System.Collections.Generic.IEnumerator`1.get_Current"]();
-            return e["System.Collections.IEnumerator.MoveNext"]() ? void 0 : some(v);
+            return e["System.Collections.IEnumerator.MoveNext"]() ? undefined : some(v);
         }
         else {
-            return void 0;
+            return undefined;
         }
     }
     finally {
@@ -543,7 +542,7 @@ export function tryExactlyOne(xs) {
 export function tryFind(predicate, xs) {
     const e = ofSeq(xs);
     try {
-        let res = void 0;
+        let res = undefined;
         while ((res == null) && e["System.Collections.IEnumerator.MoveNext"]()) {
             const c = e["System.Collections.Generic.IEnumerator`1.get_Current"]();
             if (predicate(c)) {
@@ -593,7 +592,7 @@ export function tryFindIndex(predicate, xs) {
                     }
                 }
                 else {
-                    return void 0;
+                    return undefined;
                 }
                 break;
             }
@@ -681,7 +680,7 @@ export function tryHead(xs) {
     else {
         const e = ofSeq(xs);
         try {
-            return e["System.Collections.IEnumerator.MoveNext"]() ? some(e["System.Collections.Generic.IEnumerator`1.get_Current"]()) : void 0;
+            return e["System.Collections.IEnumerator.MoveNext"]() ? some(e["System.Collections.Generic.IEnumerator`1.get_Current"]()) : undefined;
         }
         finally {
             disposeSafe(e);
@@ -698,7 +697,7 @@ export function head(xs) {
     }
 }
 export function initialize(count, f) {
-    return unfold((i) => ((i < count) ? [f(i), i + 1] : void 0), 0);
+    return unfold((i) => ((i < count) ? [f(i), i + 1] : undefined), 0);
 }
 export function initializeInfinite(f) {
     return initialize(2147483647, f);
@@ -735,7 +734,7 @@ export function tryItem(index, xs) {
                 loop: while (true) {
                     const index_1 = index_1_mut;
                     if (!e["System.Collections.IEnumerator.MoveNext"]()) {
-                        return void 0;
+                        return undefined;
                     }
                     else if (index_1 === 0) {
                         return some(e["System.Collections.Generic.IEnumerator`1.get_Current"]());
@@ -766,12 +765,12 @@ export function item(index, xs) {
 export function iterate(action, xs) {
     fold((unitVar, x) => {
         action(x);
-    }, void 0, xs);
+    }, undefined, xs);
 }
 export function iterate2(action, xs, ys) {
     fold2((unitVar, x, y) => {
         action(x, y);
-    }, void 0, xs, ys);
+    }, undefined, xs, ys);
 }
 export function iterateIndexed(action, xs) {
     fold((i, x) => {
@@ -801,7 +800,7 @@ export function tryLast(xs) {
                 break;
             }
         };
-        return e["System.Collections.IEnumerator.MoveNext"]() ? some(loop(e["System.Collections.Generic.IEnumerator`1.get_Current"]())) : void 0;
+        return e["System.Collections.IEnumerator.MoveNext"]() ? some(loop(e["System.Collections.Generic.IEnumerator`1.get_Current"]())) : undefined;
     }
     finally {
         disposeSafe(e);
@@ -839,12 +838,12 @@ export function length(xs) {
     }
 }
 export function map(mapping, xs) {
-    return generate(() => ofSeq(xs), (e) => (e["System.Collections.IEnumerator.MoveNext"]() ? some(mapping(e["System.Collections.Generic.IEnumerator`1.get_Current"]())) : void 0), (e_1) => {
+    return generate(() => ofSeq(xs), (e) => (e["System.Collections.IEnumerator.MoveNext"]() ? some(mapping(e["System.Collections.Generic.IEnumerator`1.get_Current"]())) : undefined), (e_1) => {
         disposeSafe(e_1);
     });
 }
 export function mapIndexed(mapping, xs) {
-    return generateIndexed(() => ofSeq(xs), (i, e) => (e["System.Collections.IEnumerator.MoveNext"]() ? some(mapping(i, e["System.Collections.Generic.IEnumerator`1.get_Current"]())) : void 0), (e_1) => {
+    return generateIndexed(() => ofSeq(xs), (i, e) => (e["System.Collections.IEnumerator.MoveNext"]() ? some(mapping(i, e["System.Collections.Generic.IEnumerator`1.get_Current"]())) : undefined), (e_1) => {
         disposeSafe(e_1);
     });
 }
@@ -855,7 +854,7 @@ export function map2(mapping, xs, ys) {
     return generate(() => [ofSeq(xs), ofSeq(ys)], (tupledArg) => {
         const e1 = tupledArg[0];
         const e2 = tupledArg[1];
-        return (e1["System.Collections.IEnumerator.MoveNext"]() && e2["System.Collections.IEnumerator.MoveNext"]()) ? some(mapping(e1["System.Collections.Generic.IEnumerator`1.get_Current"](), e2["System.Collections.Generic.IEnumerator`1.get_Current"]())) : void 0;
+        return (e1["System.Collections.IEnumerator.MoveNext"]() && e2["System.Collections.IEnumerator.MoveNext"]()) ? some(mapping(e1["System.Collections.Generic.IEnumerator`1.get_Current"](), e2["System.Collections.Generic.IEnumerator`1.get_Current"]())) : undefined;
     }, (tupledArg_1) => {
         try {
             disposeSafe(tupledArg_1[0]);
@@ -869,7 +868,7 @@ export function mapIndexed2(mapping, xs, ys) {
     return generateIndexed(() => [ofSeq(xs), ofSeq(ys)], (i, tupledArg) => {
         const e1 = tupledArg[0];
         const e2 = tupledArg[1];
-        return (e1["System.Collections.IEnumerator.MoveNext"]() && e2["System.Collections.IEnumerator.MoveNext"]()) ? some(mapping(i, e1["System.Collections.Generic.IEnumerator`1.get_Current"](), e2["System.Collections.Generic.IEnumerator`1.get_Current"]())) : void 0;
+        return (e1["System.Collections.IEnumerator.MoveNext"]() && e2["System.Collections.IEnumerator.MoveNext"]()) ? some(mapping(i, e1["System.Collections.Generic.IEnumerator`1.get_Current"](), e2["System.Collections.Generic.IEnumerator`1.get_Current"]())) : undefined;
     }, (tupledArg_1) => {
         try {
             disposeSafe(tupledArg_1[0]);
@@ -884,7 +883,7 @@ export function map3(mapping, xs, ys, zs) {
         const e1 = tupledArg[0];
         const e2 = tupledArg[1];
         const e3 = tupledArg[2];
-        return ((e1["System.Collections.IEnumerator.MoveNext"]() && e2["System.Collections.IEnumerator.MoveNext"]()) && e3["System.Collections.IEnumerator.MoveNext"]()) ? some(mapping(e1["System.Collections.Generic.IEnumerator`1.get_Current"](), e2["System.Collections.Generic.IEnumerator`1.get_Current"](), e3["System.Collections.Generic.IEnumerator`1.get_Current"]())) : void 0;
+        return ((e1["System.Collections.IEnumerator.MoveNext"]() && e2["System.Collections.IEnumerator.MoveNext"]()) && e3["System.Collections.IEnumerator.MoveNext"]()) ? some(mapping(e1["System.Collections.Generic.IEnumerator`1.get_Current"](), e2["System.Collections.Generic.IEnumerator`1.get_Current"](), e3["System.Collections.Generic.IEnumerator`1.get_Current"]())) : undefined;
     }, (tupledArg_1) => {
         try {
             disposeSafe(tupledArg_1[0]);
@@ -936,7 +935,7 @@ export function CachedSeq$1__Clear(_) {
 export function cache(source) {
     checkNonNull("source", source);
     const prefix = [];
-    let enumeratorR = void 0;
+    let enumeratorR = undefined;
     return CachedSeq$1_$ctor_Z7A8347D4(() => {
         Operators_Lock(prefix, () => {
             clear(prefix);
@@ -959,7 +958,7 @@ export function cache(source) {
                     break;
                 }
             }
-            enumeratorR = void 0;
+            enumeratorR = undefined;
         });
     }, unfold((i_1) => Operators_Lock(prefix, () => {
         if (i_1 < prefix.length) {
@@ -985,7 +984,7 @@ export function cache(source) {
                     }
                     else {
                         disposeSafe(enumerator);
-                        enumeratorR = some(void 0);
+                        enumeratorR = some(undefined);
                     }
                 }
             }
@@ -993,7 +992,7 @@ export function cache(source) {
                 return [prefix[i_1], i_1 + 1];
             }
             else {
-                return void 0;
+                return undefined;
             }
         }
     }), 0));
@@ -1013,7 +1012,7 @@ export function mapFoldBack(mapping, xs, state) {
 export function tryPick(chooser, xs) {
     const e = ofSeq(xs);
     try {
-        let res = void 0;
+        let res = undefined;
         while ((res == null) && e["System.Collections.IEnumerator.MoveNext"]()) {
             res = chooser(e["System.Collections.Generic.IEnumerator`1.get_Current"]());
         }
@@ -1129,19 +1128,19 @@ export function take(count, xs) {
             }
         }
         else {
-            return void 0;
+            return undefined;
         }
     }, (e_1) => {
         disposeSafe(e_1);
     });
 }
 export function takeWhile(predicate, xs) {
-    return generate(() => ofSeq(xs), (e) => ((e["System.Collections.IEnumerator.MoveNext"]() && predicate(e["System.Collections.Generic.IEnumerator`1.get_Current"]())) ? some(e["System.Collections.Generic.IEnumerator`1.get_Current"]()) : void 0), (e_1) => {
+    return generate(() => ofSeq(xs), (e) => ((e["System.Collections.IEnumerator.MoveNext"]() && predicate(e["System.Collections.Generic.IEnumerator`1.get_Current"]())) ? some(e["System.Collections.Generic.IEnumerator`1.get_Current"]()) : undefined), (e_1) => {
         disposeSafe(e_1);
     });
 }
 export function truncate(count, xs) {
-    return generateIndexed(() => ofSeq(xs), (i, e) => (((i < count) && e["System.Collections.IEnumerator.MoveNext"]()) ? some(e["System.Collections.Generic.IEnumerator`1.get_Current"]()) : void 0), (e_1) => {
+    return generateIndexed(() => ofSeq(xs), (i, e) => (((i < count) && e["System.Collections.IEnumerator.MoveNext"]()) ? some(e["System.Collections.Generic.IEnumerator`1.get_Current"]()) : undefined), (e_1) => {
         disposeSafe(e_1);
     });
 }
@@ -1255,7 +1254,7 @@ export function insertAt(index, y, xs) {
             if (!isDone) {
                 throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
             }
-            return void 0;
+            return undefined;
         }
     }, (e_1) => {
         disposeSafe(e_1);
@@ -1279,11 +1278,11 @@ export function insertManyAt(index, ys, xs) {
             }
             else {
                 status = 1;
-                inserted = void 0;
+                inserted = undefined;
             }
         }
         else {
-            inserted = void 0;
+            inserted = undefined;
         }
         if (inserted == null) {
             if (e1["System.Collections.IEnumerator.MoveNext"]()) {
@@ -1293,7 +1292,7 @@ export function insertManyAt(index, ys, xs) {
                 if (status < 1) {
                     throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
                 }
-                return void 0;
+                return undefined;
             }
         }
         else {
@@ -1315,13 +1314,13 @@ export function removeAt(index, xs) {
         }
         else if ((i === index) && e["System.Collections.IEnumerator.MoveNext"]()) {
             isDone = true;
-            return e["System.Collections.IEnumerator.MoveNext"]() ? some(e["System.Collections.Generic.IEnumerator`1.get_Current"]()) : void 0;
+            return e["System.Collections.IEnumerator.MoveNext"]() ? some(e["System.Collections.Generic.IEnumerator`1.get_Current"]()) : undefined;
         }
         else {
             if (!isDone) {
                 throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
             }
-            return void 0;
+            return undefined;
         }
     }, (e_1) => {
         disposeSafe(e_1);
@@ -1348,7 +1347,7 @@ export function removeManyAt(index, count, xs) {
                     }
                 }
             }
-            return e["System.Collections.IEnumerator.MoveNext"]() ? some(e["System.Collections.Generic.IEnumerator`1.get_Current"]()) : void 0;
+            return e["System.Collections.IEnumerator.MoveNext"]() ? some(e["System.Collections.Generic.IEnumerator`1.get_Current"]()) : undefined;
         }
     }, (e_1) => {
         disposeSafe(e_1);
@@ -1371,7 +1370,7 @@ export function updateAt(index, y, xs) {
             if (!isDone) {
                 throw new Error((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
             }
-            return void 0;
+            return undefined;
         }
     }, (e_1) => {
         disposeSafe(e_1);

package/Set.js

@@ -45,7 +45,7 @@ export function SetTreeNode$1__get_Height(_) {
     return _.h;
 }
 export function SetTreeModule_empty() {
-    return void 0;
+    return undefined;
 }
 export function SetTreeModule_countAux(t_mut, acc_mut) {
     SetTreeModule_countAux: while (true) {
@@ -688,7 +688,7 @@ export function SetTreeModule_minimumElementOpt(t) {
         }
     }
     else {
-        return void 0;
+        return undefined;
     }
 }
 export function SetTreeModule_maximumElementAux(t_mut, n_mut) {
@@ -724,7 +724,7 @@ export function SetTreeModule_maximumElementOpt(t) {
         }
     }
     else {
-        return void 0;
+        return undefined;
     }
 }
 export function SetTreeModule_minimumElement(s) {

package/System.Text.js

@@ -15,7 +15,7 @@ export class StringBuilder {
     }
 }
 export function StringBuilder_$reflection() {
-    return class_type("System.Text.StringBuilder", void 0, StringBuilder);
+    return class_type("System.Text.StringBuilder", undefined, StringBuilder);
 }
 export function StringBuilder_$ctor_Z18115A39(value, capacity) {
     return new StringBuilder(value, capacity);

package/TimeSpan.js

@@ -1,5 +1,5 @@
 import { comparePrimitives, padLeftAndRightWithZeros, padWithZeros } from "./Util.js";
-import { toInt64 } from "./BigInt.js";
+import { toInt64, fromFloat64 } from "./BigInt.js";
 /**
  * Calls:
  * - `Math.ceil` if the `value` is **negative**
@@ -55,7 +55,7 @@ export function milliseconds(ts) {
     return signedRound(ts % 1000);
 }
 export function ticks(ts) {
-    return toInt64(BigInt(ts) * 10000n);
+    return toInt64(fromFloat64(ts * 10000));
 }
 export function totalDays(ts) {
     return ts / 86400000;

package/package.json

@@ -3,7 +3,7 @@
   "private": false,
   "type": "module",
   "name": "@fable-org/fable-library-js",
-  "version": "1.4.0",
+  "version": "1.4.2",
   "description": "Core library used by F# projects compiled with fable.io",
   "author": "Fable Contributors",
   "license": "MIT",