@fable-org/fable-library-ts 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.ts

@@ -273,13 +273,13 @@ function dateToStringWithCustomFormat(date: Date, format: string, utc: boolean)
         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;
@@ -410,9 +410,28 @@ function dateToStringWithOffset(date: IDateTimeOffset, format?: string) {
     switch (format) {
       case "D": return dateToString_D(d);
       case "d": return dateToString_d(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 "O": case "o": return dateToISOStringWithOffset(d, (date.offset ?? 0));
+      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");
     }
   } else {
@@ -444,6 +463,49 @@ function dateToString_t(date: IDateTime) {
     + ":" + padWithZeros(minute(date), 2);
 }
 
+// RFC 1123: "Thu, 01 Jan 2009 00:00:00 GMT" — always UTC
+function dateToString_R(date: IDateTime) {
+  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: IDateTime) {
+  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: IDateTime) {
+  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: IDateTime) {
+  return longMonths[month(date) - 1] + " " + padWithZeros(day(date), 2);
+}
+
+// Year/month (InvariantCulture "yyyy MMMM"): "2009 June"
+function dateToString_Y(date: IDateTime) {
+  return year(date) + " " + longMonths[month(date) - 1];
+}
+
 function dateToStringWithKind(date: IDateTime, format?: string) {
   const utc = date.kind === DateTimeKind.Utc;
   if (typeof format !== "string") {
@@ -452,10 +514,19 @@ function dateToStringWithKind(date: IDateTime, format?: string) {
     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.ts

@@ -248,14 +248,16 @@ export function fromParts(low: number, mid: number, high: number, isNegative: bo
 
 export function getBits(d: Decimal) {
   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.ts

@@ -1,6 +1,7 @@
 import { FSharpRef, Record, Union } from "./Types.ts";
 import { Exception, MutableArray, combineHashCodes, equalArraysWith, IEquatable, stringHash } from "./Util.ts";
 import Decimal from "./Decimal.ts";
+import { Some, some } from "./Option.ts";
 
 export type FieldInfo = [string, TypeInfo];
 export type PropertyInfo = FieldInfo;
@@ -155,7 +156,18 @@ export function lambda_type(argType: TypeInfo, returnType: TypeInfo): TypeInfo {
 }
 
 export function option_type(generic: TypeInfo): TypeInfo {
-  return new TypeInfo("Microsoft.FSharp.Core.FSharpOption`1", [generic]);
+  const t: TypeInfo = 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: TypeInfo): TypeInfo {
@@ -443,6 +455,15 @@ export function isFunction(t: TypeInfo): boolean {
 
 export function getUnionFields(v: any, t: TypeInfo): [CaseInfo, any[]] {
   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`);
@@ -478,6 +499,10 @@ export function makeUnion(uci: CaseInfo, values: MutableArray<any>): any {
   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.ts

@@ -6,9 +6,10 @@ import { class_type, TypeInfo } from "./Reflection.ts";
 import { some, value as value_1, Option } from "./Option.ts";
 import { KeyNotFoundException_$ctor_Z721C83C5 } from "./System.Collections.Generic.ts";
 import { Operators_Lock, Operators_NullArgCheck } from "./FSharp.Core.ts";
-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.ts";
+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.ts";
 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.ts";
 import { float64, int32 } from "./Int32.ts";
+import { min as min_1 } from "./Double.ts";
 import { SR_indexOutOfBounds } from "./Global.ts";
 import { nonSeeded } from "./Random.ts";
 
@@ -724,7 +725,14 @@ export function fold2<T1, T2, State>(folder: ((arg0: State, arg1: T1, arg2: T2)
 }
 
 export function foldBack2<T1, T2, State>(folder: ((arg0: T1, arg1: T2, arg2: State) => State), xs: Iterable<T1>, ys: Iterable<T2>, state: State): State {
-    return foldBack2_1<T1, T2, State>(folder, toArray<T1>(xs), toArray<T2>(ys), state);
+    const xs_1: MutableArray<T1> = toArray<T1>(xs);
+    const ys_1: MutableArray<T2> = toArray<T2>(ys);
+    const len: int32 = min_1(xs_1.length, ys_1.length) | 0;
+    let acc: State = state;
+    for (let i: int32 = len - 1; i >= 0; i--) {
+        acc = folder(item_1(i, xs_1), item_1(i, ys_1), acc);
+    }
+    return acc;
 }
 
 export function forAll<$a>(predicate: ((arg0: $a) => boolean), xs: Iterable<$a>): boolean {

package/Set.ts

@@ -1,6 +1,6 @@
 
 import { record_type, bool_type, list_type, option_type, class_type, TypeInfo } from "./Reflection.ts";
-import { some, value as value_3, Option } from "./Option.ts";
+import { some, value as value_2, Option } from "./Option.ts";
 import { int32 } from "./Int32.ts";
 import { structuralHash, ISet, toIterator, IDisposable, disposeSafe, getEnumerator, isArrayLike, MutableArray, IEnumerator, IComparer, Exception } from "./Util.ts";
 import { Record } from "./Types.ts";
@@ -8,7 +8,7 @@ import { fold as fold_2, cons, singleton as singleton_1, empty as empty_1, ofArr
 import { fold as fold_1, fill, setItem } from "./Array.ts";
 import { join } from "./String.ts";
 import { NotSupportedException_$ctor_Z721C83C5 } from "./System.ts";
-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.ts";
+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.ts";
 import { HashSet__get_Comparer, HashSet_$ctor_Z6150332D, HashSet } from "./MutableSet.ts";
 
 export class SetTreeLeaf$1<T> {
@@ -71,7 +71,7 @@ export function SetTreeModule_countAux<T>(t_mut: Option<SetTreeLeaf$1<T>>, acc_m
     while (true) {
         const t: Option<SetTreeLeaf$1<T>> = t_mut, acc: int32 = acc_mut;
         if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
                 t_mut = SetTreeNode$1__get_Left<T>(tn);
@@ -98,7 +98,7 @@ export function SetTreeModule_mk<T>(l: Option<SetTreeLeaf$1<T>>, k: T, r: Option
     let hl: int32;
     const t: Option<SetTreeLeaf$1<T>> = l;
     if (t != null) {
-        const t2: SetTreeLeaf$1<T> = value_3(t);
+        const t2: SetTreeLeaf$1<T> = value_2(t);
         hl = ((t2 instanceof SetTreeNode$1) ? ((tn = (t2 as SetTreeNode$1<T>), SetTreeNode$1__get_Height<T>(tn))) : 1);
     }
     else {
@@ -107,7 +107,7 @@ export function SetTreeModule_mk<T>(l: Option<SetTreeLeaf$1<T>>, k: T, r: Option
     let hr: int32;
     const t_1: Option<SetTreeLeaf$1<T>> = r;
     if (t_1 != null) {
-        const t2_1: SetTreeLeaf$1<T> = value_3(t_1);
+        const t2_1: SetTreeLeaf$1<T> = value_2(t_1);
         hr = ((t2_1 instanceof SetTreeNode$1) ? ((tn_1 = (t2_1 as SetTreeNode$1<T>), SetTreeNode$1__get_Height<T>(tn_1))) : 1);
     }
     else {
@@ -127,7 +127,7 @@ export function SetTreeModule_rebalance<T>(t1: Option<SetTreeLeaf$1<T>>, v: T, t
     let t1h: int32;
     const t: Option<SetTreeLeaf$1<T>> = t1;
     if (t != null) {
-        const t2_1: SetTreeLeaf$1<T> = value_3(t);
+        const t2_1: SetTreeLeaf$1<T> = value_2(t);
         t1h = ((t2_1 instanceof SetTreeNode$1) ? ((tn = (t2_1 as SetTreeNode$1<T>), SetTreeNode$1__get_Height<T>(tn))) : 1);
     }
     else {
@@ -136,18 +136,18 @@ export function SetTreeModule_rebalance<T>(t1: Option<SetTreeLeaf$1<T>>, v: T, t
     let t2h: int32;
     const t_1: Option<SetTreeLeaf$1<T>> = t2;
     if (t_1 != null) {
-        const t2_2: SetTreeLeaf$1<T> = value_3(t_1);
+        const t2_2: SetTreeLeaf$1<T> = value_2(t_1);
         t2h = ((t2_2 instanceof SetTreeNode$1) ? ((tn_1 = (t2_2 as SetTreeNode$1<T>), SetTreeNode$1__get_Height<T>(tn_1))) : 1);
     }
     else {
         t2h = 0;
     }
     if (t2h > (t1h + 2)) {
-        const matchValue: SetTreeLeaf$1<T> = value_3(t2);
+        const matchValue: SetTreeLeaf$1<T> = value_2(t2);
         if (matchValue instanceof SetTreeNode$1) {
             const t2$0027 = matchValue as SetTreeNode$1<T>;
-            if (((t_2 = SetTreeNode$1__get_Left<T>(t2$0027), (t_2 != null) ? ((t2_3 = value_3(t_2), (t2_3 instanceof SetTreeNode$1) ? ((tn_2 = (t2_3 as SetTreeNode$1<T>), SetTreeNode$1__get_Height<T>(tn_2))) : 1)) : 0)) > (t1h + 1)) {
-                const matchValue_1: SetTreeLeaf$1<T> = value_3(SetTreeNode$1__get_Left<T>(t2$0027));
+            if (((t_2 = SetTreeNode$1__get_Left<T>(t2$0027), (t_2 != null) ? ((t2_3 = value_2(t_2), (t2_3 instanceof SetTreeNode$1) ? ((tn_2 = (t2_3 as SetTreeNode$1<T>), SetTreeNode$1__get_Height<T>(tn_2))) : 1)) : 0)) > (t1h + 1)) {
+                const matchValue_1: SetTreeLeaf$1<T> = value_2(SetTreeNode$1__get_Left<T>(t2$0027));
                 if (matchValue_1 instanceof SetTreeNode$1) {
                     const t2l = matchValue_1 as SetTreeNode$1<T>;
                     return SetTreeModule_mk<T>(SetTreeModule_mk<T>(t1, v, SetTreeNode$1__get_Left<T>(t2l)), SetTreeLeaf$1__get_Key<T>(t2l), SetTreeModule_mk<T>(SetTreeNode$1__get_Right<T>(t2l), SetTreeLeaf$1__get_Key<T>(t2$0027), SetTreeNode$1__get_Right<T>(t2$0027)));
@@ -165,11 +165,11 @@ export function SetTreeModule_rebalance<T>(t1: Option<SetTreeLeaf$1<T>>, v: T, t
         }
     }
     else if (t1h > (t2h + 2)) {
-        const matchValue_2: SetTreeLeaf$1<T> = value_3(t1);
+        const matchValue_2: SetTreeLeaf$1<T> = value_2(t1);
         if (matchValue_2 instanceof SetTreeNode$1) {
             const t1$0027 = matchValue_2 as SetTreeNode$1<T>;
-            if (((t_3 = SetTreeNode$1__get_Right<T>(t1$0027), (t_3 != null) ? ((t2_4 = value_3(t_3), (t2_4 instanceof SetTreeNode$1) ? ((tn_3 = (t2_4 as SetTreeNode$1<T>), SetTreeNode$1__get_Height<T>(tn_3))) : 1)) : 0)) > (t2h + 1)) {
-                const matchValue_3: SetTreeLeaf$1<T> = value_3(SetTreeNode$1__get_Right<T>(t1$0027));
+            if (((t_3 = SetTreeNode$1__get_Right<T>(t1$0027), (t_3 != null) ? ((t2_4 = value_2(t_3), (t2_4 instanceof SetTreeNode$1) ? ((tn_3 = (t2_4 as SetTreeNode$1<T>), SetTreeNode$1__get_Height<T>(tn_3))) : 1)) : 0)) > (t2h + 1)) {
+                const matchValue_3: SetTreeLeaf$1<T> = value_2(SetTreeNode$1__get_Right<T>(t1$0027));
                 if (matchValue_3 instanceof SetTreeNode$1) {
                     const t1r = matchValue_3 as SetTreeNode$1<T>;
                     return SetTreeModule_mk<T>(SetTreeModule_mk<T>(SetTreeNode$1__get_Left<T>(t1$0027), SetTreeLeaf$1__get_Key<T>(t1$0027), SetTreeNode$1__get_Left<T>(t1r)), SetTreeLeaf$1__get_Key<T>(t1r), SetTreeModule_mk<T>(SetTreeNode$1__get_Right<T>(t1r), v, t2));
@@ -193,7 +193,7 @@ export function SetTreeModule_rebalance<T>(t1: Option<SetTreeLeaf$1<T>>, v: T, t
 
 export function SetTreeModule_add<T>(comparer: IComparer<T>, k: T, t: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>> {
     if (t != null) {
-        const t2: SetTreeLeaf$1<T> = value_3(t);
+        const t2: SetTreeLeaf$1<T> = value_2(t);
         const c: int32 = comparer.Compare(k, SetTreeLeaf$1__get_Key<T>(t2)) | 0;
         if (t2 instanceof SetTreeNode$1) {
             const tn = t2 as SetTreeNode$1<T>;
@@ -227,9 +227,9 @@ export function SetTreeModule_add<T>(comparer: IComparer<T>, k: T, t: Option<Set
 
 export function SetTreeModule_balance<T>(comparer: IComparer<T>, t1: Option<SetTreeLeaf$1<T>>, k: T, t2: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>> {
     if (t1 != null) {
-        const t1$0027: SetTreeLeaf$1<T> = value_3(t1);
+        const t1$0027: SetTreeLeaf$1<T> = value_2(t1);
         if (t2 != null) {
-            const t2$0027: SetTreeLeaf$1<T> = value_3(t2);
+            const t2$0027: SetTreeLeaf$1<T> = value_2(t2);
             if (t1$0027 instanceof SetTreeNode$1) {
                 const t1n = t1$0027 as SetTreeNode$1<T>;
                 if (t2$0027 instanceof SetTreeNode$1) {
@@ -263,7 +263,7 @@ export function SetTreeModule_balance<T>(comparer: IComparer<T>, t1: Option<SetT
 
 export function SetTreeModule_split<T>(comparer: IComparer<T>, pivot: T, t: Option<SetTreeLeaf$1<T>>): [Option<SetTreeLeaf$1<T>>, boolean, Option<SetTreeLeaf$1<T>>] {
     if (t != null) {
-        const t2: SetTreeLeaf$1<T> = value_3(t);
+        const t2: SetTreeLeaf$1<T> = value_2(t);
         if (t2 instanceof SetTreeNode$1) {
             const tn = t2 as SetTreeNode$1<T>;
             const c: int32 = comparer.Compare(pivot, SetTreeLeaf$1__get_Key<T>(tn)) | 0;
@@ -299,7 +299,7 @@ export function SetTreeModule_split<T>(comparer: IComparer<T>, pivot: T, t: Opti
 
 export function SetTreeModule_spliceOutSuccessor<T>(t: Option<SetTreeLeaf$1<T>>): [T, Option<SetTreeLeaf$1<T>>] {
     if (t != null) {
-        const t2: SetTreeLeaf$1<T> = value_3(t);
+        const t2: SetTreeLeaf$1<T> = value_2(t);
         if (t2 instanceof SetTreeNode$1) {
             const tn = t2 as SetTreeNode$1<T>;
             if (SetTreeNode$1__get_Left<T>(tn) == null) {
@@ -321,7 +321,7 @@ export function SetTreeModule_spliceOutSuccessor<T>(t: Option<SetTreeLeaf$1<T>>)
 
 export function SetTreeModule_remove<T>(comparer: IComparer<T>, k: T, t: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>> {
     if (t != null) {
-        const t2: SetTreeLeaf$1<T> = value_3(t);
+        const t2: SetTreeLeaf$1<T> = value_2(t);
         const c: int32 = comparer.Compare(k, SetTreeLeaf$1__get_Key<T>(t2)) | 0;
         if (t2 instanceof SetTreeNode$1) {
             const tn = t2 as SetTreeNode$1<T>;
@@ -361,7 +361,7 @@ export function SetTreeModule_mem<T>(comparer_mut: IComparer<T>, k_mut: T, t_mut
     while (true) {
         const comparer: IComparer<T> = comparer_mut, k: T = k_mut, t: Option<SetTreeLeaf$1<T>> = t_mut;
         if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             const c: int32 = comparer.Compare(k, SetTreeLeaf$1__get_Key<T>(t2)) | 0;
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
@@ -397,7 +397,7 @@ export function SetTreeModule_iter<T>(f_mut: ((arg0: T) => void), t_mut: Option<
     while (true) {
         const f: ((arg0: T) => void) = f_mut, t: Option<SetTreeLeaf$1<T>> = t_mut;
         if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
                 SetTreeModule_iter<T>(f, SetTreeNode$1__get_Left<T>(tn));
@@ -419,7 +419,7 @@ export function SetTreeModule_foldBackOpt<T, $a>(f_mut: any, t_mut: Option<SetTr
     while (true) {
         const f: any = f_mut, t: Option<SetTreeLeaf$1<T>> = t_mut, x: $a = x_mut;
         if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
                 f_mut = f;
@@ -447,7 +447,7 @@ export function SetTreeModule_foldOpt<$a, T>(f_mut: any, x_mut: $a, t_mut: Optio
     while (true) {
         const f: any = f_mut, x: $a = x_mut, t: Option<SetTreeLeaf$1<T>> = t_mut;
         if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
                 f_mut = f;
@@ -475,7 +475,7 @@ export function SetTreeModule_forall<T>(f_mut: ((arg0: T) => boolean), t_mut: Op
     while (true) {
         const f: ((arg0: T) => boolean) = f_mut, t: Option<SetTreeLeaf$1<T>> = t_mut;
         if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
                 if (f(SetTreeLeaf$1__get_Key<T>(tn)) && SetTreeModule_forall<T>(f, SetTreeNode$1__get_Left<T>(tn))) {
@@ -503,7 +503,7 @@ export function SetTreeModule_exists<T>(f_mut: ((arg0: T) => boolean), t_mut: Op
     while (true) {
         const f: ((arg0: T) => boolean) = f_mut, t: Option<SetTreeLeaf$1<T>> = t_mut;
         if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
                 if (f(SetTreeLeaf$1__get_Key<T>(tn)) ? true : SetTreeModule_exists<T>(f, SetTreeNode$1__get_Left<T>(tn))) {
@@ -544,7 +544,7 @@ export function SetTreeModule_filterAux<T>(comparer_mut: IComparer<T>, f_mut: ((
     while (true) {
         const comparer: IComparer<T> = comparer_mut, f: ((arg0: T) => boolean) = f_mut, t: Option<SetTreeLeaf$1<T>> = t_mut, acc: Option<SetTreeLeaf$1<T>> = acc_mut;
         if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
                 const acc_1: Option<SetTreeLeaf$1<T>> = f(SetTreeLeaf$1__get_Key<T>(tn)) ? SetTreeModule_add<T>(comparer, SetTreeLeaf$1__get_Key<T>(tn), acc) : acc;
@@ -580,7 +580,7 @@ export function SetTreeModule_diffAux<T>(comparer_mut: IComparer<T>, t_mut: Opti
             return acc;
         }
         else if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
                 comparer_mut = comparer;
@@ -605,9 +605,9 @@ export function SetTreeModule_diff<$a>(comparer: IComparer<$a>, a: Option<SetTre
 
 export function SetTreeModule_union<T>(comparer: IComparer<T>, t1: Option<SetTreeLeaf$1<T>>, t2: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>> {
     if (t1 != null) {
-        const t1$0027: SetTreeLeaf$1<T> = value_3(t1);
+        const t1$0027: SetTreeLeaf$1<T> = value_2(t1);
         if (t2 != null) {
-            const t2$0027: SetTreeLeaf$1<T> = value_3(t2);
+            const t2$0027: SetTreeLeaf$1<T> = value_2(t2);
             if (t1$0027 instanceof SetTreeNode$1) {
                 const t1n = t1$0027 as SetTreeNode$1<T>;
                 if (t2$0027 instanceof SetTreeNode$1) {
@@ -643,7 +643,7 @@ export function SetTreeModule_intersectionAux<T>(comparer_mut: IComparer<T>, b_m
     while (true) {
         const comparer: IComparer<T> = comparer_mut, b: Option<SetTreeLeaf$1<T>> = b_mut, t: Option<SetTreeLeaf$1<T>> = t_mut, acc: Option<SetTreeLeaf$1<T>> = acc_mut;
         if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
                 const acc_1: Option<SetTreeLeaf$1<T>> = SetTreeModule_intersectionAux<T>(comparer, b, SetTreeNode$1__get_Right<T>(tn), acc);
@@ -687,7 +687,7 @@ export function SetTreeModule_partitionAux<T>(comparer_mut: IComparer<T>, f_mut:
         const comparer: IComparer<T> = comparer_mut, f: ((arg0: T) => boolean) = f_mut, t: Option<SetTreeLeaf$1<T>> = t_mut, acc_: Option<SetTreeLeaf$1<T>> = acc__mut, acc__1: Option<SetTreeLeaf$1<T>> = acc__1_mut;
         const acc = [acc_, acc__1] as [Option<SetTreeLeaf$1<T>>, Option<SetTreeLeaf$1<T>>];
         if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
                 const acc_1: [Option<SetTreeLeaf$1<T>>, Option<SetTreeLeaf$1<T>>] = SetTreeModule_partitionAux<T>(comparer, f, SetTreeNode$1__get_Right<T>(tn), acc[0], acc[1]);
@@ -719,7 +719,7 @@ export function SetTreeModule_minimumElementAux<T>(t_mut: Option<SetTreeLeaf$1<T
     while (true) {
         const t: Option<SetTreeLeaf$1<T>> = t_mut, n: T = n_mut;
         if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
                 t_mut = SetTreeNode$1__get_Left<T>(tn);
@@ -739,7 +739,7 @@ export function SetTreeModule_minimumElementAux<T>(t_mut: Option<SetTreeLeaf$1<T
 
 export function SetTreeModule_minimumElementOpt<T>(t: Option<SetTreeLeaf$1<T>>): Option<T> {
     if (t != null) {
-        const t2: SetTreeLeaf$1<T> = value_3(t);
+        const t2: SetTreeLeaf$1<T> = value_2(t);
         if (t2 instanceof SetTreeNode$1) {
             const tn = t2 as SetTreeNode$1<T>;
             return some(SetTreeModule_minimumElementAux<T>(SetTreeNode$1__get_Left<T>(tn), SetTreeLeaf$1__get_Key<T>(tn)));
@@ -758,7 +758,7 @@ export function SetTreeModule_maximumElementAux<T>(t_mut: Option<SetTreeLeaf$1<T
     while (true) {
         const t: Option<SetTreeLeaf$1<T>> = t_mut, n: T = n_mut;
         if (t != null) {
-            const t2: SetTreeLeaf$1<T> = value_3(t);
+            const t2: SetTreeLeaf$1<T> = value_2(t);
             if (t2 instanceof SetTreeNode$1) {
                 const tn = t2 as SetTreeNode$1<T>;
                 t_mut = SetTreeNode$1__get_Right<T>(tn);
@@ -778,7 +778,7 @@ export function SetTreeModule_maximumElementAux<T>(t_mut: Option<SetTreeLeaf$1<T
 
 export function SetTreeModule_maximumElementOpt<T>(t: Option<SetTreeLeaf$1<T>>): Option<T> {
     if (t != null) {
-        const t2: SetTreeLeaf$1<T> = value_3(t);
+        const t2: SetTreeLeaf$1<T> = value_2(t);
         if (t2 instanceof SetTreeNode$1) {
             const tn = t2 as SetTreeNode$1<T>;
             return some(SetTreeModule_maximumElementAux<T>(SetTreeNode$1__get_Right<T>(tn), SetTreeLeaf$1__get_Key<T>(tn)));
@@ -798,7 +798,7 @@ export function SetTreeModule_minimumElement<$a>(s: Option<SetTreeLeaf$1<$a>>):
         throw new Exception("Set contains no elements");
     }
     else {
-        return value_3(matchValue);
+        return value_2(matchValue);
     }
 }
 
@@ -808,7 +808,7 @@ export function SetTreeModule_maximumElement<$a>(s: Option<SetTreeLeaf$1<$a>>):
         throw new Exception("Set contains no elements");
     }
     else {
-        return value_3(matchValue);
+        return value_2(matchValue);
     }
 }
 
@@ -834,7 +834,7 @@ export function SetTreeModule_collapseLHS<T>(stack_mut: FSharpList<Option<SetTre
             const x: Option<SetTreeLeaf$1<T>> = head(stack);
             const rest: FSharpList<Option<SetTreeLeaf$1<T>>> = tail(stack);
             if (x != null) {
-                const x2: SetTreeLeaf$1<T> = value_3(x);
+                const x2: SetTreeLeaf$1<T> = value_2(x);
                 if (x2 instanceof SetTreeNode$1) {
                     const xn = x2 as SetTreeNode$1<T>;
                     stack_mut = ofArrayWithTail([SetTreeNode$1__get_Left<T>(xn), SetTreeLeaf$1_$ctor_2B595<T>(SetTreeLeaf$1__get_Key<T>(xn)), SetTreeNode$1__get_Right<T>(xn)], rest);
@@ -875,7 +875,7 @@ export function SetTreeModule_current<$a>(i: SetTreeModule_SetIterator$1<$a>): $
             return SetTreeModule_alreadyFinished<$a>();
         }
         else if (head(matchValue) != null) {
-            const t: SetTreeLeaf$1<$a> = value_3(head(matchValue));
+            const t: SetTreeLeaf$1<$a> = value_2(head(matchValue));
             return SetTreeLeaf$1__get_Key<$a>(t);
         }
         else {
@@ -892,7 +892,7 @@ export function SetTreeModule_moveNext<T>(i: SetTreeModule_SetIterator$1<T>): bo
         const matchValue: FSharpList<Option<SetTreeLeaf$1<T>>> = i.stack;
         if (!isEmpty_1(matchValue)) {
             if (head(matchValue) != null) {
-                const t: SetTreeLeaf$1<T> = value_3(head(matchValue));
+                const t: SetTreeLeaf$1<T> = value_2(head(matchValue));
                 if (t instanceof SetTreeNode$1) {
                     throw new Exception("Please report error: Set iterator, unexpected stack for moveNext");
                 }
@@ -946,8 +946,8 @@ export function SetTreeModule_compareStacks<T>(comparer_mut: IComparer<T>, l1_mu
             if (!isEmpty_1(l2)) {
                 if (head(l2) != null) {
                     if (head(l1) != null) {
-                        const x1_3: SetTreeLeaf$1<T> = value_3(head(l1));
-                        const x2_3: SetTreeLeaf$1<T> = value_3(head(l2));
+                        const x1_3: SetTreeLeaf$1<T> = value_2(head(l1));
+                        const x2_3: SetTreeLeaf$1<T> = value_2(head(l2));
                         if (x1_3 instanceof SetTreeNode$1) {
                             const x1n_2 = x1_3 as SetTreeNode$1<T>;
                             if (SetTreeNode$1__get_Left<T>(x1n_2) == null) {
@@ -971,13 +971,13 @@ export function SetTreeModule_compareStacks<T>(comparer_mut: IComparer<T>, l1_mu
                                             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;
@@ -991,7 +991,7 @@ export function SetTreeModule_compareStacks<T>(comparer_mut: IComparer<T>, l1_mu
                                             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;
@@ -1053,13 +1053,13 @@ export function SetTreeModule_compareStacks<T>(comparer_mut: IComparer<T>, l1_mu
                                     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;
@@ -1073,7 +1073,7 @@ export function SetTreeModule_compareStacks<T>(comparer_mut: IComparer<T>, l1_mu
                                     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;
@@ -1136,13 +1136,13 @@ export function SetTreeModule_compareStacks<T>(comparer_mut: IComparer<T>, l1_mu
                                     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;
@@ -1156,7 +1156,7 @@ export function SetTreeModule_compareStacks<T>(comparer_mut: IComparer<T>, l1_mu
                                     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;
@@ -1213,19 +1213,19 @@ export function SetTreeModule_compareStacks<T>(comparer_mut: IComparer<T>, l1_mu
                         }
                     }
                     else {
-                        const x2: SetTreeLeaf$1<T> = value_3(head(l2));
+                        const x2: SetTreeLeaf$1<T> = value_2(head(l2));
                         let matchResult_3: int32 = (undefined as any), t1_2: FSharpList<Option<SetTreeLeaf$1<T>>> = (undefined as any), x1: SetTreeLeaf$1<T> = (undefined as any), t2_2: FSharpList<Option<SetTreeLeaf$1<T>>> = (undefined as any), x2_1: SetTreeLeaf$1<T> = (undefined as any);
                         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;
@@ -1239,7 +1239,7 @@ export function SetTreeModule_compareStacks<T>(comparer_mut: IComparer<T>, l1_mu
                             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;
@@ -1283,19 +1283,19 @@ export function SetTreeModule_compareStacks<T>(comparer_mut: IComparer<T>, l1_mu
                     }
                 }
                 else if (head(l1) != null) {
-                    const x1_1: SetTreeLeaf$1<T> = value_3(head(l1));
+                    const x1_1: SetTreeLeaf$1<T> = value_2(head(l1));
                     let matchResult_4: int32 = (undefined as any), t1_4: FSharpList<Option<SetTreeLeaf$1<T>>> = (undefined as any), x1_2: SetTreeLeaf$1<T> = (undefined as any), t2_4: FSharpList<Option<SetTreeLeaf$1<T>>> = (undefined as any), x2_2: SetTreeLeaf$1<T> = (undefined as any);
                     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;
@@ -1309,7 +1309,7 @@ export function SetTreeModule_compareStacks<T>(comparer_mut: IComparer<T>, l1_mu
                         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;
@@ -1399,7 +1399,7 @@ export function SetTreeModule_toList<T>(t: Option<SetTreeLeaf$1<T>>): FSharpList
         while (true) {
             const t$0027: Option<SetTreeLeaf$1<T>> = t$0027_mut, acc: FSharpList<T> = acc_mut;
             if (t$0027 != null) {
-                const t2: SetTreeLeaf$1<T> = value_3(t$0027);
+                const t2: SetTreeLeaf$1<T> = value_2(t$0027);
                 if (t2 instanceof SetTreeNode$1) {
                     const tn = t2 as SetTreeNode$1<T>;
                     t$0027_mut = SetTreeNode$1__get_Left<T>(tn);
@@ -1944,12 +1944,44 @@ export function isProperSubsetOf<T>(s1: ISet<T>, s2: Iterable<T>): boolean {
 }
 
 export function isProperSupersetOf<T>(s1: ISet<T>, s2: Iterable<T>): boolean {
-    const s2_1: Iterable<T> = cache<T>(s2);
-    if (exists_1<T>((arg: T): boolean => !s1.has(arg), s2_1)) {
-        return forAll_1<T>((value_2: T): boolean => s1.has(value_2), s2_1);
+    const s2_1: ISet<T> = newMutableSetWith<T>(s1, s2);
+    if (s1.size > s2_1.size) {
+        return forAll_1<T>((value: T): boolean => s1.has(value), s2_1.values());
     }
     else {
         return false;
     }
 }
 
+export function symmetricExceptWith<T>(s1: ISet<T>, s2: Iterable<T>): void {
+    const s2_1: ISet<T> = newMutableSetWith<T>(s1, s2);
+    iterate_1<T>((x: T): void => {
+        if (s1.has(x)) {
+            s1.delete(x);
+        }
+        else {
+            s1.add(x);
+        }
+    }, s2_1.values());
+}
+
+export function overlaps<T>(s1: ISet<T>, s2: Iterable<T>): boolean {
+    return exists_1<T>((value: T): boolean => s1.has(value), s2);
+}
+
+export function setEquals<T>(s1: ISet<T>, s2: Iterable<T>): boolean {
+    const s2_1: ISet<T> = newMutableSetWith<T>(s1, s2);
+    if (s1.size === s2_1.size) {
+        return forAll_1<T>((value: T): boolean => s2_1.has(value), s1.values());
+    }
+    else {
+        return false;
+    }
+}
+
+export function copyToArray<T>(s1: ISet<T>, target: MutableArray<T>, sourceIndex: int32, targetIndex: int32, count_1: int32): void {
+    iterateIndexed<T>((index: int32, value: T): void => {
+        setItem(target, targetIndex + index, value);
+    }, truncate<T>(count_1, skip<T>(sourceIndex, s1.values())));
+}
+

package/String.ts

@@ -86,6 +86,19 @@ export function endsWith(str: string, pattern: string, ic: boolean | StringCompa
   return false;
 }
 
+export function contains(str: string, pattern: string, ic: boolean | StringComparison) {
+  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: string, anyOf: string[], ...args: number[]) {
   if (str == null || str === "") {
     return -1;
@@ -377,11 +390,23 @@ export function format(str: string | object, ...args: any[]) {
             rep = parts.integral + "." + padRight(parts.decimal, precision, "0");
           }
           break;
-        case "g": 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;
           rep = toFixed(rep, precision);
@@ -408,7 +433,7 @@ export function format(str: string | object, ...args: any[]) {
           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.ts

@@ -1,9 +1,10 @@
 
 import { replace, format, replicate, substring, isNullOrEmpty, join } from "./String.ts";
-import { float64, int32 } from "./Int32.ts";
+import { float64, float32, uint32, uint16, int16, uint8, int8, int32 } from "./Int32.ts";
 import { class_type, TypeInfo } from "./Reflection.ts";
 import { toString } from "./Types.ts";
-import { Exception, clear, MutableArray, int32ToString } from "./Util.ts";
+import { Exception, clear, MutableArray, int64ToString, int32ToString, int16ToString } from "./Util.ts";
+import { uint64, int64 } from "./BigInt.ts";
 import { setItem, item } from "./Array.ts";
 
 export class StringBuilder {
@@ -61,11 +62,51 @@ export function StringBuilder__Append_61B1CA(x: StringBuilder, c: string, repeat
     return x;
 }
 
+export function StringBuilder__Append_Z510FF069(x: StringBuilder, o: int8): StringBuilder {
+    void (x.buf.push(o.toString()));
+    return x;
+}
+
+export function StringBuilder__Append_244D3E44(x: StringBuilder, o: uint8): StringBuilder {
+    void (x.buf.push(o.toString()));
+    return x;
+}
+
+export function StringBuilder__Append_Z524259E6(x: StringBuilder, o: int16): StringBuilder {
+    void (x.buf.push(int16ToString(o)));
+    return x;
+}
+
+export function StringBuilder__Append_Z6EF82811(x: StringBuilder, o: uint16): StringBuilder {
+    void (x.buf.push(o.toString()));
+    return x;
+}
+
 export function StringBuilder__Append_Z524259A4(x: StringBuilder, o: int32): StringBuilder {
     void (x.buf.push(int32ToString(o)));
     return x;
 }
 
+export function StringBuilder__Append_Z6EF827D7(x: StringBuilder, o: uint32): StringBuilder {
+    void (x.buf.push(o.toString()));
+    return x;
+}
+
+export function StringBuilder__Append_Z524259C1(x: StringBuilder, o: int64): StringBuilder {
+    void (x.buf.push(int64ToString(o)));
+    return x;
+}
+
+export function StringBuilder__Append_Z6EF827B6(x: StringBuilder, o: uint64): StringBuilder {
+    void (x.buf.push(o.toString()));
+    return x;
+}
+
+export function StringBuilder__Append_Z7138B98C(x: StringBuilder, o: float32): StringBuilder {
+    void (x.buf.push(o.toString()));
+    return x;
+}
+
 export function StringBuilder__Append_5E38073B(x: StringBuilder, o: float64): StringBuilder {
     void (x.buf.push(o.toString()));
     return x;

package/package.json

@@ -3,7 +3,7 @@
     "private": false,
     "type": "module",
     "name": "@fable-org/fable-library-ts",
-    "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",

package/tsconfig.json

@@ -34,7 +34,7 @@
     // "paths": {},                                      /* Specify a set of entries that re-map imports to additional lookup locations. */
     // "rootDirs": [],                                   /* Allow multiple folders to be treated as one when resolving modules. */
     // "typeRoots": [],                                  /* Specify multiple folders that act like './node_modules/@types'. */
-    // "types": [],                                      /* Specify type package names to be included without being referenced in a source file. */
+    "types": [],                                         /* Exclude all @types/* packages (e.g. @types/node) to enforce browser-only compatibility. */
     // "allowUmdGlobalAccess": true,                     /* Allow accessing UMD globals from modules. */
     // "moduleSuffixes": [],                             /* List of file name suffixes to search when resolving a module. */
     // "allowImportingTsExtensions": true,               /* Allow imports to include TypeScript file extensions. Requires '--moduleResolution bundler' and either '--noEmit' or '--emitDeclarationOnly' to be set. */