@nfdi4plants/arctrl 3.2.3 → 3.3.1

package/dist/ts/node_modules/@fable-org/fable-library-ts/Set.js

@@ -1,6 +1,7 @@
 import { class_type, record_type, list_type, bool_type, option_type } from './Reflection.js';
 import { value, some } from './Option.js';
-import { Exception, isArrayLike, getEnumerator, disposeSafe, toIterator, structuralHash } from './Util.js';
+import { Exception, physicalHash, isArrayLike, getEnumerator, disposeSafe, toIterator, structuralHash } from './Util.js';
+import { Operators_InvalidArg, Operators_InvalidOp } from './FSharp.Core.js';
 import { Record, toString } from './Types.js';
 import { isEmpty as isEmpty$1, head, tail, ofArrayWithTail, empty as empty$1, singleton as singleton$1, cons, fold as fold$2, FSharpList } from './List.js';
 import { setItem, fill, fold as fold$1 } from './Array.js';
@@ -53,7 +54,7 @@ function SetTreeModule_countAux(t_mut, acc_mut) {
     while (true) {
       const t = t_mut, acc = acc_mut;
       if (t != null) {
-        const t2 = value(t);
+        const t2 = t;
         if (t2 instanceof SetTreeNode$1) {
           const tn = t2;
           t_mut = SetTreeNode$1__get_Left(tn);
@@ -76,7 +77,7 @@ function SetTreeModule_mk(l, k, r) {
   let hl;
   const t = l;
   if (t != null) {
-    const t2 = value(t);
+    const t2 = t;
     hl = t2 instanceof SetTreeNode$1 ? (tn = t2, SetTreeNode$1__get_Height(tn)) : 1;
   } else {
     hl = 0;
@@ -84,7 +85,7 @@ function SetTreeModule_mk(l, k, r) {
   let hr;
   const t_1 = r;
   if (t_1 != null) {
-    const t2_1 = value(t_1);
+    const t2_1 = t_1;
     hr = t2_1 instanceof SetTreeNode$1 ? (tn_1 = t2_1, SetTreeNode$1__get_Height(tn_1)) : 1;
   } else {
     hr = 0;
@@ -101,7 +102,7 @@ function SetTreeModule_rebalance(t1, v, t2) {
   let t1h;
   const t = t1;
   if (t != null) {
-    const t2_1 = value(t);
+    const t2_1 = t;
     t1h = t2_1 instanceof SetTreeNode$1 ? (tn = t2_1, SetTreeNode$1__get_Height(tn)) : 1;
   } else {
     t1h = 0;
@@ -109,7 +110,7 @@ function SetTreeModule_rebalance(t1, v, t2) {
   let t2h;
   const t_1 = t2;
   if (t_1 != null) {
-    const t2_2 = value(t_1);
+    const t2_2 = t_1;
     t2h = t2_2 instanceof SetTreeNode$1 ? (tn_1 = t2_2, SetTreeNode$1__get_Height(tn_1)) : 1;
   } else {
     t2h = 0;
@@ -118,7 +119,7 @@ function SetTreeModule_rebalance(t1, v, t2) {
     const matchValue = value(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(t_2), t2_3 instanceof SetTreeNode$1 ? (tn_2 = t2_3, SetTreeNode$1__get_Height(tn_2)) : 1) : 0) > t1h + 1) {
+      if ((t_2 = SetTreeNode$1__get_Left(t2$0027), t_2 != null ? (t2_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(SetTreeNode$1__get_Left(t2$0027));
         if (matchValue_1 instanceof SetTreeNode$1) {
           const t2l = matchValue_1;
@@ -136,7 +137,7 @@ function SetTreeModule_rebalance(t1, v, t2) {
     const matchValue_2 = value(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(t_3), t2_4 instanceof SetTreeNode$1 ? (tn_3 = t2_4, SetTreeNode$1__get_Height(tn_3)) : 1) : 0) > t2h + 1) {
+      if ((t_3 = SetTreeNode$1__get_Right(t1$0027), t_3 != null ? (t2_4 = 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(SetTreeNode$1__get_Right(t1$0027));
         if (matchValue_3 instanceof SetTreeNode$1) {
           const t1r = matchValue_3;
@@ -156,7 +157,7 @@ function SetTreeModule_rebalance(t1, v, t2) {
 }
 function SetTreeModule_add(comparer, k, t) {
   if (t != null) {
-    const t2 = value(t);
+    const t2 = t;
     const c = comparer.Compare(k, SetTreeLeaf$1__get_Key(t2)) | 0;
     if (t2 instanceof SetTreeNode$1) {
       const tn = t2;
@@ -183,9 +184,9 @@ function SetTreeModule_add(comparer, k, t) {
 }
 function SetTreeModule_balance(comparer, t1, k, t2) {
   if (t1 != null) {
-    const t1$0027 = value(t1);
+    const t1$0027 = t1;
     if (t2 != null) {
-      const t2$0027 = value(t2);
+      const t2$0027 = t2;
       if (t1$0027 instanceof SetTreeNode$1) {
         const t1n = t1$0027;
         if (t2$0027 instanceof SetTreeNode$1) {
@@ -212,7 +213,7 @@ function SetTreeModule_balance(comparer, t1, k, t2) {
 }
 function SetTreeModule_split(comparer, pivot, t) {
   if (t != null) {
-    const t2 = value(t);
+    const t2 = t;
     if (t2 instanceof SetTreeNode$1) {
       const tn = t2;
       const c = comparer.Compare(pivot, SetTreeLeaf$1__get_Key(tn)) | 0;
@@ -241,7 +242,7 @@ function SetTreeModule_split(comparer, pivot, t) {
 }
 function SetTreeModule_spliceOutSuccessor(t) {
   if (t != null) {
-    const t2 = value(t);
+    const t2 = t;
     if (t2 instanceof SetTreeNode$1) {
       const tn = t2;
       if (SetTreeNode$1__get_Left(tn) == null) {
@@ -259,7 +260,7 @@ function SetTreeModule_spliceOutSuccessor(t) {
 }
 function SetTreeModule_remove(comparer, k, t) {
   if (t != null) {
-    const t2 = value(t);
+    const t2 = t;
     const c = comparer.Compare(k, SetTreeLeaf$1__get_Key(t2)) | 0;
     if (t2 instanceof SetTreeNode$1) {
       const tn = t2;
@@ -291,7 +292,7 @@ function SetTreeModule_mem(comparer_mut, k_mut, t_mut) {
     while (true) {
       const comparer = comparer_mut, k = k_mut, t = t_mut;
       if (t != null) {
-        const t2 = value(t);
+        const t2 = t;
         const c = comparer.Compare(k, SetTreeLeaf$1__get_Key(t2)) | 0;
         if (t2 instanceof SetTreeNode$1) {
           const tn = t2;
@@ -322,7 +323,7 @@ function SetTreeModule_iter(f_mut, t_mut) {
     while (true) {
       const f = f_mut, t = t_mut;
       if (t != null) {
-        const t2 = value(t);
+        const t2 = t;
         if (t2 instanceof SetTreeNode$1) {
           const tn = t2;
           SetTreeModule_iter(f, SetTreeNode$1__get_Left(tn));
@@ -342,7 +343,7 @@ function SetTreeModule_foldBackOpt(f_mut, t_mut, x_mut) {
     while (true) {
       const f = f_mut, t = t_mut, x = x_mut;
       if (t != null) {
-        const t2 = value(t);
+        const t2 = t;
         if (t2 instanceof SetTreeNode$1) {
           const tn = t2;
           f_mut = f;
@@ -366,7 +367,7 @@ function SetTreeModule_foldOpt(f_mut, x_mut, t_mut) {
     while (true) {
       const f = f_mut, x = x_mut, t = t_mut;
       if (t != null) {
-        const t2 = value(t);
+        const t2 = t;
         if (t2 instanceof SetTreeNode$1) {
           const tn = t2;
           f_mut = f;
@@ -390,7 +391,7 @@ function SetTreeModule_forall(f_mut, t_mut) {
     while (true) {
       const f = f_mut, t = t_mut;
       if (t != null) {
-        const t2 = value(t);
+        const t2 = t;
         if (t2 instanceof SetTreeNode$1) {
           const tn = t2;
           if (f(SetTreeLeaf$1__get_Key(tn)) && SetTreeModule_forall(f, SetTreeNode$1__get_Left(tn))) {
@@ -414,7 +415,7 @@ function SetTreeModule_exists(f_mut, t_mut) {
     while (true) {
       const f = f_mut, t = t_mut;
       if (t != null) {
-        const t2 = value(t);
+        const t2 = 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))) {
@@ -448,7 +449,7 @@ function SetTreeModule_filterAux(comparer_mut, f_mut, t_mut, acc_mut) {
     while (true) {
       const comparer = comparer_mut, f = f_mut, t = t_mut, acc = acc_mut;
       if (t != null) {
-        const t2 = value(t);
+        const t2 = 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;
@@ -478,7 +479,7 @@ function SetTreeModule_diffAux(comparer_mut, t_mut, acc_mut) {
       if (acc == null) {
         return acc;
       } else if (t != null) {
-        const t2 = value(t);
+        const t2 = t;
         if (t2 instanceof SetTreeNode$1) {
           const tn = t2;
           comparer_mut = comparer;
@@ -499,9 +500,9 @@ function SetTreeModule_diff(comparer, a, b) {
 }
 function SetTreeModule_union(comparer, t1, t2) {
   if (t1 != null) {
-    const t1$0027 = value(t1);
+    const t1$0027 = t1;
     if (t2 != null) {
-      const t2$0027 = value(t2);
+      const t2$0027 = t2;
       if (t1$0027 instanceof SetTreeNode$1) {
         const t1n = t1$0027;
         if (t2$0027 instanceof SetTreeNode$1) {
@@ -531,7 +532,7 @@ function SetTreeModule_intersectionAux(comparer_mut, b_mut, t_mut, acc_mut) {
     while (true) {
       const comparer = comparer_mut, b = b_mut, t = t_mut, acc = acc_mut;
       if (t != null) {
-        const t2 = value(t);
+        const t2 = t;
         if (t2 instanceof SetTreeNode$1) {
           const tn = t2;
           const acc_1 = SetTreeModule_intersectionAux(comparer, b, SetTreeNode$1__get_Right(tn), acc);
@@ -568,7 +569,7 @@ function SetTreeModule_partitionAux(comparer_mut, f_mut, t_mut, acc__mut, acc__1
       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(t);
+        const t2 = 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]);
@@ -596,7 +597,7 @@ function SetTreeModule_minimumElementAux(t_mut, n_mut) {
     while (true) {
       const t = t_mut, n = n_mut;
       if (t != null) {
-        const t2 = value(t);
+        const t2 = t;
         if (t2 instanceof SetTreeNode$1) {
           const tn = t2;
           t_mut = SetTreeNode$1__get_Left(tn);
@@ -613,7 +614,7 @@ function SetTreeModule_minimumElementAux(t_mut, n_mut) {
 }
 function SetTreeModule_minimumElementOpt(t) {
   if (t != null) {
-    const t2 = value(t);
+    const t2 = t;
     if (t2 instanceof SetTreeNode$1) {
       const tn = t2;
       return some(SetTreeModule_minimumElementAux(SetTreeNode$1__get_Left(tn), SetTreeLeaf$1__get_Key(tn)));
@@ -629,7 +630,7 @@ function SetTreeModule_maximumElementAux(t_mut, n_mut) {
     while (true) {
       const t = t_mut, n = n_mut;
       if (t != null) {
-        const t2 = value(t);
+        const t2 = t;
         if (t2 instanceof SetTreeNode$1) {
           const tn = t2;
           t_mut = SetTreeNode$1__get_Right(tn);
@@ -646,7 +647,7 @@ function SetTreeModule_maximumElementAux(t_mut, n_mut) {
 }
 function SetTreeModule_maximumElementOpt(t) {
   if (t != null) {
-    const t2 = value(t);
+    const t2 = t;
     if (t2 instanceof SetTreeNode$1) {
       const tn = t2;
       return some(SetTreeModule_maximumElementAux(SetTreeNode$1__get_Right(tn), SetTreeLeaf$1__get_Key(tn)));
@@ -660,7 +661,7 @@ function SetTreeModule_maximumElementOpt(t) {
 function SetTreeModule_minimumElement(s) {
   const matchValue = SetTreeModule_minimumElementOpt(s);
   if (matchValue == null) {
-    throw new Exception("Set contains no elements");
+    throw Operators_InvalidArg("s", "Set contains no elements.");
   } else {
     return value(matchValue);
   }
@@ -668,7 +669,7 @@ function SetTreeModule_minimumElement(s) {
 function SetTreeModule_maximumElement(s) {
   const matchValue = SetTreeModule_maximumElementOpt(s);
   if (matchValue == null) {
-    throw new Exception("Set contains no elements");
+    throw Operators_InvalidArg("s", "Set contains no elements.");
   } else {
     return value(matchValue);
   }
@@ -679,6 +680,12 @@ class SetTreeModule_SetIterator$1 extends Record {
     this.stack = stack;
     this.started = started;
   }
+  Equals(other) {
+    return this === other;
+  }
+  GetHashCode() {
+    return physicalHash(this);
+  }
 }
 function SetTreeModule_SetIterator$1_$reflection(gen0) {
   return record_type("Set.SetTreeModule.SetIterator`1", [gen0], SetTreeModule_SetIterator$1, () => [["stack", list_type(option_type(SetTreeLeaf$1_$reflection(gen0)))], ["started", bool_type]]);
@@ -691,7 +698,7 @@ function SetTreeModule_collapseLHS(stack_mut) {
         const x = head(stack);
         const rest = tail(stack);
         if (x != null) {
-          const x2 = value(x);
+          const x2 = 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);
@@ -713,10 +720,10 @@ function SetTreeModule_mkIterator(s) {
   return new SetTreeModule_SetIterator$1(SetTreeModule_collapseLHS(singleton$1(s)), false);
 }
 function SetTreeModule_notStarted() {
-  throw new Exception("Enumeration not started");
+  throw Operators_InvalidOp("Enumeration has not started. Call MoveNext.");
 }
 function SetTreeModule_alreadyFinished() {
-  throw new Exception("Enumeration already started");
+  throw Operators_InvalidOp("Enumeration already finished.");
 }
 function SetTreeModule_current(i) {
   if (i.started) {
@@ -724,7 +731,7 @@ function SetTreeModule_current(i) {
     if (isEmpty$1(matchValue)) {
       return SetTreeModule_alreadyFinished();
     } else if (head(matchValue) != null) {
-      const t = value(head(matchValue));
+      const t = head(matchValue);
       return SetTreeLeaf$1__get_Key(t);
     } else {
       throw new Exception("Please report error: Set iterator, unexpected stack for current");
@@ -738,7 +745,7 @@ function SetTreeModule_moveNext(i) {
     const matchValue = i.stack;
     if (!isEmpty$1(matchValue)) {
       if (head(matchValue) != null) {
-        const t = value(head(matchValue));
+        const t = head(matchValue);
         if (t instanceof SetTreeNode$1) {
           throw new Exception("Please report error: Set iterator, unexpected stack for moveNext");
         } else {
@@ -783,8 +790,8 @@ 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(head(l1));
-              const x2_3 = value(head(l2));
+              const x1_3 = head(l1);
+              const x2_3 = head(l2);
               if (x1_3 instanceof SetTreeNode$1) {
                 const x1n_2 = x1_3;
                 if (SetTreeNode$1__get_Left(x1n_2) == null) {
@@ -806,12 +813,12 @@ function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                         if (head(l1) != null) {
                           matchResult = 0;
                           t1_6 = tail(l1);
-                          x1_4 = value(head(l1));
+                          x1_4 = head(l1);
                         } else if (!isEmpty$1(l2)) {
                           if (head(l2) != null) {
                             matchResult = 1;
                             t2_6 = tail(l2);
-                            x2_4 = value(head(l2));
+                            x2_4 = head(l2);
                           } else {
                             matchResult = 2;
                           }
@@ -822,7 +829,7 @@ function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                         if (head(l2) != null) {
                           matchResult = 1;
                           t2_6 = tail(l2);
-                          x2_4 = value(head(l2));
+                          x2_4 = head(l2);
                         } else {
                           matchResult = 2;
                         }
@@ -877,12 +884,12 @@ function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                     if (head(l1) != null) {
                       matchResult_1 = 0;
                       t1_7 = tail(l1);
-                      x1_5 = value(head(l1));
+                      x1_5 = head(l1);
                     } else if (!isEmpty$1(l2)) {
                       if (head(l2) != null) {
                         matchResult_1 = 1;
                         t2_7 = tail(l2);
-                        x2_5 = value(head(l2));
+                        x2_5 = head(l2);
                       } else {
                         matchResult_1 = 2;
                       }
@@ -893,7 +900,7 @@ function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                     if (head(l2) != null) {
                       matchResult_1 = 1;
                       t2_7 = tail(l2);
-                      x2_5 = value(head(l2));
+                      x2_5 = head(l2);
                     } else {
                       matchResult_1 = 2;
                     }
@@ -949,12 +956,12 @@ function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                     if (head(l1) != null) {
                       matchResult_2 = 0;
                       t1_8 = tail(l1);
-                      x1_6 = value(head(l1));
+                      x1_6 = head(l1);
                     } else if (!isEmpty$1(l2)) {
                       if (head(l2) != null) {
                         matchResult_2 = 1;
                         t2_8 = tail(l2);
-                        x2_6 = value(head(l2));
+                        x2_6 = head(l2);
                       } else {
                         matchResult_2 = 2;
                       }
@@ -965,7 +972,7 @@ function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                     if (head(l2) != null) {
                       matchResult_2 = 1;
                       t2_8 = tail(l2);
-                      x2_6 = value(head(l2));
+                      x2_6 = head(l2);
                     } else {
                       matchResult_2 = 2;
                     }
@@ -1015,18 +1022,18 @@ function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                 }
               }
             } else {
-              const x2 = value(head(l2));
+              const x2 = head(l2);
               let matchResult_3 = void 0, t1_2 = void 0, x1 = void 0, t2_2 = void 0, x2_1 = void 0;
               if (!isEmpty$1(l1)) {
                 if (head(l1) != null) {
                   matchResult_3 = 0;
                   t1_2 = tail(l1);
-                  x1 = value(head(l1));
+                  x1 = head(l1);
                 } else if (!isEmpty$1(l2)) {
                   if (head(l2) != null) {
                     matchResult_3 = 1;
                     t2_2 = tail(l2);
-                    x2_1 = value(head(l2));
+                    x2_1 = head(l2);
                   } else {
                     matchResult_3 = 2;
                   }
@@ -1037,7 +1044,7 @@ function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
                 if (head(l2) != null) {
                   matchResult_3 = 1;
                   t2_2 = tail(l2);
-                  x2_1 = value(head(l2));
+                  x2_1 = head(l2);
                 } else {
                   matchResult_3 = 2;
                 }
@@ -1076,18 +1083,18 @@ function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
               }
             }
           } else if (head(l1) != null) {
-            const x1_1 = value(head(l1));
+            const x1_1 = head(l1);
             let matchResult_4 = void 0, t1_4 = void 0, x1_2 = void 0, t2_4 = void 0, x2_2 = void 0;
             if (!isEmpty$1(l1)) {
               if (head(l1) != null) {
                 matchResult_4 = 0;
                 t1_4 = tail(l1);
-                x1_2 = value(head(l1));
+                x1_2 = head(l1);
               } else if (!isEmpty$1(l2)) {
                 if (head(l2) != null) {
                   matchResult_4 = 1;
                   t2_4 = tail(l2);
-                  x2_2 = value(head(l2));
+                  x2_2 = head(l2);
                 } else {
                   matchResult_4 = 2;
                 }
@@ -1098,7 +1105,7 @@ function SetTreeModule_compareStacks(comparer_mut, l1_mut, l2_mut) {
               if (head(l2) != null) {
                 matchResult_4 = 1;
                 t2_4 = tail(l2);
-                x2_2 = value(head(l2));
+                x2_2 = head(l2);
               } else {
                 matchResult_4 = 2;
               }
@@ -1174,7 +1181,7 @@ function SetTreeModule_toList(t) {
       while (true) {
         const t$0027 = t$0027_mut, acc = acc_mut;
         if (t$0027 != null) {
-          const t2 = value(t$0027);
+          const t2 = t$0027;
           if (t2 instanceof SetTreeNode$1) {
             const tn = t2;
             t$0027_mut = SetTreeNode$1__get_Left(tn);

package/dist/ts/node_modules/@fable-org/fable-library-ts/String.js

@@ -1,5 +1,5 @@
 import { toString } from './Date.js';
-import { compare as compare$1, isNumeric, multiply, toHex, toExponential, toPrecision, toFixed, divide, isIntegral } from './Numeric.js';
+import { compare as compare$1, isNumeric, multiply, toRadix, toExponential, toPrecision, toFixed, divide, isIntegral, toHex } from './Numeric.js';
 import { escape } from './RegExp.js';
 import { toString as toString$1 } from './Types.js';
 import { Exception } from './Util.js';
@@ -200,17 +200,14 @@ function formatReplacement(rep, flags, padLength, precision, format2) {
   flags = flags || "";
   format2 = format2 || "";
   if (isNumeric(rep)) {
-    if (format2.toLowerCase() !== "x") {
-      if (isLessThan(rep, 0)) {
-        rep = multiply(rep, -1);
-        sign = "-";
-      } else {
-        if (flags.indexOf(" ") >= 0) {
-          sign = " ";
-        } else if (flags.indexOf("+") >= 0) {
-          sign = "+";
-        }
-      }
+    const radix = format2 === "x" || format2 === "X" ? 16 : format2 === "o" ? 8 : 10;
+    if (radix === 10 && isLessThan(rep, 0)) {
+      rep = multiply(rep, -1);
+      sign = "-";
+    } else if (flags.indexOf(" ") >= 0) {
+      sign = " ";
+    } else if (flags.indexOf("+") >= 0) {
+      sign = "+";
     }
     precision = precision == null ? null : parseInt(precision, 10);
     switch (format2) {
@@ -228,10 +225,11 @@ function formatReplacement(rep, flags, padLength, precision, format2) {
         rep = precision != null ? toExponential(rep, precision) : toExponential(rep);
         break;
       case "x":
-        rep = toHex(rep);
+      case "o":
+        rep = toRadix(rep, radix);
         break;
       case "X":
-        rep = toHex(rep).toUpperCase();
+        rep = toRadix(rep, radix).toUpperCase();
         break;
       default:
         rep = String(rep);
@@ -325,6 +323,48 @@ function splitIntAndDecimalPart(value) {
 function thousandSeparate(value) {
   return value.replace(/\B(?=(\d{3})+(?!\d))/g, ",");
 }
+function splitExponential(s) {
+  const eIdx = s.indexOf("e");
+  return [s.slice(0, eIdx).replace(".", ""), Number(s.slice(eIdx + 1))];
+}
+function shortestSingle(x) {
+  const [digits, exponent] = splitExponential(x.toExponential(99));
+  for (let p = 1; ; p++) {
+    const down = Number(digits.slice(0, p));
+    const rest = digits.slice(p);
+    const half = "5".padEnd(rest.length, "0");
+    const roundUp = rest > half || rest === half && down % 2 === 1;
+    for (const n of roundUp ? [down + 1, down] : [down, down + 1]) {
+      if (Math.fround(Number(n + "e" + (exponent - p + 1))) === x) {
+        return [String(n), exponent + String(n).length - p];
+      }
+    }
+  }
+}
+function formatGeneral(x, format2, precision, isSingle = false) {
+  if (!Number.isFinite(x)) {
+    return String(x);
+  }
+  const sign = x < 0 || Object.is(x, -0) ? "-" : "";
+  x = Math.abs(x);
+  const p = format2 === "r" || format2 === "R" ? 0 : precision ?? 0;
+  const [significand, exponent] = p > 0 ? splitExponential(x.toExponential(p - 1)) : isSingle ? shortestSingle(x) : splitExponential(x.toExponential());
+  const digits = trimEnd(significand, "0") || "0";
+  if (exponent < -4 || exponent >= (p > 0 ? p : isSingle ? 9 : 17)) {
+    const mantissa = digits.length > 1 ? digits[0] + "." + digits.slice(1) : digits;
+    const eChar = format2 === "G" || format2 === "R" ? "E" : "e";
+    return sign + mantissa + eChar + (exponent < 0 ? "-" : "+") + padLeft(String(Math.abs(exponent)), 2, "0");
+  } else if (exponent < 0) {
+    return sign + "0." + "0".repeat(-exponent - 1) + digits;
+  } else {
+    const decimals = digits.slice(exponent + 1);
+    return sign + digits.slice(0, exponent + 1).padEnd(exponent + 1, "0") + (decimals ? "." + decimals : "");
+  }
+}
+function formatSingle(str, x) {
+  const m = /^\{0:([GgRr])(\d{0,2})\}$/.exec(str);
+  return m != null ? formatGeneral(Math.fround(x), m[1], m[2] ? parseInt(m[2], 10) : null, true) : format(str, x);
+}
 function format(str, ...args) {
   let str2;
   if (typeof str === "object") {
@@ -399,15 +439,25 @@ function format(str, ...args) {
           }
           break;
         case "g":
-        case "G": {
-          rep = precision != null ? toPrecision(rep, precision) : toPrecision(rep);
+        case "G":
+        case "r":
+        case "R": {
+          if (typeof rep === "number") {
+            rep = formatGeneral(rep, format2, precision);
+            break;
+          }
+          if (precision == null) {
+            rep = String(rep);
+            break;
+          }
+          rep = toPrecision(rep, precision);
           const eIdx = rep.indexOf("e");
           if (eIdx >= 0) {
             const mantissa = trimEnd(trimEnd(rep.slice(0, eIdx), "0"), ".");
             const expSign = rep[eIdx + 1];
             const expDigits = rep.slice(eIdx + 2);
             const paddedExpDigits = expDigits.length < 2 ? "0" + expDigits : expDigits;
-            const eChar = format2 === "G" ? "E" : "e";
+            const eChar = format2 === "G" || format2 === "R" ? "E" : "e";
             rep = mantissa + eChar + expSign + paddedExpDigits;
           } else if (rep.indexOf(".") >= 0) {
             rep = trimEnd(trimEnd(rep, "0"), ".");
@@ -436,9 +486,6 @@ function format(str, ...args) {
             rep = thousandSeparate(parts.integral) + " %";
           }
           break;
-        case "r":
-        case "R":
-          throw new Exception("The round-trip format is not supported by Fable");
         case "x":
         case "X":
           if (!isIntegral(rep)) {
@@ -678,4 +725,4 @@ function getFormat(s) {
   return s.fmts ? strs.reduce((acc, newPart, index) => acc + `{${String(index - 1) + s.fmts[index - 1]}}` + newPart) : strs.reduce((acc, newPart, index) => acc + `{${index - 1}}` + newPart);
 }
 
-export { StringComparison, compare, compareOrdinal, compareTo, concat, contains, endsWith, filter, fmt, fmtWith, format, fromBase64String, fsFormat, getCharAtIndex, getFormat, indexOf, indexOfAny, initialize, insert, interpolate, isNullOrEmpty, isNullOrWhiteSpace, join, joinWithIndices, lastIndexOf, padLeft, padRight, printf, remove, replace, replicate, split, startsWith, substring, toBase64String, toCharArray2, toConsole, toConsoleError, toFail, toText, trim, trimEnd, trimStart };
+export { StringComparison, compare, compareOrdinal, compareTo, concat, contains, endsWith, filter, fmt, fmtWith, format, formatSingle, fromBase64String, fsFormat, getCharAtIndex, getFormat, indexOf, indexOfAny, initialize, insert, interpolate, isNullOrEmpty, isNullOrWhiteSpace, join, joinWithIndices, lastIndexOf, padLeft, padRight, printf, remove, replace, replicate, split, startsWith, substring, toBase64String, toCharArray2, toConsole, toConsoleError, toFail, toText, trim, trimEnd, trimStart };

package/dist/ts/node_modules/@fable-org/fable-library-ts/System.Collections.Generic.js

@@ -5,6 +5,7 @@ import { delay, enumerateWhile, append, singleton, empty, toArray } from './Seq.
 import { item, fill, copyTo, initialize, setItem } from './Array.js';
 import { max } from './Double.js';
 import { ArgumentOutOfRangeException_$ctor_Z721C83C5 } from './System.js';
+import { Operators_InvalidOp } from './FSharp.Core.js';
 
 class KeyNotFoundException extends Exception {
   constructor(message) {
@@ -229,7 +230,7 @@ function Queue$1__Enqueue_2B595(_, value) {
 }
 function Queue$1__Dequeue(_) {
   if (_.count === 0) {
-    throw new Exception("Queue is empty");
+    throw Operators_InvalidOp("Queue is empty");
   }
   const value = item(_.head, _.contents);
   _.head = (_.head + 1) % Queue$1__size(_) | 0;
@@ -238,7 +239,7 @@ function Queue$1__Dequeue(_) {
 }
 function Queue$1__Peek(_) {
   if (_.count === 0) {
-    throw new Exception("Queue is empty");
+    throw Operators_InvalidOp("Queue is empty");
   }
   return item(_.head, _.contents);
 }

package/dist/ts/node_modules/@fable-org/fable-library-ts/System.Text.js

@@ -1,4 +1,4 @@
-import { isNullOrEmpty, join, substring, replicate, format, replace } from './String.js';
+import { isNullOrEmpty, join, substring, replicate, format, getCharAtIndex, replace } from './String.js';
 import { class_type } from './Reflection.js';
 import { toString } from './Types.js';
 import { int16ToString, int32ToString, int64ToString, clear, Exception } from './Util.js';
@@ -160,7 +160,7 @@ function StringBuilder__get_Chars_Z524259A4(x, index) {
     throw new Exception("Index was outside the bounds of the array");
   } else {
     const pos = index - len | 0;
-    return item(i, x.buf)[pos];
+    return getCharAtIndex(item(i, x.buf), pos);
   }
 }
 function StringBuilder__set_Chars_413E0D0A(x, index, value) {