@cesium/engine 11.0.0 → 12.0.0

package/Source/Core/TileAvailability.js

@@ -48,7 +48,7 @@ TileAvailability.prototype.addAvailableTileRange = function (
   startX,
   startY,
   endX,
-  endY
+  endY,
 ) {
   const tilingScheme = this._tilingScheme;
 
@@ -76,7 +76,7 @@ TileAvailability.prototype.addAvailableTileRange = function (
     west,
     south,
     east,
-    north
+    north,
   );
 
   for (let i = 0; i < rootNodes.length; ++i) {
@@ -130,7 +130,7 @@ const eastScratch = new Rectangle();
  * @return {number} The best available level for the entire rectangle.
  */
 TileAvailability.prototype.computeBestAvailableLevelOverRectangle = function (
-  rectangle
+  rectangle,
 ) {
   const rectangles = rectanglesScratch;
   rectangles.length = 0;
@@ -143,8 +143,8 @@ TileAvailability.prototype.computeBestAvailableLevelOverRectangle = function (
         rectangle.south,
         rectangle.east,
         rectangle.north,
-        westScratch
-      )
+        westScratch,
+      ),
     );
     rectangles.push(
       Rectangle.fromRadians(
@@ -152,8 +152,8 @@ TileAvailability.prototype.computeBestAvailableLevelOverRectangle = function (
         rectangle.south,
         Math.PI,
         rectangle.north,
-        eastScratch
-      )
+        eastScratch,
+      ),
     );
   } else {
     rectangles.push(rectangle);
@@ -167,7 +167,7 @@ TileAvailability.prototype.computeBestAvailableLevelOverRectangle = function (
     updateCoverageWithNode(
       remainingToCoverByLevel,
       this._rootNodes[i],
-      rectangles
+      rectangles,
     );
   }
 
@@ -202,7 +202,7 @@ TileAvailability.prototype.isTileAvailable = function (level, x, y) {
     x,
     y,
     level,
-    rectangleScratch
+    rectangleScratch,
   );
   Rectangle.center(rectangle, cartographicScratch);
   return this.computeMaximumLevelAtPosition(cartographicScratch) >= level;
@@ -265,7 +265,7 @@ Object.defineProperties(QuadtreeNode.prototype, {
           this,
           this.level + 1,
           this.x * 2,
-          this.y * 2
+          this.y * 2,
         );
       }
       return this._nw;
@@ -280,7 +280,7 @@ Object.defineProperties(QuadtreeNode.prototype, {
           this,
           this.level + 1,
           this.x * 2 + 1,
-          this.y * 2
+          this.y * 2,
         );
       }
       return this._ne;
@@ -295,7 +295,7 @@ Object.defineProperties(QuadtreeNode.prototype, {
           this,
           this.level + 1,
           this.x * 2,
-          this.y * 2 + 1
+          this.y * 2 + 1,
         );
       }
       return this._sw;
@@ -310,7 +310,7 @@ Object.defineProperties(QuadtreeNode.prototype, {
           this,
           this.level + 1,
           this.x * 2 + 1,
-          this.y * 2 + 1
+          this.y * 2 + 1,
         );
       }
       return this._se;
@@ -359,7 +359,7 @@ function putRectangleInQuadtree(maxDepth, node, rectangle) {
     let index = binarySearch(
       node.rectangles,
       rectangle.level,
-      rectangleLevelComparator
+      rectangleLevelComparator,
     );
     if (index < 0) {
       index = ~index;
@@ -408,25 +408,25 @@ function findMaxLevelFromNode(stopNode, node, position) {
       if (nw) {
         maxLevel = Math.max(
           maxLevel,
-          findMaxLevelFromNode(node, node._nw, position)
+          findMaxLevelFromNode(node, node._nw, position),
         );
       }
       if (ne) {
         maxLevel = Math.max(
           maxLevel,
-          findMaxLevelFromNode(node, node._ne, position)
+          findMaxLevelFromNode(node, node._ne, position),
         );
       }
       if (sw) {
         maxLevel = Math.max(
           maxLevel,
-          findMaxLevelFromNode(node, node._sw, position)
+          findMaxLevelFromNode(node, node._sw, position),
         );
       }
       if (se) {
         maxLevel = Math.max(
           maxLevel,
-          findMaxLevelFromNode(node, node._se, position)
+          findMaxLevelFromNode(node, node._se, position),
         );
       }
       break;
@@ -468,7 +468,7 @@ function findMaxLevelFromNode(stopNode, node, position) {
 function updateCoverageWithNode(
   remainingToCoverByLevel,
   node,
-  rectanglesToCover
+  rectanglesToCover,
 ) {
   if (!node) {
     return;
@@ -496,7 +496,7 @@ function updateCoverageWithNode(
 
     remainingToCoverByLevel[rectangle.level] = subtractRectangle(
       remainingToCoverByLevel[rectangle.level],
-      rectangle
+      rectangle,
     );
   }
 
@@ -522,8 +522,8 @@ function subtractRectangle(rectangleList, rectangleToSubtract) {
             rectangle.west,
             rectangle.south,
             rectangleToSubtract.west,
-            rectangle.north
-          )
+            rectangle.north,
+          ),
         );
       }
       if (rectangle.east > rectangleToSubtract.east) {
@@ -532,8 +532,8 @@ function subtractRectangle(rectangleList, rectangleToSubtract) {
             rectangleToSubtract.east,
             rectangle.south,
             rectangle.east,
-            rectangle.north
-          )
+            rectangle.north,
+          ),
         );
       }
       if (rectangle.south < rectangleToSubtract.south) {
@@ -542,8 +542,8 @@ function subtractRectangle(rectangleList, rectangleToSubtract) {
             Math.max(rectangleToSubtract.west, rectangle.west),
             rectangle.south,
             Math.min(rectangleToSubtract.east, rectangle.east),
-            rectangleToSubtract.south
-          )
+            rectangleToSubtract.south,
+          ),
         );
       }
       if (rectangle.north > rectangleToSubtract.north) {
@@ -552,8 +552,8 @@ function subtractRectangle(rectangleList, rectangleToSubtract) {
             Math.max(rectangleToSubtract.west, rectangle.west),
             rectangleToSubtract.north,
             Math.min(rectangleToSubtract.east, rectangle.east),
-            rectangle.north
-          )
+            rectangle.north,
+          ),
         );
       }
     }

package/Source/Core/TileProviderError.js

@@ -26,7 +26,7 @@ function TileProviderError(
   y,
   level,
   timesRetried,
-  error
+  error,
 ) {
   /**
    * The {@link ImageryProvider} or {@link TerrainProvider} that experienced the error.
@@ -114,7 +114,7 @@ TileProviderError.reportError = function (
   x,
   y,
   level,
-  errorDetails
+  errorDetails,
 ) {
   let error = previousError;
   if (!defined(previousError)) {
@@ -125,7 +125,7 @@ TileProviderError.reportError = function (
       y,
       level,
       0,
-      errorDetails
+      errorDetails,
     );
   } else {
     error.provider = provider;
@@ -143,8 +143,8 @@ TileProviderError.reportError = function (
   } else if (defined(provider)) {
     console.log(
       `An error occurred in "${provider.constructor.name}": ${formatError(
-        message
-      )}`
+        message,
+      )}`,
     );
   }
 

package/Source/Core/TilingScheme.js

@@ -16,7 +16,7 @@ import DeveloperError from "./DeveloperError.js";
 function TilingScheme(options) {
   //>>includeStart('debug', pragmas.debug);
   throw new DeveloperError(
-    "This type should not be instantiated directly.  Instead, use WebMercatorTilingScheme or GeographicTilingScheme."
+    "This type should not be instantiated directly.  Instead, use WebMercatorTilingScheme or GeographicTilingScheme.",
   );
   //>>includeEnd('debug');
 }

package/Source/Core/TimeInterval.js

@@ -145,7 +145,7 @@ TimeInterval.fromIso8601 = function (options, result) {
   const dates = options.iso8601.split("/");
   if (dates.length !== 2) {
     throw new DeveloperError(
-      "options.iso8601 is an invalid ISO 8601 interval."
+      "options.iso8601 is an invalid ISO 8601 interval.",
     );
   }
   const start = JulianDate.fromIso8601(dates[0]);
@@ -185,7 +185,7 @@ TimeInterval.toIso8601 = function (timeInterval, precision) {
 
   return `${JulianDate.toIso8601(
     timeInterval.start,
-    precision
+    precision,
   )}/${JulianDate.toIso8601(timeInterval.stop, precision)}`;
 };
 
@@ -345,7 +345,7 @@ TimeInterval.contains = function (timeInterval, julianDate) {
 
   const startComparedToDate = JulianDate.compare(
     timeInterval.start,
-    julianDate
+    julianDate,
   );
   if (startComparedToDate === 0) {
     return timeInterval.isStartIncluded;
@@ -416,7 +416,7 @@ TimeInterval.EMPTY = Object.freeze(
     stop: new JulianDate(),
     isStartIncluded: false,
     isStopIncluded: false,
-  })
+  }),
 );
 
 /**

package/Source/Core/TimeIntervalCollection.js

@@ -197,7 +197,7 @@ TimeIntervalCollection.prototype.findIntervalContainingDate = function (date) {
  * @returns {object} The data for the interval containing the specified date, or <code>undefined</code> if no such interval exists.
  */
 TimeIntervalCollection.prototype.findDataForIntervalContainingDate = function (
-  date
+  date,
 ) {
   const index = this.indexOf(date);
   return index >= 0 ? this._intervals[index].data : undefined;
@@ -237,7 +237,7 @@ TimeIntervalCollection.prototype.indexOf = function (date) {
   let index = binarySearch(
     intervals,
     indexOfScratch,
-    compareIntervalStartTimes
+    compareIntervalStartTimes,
   );
   if (index >= 0) {
     if (intervals[index].isStartIncluded) {
@@ -309,7 +309,7 @@ TimeIntervalCollection.prototype.findInterval = function (options) {
  */
 TimeIntervalCollection.prototype.addInterval = function (
   interval,
-  dataComparer
+  dataComparer,
 ) {
   //>>includeStart('debug', pragmas.debug);
   if (!defined(interval)) {
@@ -409,7 +409,7 @@ TimeIntervalCollection.prototype.addInterval = function (
         // split the existing interval into two intervals.
         comparison = JulianDate.compare(
           intervals[index - 1].stop,
-          interval.stop
+          interval.stop,
         );
         if (
           comparison > 0 ||
@@ -426,7 +426,7 @@ TimeIntervalCollection.prototype.addInterval = function (
               isStartIncluded: !interval.isStopIncluded,
               isStopIncluded: intervals[index - 1].isStopIncluded,
               data: intervals[index - 1].data,
-            })
+            }),
           );
         }
         intervals[index - 1] = new TimeInterval({
@@ -463,7 +463,7 @@ TimeIntervalCollection.prototype.addInterval = function (
           isStartIncluded: interval.isStartIncluded,
           isStopIncluded: JulianDate.greaterThan(
             intervals[index].stop,
-            interval.stop
+            interval.stop,
           )
             ? intervals[index].isStopIncluded
             : interval.isStopIncluded,
@@ -553,7 +553,7 @@ TimeIntervalCollection.prototype.removeInterval = function (interval) {
           isStartIncluded: !interval.isStopIncluded,
           isStopIncluded: intervals[index - 1].isStopIncluded,
           data: intervals[index - 1].data,
-        })
+        }),
       );
     }
     intervals[index - 1] = new TimeInterval({
@@ -584,7 +584,7 @@ TimeIntervalCollection.prototype.removeInterval = function (interval) {
         isStartIncluded: true,
         isStopIncluded: true,
         data: intervals[index].data,
-      })
+      }),
     );
     ++index;
   }
@@ -671,7 +671,7 @@ TimeIntervalCollection.prototype.removeInterval = function (interval) {
 TimeIntervalCollection.prototype.intersect = function (
   other,
   dataComparer,
-  mergeCallback
+  mergeCallback,
 ) {
   //>>includeStart('debug', pragmas.debug);
   if (!defined(other)) {
@@ -704,7 +704,7 @@ TimeIntervalCollection.prototype.intersect = function (
           leftInterval,
           rightInterval,
           new TimeInterval(),
-          mergeCallback
+          mergeCallback,
         );
         if (!intersection.isEmpty) {
           // Since we start with an empty collection for 'result', and there are no overlapping intervals in 'this' (as a rule),
@@ -893,7 +893,8 @@ function addToDate(julianDate, duration, result) {
 }
 
 const scratchJulianDate = new JulianDate();
-const durationRegex = /P(?:([\d.,]+)Y)?(?:([\d.,]+)M)?(?:([\d.,]+)W)?(?:([\d.,]+)D)?(?:T(?:([\d.,]+)H)?(?:([\d.,]+)M)?(?:([\d.,]+)S)?)?/;
+const durationRegex =
+  /P(?:([\d.,]+)Y)?(?:([\d.,]+)M)?(?:([\d.,]+)W)?(?:([\d.,]+)D)?(?:T(?:([\d.,]+)H)?(?:([\d.,]+)M)?(?:([\d.,]+)S)?)?/;
 
 /**
  * Parses ISO8601 duration string
@@ -961,7 +962,7 @@ function parseDuration(iso8601, result) {
     }
     JulianDate.toGregorianDate(
       JulianDate.fromIso8601(iso8601, scratchJulianDate),
-      result
+      result,
     );
   }
 
@@ -1031,7 +1032,7 @@ TimeIntervalCollection.fromIso8601 = function (options, result) {
       trailingInterval: options.trailingInterval,
       dataCallback: options.dataCallback,
     },
-    result
+    result,
   );
 };
 
@@ -1069,7 +1070,7 @@ TimeIntervalCollection.fromIso8601DateArray = function (options, result) {
       trailingInterval: options.trailingInterval,
       dataCallback: options.dataCallback,
     },
-    result
+    result,
   );
 };
 
@@ -1130,7 +1131,7 @@ TimeIntervalCollection.fromIso8601DurationArray = function (options, result) {
       trailingInterval: options.trailingInterval,
       dataCallback: options.dataCallback,
     },
-    result
+    result,
   );
 };
 export default TimeIntervalCollection;

package/Source/Core/Tipsify.js

@@ -152,7 +152,7 @@ Tipsify.tipsify = function (options) {
     vertices,
     s,
     deadEnd,
-    maximumIndexPlusOne
+    maximumIndexPlusOne,
   ) {
     let n = -1;
     let p;
@@ -305,7 +305,7 @@ Tipsify.tipsify = function (options) {
       vertices,
       s,
       deadEnd,
-      maximumIndexPlusOne
+      maximumIndexPlusOne,
     );
   }