@vcmap/ui 6.1.0-rc.6 → 6.1.0-rc.7

package/config/cluster.config.json

@@ -5,7 +5,6 @@
       "type": "GeoJSONLayer",
       "name": "12de4200e2e76f756e06da59c07eae3a1760acdd",
       "activeOnStartup": true,
-      "balloonHeightOffset": 0,
       "vectorProperties": {
         "altitudeMode": "relativeToGround",
         "heightAboveGround": 65
@@ -38,7 +37,6 @@
     {
       "type": "GeoJSONLayer",
       "name": "b408b454472a5ce5dfb44bb57afe8da1baeeb6cf",
-      "balloonHeightOffset": 0,
       "vectorProperties": {
         "altitudeMode": "relativeToGround",
         "heightAboveGround": 65
@@ -73,22 +71,15 @@
     {
       "type": "VectorClusterLayer",
       "name": "clusterLayerOthers",
-      "showInContent": true,
-      "defaultFeatureTemplate": "<%=name%>",
       "clusterDistance": 90,
       "style": {
-        "type": "cluster",
-        "fillColor": "#002e4d",
-        "strokeColor": "#cc970f",
-        "strokeWidth": 7,
-        "textColor": "#ffffff",
-        "font": "bold 18px/53px DroidSans400, Droid, Arial, sans-serif",
         "scaleFactor": 0.125,
         "breaks": [2, 3, 4, 5, 10, 15, 25, 50, 100, 250, 500, 1000, 2000, 5000]
       },
-      "heightAboveGround": 65,
-      "altitudeMode": "relativeToGround",
-      "url": ""
+      "vectorProperties": {
+        "altitudeMode": "relativeToGround",
+        "heightAboveGround": 65
+      }
     }
   ],
   "contentTree": [

package/config/dev.config.json

@@ -43,7 +43,7 @@
     {
       "type": "MarkdownBalloonFeatureInfoView",
       "name": "markdownFeatureInfo",
-      "template": "# {{featureId}}\n- Altitude Mode: {{Altitude Mode}}\n [Link text Here](https://vc.systems/?id={{id}})",
+      "template": "# {{featureId}}\n- {{#t components.vectorProperties.altitudeMode}}: {{Altitude Mode}}\n [Link text Here](https://vc.systems/?id={{id}})\nCurrent Locale: {{ currentVcsAppLocale }}",
       "keyMapping": {
         "olcs_storeyNumber": "Storey Number",
         "olcs_storeyHeight": "Storey Height",
@@ -691,12 +691,15 @@
     {
       "name": "czmlPoint",
       "layerName": "czmlPoint",
-      "type": "LayerContentTreeItem"
+      "type": "LayerContentTreeItem",
+
+      "showWhenNotSupported": true
     },
     {
       "name": "czmlDynamicPoint",
       "layerName": "czmlDynamicPoint",
-      "type": "LayerContentTreeItem"
+      "type": "LayerContentTreeItem",
+      "showWhenNotSupported": true
     },
     {
       "name": "wmsLayerPOI",

package/config/splashscreen.config.json

@@ -1,15 +1,17 @@
 {
   "name": "SplashScreen Examples",
+  "_id": "splashscreen",
   "uiConfig": [
     {
       "name": "splashScreen",
       "value": {
-        "name": "MyCustomScreen.name",
-        "title": "MyCustomScreen.tooltip",
+        "name": "Splashscreen Example",
+        "title": "Splashscreen Example",
         "icon": "mdi-information-slab-circle-outline",
         "content": "![image](https://vc.systems/wp-content/uploads/2020/07/vcs_logo.png)\nSplash Screen Template\n-------------------\nErste Schritte\n-------------------\n\nDies ist ein <em> Beispieltext</em>, der Ihnen den Einstieg erleichtern soll. **Marked** wird verwendet, um Ihren Text <u>von Markdown nach HTML</u> zu konvertieren. Um mehr über die <u><em>korrekte Syntax</em></u>zu erfahren, besuchen Sie bitte diesen [Link](https://marked.js.org/demo/) für eine Demo.  \n\nWie man Listen hinzufügt\n\n1. Punkt 1 einer Aufzählung\n2. Punkt 2 einer Aufzählung.\n\nWenn Sie Aufzählungen nicht mögen, wie wäre es mit Aufzählungspunkten?  \n- Punkt 1: einer Liste mit Aufzählungspunkten. \n- Punkt 2: einer Aufzählungsliste.",
         "acceptInput": true,
-        "menuEntry": false,
+        "menuEntry": true,
+        "enableDontShowAgain": true,
         "checkBoxText": "components.splashScreen.checkBoxText",
         "buttonTitle": "components.splashScreen.buttonTitle",
         "secondaryButtonTitle": "Hello World Callback",
@@ -24,13 +26,7 @@
             "type": "GoToViewpointCallback",
             "viewpoint": "alexanderplatz"
           }
-        ],
-        "position": {
-          "width": "800px",
-          "height": "500px",
-          "maxWidth": "800px",
-          "maxHeight": "500px"
-        }
+        ]
       },
       "properties": {
         "title": "appConfigurator.editors.uiConfig.splashScreen"

package/dist/assets/{cesium-f5e8e354.js → cesium-6c6aa853.js}

@@ -6563,6 +6563,7 @@ function requireSecondLevelDomains() {
       switch (h(O)) {
         case "Undefined":
           return w in g;
+        // data[name] !== undefined;
         case "Boolean":
           var V = !!(p(g[w]) ? g[w].length : g[w]);
           return O === V;
@@ -6577,6 +6578,7 @@ function requireSecondLevelDomains() {
           return p(g[w]) ? N ? _(g[w], O) : !1 : !!(g[w] && g[w].match(O));
         case "Number":
           O = String(O);
+        /* falls through */
         case "String":
           return p(g[w]) ? N ? _(g[w], O) : !1 : g[w] === O;
         default:
@@ -6712,6 +6714,7 @@ function requireSecondLevelDomains() {
           return k;
         case "absolute":
           return !k;
+        // hostname identification
         case "domain":
         case "name":
           return F;
@@ -18086,7 +18089,7 @@ CullingVolume.prototype.computeVisibilityWithPlaneMask = function(e, t) {
   const i = this.planes;
   for (let r = 0, o = i.length; r < o; ++r) {
     const s = r < 31 ? 1 << r : 0;
-    if (r < 31 && !(t & s))
+    if (r < 31 && (t & s) === 0)
       continue;
     const c = e.intersectPlane(
       Plane.fromCartesian4(i[r], scratchPlane$2)
@@ -108506,6 +108509,7 @@ function parseMatches(e, t) {
       for (var m = f.length - 1; m >= 0; m--) {
         var _ = f[m];
         switch (_.state) {
+          // Protocol-relative URL states
           case 11:
             A(_, p);
             break;
@@ -108551,6 +108555,7 @@ function parseMatches(e, t) {
           case 10:
             O(_, p);
             break;
+          // Email States
           case 15:
             N(_, p);
             break;
@@ -108590,18 +108595,21 @@ function parseMatches(e, t) {
           case 27:
             ne(_, p);
             break;
+          // Hashtag states
           case 28:
             K(_, p);
             break;
           case 29:
             Z(_, p);
             break;
+          // Mention states
           case 30:
             ee(_, p);
             break;
           case 31:
             oe(_, p);
             break;
+          // Phone number states
           case 32:
             he(_, p);
             break;
@@ -110405,7 +110413,7 @@ function Deflate() {
   }
   function pe(J, ae) {
     let te, ie, ue;
-    if (e.dist_buf[$] = J, e.lc_buf[$] = ae & 255, $++, J === 0 ? O[ae * 2]++ : (G++, J--, O[(Tree._length_code[ae] + LITERALS + 1) * 2]++, N[Tree.d_code(J) * 2]++), !($ & 8191) && R > 2) {
+    if (e.dist_buf[$] = J, e.lc_buf[$] = ae & 255, $++, J === 0 ? O[ae * 2]++ : (G++, J--, O[(Tree._length_code[ae] + LITERALS + 1) * 2]++, N[Tree.d_code(J) * 2]++), ($ & 8191) === 0 && R > 2) {
       for (te = $ * 8, ie = E - T, ue = 0; ue < D_CODES; ue++)
         te += N[ue * 2] * (5 + Tree.extra_dbits[ue]);
       if (te >>>= 3, G < Math.floor($ / 2) && te < Math.floor(ie / 2))
@@ -112516,7 +112524,7 @@ function InfTree() {
         b[g] < 256 ? 0 : 96, r[2] = b[g++]) : (r[0] = /* (byte) */
         _[b[g] - p] + 16 + 64, r[2] = m[b[g++] - p]), E = 1 << M - O, I = P >>> O; I < B; I += E)
           T.set(r, (w + I) * 3);
-        for (I = 1 << M - 1; P & I; I >>>= 1)
+        for (I = 1 << M - 1; (P & I) !== 0; I >>>= 1)
           P ^= I;
         for (P ^= I, L = (1 << O) - 1; (P & L) != s[D]; )
           D--, O -= R, L = (1 << O) - 1;
@@ -112560,13 +112568,13 @@ function InfCodes() {
         continue;
       }
       do {
-        if (L >>= I[G + 1], g -= I[G + 1], R & 16) {
+        if (L >>= I[G + 1], g -= I[G + 1], (R & 16) !== 0) {
           for (R &= 15, U = I[G + 2] + /* (int) */
           (L & inflate_mask[R]), L >>= R, g -= R; g < 15; )
             O--, L |= (D.read_byte(w++) & 255) << g, g += 8;
           P = L & V, I = S, M = E, G = (M + P) * 3, R = I[G];
           do
-            if (L >>= I[G + 1], g -= I[G + 1], R & 16) {
+            if (L >>= I[G + 1], g -= I[G + 1], (R & 16) !== 0) {
               for (R &= 15; g < R; )
                 O--, L |= (D.read_byte(w++) & 255) << g, g += 8;
               if (k = I[G + 2] + (L & inflate_mask[R]), L >>= R, g -= R, F -= U, N >= k)
@@ -112593,20 +112601,20 @@ function InfCodes() {
               else
                 A.win.set(A.win.subarray($, $ + U), N), N += U, $ += U, U = 0;
               break;
-            } else if (!(R & 64))
+            } else if ((R & 64) === 0)
               P += I[G + 2], P += L & inflate_mask[R], G = (M + P) * 3, R = I[G];
             else
               return D.msg = "invalid distance code", U = D.avail_in - O, U = g >> 3 < U ? g >> 3 : U, O += U, w -= U, g -= U << 3, A.bitb = L, A.bitk = g, D.avail_in = O, D.total_in += w - D.next_in_index, D.next_in_index = w, A.write = N, Z_DATA_ERROR;
           while (!0);
           break;
         }
-        if (R & 64)
-          return R & 32 ? (U = D.avail_in - O, U = g >> 3 < U ? g >> 3 : U, O += U, w -= U, g -= U << 3, A.bitb = L, A.bitk = g, D.avail_in = O, D.total_in += w - D.next_in_index, D.next_in_index = w, A.write = N, Z_STREAM_END) : (D.msg = "invalid literal/length code", U = D.avail_in - O, U = g >> 3 < U ? g >> 3 : U, O += U, w -= U, g -= U << 3, A.bitb = L, A.bitk = g, D.avail_in = O, D.total_in += w - D.next_in_index, D.next_in_index = w, A.write = N, Z_DATA_ERROR);
-        if (P += I[G + 2], P += L & inflate_mask[R], G = (M + P) * 3, (R = I[G]) === 0) {
-          L >>= I[G + 1], g -= I[G + 1], A.win[N++] = /* (byte) */
-          I[G + 2], F--;
-          break;
-        }
+        if ((R & 64) === 0) {
+          if (P += I[G + 2], P += L & inflate_mask[R], G = (M + P) * 3, (R = I[G]) === 0) {
+            L >>= I[G + 1], g -= I[G + 1], A.win[N++] = /* (byte) */
+            I[G + 2], F--;
+            break;
+          }
+        } else return (R & 32) !== 0 ? (U = D.avail_in - O, U = g >> 3 < U ? g >> 3 : U, O += U, w -= U, g -= U << 3, A.bitb = L, A.bitk = g, D.avail_in = O, D.total_in += w - D.next_in_index, D.next_in_index = w, A.write = N, Z_STREAM_END) : (D.msg = "invalid literal/length code", U = D.avail_in - O, U = g >> 3 < U ? g >> 3 : U, O += U, w -= U, g -= U << 3, A.bitb = L, A.bitk = g, D.avail_in = O, D.total_in += w - D.next_in_index, D.next_in_index = w, A.write = N, Z_DATA_ERROR);
       } while (!0);
     } while (F >= 258 && O >= 10);
     return U = D.avail_in - O, U = g >> 3 < U ? g >> 3 : U, O += U, w -= U, g -= U << 3, A.bitb = L, A.bitk = g, D.avail_in = O, D.total_in += w - D.next_in_index, D.next_in_index = w, A.write = N, Z_OK;
@@ -112619,12 +112627,14 @@ function InfCodes() {
     let b, S, E, A = 0, D = 0, P = 0, I, M, R, L;
     for (P = T.next_in_index, I = T.avail_in, A = C.bitb, D = C.bitk, M = C.write, R = M < C.read ? C.read - M - 1 : C.end - M; ; )
       switch (t) {
+        // waiting for "i:"=input, "o:"=output, "x:"=nothing
         case START:
           if (R >= 258 && I >= 10 && (C.bitb = A, C.bitk = D, T.avail_in = I, T.total_in += P - T.next_in_index, T.next_in_index = P, C.write = M, x = y(d, f, h, p, m, _, C, T), P = T.next_in_index, I = T.avail_in, A = C.bitb, D = C.bitk, M = C.write, R = M < C.read ? C.read - M - 1 : C.end - M, x != Z_OK)) {
             t = x == Z_STREAM_END ? WASH : BADCODE;
             break;
           }
           o = d, i = h, r = p, t = LEN;
+        /* falls through */
         case LEN:
           for (b = o; D < b; ) {
             if (I !== 0)
@@ -112637,15 +112647,15 @@ function InfCodes() {
             s = i[S + 2], t = LIT;
             break;
           }
-          if (E & 16) {
+          if ((E & 16) !== 0) {
             c = E & 15, n = i[S + 2], t = LENEXT;
             break;
           }
-          if (!(E & 64)) {
+          if ((E & 64) === 0) {
             o = E, r = S / 3 + i[S + 2];
             break;
           }
-          if (E & 32) {
+          if ((E & 32) !== 0) {
             t = WASH;
             break;
           }
@@ -112659,6 +112669,7 @@ function InfCodes() {
             I--, A |= (T.read_byte(P++) & 255) << D, D += 8;
           }
           n += A & inflate_mask[b], A >>= b, D -= b, o = f, i = m, r = _, t = DIST;
+        /* falls through */
         case DIST:
           for (b = o; D < b; ) {
             if (I !== 0)
@@ -112667,11 +112678,11 @@ function InfCodes() {
               return C.bitb = A, C.bitk = D, T.avail_in = I, T.total_in += P - T.next_in_index, T.next_in_index = P, C.write = M, C.inflate_flush(T, x);
             I--, A |= (T.read_byte(P++) & 255) << D, D += 8;
           }
-          if (S = (r + (A & inflate_mask[b])) * 3, A >>= i[S + 1], D -= i[S + 1], E = i[S], E & 16) {
+          if (S = (r + (A & inflate_mask[b])) * 3, A >>= i[S + 1], D -= i[S + 1], E = i[S], (E & 16) !== 0) {
             c = E & 15, l = i[S + 2], t = DISTEXT;
             break;
           }
-          if (!(E & 64)) {
+          if ((E & 64) === 0) {
             o = E, r = S / 3 + i[S + 2];
             break;
           }
@@ -112685,6 +112696,7 @@ function InfCodes() {
             I--, A |= (T.read_byte(P++) & 255) << D, D += 8;
           }
           l += A & inflate_mask[b], A >>= b, D -= b, t = COPY;
+        /* falls through */
         case COPY:
           for (L = M - l; L < 0; )
             L += C.end;
@@ -112705,6 +112717,7 @@ function InfCodes() {
           if (D > 7 && (D -= 8, I++, P--), C.write = M, x = C.inflate_flush(T, x), M = C.write, R = M < C.read ? C.read - M - 1 : C.end - M, C.read != C.write)
             return C.bitb = A, C.bitk = D, T.avail_in = I, T.total_in += P - T.next_in_index, T.next_in_index = P, C.write = M, C.inflate_flush(T, x);
           t = END;
+        /* falls through */
         case END:
           return x = Z_STREAM_END, C.bitb = A, C.bitk = D, T.avail_in = I, T.total_in += P - T.next_in_index, T.next_in_index = P, C.write = M, C.inflate_flush(T, x);
         case BADCODE:
@@ -112816,6 +112829,7 @@ function InfBlocks(e, t) {
             for (P = 0; P < T; P++)
               c[P] = 0;
           x >>>= 14, b -= 14, s = 0, i = BTREE;
+        /* falls through */
         case BTREE:
           for (; s < 4 + (o >>> 10); ) {
             for (; b < 3; ) {
@@ -112832,6 +112846,7 @@ function InfBlocks(e, t) {
           if (l[0] = 7, T = _.inflate_trees_bits(c, l, d, p, y), T != Z_OK)
             return C = T, C == Z_DATA_ERROR && (c = null, i = BADBLOCKS), n.bitb = x, n.bitk = b, y.avail_in = E, y.total_in += S - y.next_in_index, y.next_in_index = S, n.write = A, n.inflate_flush(y, C);
           s = 0, i = DTREE;
+        /* falls through */
         case DTREE:
           for (; T = o, !(s >= 258 + (T & 31) + (T >> 5 & 31)); ) {
             let F, B;
@@ -112864,6 +112879,7 @@ function InfBlocks(e, t) {
           if (d[0] = -1, g = [], w = [], O = [], N = [], g[0] = 9, w[0] = 6, T = o, T = _.inflate_trees_dynamic(257 + (T & 31), 1 + (T >> 5 & 31), c, g, w, O, N, p, y), T != Z_OK)
             return T == Z_DATA_ERROR && (c = null, i = BADBLOCKS), C = T, n.bitb = x, n.bitk = b, y.avail_in = E, y.total_in += S - y.next_in_index, y.next_in_index = S, n.write = A, n.inflate_flush(y, C);
           f.init(g[0], w[0], p, O[0], p, N[0]), i = CODES;
+        /* falls through */
         case CODES:
           if (n.bitb = x, n.bitk = b, y.avail_in = E, y.total_in += S - y.next_in_index, y.next_in_index = S, n.write = A, (C = f.proc(n, y, C)) != Z_STREAM_END)
             return n.inflate_flush(y, C);
@@ -112873,11 +112889,13 @@ function InfBlocks(e, t) {
             break;
           }
           i = DRY;
+        /* falls through */
         case DRY:
           if (n.write = A, C = n.inflate_flush(y, C), A = n.write, D = /* (int) */
           A < n.read ? n.read - A - 1 : n.end - A, n.read != n.write)
             return n.bitb = x, n.bitk = b, y.avail_in = E, y.total_in += S - y.next_in_index, y.next_in_index = S, n.write = A, n.inflate_flush(y, C);
           i = DONELOCKS;
+        /* falls through */
         case DONELOCKS:
           return C = Z_STREAM_END, n.bitb = x, n.bitk = b, y.avail_in = E, y.total_in += S - y.next_in_index, y.next_in_index = S, n.write = A, n.inflate_flush(y, C);
         case BADBLOCKS:
@@ -112924,6 +112942,7 @@ function Inflate() {
             break;
           }
           s.mode = FLAG;
+        /* falls through */
         case FLAG:
           if (n.avail_in === 0)
             return r;
@@ -112931,23 +112950,27 @@ function Inflate() {
             s.mode = BAD, n.msg = "incorrect header check", s.marker = 5;
             break;
           }
-          if (!(o & PRESET_DICT)) {
+          if ((o & PRESET_DICT) === 0) {
             s.mode = BLOCKS;
             break;
           }
           s.mode = DICT4;
+        /* falls through */
         case DICT4:
           if (n.avail_in === 0)
             return r;
           r = i, n.avail_in--, n.total_in++, s.need = (n.read_byte(n.next_in_index++) & 255) << 24 & 4278190080, s.mode = DICT3;
+        /* falls through */
         case DICT3:
           if (n.avail_in === 0)
             return r;
           r = i, n.avail_in--, n.total_in++, s.need += (n.read_byte(n.next_in_index++) & 255) << 16 & 16711680, s.mode = DICT2;
+        /* falls through */
         case DICT2:
           if (n.avail_in === 0)
             return r;
           r = i, n.avail_in--, n.total_in++, s.need += (n.read_byte(n.next_in_index++) & 255) << 8 & 65280, s.mode = DICT1;
+        /* falls through */
         case DICT1:
           return n.avail_in === 0 ? r : (r = i, n.avail_in--, n.total_in++, s.need += n.read_byte(n.next_in_index++) & 255, s.mode = DICT0, Z_NEED_DICT);
         case DICT0:
@@ -112960,6 +112983,7 @@ function Inflate() {
           if (r == Z_OK && (r = i), r != Z_STREAM_END)
             return r;
           r = i, s.blocks.reset(n, s.was), s.mode = DONE;
+        /* falls through */
         case DONE:
           return n.avail_in = 0, Z_STREAM_END;
         case BAD:
@@ -113244,7 +113268,7 @@ const bitArray = {
       const n = bitArray.bitLength(e) / 8, i = new Uint8Array(n);
       let r;
       for (let o = 0; o < n; o++)
-        o & 3 || (r = e[o / 4]), i[o] = r >>> 24, r <<= 8;
+        (o & 3) === 0 && (r = e[o / 4]), i[o] = r >>> 24, r <<= 8;
       return i;
     },
     /** Convert from an array of bytes to a bitArray. */
@@ -124961,7 +124985,7 @@ BingMapsImageryProvider.tileXYToQuadKey = function(e, t, n) {
   for (let r = n; r >= 0; --r) {
     const o = 1 << r;
     let s = 0;
-    e & o && (s |= 1), t & o && (s |= 2), i += s;
+    (e & o) !== 0 && (s |= 1), (t & o) !== 0 && (s |= 2), i += s;
   }
   return i;
 };
@@ -124970,7 +124994,7 @@ BingMapsImageryProvider.quadKeyToTileXY = function(e) {
   const i = e.length - 1;
   for (let r = i; r >= 0; --r) {
     const o = 1 << r, s = +e[i - r];
-    s & 1 && (t |= o), s & 2 && (n |= o);
+    (s & 1) !== 0 && (t |= o), (s & 2) !== 0 && (n |= o);
   }
   return {
     x: t,
@@ -128642,6 +128666,7 @@ function propagateEdge(e, t, n, i, r, o) {
     case TileEdge.NORTH:
       d = s.northMeshes, f = s.northTiles;
       break;
+    // Corners are simpler.
     case TileEdge.NORTHWEST:
       s.changedThisFrame = s.changedThisFrame || s.northwestMesh !== c, s.northwestMesh = c, s.northwestTile = n;
       return;
@@ -157233,6 +157258,7 @@ var protobuf$2 = { exports: {} };
           case 5:
             this.skip(4);
             break;
+          /* istanbul ignore next */
           default:
             throw Error("invalid wire type " + _ + " at offset " + this.pos);
         }
@@ -165090,7 +165116,7 @@ var LercDecode = { exports: {} };
             if (x !== -32768 || S < T.length)
               throw "Unexpected end of mask RLE encoding";
             _.mask.bitset = T, p += _.mask.numBytes;
-          } else _.mask.numBytes | _.mask.numBlocksY | _.mask.maxValue || (_.mask.bitset = new Uint8Array(Math.ceil(_.width * _.height / 8)));
+          } else (_.mask.numBytes | _.mask.numBlocksY | _.mask.maxValue) === 0 && (_.mask.bitset = new Uint8Array(Math.ceil(_.width * _.height / 8)));
         C = new DataView(h, p, 16), _.pixels = {}, _.pixels.numBlocksY = C.getUint32(0, !0), _.pixels.numBlocksX = C.getUint32(4, !0), _.pixels.numBytes = C.getUint32(8, !0), _.pixels.maxValue = C.getFloat32(12, !0), p += 16;
         var A = _.pixels.numBlocksX, D = _.pixels.numBlocksY, P = A + (_.width % A > 0 ? 1 : 0), I = D + (_.height % D > 0 ? 1 : 0);
         _.pixels.blocks = new Array(P * I);
@@ -165608,10 +165634,12 @@ var LercDecode = { exports: {} };
           var f = 0;
           switch (d) {
             case 0:
+            //ubyte
             case 1:
               f = 1;
               break;
             case 2:
+            //short
             case 3:
               f = 2;
               break;
@@ -165632,10 +165660,12 @@ var LercDecode = { exports: {} };
           var h = d;
           switch (d) {
             case 2:
+            //short
             case 4:
               h = d - f;
               break;
             case 3:
+            //ushort
             case 5:
               h = d - 2 * f;
               break;

package/dist/assets/cesium.js

@@ -1 +1 @@
-export * from "./cesium-f5e8e354.js";
+export * from "./cesium-6c6aa853.js";