@magnusopera/fscript 0.77.1 → 0.78.1

package/dist/fable_modules/{fable-library-js.5.2.0 → fable-library-js.5.13.0}/Array.js

@@ -1,7 +1,7 @@
 import { disposeSafe, getEnumerator, copyToArray, defaultOf, Exception } from "./Util.js";
 import { Helpers_allocateArrayFromCons } from "./Native.js";
 import { setItem as setItem_1, item as item_2 } from "./Array.js";
-import { value as value_2, map as map_1, defaultArg, some } from "./Option.js";
+import { value as value_2, defaultArg, some } from "./Option.js";
 import { min as min_1, max as max_1 } from "./Double.js";
 import { SR_notEnoughElements, SR_inputMustBeNonNegative, SR_inputSequenceEmpty, SR_Arg_ArgumentOutOfRangeException, SR_indexOutOfBounds } from "./Global.js";
 import { Operators_IsNull } from "./FSharp.Core.js";
@@ -37,7 +37,7 @@ export function getSubArray(array, start, count) {
 }
 export function last(array) {
     if (array.length === 0) {
-        throw new Exception("The input array was empty\\nParameter name: array");
+        throw new Exception("The input array was empty (Parameter \'array\')");
     }
     return item_2(array.length - 1, array);
 }
@@ -183,8 +183,9 @@ export function where(predicate, array) {
     return array.filter(predicate);
 }
 export function indexOf(array, item_1, start, count, eq) {
+    let option_1 = undefined;
     const start_1 = defaultArg(start, 0) | 0;
-    const end$0027 = defaultArg(map_1((c) => ((start_1 + c) | 0), count), array.length) | 0;
+    const end$0027 = defaultArg((option_1 = count, (option_1 != null) ? (start_1 + value_2(option_1)) : undefined), array.length) | 0;
     const loop = (i_mut) => {
         loop: while (true) {
             const i = i_mut;
@@ -216,7 +217,7 @@ export function singleton(value, cons) {
 }
 export function initialize(count, initializer, cons) {
     if (count < 0) {
-        throw new Exception("The input must be non-negative\\nParameter name: count");
+        throw new Exception("The input must be non-negative (Parameter \'count\')");
     }
     const result = Helpers_allocateArrayFromCons(cons, count);
     for (let i = 0; i <= (count - 1); i++) {
@@ -239,7 +240,7 @@ export function pairwise(array) {
 }
 export function replicate(count, initial, cons) {
     if (count < 0) {
-        throw new Exception("The input must be non-negative\\nParameter name: count");
+        throw new Exception("The input must be non-negative (Parameter \'count\')");
     }
     const result = Helpers_allocateArrayFromCons(cons, count);
     for (let i = 0; i <= (result.length - 1); i++) {
@@ -275,7 +276,7 @@ export function scanBack(folder, array, state, cons) {
 }
 export function skip(count, array, cons) {
     if (count > array.length) {
-        throw new Exception("count is greater than array length\\nParameter name: count");
+        throw new Exception("count is greater than array length (Parameter \'count\')");
     }
     if (count === array.length) {
         return Helpers_allocateArrayFromCons(cons, 0);
@@ -300,10 +301,10 @@ export function skipWhile(predicate, array, cons) {
 }
 export function take(count, array, cons) {
     if (count < 0) {
-        throw new Exception("The input must be non-negative\\nParameter name: count");
+        throw new Exception("The input must be non-negative (Parameter \'count\')");
     }
     if (count > array.length) {
-        throw new Exception("count is greater than array length\\nParameter name: count");
+        throw new Exception("count is greater than array length (Parameter \'count\')");
     }
     if (count === 0) {
         return Helpers_allocateArrayFromCons(cons, 0);
@@ -761,7 +762,7 @@ export function zip3(array1, array2, array3) {
 }
 export function chunkBySize(chunkSize, array) {
     if (chunkSize < 1) {
-        throw new Exception("The input must be positive.\\nParameter name: size");
+        throw new Exception("The input must be positive. (Parameter \'size\')");
     }
     const result = [];
     if (array.length > 0) {
@@ -777,7 +778,7 @@ export function chunkBySize(chunkSize, array) {
 }
 export function splitAt(index, array) {
     if ((index < 0) ? true : (index > array.length)) {
-        throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+        throw new Exception(SR_indexOutOfBounds + " (Parameter \'index\')");
     }
     return [array.slice(0, (0 + index)), array.slice(index)];
 }
@@ -886,9 +887,9 @@ export function exactlyOne(array) {
         case 1:
             return item_2(0, array);
         case 0:
-            throw new Exception("The input sequence was empty\\nParameter name: array");
+            throw new Exception("The input sequence was empty (Parameter \'array\')");
         default:
-            throw new Exception("Input array too long\\nParameter name: array");
+            throw new Exception("Input array too long (Parameter \'array\')");
     }
 }
 export function tryExactlyOne(array) {
@@ -901,7 +902,7 @@ export function tryExactlyOne(array) {
 }
 export function head(array) {
     if (array.length === 0) {
-        throw new Exception("The input array was empty\\nParameter name: array");
+        throw new Exception("The input array was empty (Parameter \'array\')");
     }
     else {
         return item_2(0, array);
@@ -917,13 +918,13 @@ export function tryHead(array) {
 }
 export function tail(array) {
     if (array.length === 0) {
-        throw new Exception("Not enough elements\\nParameter name: array");
+        throw new Exception("Not enough elements (Parameter \'array\')");
     }
     return array.slice(1);
 }
 export function item(index, array) {
     if ((index < 0) ? true : (index >= array.length)) {
-        throw new Exception("Index was outside the bounds of the array.\\nParameter name: index");
+        throw new Exception("Index was outside the bounds of the array. (Parameter \'index\')");
     }
     else {
         return array[index];
@@ -931,7 +932,7 @@ export function item(index, array) {
 }
 export function setItem(array, index, value) {
     if ((index < 0) ? true : (index >= array.length)) {
-        throw new Exception("Index was outside the bounds of the array.\\nParameter name: index");
+        throw new Exception("Index was outside the bounds of the array. (Parameter \'index\')");
     }
     else {
         array[index] = value;
@@ -1069,7 +1070,7 @@ export function min(xs, comparer) {
 }
 export function average(array, averager) {
     if (array.length === 0) {
-        throw new Exception("The input array was empty\\nParameter name: array");
+        throw new Exception("The input array was empty (Parameter \'array\')");
     }
     let total = averager.GetZero();
     for (let i = 0; i <= (array.length - 1); i++) {
@@ -1079,7 +1080,7 @@ export function average(array, averager) {
 }
 export function averageBy(projection, array, averager) {
     if (array.length === 0) {
-        throw new Exception("The input array was empty\\nParameter name: array");
+        throw new Exception("The input array was empty (Parameter \'array\')");
     }
     let total = averager.GetZero();
     for (let i = 0; i <= (array.length - 1); i++) {
@@ -1101,7 +1102,7 @@ export function windowed(windowSize, source) {
 }
 export function splitInto(chunks, array) {
     if (chunks < 1) {
-        throw new Exception("The input must be positive.\\nParameter name: chunks");
+        throw new Exception("The input must be positive. (Parameter \'chunks\')");
     }
     const result = [];
     if (array.length > 0) {
@@ -1143,7 +1144,7 @@ export function transpose(arrays, cons) {
 export function insertAt(index, y, xs, cons) {
     const len = xs.length | 0;
     if ((index < 0) ? true : (index > len)) {
-        throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+        throw new Exception(SR_indexOutOfBounds + " (Parameter \'index\')");
     }
     const target = Helpers_allocateArrayFromCons(cons, len + 1);
     for (let i = 0; i <= (index - 1); i++) {
@@ -1158,7 +1159,7 @@ export function insertAt(index, y, xs, cons) {
 export function insertManyAt(index, ys, xs, cons) {
     const len = xs.length | 0;
     if ((index < 0) ? true : (index > len)) {
-        throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+        throw new Exception(SR_indexOutOfBounds + " (Parameter \'index\')");
     }
     const ys_1 = Array.from(ys);
     const len2 = ys_1.length | 0;
@@ -1179,7 +1180,7 @@ export function randomShuffleInPlaceBy(randomizer, xs) {
     for (let i = len - 1; i >= 1; i--) {
         const r = randomizer();
         if ((r < 0) ? true : (r >= 1)) {
-            throw new Exception((SR_Arg_ArgumentOutOfRangeException + "\\nParameter name: ") + "randomizer");
+            throw new Exception(SR_Arg_ArgumentOutOfRangeException + " (Parameter \'randomizer\')");
         }
         const j = ~~(r * (i + 1)) | 0;
         const tmp = item_2(i, xs);
@@ -1206,12 +1207,12 @@ export function randomShuffle(xs) {
 }
 export function randomChoiceBy(randomizer, xs) {
     if (isEmpty(xs)) {
-        throw new Exception((SR_inputSequenceEmpty + "\\nParameter name: ") + "source");
+        throw new Exception(SR_inputSequenceEmpty + " (Parameter \'source\')");
     }
     const len = xs.length | 0;
     const r = randomizer();
     if ((r < 0) ? true : (r >= 1)) {
-        throw new Exception((SR_Arg_ArgumentOutOfRangeException + "\\nParameter name: ") + "randomizer");
+        throw new Exception(SR_Arg_ArgumentOutOfRangeException + " (Parameter \'randomizer\')");
     }
     return item_2(~~(r * len), xs);
 }
@@ -1223,16 +1224,16 @@ export function randomChoice(xs) {
 }
 export function randomChoicesBy(randomizer, count, xs, cons) {
     if (count < 0) {
-        throw new Exception((SR_inputMustBeNonNegative + "\\nParameter name: ") + "count");
+        throw new Exception(SR_inputMustBeNonNegative + " (Parameter \'count\')");
     }
     if ((count > 0) && isEmpty(xs)) {
-        throw new Exception((SR_inputSequenceEmpty + "\\nParameter name: ") + "source");
+        throw new Exception(SR_inputSequenceEmpty + " (Parameter \'source\')");
     }
     const len = xs.length | 0;
     return initialize(count, (_arg) => {
         const r = randomizer();
         if ((r < 0) ? true : (r >= 1)) {
-            throw new Exception((SR_Arg_ArgumentOutOfRangeException + "\\nParameter name: ") + "randomizer");
+            throw new Exception(SR_Arg_ArgumentOutOfRangeException + " (Parameter \'randomizer\')");
         }
         return item_2(~~(r * len), xs);
     }, cons);
@@ -1245,20 +1246,20 @@ export function randomChoices(count, xs, cons) {
 }
 export function randomSampleBy(randomizer, count, xs) {
     if (count < 0) {
-        throw new Exception((SR_inputMustBeNonNegative + "\\nParameter name: ") + "count");
+        throw new Exception(SR_inputMustBeNonNegative + " (Parameter \'count\')");
     }
     const arr = copy(xs);
     const len = arr.length | 0;
     if ((len === 0) && (count > 0)) {
-        throw new Exception((SR_inputSequenceEmpty + "\\nParameter name: ") + "source");
+        throw new Exception(SR_inputSequenceEmpty + " (Parameter \'source\')");
     }
     if (count > len) {
-        throw new Exception((SR_notEnoughElements + "\\nParameter name: ") + "count");
+        throw new Exception(SR_notEnoughElements + " (Parameter \'count\')");
     }
     for (let i = 0; i <= (count - 1); i++) {
         const r = randomizer();
         if ((r < 0) ? true : (r >= 1)) {
-            throw new Exception((SR_Arg_ArgumentOutOfRangeException + "\\nParameter name: ") + "randomizer");
+            throw new Exception(SR_Arg_ArgumentOutOfRangeException + " (Parameter \'randomizer\')");
         }
         const j = (i + ~~(r * (len - i))) | 0;
         const tmp = item_2(i, arr);
@@ -1275,7 +1276,7 @@ export function randomSample(count, xs) {
 }
 export function removeAt(index, xs) {
     if ((index < 0) ? true : (index >= xs.length)) {
-        throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+        throw new Exception(SR_indexOutOfBounds + " (Parameter \'index\')");
     }
     let i = -1;
     return filter((_arg) => {
@@ -1307,14 +1308,14 @@ export function removeManyAt(index, count, xs) {
     }, xs);
     const status_1 = (((status === 0) && ((i + 1) === (index + count))) ? 1 : status) | 0;
     if (status_1 < 1) {
-        throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + ((status_1 < 0) ? "index" : "count"));
+        throw new Exception(SR_indexOutOfBounds + ((" (Parameter \'" + ((status_1 < 0) ? "index" : "count")) + "\')"));
     }
     return ys;
 }
 export function updateAt(index, y, xs, cons) {
     const len = xs.length | 0;
     if ((index < 0) ? true : (index >= len)) {
-        throw new Exception((SR_indexOutOfBounds + "\\nParameter name: ") + "index");
+        throw new Exception(SR_indexOutOfBounds + " (Parameter \'index\')");
     }
     const target = Helpers_allocateArrayFromCons(cons, len);
     for (let i = 0; i <= (len - 1); i++) {
@@ -1325,7 +1326,7 @@ export function updateAt(index, y, xs, cons) {
 export function resize(xs, newSize, zero, cons) {
     let array = undefined, array_1 = undefined, start_2 = undefined, count_2 = undefined;
     if (newSize < 0) {
-        throw new Exception("The input must be non-negative.\\nParameter name: newSize");
+        throw new Exception("The input must be non-negative. (Parameter \'newSize\')");
     }
     const zero_1 = defaultArg(zero, defaultOf());
     if (Operators_IsNull(xs.contents)) {

package/dist/fable_modules/{fable-library-js.5.2.0 → fable-library-js.5.13.0}/Async.js

@@ -7,10 +7,6 @@ import { Exception } from "./Util.js";
 function emptyContinuation(_x) {
     // NOP
 }
-// see AsyncBuilder.Delay
-function delay(generator) {
-    return protectedCont((ctx) => generator()(ctx));
-}
 // MakeAsync: body:(AsyncActivation<'T> -> AsyncReturn) -> Async<'T>
 export function makeAsync(body) {
     return body;
@@ -49,23 +45,50 @@ export function throwIfCancellationRequested(token) {
     }
 }
 export function startChild(computation, ms) {
-    const promise = startAsPromise(computation);
-    let promiseToRun = promise;
-    if (ms) {
-        // Race the computation against a timeout: whichever settles first wins.
-        promiseToRun = new Promise((resolve, reject) => {
-            const timeoutId = setTimeout(() => reject(TimeoutException_$ctor()), ms);
-            promise.then(value => { clearTimeout(timeoutId); resolve(value); }, error => { clearTimeout(timeoutId); reject(error); });
-        });
-    }
-    // JS Promises are hot, computation has already started
-    // but we delay returning the result
-    return protectedCont((ctx) => protectedReturn(awaitPromise(promiseToRun))(ctx));
+    return protectedCont((ctx) => {
+        // Share the parent's cancellation token so cancelling the parent
+        // cancels the child, like .NET Async.StartChild
+        const promise = startAsPromise(computation, ctx.cancelToken);
+        let promiseToRun = promise;
+        if (ms) {
+            // Race the computation against a timeout: whichever settles first wins.
+            promiseToRun = new Promise((resolve, reject) => {
+                const timeoutId = setTimeout(() => reject(TimeoutException_$ctor()), ms);
+                promise.then(value => { clearTimeout(timeoutId); resolve(value); }, error => { clearTimeout(timeoutId); reject(error); });
+            });
+        }
+        // Prevent an unhandled rejection when the child is cancelled or fails
+        // while nobody awaits it (in F# an unobserved child's cancellation or
+        // failure is simply not propagated). awaitPromise attaches its own
+        // handlers to the same promise, so awaiting still observes the result.
+        promiseToRun.catch(emptyContinuation);
+        // JS Promises are hot, computation has already started
+        // but we delay returning the result
+        protectedReturn(awaitPromise(promiseToRun))(ctx);
+    });
 }
 export function awaitPromise(p) {
     return fromContinuations((conts) => p.then(conts[0]).catch((err) => (err instanceof OperationCanceledException
         ? conts[2] : conts[1])(err)));
 }
+export function awaitEvent(event, cancelAction) {
+    return protectedCont((ctx) => {
+        let tokenId;
+        const handler = ((_sender, arg) => {
+            ctx.cancelToken.removeListener(tokenId);
+            event.RemoveHandler(handler);
+            ctx.onSuccess(arg);
+        });
+        tokenId = ctx.cancelToken.addListener(() => {
+            event.RemoveHandler(handler);
+            if (cancelAction != null) {
+                cancelAction();
+            }
+            ctx.onCancel(new OperationCanceledException());
+        });
+        event.AddHandler(handler);
+    });
+}
 export function cancellationToken() {
     return protectedCont((ctx) => ctx.onSuccess(ctx.cancelToken));
 }
@@ -88,17 +111,19 @@ export function ignore(computation) {
     return protectedBind(computation, (_x) => protectedReturn(void 0));
 }
 export function parallel(computations) {
-    return delay(() => awaitPromise(Promise.all(Array.from(computations, (w) => startAsPromise(w)))));
+    // Children share the parent's cancellation token, like .NET Async.Parallel
+    return protectedCont((ctx) => awaitPromise(Promise.all(Array.from(computations, (w) => startAsPromise(w, ctx.cancelToken))))(ctx));
 }
 export function sequential(computations) {
-    function _sequential(computations) {
+    function _sequential(computations, cancelToken) {
         let pr = Promise.resolve([]);
         for (const c of computations) {
-            pr = pr.then(results => startAsPromise(c).then(r => results.concat([r])));
+            pr = pr.then(results => startAsPromise(c, cancelToken).then(r => results.concat([r])));
         }
         return pr;
     }
-    return delay(() => awaitPromise(_sequential(computations)));
+    // Children share the parent's cancellation token, like .NET Async.Sequential
+    return protectedCont((ctx) => awaitPromise(_sequential(computations, ctx.cancelToken))(ctx));
 }
 export function sleep(millisecondsDueTime) {
     return protectedCont((ctx) => {
@@ -121,10 +146,14 @@ export function startImmediate(computation, cancellationToken) {
 }
 export function startWithContinuations(computation, continuation, exceptionContinuation, cancellationContinuation, cancelToken) {
     const trampoline = new Trampoline();
+    // Mark the computation completed as soon as a terminal continuation is entered
+    // so protectedCont lets exceptions from continuation code propagate instead of
+    // routing them to onError (see Trampoline.completed).
+    const done = (cont) => (x) => { trampoline.completed = true; return cont(x); };
     computation({
-        onSuccess: continuation ? continuation : emptyContinuation,
-        onError: exceptionContinuation,
-        onCancel: cancellationContinuation,
+        onSuccess: done(continuation ? continuation : emptyContinuation),
+        onError: done(exceptionContinuation),
+        onCancel: done(cancellationContinuation),
         cancelToken: cancelToken ? cancelToken : defaultCancellationToken,
         trampoline,
     });

package/dist/fable_modules/{fable-library-js.5.2.0 → fable-library-js.5.13.0}/AsyncBuilder.js

@@ -47,6 +47,7 @@ export class Trampoline {
     }
     constructor() {
         this.callCount = 0;
+        this.completed = false;
     }
     incrementAndCheck() {
         return this.callCount++ > Trampoline.maxTrampolineCallCount;
@@ -67,6 +68,9 @@ export function protectedCont(f) {
                     f(ctx);
                 }
                 catch (err) {
+                    if (ctx.trampoline.completed) {
+                        throw err;
+                    }
                     ctx.onError(ensureErrorOrException(err));
                 }
             });
@@ -76,6 +80,13 @@ export function protectedCont(f) {
                 f(ctx);
             }
             catch (err) {
+                // Once a terminal continuation has run the computation is complete, so
+                // an exception from user continuation code must propagate rather than be
+                // routed to onError (which would resolve the computation a second time,
+                // e.g. a succeeded try/with body re-entering its with handler).
+                if (ctx.trampoline.completed) {
+                    throw err;
+                }
                 ctx.onError(ensureErrorOrException(err));
             }
         }
@@ -85,12 +96,18 @@ export function protectedBind(computation, binder) {
     return protectedCont((ctx) => {
         computation({
             onSuccess: (x) => {
+                // Only guard the binder evaluation itself: the resulting computation
+                // is protected on its own, and re-catching what it throws would
+                // route continuation exceptions back into onError (double-resolve).
+                let bound;
                 try {
-                    binder(x)(ctx);
+                    bound = binder(x);
                 }
                 catch (err) {
                     ctx.onError(ensureErrorOrException(err));
+                    return;
                 }
+                bound(ctx);
             },
             onError: ctx.onError,
             onCancel: ctx.onCancel,
@@ -155,12 +172,16 @@ export class AsyncBuilder {
                 cancelToken: ctx.cancelToken,
                 trampoline: ctx.trampoline,
                 onError: (ex) => {
+                    // See protectedBind: only guard the handler evaluation itself.
+                    let handled;
                     try {
-                        catchHandler(ex)(ctx);
+                        handled = catchHandler(ex);
                     }
                     catch (err) {
                         ctx.onError(ensureErrorOrException(err));
+                        return;
                     }
+                    handled(ctx);
                 },
             });
         });

package/dist/fable_modules/{fable-library-js.5.2.0 → fable-library-js.5.13.0}/BigInt.js

@@ -99,12 +99,12 @@ export function toIntN_unchecked(bits, x, signed) {
     return signed ? BigInt.asIntN(bits, x) : BigInt.asUintN(bits, x);
 }
 export function toIntN(bits, x, signed) {
-    let higher_bits = abs(x) >> BigInt(bits);
-    if (higher_bits !== 0n) {
+    const truncated = signed ? BigInt.asIntN(bits, x) : BigInt.asUintN(bits, x);
+    if (truncated !== x) {
         const s = signed ? "a signed" : "an unsigned";
         throw new Exception(`Value was either too large or too small for ${s} ${bits}-bit integer.`);
     }
-    return signed ? BigInt.asIntN(bits, x) : BigInt.asUintN(bits, x);
+    return truncated;
 }
 export function toInt8(x) { return Number(toIntN(8, x, true)); }
 export function toUInt8(x) { return Number(toIntN(8, x, false)); }
@@ -136,6 +136,9 @@ export function toFloat64(x) { return Number(x); }
 export function toDecimal(x) {
     const isNegative = x < zero;
     const bits = abs(x);
+    if ((bits >> 96n) !== zero) {
+        throw new Exception("Value was either too large or too small for a Decimal.");
+    }
     const low = Number(BigInt.asUintN(32, bits));
     const mid = Number(BigInt.asUintN(32, bits >> 32n));
     const high = Number(BigInt.asUintN(32, bits >> 64n));
@@ -178,6 +181,8 @@ export function divRem(x, y, out) {
     }
 }
 export function greatestCommonDivisor(x, y) {
+    x = abs(x);
+    y = abs(y);
     while (y > zero) {
         const q = x / y;
         const r = x - q * y;
@@ -186,8 +191,16 @@ export function greatestCommonDivisor(x, y) {
     }
     return x;
 }
+// Number of bits in the binary representation of x (x must be positive)
+function bitLength(x) {
+    const hex = x.toString(16);
+    return (hex.length - 1) * 4 + (32 - Math.clz32(fromHexCode(hex.charCodeAt(0))));
+}
 export function getBitLength(x) {
-    return fromFloat64(x === zero ? 1 : log2(abs(x)) + 1);
+    if (x < zero) {
+        x = -x - one; // two's complement bit length excluding the sign bit
+    }
+    return x === zero ? zero : BigInt(bitLength(x));
 }
 export function log2(x) {
     const n = Number(x);
@@ -219,7 +232,10 @@ export function log(x, base) {
     return log2(x) / Math.log2(base);
 }
 export function ilog2(x) {
-    return BigInt(log2(x));
+    if (x < zero) {
+        throw new Exception("Value must be non-negative.");
+    }
+    return x === zero ? zero : BigInt(bitLength(x) - 1);
 }
 // export function copySign
 // export function createChecked
@@ -248,35 +264,20 @@ function fromHexCode(code) {
 }
 function toSignedBytes(x, isBigEndian) {
     const isNeg = x < 0n;
-    if (isNeg) {
-        const len = log2(-x);
-        const bits = len + (8 - len % 8);
-        const pow2 = (1n << BigInt(bits));
-        x = x + pow2; // two's complement
-    }
-    const hex = x.toString(16);
-    const len = hex.length;
-    const odd = len % 2;
-    const first = hex.charCodeAt(0);
-    const isLow = 48 <= first && first <= 55; // 0..7
-    const start = (isNeg && isLow) || (!isNeg && !isLow) ? 1 : 0;
-    const bytes = new Uint8Array(start + (len + odd) / 2);
-    const inc = isBigEndian ? 1 : -1;
-    let pos = isBigEndian ? 0 : bytes.length - 1;
-    if (start > 0) {
-        bytes[pos] = isNeg ? 255 : 0;
-        pos += inc;
-    }
-    if (odd > 0) {
-        bytes[pos] = fromHexCode(first);
-        pos += inc;
+    const sentinel = isNeg ? -1n : 0n;
+    const bytes = []; // little-endian
+    do {
+        bytes.push(Number(BigInt.asUintN(8, x)));
+        x = x >> 8n;
+    } while (x !== sentinel);
+    // extra byte if the top byte's sign bit would misrepresent the sign
+    if (isNeg !== (bytes[bytes.length - 1] > 127)) {
+        bytes.push(isNeg ? 255 : 0);
     }
-    for (let i = odd; i < len; i += 2, pos += inc) {
-        const a = fromHexCode(hex.charCodeAt(i));
-        const b = fromHexCode(hex.charCodeAt(i + 1));
-        bytes[pos] = (a << 4) | b;
+    if (isBigEndian) {
+        bytes.reverse();
     }
-    return bytes;
+    return new Uint8Array(bytes);
 }
 function fromSignedBytes(bytes, isBigEndian) {
     if (bytes == null) {

package/dist/fable_modules/{fable-library-js.5.2.0 → fable-library-js.5.13.0}/BitConverter.js

@@ -77,7 +77,7 @@ export function doubleToInt64Bits(value) {
 export function toBoolean(bytes, offset) {
     const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);
     const view = new DataView(array.buffer, array.byteOffset, array.byteLength);
-    return view.getUint8(offset) === 1 ? true : false;
+    return view.getUint8(offset) !== 0;
 }
 export function toChar(bytes, offset) {
     const array = ArrayBuffer.isView(bytes) ? bytes : Uint8Array.from(bytes);
@@ -134,5 +134,5 @@ export function toString(bytes, offset, count) {
     else if (offset != null) {
         buffer = buffer.subarray(offset);
     }
-    return Array.from(buffer).map((b) => ("0" + b.toString(16)).slice(-2)).join("-");
+    return Array.from(buffer).map((b) => ("0" + b.toString(16)).slice(-2).toUpperCase()).join("-");
 }