@fable-org/fable-library-js 2.0.0-rc.6 → 2.1.0

package/CHANGELOG.md

@@ -1,3 +1,13 @@
+---
+last_commit_released: 63bcd3d90f37cb3934edcc59b5f54f49ffab3896
+updaters:
+  - package.json:
+      file: package.json
+  - regex:
+      file: ./../Fable.Transforms/Global/Compiler.fs
+      pattern: (?<=let JS_LIBRARY_VERSION = ").*(?=")
+---
+
 # Changelog
 
 All notable changes to this project will be documented in this file.
@@ -5,7 +15,31 @@ All notable changes to this project will be documented in this file.
 The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
 and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
-## Unreleased
+## 2.1.0 - 2026-05-28
+
+### 🚀 Features
+
+* *(js/ts/python)* Add missing standard DateTime format specifiers for JS/TS and Python (#4547) ([90f5eb7](https://github.com/fable-compiler/Fable/commit/90f5eb7f61710bc679f6fdec30ff5d864984ac08))
+* *(js/ts/python)* Add missing StringBuilder.Append overloads for numeric types (#4568) ([b402c30](https://github.com/fable-compiler/Fable/commit/b402c30d04bfca8644314ba4b21894abfff6a713))
+
+### 🐞 Bug Fixes
+
+* [JS/TS] Fix DatetimeOffset.ToString("s") (#4596) ([3ce6f3f](https://github.com/fable-compiler/Fable/commit/3ce6f3fd88cc7f67e34e2bbc311e722c55ffbf45))
+* *(js/ts)* Fix datetime custom format off by one year (#4558) ([83bdbb5](https://github.com/fable-compiler/Fable/commit/83bdbb5b34e70eae203831a3a442d477d15911e1))
+* *(js/ts)* Hex format specifier uses no padding unless precision is specified (#4603) ([ba9857a](https://github.com/fable-compiler/Fable/commit/ba9857a4dcbf7ab1f936241f6619fda43e039040))
+* *(js/ts)* Fix Decimal.GetBits returning incorrect mantissa after round arithmetic result (#4561) ([345bcd4](https://github.com/fable-compiler/Fable/commit/345bcd4b99417b304c71059966126fad74cf3a97))
+* *(js/ts)* Fix G/g format specifier corrupting exponential notation when trimming trailing zeros (#4587) ([773c098](https://github.com/fable-compiler/Fable/commit/773c098a8f7ac7e8db1d4e490dec1294a80321ee))
+* *(js/ts/python)* Fix FSharpOption not recognized as union type in F# reflection (#4529) ([d78a37d](https://github.com/fable-compiler/Fable/commit/d78a37db9f4c25eb51fac8afcd320b4ea36c60a7))
+* *(ts)* Enforce browser-only compatibility in fable-library-ts tsconfig (#4563) ([10c81c1](https://github.com/fable-compiler/Fable/commit/10c81c1361208eb61f5fa78c6704e6fccc068fb1))
+
+<strong><small>[View changes on Github](https://github.com/fable-compiler/Fable/compare/b471dc16fc3b5132af77b5974d1669c9b8220cca..63bcd3d90f37cb3934edcc59b5f54f49ffab3896)</small></strong>
+
+## 2.0.0 - 2026-04-21
+
+### Fixed
+
+* [JS/TS] Fix `ResizeArray` (`System.Collections.Generic.List`) equality to use reference equality instead of structural equality (fixes #3718)
+* [JS/TS] Fix `String.Contains` ignoring `StringComparison` argument (second argument was silently discarded)
 
 ## 2.0.0-rc.6 - 2026-04-07
 

package/Date.js

@@ -254,13 +254,13 @@ function dateToStringWithCustomFormat(date, format, utc) {
                 cursorPos += tokenLength;
                 switch (tokenLength) {
                     case 1:
-                        result += localizedDate.getFullYear() % 100;
+                        result += year(localizedDate) % 100;
                         break;
                     case 2:
-                        result += padWithZeros(localizedDate.getFullYear() % 100, 2);
+                        result += padWithZeros(year(localizedDate) % 100, 2);
                         break;
                     default:
-                        result += padWithZeros(localizedDate.getFullYear(), tokenLength);
+                        result += padWithZeros(year(localizedDate), tokenLength);
                         break;
                 }
                 break;
@@ -384,10 +384,32 @@ function dateToStringWithOffset(date, format) {
         switch (format) {
             case "D": return dateToString_D(d);
             case "d": return dateToString_d(d);
-            case "T": return dateToString_T(toUniversalTime(d));
-            case "t": return dateToString_t(toUniversalTime(d));
+            case "F": return dateToString_D(d) + " " + dateToString_T(d);
+            case "f": return dateToString_D(d) + " " + dateToString_t(d);
+            case "G": return dateToString_d(d) + " " + dateToString_T(d);
+            case "g": return dateToString_d(d) + " " + dateToString_t(d);
+            case "M":
+            case "m": return dateToString_M(d);
             case "O":
             case "o": return dateToISOStringWithOffset(d, (date.offset ?? 0));
+            case "R":
+            case "r": {
+                const utcDate = DateTime(date.getTime(), DateTimeKind.Utc);
+                return dateToString_R(utcDate);
+            }
+            case "s": return dateToString_s(toUniversalTime(d));
+            case "T": return dateToString_T(toUniversalTime(d));
+            case "t": return dateToString_t(toUniversalTime(d));
+            case "u": {
+                const utcDate = DateTime(date.getTime(), DateTimeKind.Utc);
+                return dateToString_u(utcDate);
+            }
+            case "U": {
+                const utcDate = DateTime(date.getTime(), DateTimeKind.Utc);
+                return dateToString_D(utcDate) + " " + dateToString_T(utcDate);
+            }
+            case "Y":
+            case "y": return dateToString_Y(d);
             default: throw new Exception("Unrecognized Date print format");
         }
     }
@@ -415,6 +437,44 @@ function dateToString_t(date) {
     return padWithZeros(hour(date), 2)
         + ":" + padWithZeros(minute(date), 2);
 }
+// RFC 1123: "Thu, 01 Jan 2009 00:00:00 GMT" — always UTC
+function dateToString_R(date) {
+    const utcDate = toUniversalTime(date);
+    return shortDays[dayOfWeek(utcDate)] + ", "
+        + padWithZeros(day(utcDate), 2) + " "
+        + shortMonths[month(utcDate) - 1] + " "
+        + year(utcDate) + " "
+        + padWithZeros(hour(utcDate), 2) + ":"
+        + padWithZeros(minute(utcDate), 2) + ":"
+        + padWithZeros(second(utcDate), 2) + " GMT";
+}
+// Sortable ISO 8601, no timezone: "2009-06-15T13:45:30"
+function dateToString_s(date) {
+    return padWithZeros(year(date), 4) + "-"
+        + padWithZeros(month(date), 2) + "-"
+        + padWithZeros(day(date), 2) + "T"
+        + padWithZeros(hour(date), 2) + ":"
+        + padWithZeros(minute(date), 2) + ":"
+        + padWithZeros(second(date), 2);
+}
+// Universal sortable: "2009-06-15 13:45:30Z" — always UTC
+function dateToString_u(date) {
+    const utcDate = toUniversalTime(date);
+    return padWithZeros(year(utcDate), 4) + "-"
+        + padWithZeros(month(utcDate), 2) + "-"
+        + padWithZeros(day(utcDate), 2) + " "
+        + padWithZeros(hour(utcDate), 2) + ":"
+        + padWithZeros(minute(utcDate), 2) + ":"
+        + padWithZeros(second(utcDate), 2) + "Z";
+}
+// Month/day (InvariantCulture "MMMM dd"): "June 15"
+function dateToString_M(date) {
+    return longMonths[month(date) - 1] + " " + padWithZeros(day(date), 2);
+}
+// Year/month (InvariantCulture "yyyy MMMM"): "2009 June"
+function dateToString_Y(date) {
+    return year(date) + " " + longMonths[month(date) - 1];
+}
 function dateToStringWithKind(date, format) {
     const utc = date.kind === DateTimeKind.Utc;
     if (typeof format !== "string") {
@@ -424,11 +484,23 @@ function dateToStringWithKind(date, format) {
         switch (format) {
             case "D": return dateToString_D(date);
             case "d": return dateToString_d(date);
+            case "F": return dateToString_D(date) + " " + dateToString_T(date);
+            case "f": return dateToString_D(date) + " " + dateToString_t(date);
+            case "G": return dateToString_d(date) + " " + dateToString_T(date);
+            case "g": return dateToString_d(date) + " " + dateToString_t(date);
+            case "M":
+            case "m": return dateToString_M(date);
+            case "O":
+            case "o": return dateToISOString(date, utc);
+            case "R":
+            case "r": return dateToString_R(date);
+            case "s": return dateToString_s(date);
             case "T": return dateToString_T(date);
             case "t": return dateToString_t(date);
-            case "O":
-            case "o":
-                return dateToISOString(date, utc);
+            case "u": return dateToString_u(date);
+            case "U": return dateToString_D(toUniversalTime(date)) + " " + dateToString_T(toUniversalTime(date));
+            case "Y":
+            case "y": return dateToString_Y(date);
             default:
                 throw new Exception("Unrecognized Date print format");
         }

package/Decimal.js

@@ -207,14 +207,16 @@ export function fromParts(low, mid, high, isNegative, scale) {
 }
 export function getBits(d) {
     const bitSize = 96;
-    const decDigits = Uint8Array.from(d.c);
+    const decStr = d.toString();
+    const absStr = decStr[0] === "-" ? decStr.slice(1) : decStr;
+    const dotPos = absStr.indexOf(".");
+    const scale = dotPos < 0 ? 0 : absStr.length - dotPos - 1;
+    const mantissaStr = absStr.replace(".", "");
+    const decDigits = Uint8Array.from(mantissaStr, ch => ch.charCodeAt(0) - 48);
     const hexDigits = decimalToHex(decDigits, bitSize);
     const low = getInt32Bits(hexDigits, 0);
     const mid = getInt32Bits(hexDigits, 8);
     const high = getInt32Bits(hexDigits, 16);
-    const decStr = d.toString();
-    const dotPos = decStr.indexOf(".");
-    const scale = dotPos < 0 ? 0 : decStr.length - dotPos - 1;
     const signExp = ((scale & 0x7F) << 16) | (d.s < 0 ? 0x80000000 : 0);
     return [low, mid, high, signExp];
 }

package/Reflection.js

@@ -1,6 +1,7 @@
 import { Record, Union } from "./Types.js";
 import { Exception, combineHashCodes, equalArraysWith, stringHash } from "./Util.js";
 import Decimal from "./Decimal.js";
+import { Some, some } from "./Option.js";
 export class CaseInfo {
     constructor(declaringType, tag, name, fields) {
         this.declaringType = declaringType;
@@ -85,7 +86,11 @@ export function lambda_type(argType, returnType) {
     return new TypeInfo("Microsoft.FSharp.Core.FSharpFunc`2", [argType, returnType]);
 }
 export function option_type(generic) {
-    return new TypeInfo("Microsoft.FSharp.Core.FSharpOption`1", [generic]);
+    const t = new TypeInfo("Microsoft.FSharp.Core.FSharpOption`1", [generic], undefined, undefined, undefined, () => [
+        new CaseInfo(t, 0, "None"),
+        new CaseInfo(t, 1, "Some", [["value", generic]])
+    ]);
+    return t;
 }
 export function list_type(generic) {
     return new TypeInfo("Microsoft.FSharp.Collections.FSharpList`1", [generic]);
@@ -351,6 +356,16 @@ export function isFunction(t) {
 // FSharpValue
 export function getUnionFields(v, t) {
     const cases = getUnionCases(t);
+    // Special handling for option types (None is undefined, Some is the value or a Some wrapper)
+    if (t.fullname === "Microsoft.FSharp.Core.FSharpOption`1") {
+        if (v == null) {
+            return [cases[0], []]; // None case
+        }
+        else {
+            const innerValue = v instanceof Some ? v.value : v;
+            return [cases[1], [innerValue]]; // Some case
+        }
+    }
     const case_ = cases[v.tag];
     if (case_ == null) {
         throw new Exception(`Cannot find case ${v.name} in union type`);
@@ -380,6 +395,10 @@ export function makeUnion(uci, values) {
     if (values.length !== expectedLength) {
         throw new Exception(`Expected an array of length ${expectedLength} but got ${values.length}`);
     }
+    // Special handling for option types
+    if (uci.declaringType.fullname === "Microsoft.FSharp.Core.FSharpOption`1") {
+        return uci.tag === 0 ? undefined : some(values[0]);
+    }
     const construct = uci.declaringType.construct;
     if (construct == null) {
         return {};

package/Seq.js

@@ -5,8 +5,9 @@ import { class_type } from "./Reflection.js";
 import { some, value as value_1 } from "./Option.js";
 import { KeyNotFoundException_$ctor_Z721C83C5 } from "./System.Collections.Generic.js";
 import { Operators_Lock, Operators_NullArgCheck } from "./FSharp.Core.js";
-import { randomSampleBy as randomSampleBy_1, randomChoicesBy as randomChoicesBy_1, randomChoice as randomChoice_1, randomChoiceWith as randomChoiceWith_1, randomChoiceBy as randomChoiceBy_1, randomShuffleInPlaceBy, chunkBySize as chunkBySize_1, permute as permute_1, transpose as transpose_1, map as map_1, windowed as windowed_1, splitInto as splitInto_1, pairwise as pairwise_1, scanBack as scanBack_1, reverse as reverse_1, mapFoldBack as mapFoldBack_1, mapFold as mapFold_1, item as item_1, tryItem as tryItem_1, tryHead as tryHead_1, foldBack2 as foldBack2_1, foldBack as foldBack_1, tryFindIndexBack as tryFindIndexBack_1, tryFindBack as tryFindBack_1, singleton as singleton_1 } from "./Array.js";
+import { randomSampleBy as randomSampleBy_1, randomChoicesBy as randomChoicesBy_1, randomChoice as randomChoice_1, randomChoiceWith as randomChoiceWith_1, randomChoiceBy as randomChoiceBy_1, randomShuffleInPlaceBy, chunkBySize as chunkBySize_1, permute as permute_1, transpose as transpose_1, map as map_1, windowed as windowed_1, splitInto as splitInto_1, pairwise as pairwise_1, scanBack as scanBack_1, reverse as reverse_1, mapFoldBack as mapFoldBack_1, mapFold as mapFold_1, tryItem as tryItem_1, tryHead as tryHead_1, item as item_1, foldBack as foldBack_1, tryFindIndexBack as tryFindIndexBack_1, tryFindBack as tryFindBack_1, singleton as singleton_1 } from "./Array.js";
 import { length as length_1, tryItem as tryItem_2, isEmpty as isEmpty_1, tryHead as tryHead_2, ofSeq as ofSeq_1, ofArray as ofArray_1, toArray as toArray_1, FSharpList } from "./List.js";
+import { min as min_1 } from "./Double.js";
 import { SR_indexOutOfBounds } from "./Global.js";
 import { nonSeeded } from "./Random.js";
 export const SR_enumerationAlreadyFinished = "Enumeration already finished.";
@@ -656,7 +657,14 @@ export function fold2(folder, state, xs, ys) {
     }
 }
 export function foldBack2(folder, xs, ys, state) {
-    return foldBack2_1(folder, toArray(xs), toArray(ys), state);
+    const xs_1 = toArray(xs);
+    const ys_1 = toArray(ys);
+    const len = min_1(xs_1.length, ys_1.length) | 0;
+    let acc = state;
+    for (let i = len - 1; i >= 0; i--) {
+        acc = folder(item_1(i, xs_1), item_1(i, ys_1), acc);
+    }
+    return acc;
 }
 export function forAll(predicate, xs) {
     return !exists((x) => !predicate(x), xs);

package/Set.js

@@ -1,12 +1,12 @@
 import { record_type, bool_type, list_type, option_type, class_type } from "./Reflection.js";
-import { some, value as value_3 } from "./Option.js";
+import { some, value as value_2 } from "./Option.js";
 import { structuralHash, toIterator, disposeSafe, getEnumerator, isArrayLike, Exception } from "./Util.js";
 import { Record } from "./Types.js";
 import { fold as fold_2, cons, singleton as singleton_1, empty as empty_1, ofArrayWithTail, tail, head, isEmpty as isEmpty_1, FSharpList } from "./List.js";
 import { fold as fold_1, fill, setItem } from "./Array.js";
 import { join } from "./String.js";
 import { NotSupportedException_$ctor_Z721C83C5 } from "./System.js";
-import { exists as exists_1, cache, forAll as forAll_1, fold as fold_3, reduce, iterate as iterate_1, map as map_1 } from "./Seq.js";
+import { skip, truncate, iterateIndexed, exists as exists_1, forAll as forAll_1, fold as fold_3, reduce, iterate as iterate_1, map as map_1 } from "./Seq.js";
 import { HashSet__get_Comparer, HashSet_$ctor_Z6150332D, HashSet } from "./MutableSet.js";
 export class SetTreeLeaf$1 {
     constructor(k) {
@@ -52,7 +52,7 @@ export function SetTreeModule_countAux(t_mut, acc_mut) {
     SetTreeModule_countAux: while (true) {
         const t = t_mut, acc = acc_mut;
         if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
                 t_mut = SetTreeNode$1__get_Left(tn);
@@ -77,7 +77,7 @@ export function SetTreeModule_mk(l, k, r) {
     let hl;
     const t = l;
     if (t != null) {
-        const t2 = value_3(t);
+        const t2 = value_2(t);
         hl = ((t2 instanceof SetTreeNode$1) ? ((tn = t2, SetTreeNode$1__get_Height(tn))) : 1);
     }
     else {
@@ -86,7 +86,7 @@ export function SetTreeModule_mk(l, k, r) {
     let hr;
     const t_1 = r;
     if (t_1 != null) {
-        const t2_1 = value_3(t_1);
+        const t2_1 = value_2(t_1);
         hr = ((t2_1 instanceof SetTreeNode$1) ? ((tn_1 = t2_1, SetTreeNode$1__get_Height(tn_1))) : 1);
     }
     else {
@@ -105,7 +105,7 @@ export function SetTreeModule_rebalance(t1, v, t2) {
     let t1h;
     const t = t1;
     if (t != null) {
-        const t2_1 = value_3(t);
+        const t2_1 = value_2(t);
         t1h = ((t2_1 instanceof SetTreeNode$1) ? ((tn = t2_1, SetTreeNode$1__get_Height(tn))) : 1);
     }
     else {
@@ -114,18 +114,18 @@ export function SetTreeModule_rebalance(t1, v, t2) {
     let t2h;
     const t_1 = t2;
     if (t_1 != null) {
-        const t2_2 = value_3(t_1);
+        const t2_2 = value_2(t_1);
         t2h = ((t2_2 instanceof SetTreeNode$1) ? ((tn_1 = t2_2, SetTreeNode$1__get_Height(tn_1))) : 1);
     }
     else {
         t2h = 0;
     }
     if (t2h > (t1h + 2)) {
-        const matchValue = value_3(t2);
+        const matchValue = value_2(t2);
         if (matchValue instanceof SetTreeNode$1) {
             const t2$0027 = matchValue;
-            if (((t_2 = SetTreeNode$1__get_Left(t2$0027), (t_2 != null) ? ((t2_3 = value_3(t_2), (t2_3 instanceof SetTreeNode$1) ? ((tn_2 = t2_3, SetTreeNode$1__get_Height(tn_2))) : 1)) : 0)) > (t1h + 1)) {
-                const matchValue_1 = value_3(SetTreeNode$1__get_Left(t2$0027));
+            if (((t_2 = SetTreeNode$1__get_Left(t2$0027), (t_2 != null) ? ((t2_3 = value_2(t_2), (t2_3 instanceof SetTreeNode$1) ? ((tn_2 = t2_3, SetTreeNode$1__get_Height(tn_2))) : 1)) : 0)) > (t1h + 1)) {
+                const matchValue_1 = value_2(SetTreeNode$1__get_Left(t2$0027));
                 if (matchValue_1 instanceof SetTreeNode$1) {
                     const t2l = matchValue_1;
                     return SetTreeModule_mk(SetTreeModule_mk(t1, v, SetTreeNode$1__get_Left(t2l)), SetTreeLeaf$1__get_Key(t2l), SetTreeModule_mk(SetTreeNode$1__get_Right(t2l), SetTreeLeaf$1__get_Key(t2$0027), SetTreeNode$1__get_Right(t2$0027)));
@@ -143,11 +143,11 @@ export function SetTreeModule_rebalance(t1, v, t2) {
         }
     }
     else if (t1h > (t2h + 2)) {
-        const matchValue_2 = value_3(t1);
+        const matchValue_2 = value_2(t1);
         if (matchValue_2 instanceof SetTreeNode$1) {
             const t1$0027 = matchValue_2;
-            if (((t_3 = SetTreeNode$1__get_Right(t1$0027), (t_3 != null) ? ((t2_4 = value_3(t_3), (t2_4 instanceof SetTreeNode$1) ? ((tn_3 = t2_4, SetTreeNode$1__get_Height(tn_3))) : 1)) : 0)) > (t2h + 1)) {
-                const matchValue_3 = value_3(SetTreeNode$1__get_Right(t1$0027));
+            if (((t_3 = SetTreeNode$1__get_Right(t1$0027), (t_3 != null) ? ((t2_4 = value_2(t_3), (t2_4 instanceof SetTreeNode$1) ? ((tn_3 = t2_4, SetTreeNode$1__get_Height(tn_3))) : 1)) : 0)) > (t2h + 1)) {
+                const matchValue_3 = value_2(SetTreeNode$1__get_Right(t1$0027));
                 if (matchValue_3 instanceof SetTreeNode$1) {
                     const t1r = matchValue_3;
                     return SetTreeModule_mk(SetTreeModule_mk(SetTreeNode$1__get_Left(t1$0027), SetTreeLeaf$1__get_Key(t1$0027), SetTreeNode$1__get_Left(t1r)), SetTreeLeaf$1__get_Key(t1r), SetTreeModule_mk(SetTreeNode$1__get_Right(t1r), v, t2));
@@ -170,7 +170,7 @@ export function SetTreeModule_rebalance(t1, v, t2) {
 }
 export function SetTreeModule_add(comparer, k, t) {
     if (t != null) {
-        const t2 = value_3(t);
+        const t2 = value_2(t);
         const c = comparer.Compare(k, SetTreeLeaf$1__get_Key(t2)) | 0;
         if (t2 instanceof SetTreeNode$1) {
             const tn = t2;
@@ -203,9 +203,9 @@ export function SetTreeModule_add(comparer, k, t) {
 }
 export function SetTreeModule_balance(comparer, t1, k, t2) {
     if (t1 != null) {
-        const t1$0027 = value_3(t1);
+        const t1$0027 = value_2(t1);
         if (t2 != null) {
-            const t2$0027 = value_3(t2);
+            const t2$0027 = value_2(t2);
             if (t1$0027 instanceof SetTreeNode$1) {
                 const t1n = t1$0027;
                 if (t2$0027 instanceof SetTreeNode$1) {
@@ -238,7 +238,7 @@ export function SetTreeModule_balance(comparer, t1, k, t2) {
 }
 export function SetTreeModule_split(comparer, pivot, t) {
     if (t != null) {
-        const t2 = value_3(t);
+        const t2 = value_2(t);
         if (t2 instanceof SetTreeNode$1) {
             const tn = t2;
             const c = comparer.Compare(pivot, SetTreeLeaf$1__get_Key(tn)) | 0;
@@ -273,7 +273,7 @@ export function SetTreeModule_split(comparer, pivot, t) {
 }
 export function SetTreeModule_spliceOutSuccessor(t) {
     if (t != null) {
-        const t2 = value_3(t);
+        const t2 = value_2(t);
         if (t2 instanceof SetTreeNode$1) {
             const tn = t2;
             if (SetTreeNode$1__get_Left(tn) == null) {
@@ -294,7 +294,7 @@ export function SetTreeModule_spliceOutSuccessor(t) {
 }
 export function SetTreeModule_remove(comparer, k, t) {
     if (t != null) {
-        const t2 = value_3(t);
+        const t2 = value_2(t);
         const c = comparer.Compare(k, SetTreeLeaf$1__get_Key(t2)) | 0;
         if (t2 instanceof SetTreeNode$1) {
             const tn = t2;
@@ -332,7 +332,7 @@ export function SetTreeModule_mem(comparer_mut, k_mut, t_mut) {
     SetTreeModule_mem: while (true) {
         const comparer = comparer_mut, k = k_mut, t = t_mut;
         if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             const c = comparer.Compare(k, SetTreeLeaf$1__get_Key(t2)) | 0;
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
@@ -366,7 +366,7 @@ export function SetTreeModule_iter(f_mut, t_mut) {
     SetTreeModule_iter: while (true) {
         const f = f_mut, t = t_mut;
         if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
                 SetTreeModule_iter(f, SetTreeNode$1__get_Left(tn));
@@ -386,7 +386,7 @@ export function SetTreeModule_foldBackOpt(f_mut, t_mut, x_mut) {
     SetTreeModule_foldBackOpt: while (true) {
         const f = f_mut, t = t_mut, x = x_mut;
         if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
                 f_mut = f;
@@ -411,7 +411,7 @@ export function SetTreeModule_foldOpt(f_mut, x_mut, t_mut) {
     SetTreeModule_foldOpt: while (true) {
         const f = f_mut, x = x_mut, t = t_mut;
         if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
                 f_mut = f;
@@ -436,7 +436,7 @@ export function SetTreeModule_forall(f_mut, t_mut) {
     SetTreeModule_forall: while (true) {
         const f = f_mut, t = t_mut;
         if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
                 if (f(SetTreeLeaf$1__get_Key(tn)) && SetTreeModule_forall(f, SetTreeNode$1__get_Left(tn))) {
@@ -462,7 +462,7 @@ export function SetTreeModule_exists(f_mut, t_mut) {
     SetTreeModule_exists: while (true) {
         const f = f_mut, t = t_mut;
         if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
                 if (f(SetTreeLeaf$1__get_Key(tn)) ? true : SetTreeModule_exists(f, SetTreeNode$1__get_Left(tn))) {
@@ -499,7 +499,7 @@ export function SetTreeModule_filterAux(comparer_mut, f_mut, t_mut, acc_mut) {
     SetTreeModule_filterAux: while (true) {
         const comparer = comparer_mut, f = f_mut, t = t_mut, acc = acc_mut;
         if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
                 const acc_1 = f(SetTreeLeaf$1__get_Key(tn)) ? SetTreeModule_add(comparer, SetTreeLeaf$1__get_Key(tn), acc) : acc;
@@ -532,7 +532,7 @@ export function SetTreeModule_diffAux(comparer_mut, t_mut, acc_mut) {
             return acc;
         }
         else if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
                 comparer_mut = comparer;
@@ -555,9 +555,9 @@ export function SetTreeModule_diff(comparer, a, b) {
 }
 export function SetTreeModule_union(comparer, t1, t2) {
     if (t1 != null) {
-        const t1$0027 = value_3(t1);
+        const t1$0027 = value_2(t1);
         if (t2 != null) {
-            const t2$0027 = value_3(t2);
+            const t2$0027 = value_2(t2);
             if (t1$0027 instanceof SetTreeNode$1) {
                 const t1n = t1$0027;
                 if (t2$0027 instanceof SetTreeNode$1) {
@@ -591,7 +591,7 @@ export function SetTreeModule_intersectionAux(comparer_mut, b_mut, t_mut, acc_mu
     SetTreeModule_intersectionAux: while (true) {
         const comparer = comparer_mut, b = b_mut, t = t_mut, acc = acc_mut;
         if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
                 const acc_1 = SetTreeModule_intersectionAux(comparer, b, SetTreeNode$1__get_Right(tn), acc);
@@ -631,7 +631,7 @@ export function SetTreeModule_partitionAux(comparer_mut, f_mut, t_mut, acc__mut,
         const comparer = comparer_mut, f = f_mut, t = t_mut, acc_ = acc__mut, acc__1 = acc__1_mut;
         const acc = [acc_, acc__1];
         if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
                 const acc_1 = SetTreeModule_partitionAux(comparer, f, SetTreeNode$1__get_Right(tn), acc[0], acc[1]);
@@ -660,7 +660,7 @@ export function SetTreeModule_minimumElementAux(t_mut, n_mut) {
     SetTreeModule_minimumElementAux: while (true) {
         const t = t_mut, n = n_mut;
         if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
                 t_mut = SetTreeNode$1__get_Left(tn);
@@ -679,7 +679,7 @@ export function SetTreeModule_minimumElementAux(t_mut, n_mut) {
 }
 export function SetTreeModule_minimumElementOpt(t) {
     if (t != null) {
-        const t2 = value_3(t);
+        const t2 = value_2(t);
         if (t2 instanceof SetTreeNode$1) {
             const tn = t2;
             return some(SetTreeModule_minimumElementAux(SetTreeNode$1__get_Left(tn), SetTreeLeaf$1__get_Key(tn)));
@@ -696,7 +696,7 @@ export function SetTreeModule_maximumElementAux(t_mut, n_mut) {
     SetTreeModule_maximumElementAux: while (true) {
         const t = t_mut, n = n_mut;
         if (t != null) {
-            const t2 = value_3(t);
+            const t2 = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2;
                 t_mut = SetTreeNode$1__get_Right(tn);
@@ -715,7 +715,7 @@ export function SetTreeModule_maximumElementAux(t_mut, n_mut) {
 }
 export function SetTreeModule_maximumElementOpt(t) {
     if (t != null) {
-        const t2 = value_3(t);
+        const t2 = value_2(t);
         if (t2 instanceof SetTreeNode$1) {
             const tn = t2;
             return some(SetTreeModule_maximumElementAux(SetTreeNode$1__get_Right(tn), SetTreeLeaf$1__get_Key(tn)));
@@ -734,7 +734,7 @@ export function SetTreeModule_minimumElement(s) {
         throw new Exception("Set contains no elements");
     }
     else {
-        return value_3(matchValue);
+        return value_2(matchValue);
     }
 }
 export function SetTreeModule_maximumElement(s) {
@@ -743,7 +743,7 @@ export function SetTreeModule_maximumElement(s) {
         throw new Exception("Set contains no elements");
     }
     else {
-        return value_3(matchValue);
+        return value_2(matchValue);
     }
 }
 export class SetTreeModule_SetIterator$1 extends Record {
@@ -763,7 +763,7 @@ export function SetTreeModule_collapseLHS(stack_mut) {
             const x = head(stack);
             const rest = tail(stack);
             if (x != null) {
-                const x2 = value_3(x);
+                const x2 = value_2(x);
                 if (x2 instanceof SetTreeNode$1) {
                     const xn = x2;
                     stack_mut = ofArrayWithTail([SetTreeNode$1__get_Left(xn), SetTreeLeaf$1_$ctor_2B595(SetTreeLeaf$1__get_Key(xn)), SetTreeNode$1__get_Right(xn)], rest);
@@ -800,7 +800,7 @@ export function SetTreeModule_current(i) {
             return SetTreeModule_alreadyFinished();
         }
         else if (head(matchValue) != null) {
-            const t = value_3(head(matchValue));
+            const t = value_2(head(matchValue));
             return SetTreeLeaf$1__get_Key(t);
         }
         else {
@@ -816,7 +816,7 @@ export function SetTreeModule_moveNext(i) {
         const matchValue = i.stack;
         if (!isEmpty_1(matchValue)) {
             if (head(matchValue) != null) {
-                const t = value_3(head(matchValue));
+                const t = value_2(head(matchValue));
                 if (t instanceof SetTreeNode$1) {
                     throw new Exception("Please report error: Set iterator, unexpected stack for moveNext");
                 }
@@ -867,8 +867,8 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
             if (!isEmpty_1(l2)) {
                 if (head(l2) != null) {
                     if (head(l1) != null) {
-                        const x1_3 = value_3(head(l1));
-                        const x2_3 = value_3(head(l2));
+                        const x1_3 = value_2(head(l1));
+                        const x2_3 = value_2(head(l2));
                         if (x1_3 instanceof SetTreeNode$1) {
                             const x1n_2 = x1_3;
                             if (SetTreeNode$1__get_Left(x1n_2) == null) {
@@ -892,13 +892,13 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                             if (head(l1) != null) {
                                                 matchResult = 0;
                                                 t1_6 = tail(l1);
-                                                x1_4 = value_3(head(l1));
+                                                x1_4 = value_2(head(l1));
                                             }
                                             else if (!isEmpty_1(l2)) {
                                                 if (head(l2) != null) {
                                                     matchResult = 1;
                                                     t2_6 = tail(l2);
-                                                    x2_4 = value_3(head(l2));
+                                                    x2_4 = value_2(head(l2));
                                                 }
                                                 else {
                                                     matchResult = 2;
@@ -912,7 +912,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                             if (head(l2) != null) {
                                                 matchResult = 1;
                                                 t2_6 = tail(l2);
-                                                x2_4 = value_3(head(l2));
+                                                x2_4 = value_2(head(l2));
                                             }
                                             else {
                                                 matchResult = 2;
@@ -974,13 +974,13 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                     if (head(l1) != null) {
                                         matchResult_1 = 0;
                                         t1_7 = tail(l1);
-                                        x1_5 = value_3(head(l1));
+                                        x1_5 = value_2(head(l1));
                                     }
                                     else if (!isEmpty_1(l2)) {
                                         if (head(l2) != null) {
                                             matchResult_1 = 1;
                                             t2_7 = tail(l2);
-                                            x2_5 = value_3(head(l2));
+                                            x2_5 = value_2(head(l2));
                                         }
                                         else {
                                             matchResult_1 = 2;
@@ -994,7 +994,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                     if (head(l2) != null) {
                                         matchResult_1 = 1;
                                         t2_7 = tail(l2);
-                                        x2_5 = value_3(head(l2));
+                                        x2_5 = value_2(head(l2));
                                     }
                                     else {
                                         matchResult_1 = 2;
@@ -1057,13 +1057,13 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                     if (head(l1) != null) {
                                         matchResult_2 = 0;
                                         t1_8 = tail(l1);
-                                        x1_6 = value_3(head(l1));
+                                        x1_6 = value_2(head(l1));
                                     }
                                     else if (!isEmpty_1(l2)) {
                                         if (head(l2) != null) {
                                             matchResult_2 = 1;
                                             t2_8 = tail(l2);
-                                            x2_6 = value_3(head(l2));
+                                            x2_6 = value_2(head(l2));
                                         }
                                         else {
                                             matchResult_2 = 2;
@@ -1077,7 +1077,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                                     if (head(l2) != null) {
                                         matchResult_2 = 1;
                                         t2_8 = tail(l2);
-                                        x2_6 = value_3(head(l2));
+                                        x2_6 = value_2(head(l2));
                                     }
                                     else {
                                         matchResult_2 = 2;
@@ -1134,19 +1134,19 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                         }
                     }
                     else {
-                        const x2 = value_3(head(l2));
+                        const x2 = value_2(head(l2));
                         let matchResult_3 = undefined, t1_2 = undefined, x1 = undefined, t2_2 = undefined, x2_1 = undefined;
                         if (!isEmpty_1(l1)) {
                             if (head(l1) != null) {
                                 matchResult_3 = 0;
                                 t1_2 = tail(l1);
-                                x1 = value_3(head(l1));
+                                x1 = value_2(head(l1));
                             }
                             else if (!isEmpty_1(l2)) {
                                 if (head(l2) != null) {
                                     matchResult_3 = 1;
                                     t2_2 = tail(l2);
-                                    x2_1 = value_3(head(l2));
+                                    x2_1 = value_2(head(l2));
                                 }
                                 else {
                                     matchResult_3 = 2;
@@ -1160,7 +1160,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                             if (head(l2) != null) {
                                 matchResult_3 = 1;
                                 t2_2 = tail(l2);
-                                x2_1 = value_3(head(l2));
+                                x2_1 = value_2(head(l2));
                             }
                             else {
                                 matchResult_3 = 2;
@@ -1204,19 +1204,19 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                     }
                 }
                 else if (head(l1) != null) {
-                    const x1_1 = value_3(head(l1));
+                    const x1_1 = value_2(head(l1));
                     let matchResult_4 = undefined, t1_4 = undefined, x1_2 = undefined, t2_4 = undefined, x2_2 = undefined;
                     if (!isEmpty_1(l1)) {
                         if (head(l1) != null) {
                             matchResult_4 = 0;
                             t1_4 = tail(l1);
-                            x1_2 = value_3(head(l1));
+                            x1_2 = value_2(head(l1));
                         }
                         else if (!isEmpty_1(l2)) {
                             if (head(l2) != null) {
                                 matchResult_4 = 1;
                                 t2_4 = tail(l2);
-                                x2_2 = value_3(head(l2));
+                                x2_2 = value_2(head(l2));
                             }
                             else {
                                 matchResult_4 = 2;
@@ -1230,7 +1230,7 @@ export function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                         if (head(l2) != null) {
                             matchResult_4 = 1;
                             t2_4 = tail(l2);
-                            x2_2 = value_3(head(l2));
+                            x2_2 = value_2(head(l2));
                         }
                         else {
                             matchResult_4 = 2;
@@ -1316,7 +1316,7 @@ export function SetTreeModule_toList(t) {
         loop: while (true) {
             const t$0027 = t$0027_mut, acc = acc_mut;
             if (t$0027 != null) {
-                const t2 = value_3(t$0027);
+                const t2 = value_2(t$0027);
                 if (t2 instanceof SetTreeNode$1) {
                     const tn = t2;
                     t$0027_mut = SetTreeNode$1__get_Left(tn);
@@ -1778,11 +1778,39 @@ export function isProperSubsetOf(s1, s2) {
     }
 }
 export function isProperSupersetOf(s1, s2) {
-    const s2_1 = cache(s2);
-    if (exists_1((arg) => !s1.has(arg), s2_1)) {
-        return forAll_1((value_2) => s1.has(value_2), s2_1);
+    const s2_1 = newMutableSetWith(s1, s2);
+    if (s1.size > s2_1.size) {
+        return forAll_1((value) => s1.has(value), s2_1.values());
     }
     else {
         return false;
     }
 }
+export function symmetricExceptWith(s1, s2) {
+    const s2_1 = newMutableSetWith(s1, s2);
+    iterate_1((x) => {
+        if (s1.has(x)) {
+            s1.delete(x);
+        }
+        else {
+            s1.add(x);
+        }
+    }, s2_1.values());
+}
+export function overlaps(s1, s2) {
+    return exists_1((value) => s1.has(value), s2);
+}
+export function setEquals(s1, s2) {
+    const s2_1 = newMutableSetWith(s1, s2);
+    if (s1.size === s2_1.size) {
+        return forAll_1((value) => s2_1.has(value), s1.values());
+    }
+    else {
+        return false;
+    }
+}
+export function copyToArray(s1, target, sourceIndex, targetIndex, count_1) {
+    iterateIndexed((index, value) => {
+        setItem(target, targetIndex + index, value);
+    }, truncate(count_1, skip(sourceIndex, s1.values())));
+}

package/String.js

@@ -84,6 +84,18 @@ export function endsWith(str, pattern, ic) {
     }
     return false;
 }
+export function contains(str, pattern, ic) {
+    if (ic === StringComparison.Ordinal) { // fast path
+        return str.includes(pattern);
+    }
+    const len = pattern.length;
+    for (let i = 0; i <= str.length - len; i++) {
+        if (cmp(str.slice(i, i + len), pattern, ic) === 0) {
+            return true;
+        }
+    }
+    return false;
+}
 export function indexOfAny(str, anyOf, ...args) {
     if (str == null || str === "") {
         return -1;
@@ -370,11 +382,24 @@ export function format(str, ...args) {
                     }
                     break;
                 case "g":
-                case "G":
+                case "G": {
                     rep = precision != null ? toPrecision(rep, precision) : toPrecision(rep);
-                    // TODO: Check why some numbers are formatted with decimal part
-                    rep = trimEnd(trimEnd(rep, "0"), ".");
+                    // Handle exponential notation: only trim trailing zeros from mantissa, not from exponent.
+                    // .NET G format guarantees an exponent of at least 2 digits with an explicit sign (e.g. "E-07").
+                    const eIdx = rep.indexOf("e");
+                    if (eIdx >= 0) {
+                        const mantissa = trimEnd(trimEnd(rep.slice(0, eIdx), "0"), ".");
+                        const expSign = rep[eIdx + 1]; // toPrecision always emits "+" or "-"
+                        const expDigits = rep.slice(eIdx + 2);
+                        const paddedExpDigits = expDigits.length < 2 ? "0" + expDigits : expDigits;
+                        const eChar = format === "G" ? "E" : "e";
+                        rep = mantissa + eChar + expSign + paddedExpDigits;
+                    }
+                    else {
+                        rep = trimEnd(trimEnd(rep, "0"), ".");
+                    }
                     break;
+                }
                 case "n":
                 case "N":
                     precision = precision != null ? precision : 2;
@@ -407,7 +432,7 @@ export function format(str, ...args) {
                     if (!isIntegral(rep)) {
                         throw new Exception("Format specifier was invalid.");
                     }
-                    precision = precision != null ? precision : 2;
+                    precision = precision != null ? precision : 1;
                     rep = padLeft(toHex(rep), precision, "0");
                     if (format === "X") {
                         rep = rep.toUpperCase();

package/System.Text.js

@@ -1,7 +1,7 @@
 import { replace, format, replicate, substring, isNullOrEmpty, join } from "./String.js";
 import { class_type } from "./Reflection.js";
 import { toString } from "./Types.js";
-import { Exception, clear, int32ToString } from "./Util.js";
+import { Exception, clear, int64ToString, int32ToString, int16ToString } from "./Util.js";
 import { setItem, item } from "./Array.js";
 export class StringBuilder {
     constructor(value, capacity) {
@@ -47,10 +47,42 @@ export function StringBuilder__Append_61B1CA(x, c, repeatCount) {
     void (x.buf.push(s));
     return x;
 }
+export function StringBuilder__Append_Z510FF069(x, o) {
+    void (x.buf.push(o.toString()));
+    return x;
+}
+export function StringBuilder__Append_244D3E44(x, o) {
+    void (x.buf.push(o.toString()));
+    return x;
+}
+export function StringBuilder__Append_Z524259E6(x, o) {
+    void (x.buf.push(int16ToString(o)));
+    return x;
+}
+export function StringBuilder__Append_Z6EF82811(x, o) {
+    void (x.buf.push(o.toString()));
+    return x;
+}
 export function StringBuilder__Append_Z524259A4(x, o) {
     void (x.buf.push(int32ToString(o)));
     return x;
 }
+export function StringBuilder__Append_Z6EF827D7(x, o) {
+    void (x.buf.push(o.toString()));
+    return x;
+}
+export function StringBuilder__Append_Z524259C1(x, o) {
+    void (x.buf.push(int64ToString(o)));
+    return x;
+}
+export function StringBuilder__Append_Z6EF827B6(x, o) {
+    void (x.buf.push(o.toString()));
+    return x;
+}
+export function StringBuilder__Append_Z7138B98C(x, o) {
+    void (x.buf.push(o.toString()));
+    return x;
+}
 export function StringBuilder__Append_5E38073B(x, o) {
     void (x.buf.push(o.toString()));
     return x;

package/package.json

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