bruce-cesium 5.8.4 → 5.8.6

package/dist/bruce-cesium.es5.js

@@ -1,6 +1,6 @@
 import { BruceEvent, Cartes, Entity as Entity$1, ProjectViewTile, Carto, Geometry, MathUtils, LRUCache, Api, Calculator, ClientFile, EntityTag, EntityType, ObjectUtils, Style, DelayQueue, EntityLod, Bounds, ZoomControl, EntityRelationType, ENVIRONMENT, EntityHistoricData, Tileset, EntityCoords, DataLab, EntitySource, MenuItem, EntityRelation, ProgramKey, ProjectView, ProjectViewBookmark, Camera, ProjectViewLegacyTile, EntityAttachment, EntityAttachmentType, EntityAttribute, AbstractApi, Session } from 'bruce-models';
 import * as Cesium from 'cesium';
-import { Cartographic, Cartesian2, Math as Math$1, Cartesian3, CallbackProperty, Color, HeightReference, Rectangle, JulianDate, Entity, DistanceDisplayCondition, ClassificationType, ArcType, CornerType, ShadowMode, ConstantProperty, ConstantPositionProperty, PolygonHierarchy, PolylineGraphics, ColorMaterialProperty, HorizontalOrigin, VerticalOrigin, ColorBlendMode, HeadingPitchRoll, Transforms, Model, Primitive, Cesium3DTileFeature, SceneMode, GeoJsonDataSource, Cesium3DTileStyle, HeadingPitchRange, Cesium3DTileColorBlendMode, Ion, KmlDataSource, Quaternion, Matrix3, Matrix4, SceneTransforms, OrthographicFrustum, EasingFunction, NearFarScalar, EllipsoidTerrainProvider, IonImageryProvider, createWorldImagery, createWorldImageryAsync, BingMapsImageryProvider, BingMapsStyle, MapboxImageryProvider, MapboxStyleImageryProvider, ArcGisMapServerImageryProvider, OpenStreetMapImageryProvider, UrlTemplateImageryProvider, GridImageryProvider, GeographicTilingScheme, ImageryLayer, TileMapServiceImageryProvider, CesiumTerrainProvider, IonResource, Cesium3DTileset, CesiumInspector, defined, ClockRange, EllipsoidGeodesic, sampleTerrainMostDetailed, PolygonPipeline, ScreenSpaceEventHandler, ScreenSpaceEventType, ModelGraphics, PolygonGraphics, CorridorGraphics, PointGraphics, BillboardGraphics, EllipseGraphics, PolylineDashMaterialProperty, BoundingSphere, GeometryInstance, CzmlDataSource, Intersect, Fullscreen } from 'cesium';
+import { Cartographic, Cartesian2, Math as Math$1, Cartesian3, CallbackProperty, Color, HeightReference, Rectangle, JulianDate, Entity, DistanceDisplayCondition, ClassificationType, ArcType, CornerType, ShadowMode, ConstantProperty, ConstantPositionProperty, HorizontalOrigin, VerticalOrigin, PolygonHierarchy, PolylineGraphics, ColorMaterialProperty, ColorBlendMode, HeadingPitchRoll, Transforms, Model, SceneMode, Primitive, Cesium3DTileFeature, GeoJsonDataSource, Cesium3DTileStyle, HeadingPitchRange, Cesium3DTileColorBlendMode, Ion, KmlDataSource, Quaternion, Matrix3, Matrix4, SceneTransforms, OrthographicFrustum, EasingFunction, NearFarScalar, Cesium3DTileset, IonResource, EllipsoidTerrainProvider, CesiumInspector, defined, ClockRange, EllipsoidGeodesic, sampleTerrainMostDetailed, PolygonPipeline, ModelGraphics, PolygonGraphics, CorridorGraphics, PointGraphics, BillboardGraphics, EllipseGraphics, PolylineDashMaterialProperty, BoundingSphere, GeometryInstance, IonImageryProvider, createWorldImagery, createWorldImageryAsync, BingMapsImageryProvider, BingMapsStyle, MapboxImageryProvider, MapboxStyleImageryProvider, ArcGisMapServerImageryProvider, OpenStreetMapImageryProvider, UrlTemplateImageryProvider, GridImageryProvider, GeographicTilingScheme, ImageryLayer, TileMapServiceImageryProvider, CesiumTerrainProvider, ScreenSpaceEventHandler, ScreenSpaceEventType, CzmlDataSource, Intersect, Fullscreen } from 'cesium';
 
 const TIME_LAG = 300;
 const POSITION_CHECK_TIMER = 950;
@@ -18369,6 +18369,7 @@ var TilesetCadRenderManager;
                             rego.entityId = meta.entityId;
                             rego.entityTypeId = meta.typeId;
                             rego.name = meta.name;
+                            rego.parentId = meta.parentId;
                         }
                     }
                 }
@@ -18500,7 +18501,11 @@ var TilesetCadRenderManager;
         buildModelTreeNodes(modelTree) {
             this.treeNodeByGeomId = {};
             this.treeNodeByEntityId = {};
-            const recurse = (node, firstFoundCollapsedBranch) => {
+            const stack = [
+                { node: modelTree, parentId: null, firstFoundCollapsedBranch: null }
+            ];
+            while (stack.length > 0) {
+                const { node, parentId, firstFoundCollapsedBranch } = stack.pop();
                 if (firstFoundCollapsedBranch) {
                     this.treeNodeByGeomId[node.geomId] = firstFoundCollapsedBranch;
                     this.treeNodeByEntityId[node.id] = firstFoundCollapsedBranch;
@@ -18510,21 +18515,27 @@ var TilesetCadRenderManager;
                         entityId: node.id,
                         typeId: node.typeId,
                         name: node.name,
-                        geomId: node.geomId
+                        geomId: node.geomId,
+                        parentId: parentId
                     };
                     this.treeNodeByGeomId[node.geomId] = cache;
                     this.treeNodeByEntityId[node.id] = cache;
+                    let newFirstFoundCollapsedBranch = firstFoundCollapsedBranch;
                     if (!firstFoundCollapsedBranch && node.collapsed) {
-                        firstFoundCollapsedBranch = cache;
-                    }
-                }
-                if (node.children) {
-                    for (let i = 0; i < node.children.length; i++) {
-                        recurse(node.children[i], firstFoundCollapsedBranch);
+                        newFirstFoundCollapsedBranch = cache;
+                    }
+                    // Push children to stack in reverse order to maintain correct traversal
+                    if (node.children) {
+                        for (let i = node.children.length - 1; i >= 0; i--) {
+                            stack.push({
+                                node: node.children[i],
+                                parentId: node.id,
+                                firstFoundCollapsedBranch: newFirstFoundCollapsedBranch
+                            });
+                        }
                     }
                 }
-            };
-            recurse(modelTree, null);
+            }
         }
         getEntityTypeByPath(path) {
             var _a, _b;
@@ -18543,6 +18554,236 @@ var TilesetCadRenderManager;
             const node = this.treeNodeByEntityId[entityId] || null;
             return node ? node.typeId : null;
         }
+        /**
+         * Gets the parent node of a given entity.
+         * @param entityId The entity ID to find the parent for
+         * @returns The parent node or null if no parent exists
+         */
+        getParentNode(entityId) {
+            var _a, _b;
+            if (this.treeNodeByEntityId == null) {
+                let modelTree = (_b = (_a = this.cTileset) === null || _a === void 0 ? void 0 : _a.extensions) === null || _b === void 0 ? void 0 : _b.modelTree;
+                if (!modelTree) {
+                    modelTree = this.modelTree;
+                }
+                if (!modelTree) {
+                    return null;
+                }
+                this.buildModelTreeNodes(modelTree);
+            }
+            const node = this.treeNodeByEntityId[entityId];
+            if (node === null || node === void 0 ? void 0 : node.parentId) {
+                return this.treeNodeByEntityId[node.parentId] || null;
+            }
+            return null;
+        }
+        /**
+         * Gets all child nodes of a given entity.
+         * @param entityId The entity ID to find children for
+         * @returns Array of child nodes
+         */
+        getChildNodes(entityId) {
+            var _a, _b;
+            if (this.treeNodeByEntityId == null) {
+                let modelTree = (_b = (_a = this.cTileset) === null || _a === void 0 ? void 0 : _a.extensions) === null || _b === void 0 ? void 0 : _b.modelTree;
+                if (!modelTree) {
+                    modelTree = this.modelTree;
+                }
+                if (!modelTree) {
+                    return [];
+                }
+                this.buildModelTreeNodes(modelTree);
+            }
+            const children = [];
+            for (const nodeId in this.treeNodeByEntityId) {
+                const node = this.treeNodeByEntityId[nodeId];
+                if (node.parentId === entityId) {
+                    children.push(node);
+                }
+            }
+            return children;
+        }
+        /**
+         * Gets all descendant nodes of a given entity (children, grandchildren, etc.).
+         * @param entityId The entity ID to find descendants for
+         * @returns Array of descendant nodes
+         */
+        getDescendantNodes(entityId) {
+            var _a, _b;
+            if (this.treeNodeByEntityId == null) {
+                let modelTree = (_b = (_a = this.cTileset) === null || _a === void 0 ? void 0 : _a.extensions) === null || _b === void 0 ? void 0 : _b.modelTree;
+                if (!modelTree) {
+                    modelTree = this.modelTree;
+                }
+                if (!modelTree) {
+                    return [];
+                }
+                this.buildModelTreeNodes(modelTree);
+            }
+            const descendants = [];
+            const stack = [entityId];
+            // Use iterative approach with a stack instead of recursion
+            while (stack.length > 0) {
+                const currentId = stack.pop();
+                if (!currentId)
+                    continue;
+                for (const nodeId in this.treeNodeByEntityId) {
+                    const node = this.treeNodeByEntityId[nodeId];
+                    if (node.parentId === currentId) {
+                        descendants.push(node);
+                        stack.push(node.entityId);
+                    }
+                }
+            }
+            return descendants;
+        }
+        /**
+         * Gets the root node of the model tree.
+         * @returns The root node or null if no tree exists
+         */
+        getRootNode() {
+            var _a, _b;
+            if (this.treeNodeByEntityId == null) {
+                let modelTree = (_b = (_a = this.cTileset) === null || _a === void 0 ? void 0 : _a.extensions) === null || _b === void 0 ? void 0 : _b.modelTree;
+                if (!modelTree) {
+                    modelTree = this.modelTree;
+                }
+                if (!modelTree) {
+                    return null;
+                }
+                this.buildModelTreeNodes(modelTree);
+            }
+            // Find the node with no parent (root node)
+            for (const nodeId in this.treeNodeByEntityId) {
+                const node = this.treeNodeByEntityId[nodeId];
+                if (!node.parentId) {
+                    return node;
+                }
+            }
+            return null;
+        }
+        /**
+         * Gets the path from root to a given entity.
+         * @param entityId The entity ID to find the path for
+         * @returns Array of node IDs representing the path from root to the entity
+         */
+        getNodePath(entityId) {
+            var _a, _b;
+            if (this.treeNodeByEntityId == null) {
+                let modelTree = (_b = (_a = this.cTileset) === null || _a === void 0 ? void 0 : _a.extensions) === null || _b === void 0 ? void 0 : _b.modelTree;
+                if (!modelTree) {
+                    modelTree = this.modelTree;
+                }
+                if (!modelTree) {
+                    return [];
+                }
+                this.buildModelTreeNodes(modelTree);
+            }
+            const path = [];
+            let currentId = entityId;
+            while (currentId) {
+                const node = this.treeNodeByEntityId[currentId];
+                if (!node) {
+                    break;
+                }
+                path.unshift(currentId);
+                currentId = node.parentId;
+            }
+            return path;
+        }
+        /**
+         * Batch operation to get multiple node paths efficiently.
+         * @param entityIds Array of entity IDs to get paths for
+         * @returns Map of entityId to path array
+         */
+        getNodePathsBatch(entityIds) {
+            var _a, _b;
+            if (this.treeNodeByEntityId == null) {
+                let modelTree = (_b = (_a = this.cTileset) === null || _a === void 0 ? void 0 : _a.extensions) === null || _b === void 0 ? void 0 : _b.modelTree;
+                if (!modelTree) {
+                    modelTree = this.modelTree;
+                }
+                if (!modelTree) {
+                    return new Map();
+                }
+                this.buildModelTreeNodes(modelTree);
+            }
+            const paths = new Map();
+            for (const entityId of entityIds) {
+                const path = [];
+                let currentId = entityId;
+                while (currentId) {
+                    const node = this.treeNodeByEntityId[currentId];
+                    if (!node) {
+                        break;
+                    }
+                    path.unshift(currentId);
+                    currentId = node.parentId;
+                }
+                paths.set(entityId, path);
+            }
+            return paths;
+        }
+        /**
+         * Batch operation to get multiple parent nodes efficiently.
+         * @param entityIds Array of entity IDs to get parents for
+         * @returns Map of entityId to parent node
+         */
+        getParentNodesBatch(entityIds) {
+            var _a, _b;
+            if (this.treeNodeByEntityId == null) {
+                let modelTree = (_b = (_a = this.cTileset) === null || _a === void 0 ? void 0 : _a.extensions) === null || _b === void 0 ? void 0 : _b.modelTree;
+                if (!modelTree) {
+                    modelTree = this.modelTree;
+                }
+                if (!modelTree) {
+                    return new Map();
+                }
+                this.buildModelTreeNodes(modelTree);
+            }
+            const parents = new Map();
+            for (const entityId of entityIds) {
+                const node = this.treeNodeByEntityId[entityId];
+                if (node === null || node === void 0 ? void 0 : node.parentId) {
+                    parents.set(entityId, this.treeNodeByEntityId[node.parentId] || null);
+                }
+                else {
+                    parents.set(entityId, null);
+                }
+            }
+            return parents;
+        }
+        /**
+         * Batch operation to get multiple child nodes efficiently.
+         * @param entityIds Array of entity IDs to get children for
+         * @returns Map of entityId to array of child nodes
+         */
+        getChildNodesBatch(entityIds) {
+            var _a, _b;
+            if (this.treeNodeByEntityId == null) {
+                let modelTree = (_b = (_a = this.cTileset) === null || _a === void 0 ? void 0 : _a.extensions) === null || _b === void 0 ? void 0 : _b.modelTree;
+                if (!modelTree) {
+                    modelTree = this.modelTree;
+                }
+                if (!modelTree) {
+                    return new Map();
+                }
+                this.buildModelTreeNodes(modelTree);
+            }
+            const children = new Map();
+            // Initialize all entityIds with empty arrays
+            for (const entityId of entityIds) {
+                children.set(entityId, []);
+            }
+            // Build a reverse lookup for efficiency
+            for (const nodeId in this.treeNodeByEntityId) {
+                const node = this.treeNodeByEntityId[nodeId];
+                if (node.parentId && children.has(node.parentId)) {
+                    children.get(node.parentId).push(node);
+                }
+            }
+            return children;
+        }
         Dispose() {
             if (this.disposed) {
                 return;
@@ -22075,6 +22316,8 @@ var AssemblyRenderManager;
             this.disposed = false;
             // Cache of the hierarchy so that our scene-tree can reference it.
             this.hierarchy = null;
+            // Quick look-up of the hierarchy nodes by entity ID.
+            this.hierarchyNodeByEntityId = null;
             this.modelSpace = false;
             const { viewer, register: visualsManager, getters, item } = params;
             this.viewer = viewer;
@@ -22089,7 +22332,7 @@ var AssemblyRenderManager;
                 this.renderPriority = 1;
             }
             (async () => {
-                var _a;
+                var _a, _b, _c;
                 if (this.disposed) {
                     return;
                 }
@@ -22102,6 +22345,8 @@ var AssemblyRenderManager;
                         if (this.disposed) {
                             return;
                         }
+                        // Build hierarchy node cache for quick lookups
+                        this.buildHierarchyNodes(hierarchy);
                         const traverseHierarchy = (node, leavesOnly) => {
                             var _a;
                             if (node.Children) {
@@ -22174,7 +22419,8 @@ var AssemblyRenderManager;
                                     accountId: this.getters.GetAccountId(),
                                     entityTypeId: entity.Bruce["EntityType.ID"],
                                     name: entity.Bruce.Name,
-                                    rootId: rootId
+                                    rootId: rootId,
+                                    parentId: (_c = (_b = this.hierarchyNodeByEntityId) === null || _b === void 0 ? void 0 : _b[entity.Bruce.ID]) === null || _c === void 0 ? void 0 : _c.parentId
                                 },
                                 requestRender: false
                             });
@@ -22202,6 +22448,210 @@ var AssemblyRenderManager;
                 entityIds = entities.map(x => { var _a; return (_a = x.Bruce) === null || _a === void 0 ? void 0 : _a.ID; });
             }
         }
+        /**
+         * Builds quick look-up of the hierarchy nodes by entity ID.
+         * @param hierarchy The hierarchy data from the API
+         */
+        buildHierarchyNodes(hierarchy) {
+            this.hierarchyNodeByEntityId = {};
+            if (!(hierarchy === null || hierarchy === void 0 ? void 0 : hierarchy.Root)) {
+                return;
+            }
+            // Use iterative approach with a stack instead of recursion
+            const stack = [
+                { node: hierarchy.Root, parentId: null }
+            ];
+            while (stack.length > 0) {
+                const { node, parentId } = stack.pop();
+                if (node.ID) {
+                    const cache = {
+                        entityId: node.ID,
+                        name: node.Name || node.ID,
+                        parentId: parentId
+                    };
+                    this.hierarchyNodeByEntityId[node.ID] = cache;
+                }
+                // Push children to stack in reverse order to maintain correct traversal
+                if (node.Children) {
+                    for (let i = node.Children.length - 1; i >= 0; i--) {
+                        stack.push({
+                            node: node.Children[i],
+                            parentId: node.ID
+                        });
+                    }
+                }
+            }
+        }
+        /**
+         * Gets the parent node of a given entity.
+         * @param entityId The entity ID to find the parent for
+         * @returns The parent node or null if no parent exists
+         */
+        getParentNode(entityId) {
+            var _a;
+            if (this.hierarchyNodeByEntityId == null && this.hierarchy) {
+                this.buildHierarchyNodes(this.hierarchy);
+            }
+            const node = (_a = this.hierarchyNodeByEntityId) === null || _a === void 0 ? void 0 : _a[entityId];
+            if (node === null || node === void 0 ? void 0 : node.parentId) {
+                return this.hierarchyNodeByEntityId[node.parentId] || null;
+            }
+            return null;
+        }
+        /**
+         * Gets all child nodes of a given entity.
+         * @param entityId The entity ID to find children for
+         * @returns Array of child nodes
+         */
+        getChildNodes(entityId) {
+            if (this.hierarchyNodeByEntityId == null && this.hierarchy) {
+                this.buildHierarchyNodes(this.hierarchy);
+            }
+            const children = [];
+            for (const nodeId in this.hierarchyNodeByEntityId) {
+                const node = this.hierarchyNodeByEntityId[nodeId];
+                if (node.parentId === entityId) {
+                    children.push(node);
+                }
+            }
+            return children;
+        }
+        /**
+         * Gets all descendant nodes of a given entity (children, grandchildren, etc.).
+         * @param entityId The entity ID to find descendants for
+         * @returns Array of descendant nodes
+         */
+        getDescendantNodes(entityId) {
+            if (this.hierarchyNodeByEntityId == null && this.hierarchy) {
+                this.buildHierarchyNodes(this.hierarchy);
+            }
+            const descendants = [];
+            const stack = [entityId];
+            // Use iterative approach with a stack instead of recursion
+            while (stack.length > 0) {
+                const currentId = stack.pop();
+                if (!currentId)
+                    continue;
+                for (const nodeId in this.hierarchyNodeByEntityId) {
+                    const node = this.hierarchyNodeByEntityId[nodeId];
+                    if (node.parentId === currentId) {
+                        descendants.push(node);
+                        stack.push(node.entityId);
+                    }
+                }
+            }
+            return descendants;
+        }
+        /**
+         * Gets the root node of the hierarchy.
+         * @returns The root node or null if no hierarchy exists
+         */
+        getRootNode() {
+            if (this.hierarchyNodeByEntityId == null && this.hierarchy) {
+                this.buildHierarchyNodes(this.hierarchy);
+            }
+            // Find the node with no parent (root node)
+            for (const nodeId in this.hierarchyNodeByEntityId) {
+                const node = this.hierarchyNodeByEntityId[nodeId];
+                if (!node.parentId) {
+                    return node;
+                }
+            }
+            return null;
+        }
+        /**
+         * Gets the path from root to a given entity.
+         * @param entityId The entity ID to find the path for
+         * @returns Array of node IDs representing the path from root to the entity
+         */
+        getNodePath(entityId) {
+            var _a;
+            if (this.hierarchyNodeByEntityId == null && this.hierarchy) {
+                this.buildHierarchyNodes(this.hierarchy);
+            }
+            const path = [];
+            let currentId = entityId;
+            while (currentId) {
+                const node = (_a = this.hierarchyNodeByEntityId) === null || _a === void 0 ? void 0 : _a[currentId];
+                if (!node) {
+                    break;
+                }
+                path.unshift(currentId);
+                currentId = node.parentId;
+            }
+            return path;
+        }
+        /**
+         * Batch operation to get multiple node paths efficiently.
+         * @param entityIds Array of entity IDs to get paths for
+         * @returns Map of entityId to path array
+         */
+        getNodePathsBatch(entityIds) {
+            var _a;
+            if (this.hierarchyNodeByEntityId == null && this.hierarchy) {
+                this.buildHierarchyNodes(this.hierarchy);
+            }
+            const paths = new Map();
+            for (const entityId of entityIds) {
+                const path = [];
+                let currentId = entityId;
+                while (currentId) {
+                    const node = (_a = this.hierarchyNodeByEntityId) === null || _a === void 0 ? void 0 : _a[currentId];
+                    if (!node) {
+                        break;
+                    }
+                    path.unshift(currentId);
+                    currentId = node.parentId;
+                }
+                paths.set(entityId, path);
+            }
+            return paths;
+        }
+        /**
+         * Batch operation to get multiple parent nodes efficiently.
+         * @param entityIds Array of entity IDs to get parents for
+         * @returns Map of entityId to parent node
+         */
+        getParentNodesBatch(entityIds) {
+            var _a;
+            if (this.hierarchyNodeByEntityId == null && this.hierarchy) {
+                this.buildHierarchyNodes(this.hierarchy);
+            }
+            const parents = new Map();
+            for (const entityId of entityIds) {
+                const node = (_a = this.hierarchyNodeByEntityId) === null || _a === void 0 ? void 0 : _a[entityId];
+                if (node === null || node === void 0 ? void 0 : node.parentId) {
+                    parents.set(entityId, this.hierarchyNodeByEntityId[node.parentId] || null);
+                }
+                else {
+                    parents.set(entityId, null);
+                }
+            }
+            return parents;
+        }
+        /**
+         * Batch operation to get multiple child nodes efficiently.
+         * @param entityIds Array of entity IDs to get children for
+         * @returns Map of entityId to array of child nodes
+         */
+        getChildNodesBatch(entityIds) {
+            if (this.hierarchyNodeByEntityId == null && this.hierarchy) {
+                this.buildHierarchyNodes(this.hierarchy);
+            }
+            const children = new Map();
+            // Initialize all entityIds with empty arrays
+            for (const entityId of entityIds) {
+                children.set(entityId, []);
+            }
+            // Build a reverse lookup for efficiency
+            for (const nodeId in this.hierarchyNodeByEntityId) {
+                const node = this.hierarchyNodeByEntityId[nodeId];
+                if (node.parentId && children.has(node.parentId)) {
+                    children.get(node.parentId).push(node);
+                }
+            }
+            return children;
+        }
     }
     AssemblyRenderManager.Manager = Manager;
 })(AssemblyRenderManager || (AssemblyRenderManager = {}));
@@ -32412,7 +32862,7 @@ class WidgetViewBar extends Widget.AWidget {
     }
 }
 
-const VERSION = "5.8.4";
+const VERSION = "5.8.6";
 
 export { VERSION, CesiumViewMonitor, ViewerUtils, ViewerEventTracker, MenuItemManager, isOutlineChanged, EntityRenderEngine, EntityRenderEnginePoint, EntityRenderEnginePolyline, EntityRenderEnginePolygon, EntityRenderEngineModel3d, MenuItemCreator, VisualsRegister, RenderManager, EntitiesIdsRenderManager, DataLabRenderManager, EntitiesLoadedRenderManager, EntitiesRenderManager, EntityRenderManager, TilesetCadRenderManager, TilesetArbRenderManager, TilesetEntitiesRenderManager, TilesetOsmRenderManager, TilesetPointcloudRenderManager, TilesetGooglePhotosRenderManager, DataSourceStaticKmlManager, GoogleSearchRenderManager, AssemblyRenderManager, RelationsRenderManager, SharedGetters, CesiumParabola, EntityLabel, ViewRenderEngine, TileRenderEngine, TilesetRenderEngine, CESIUM_INSPECTOR_KEY, CESIUM_TIMELINE_KEY, CESIUM_TIMELINE_LIVE_KEY, CESIUM_TIMELINE_LIVE_PADDING_KEY, CESIUM_TIMELINE_INTERVAL_KEY, DEFAULT_LIVE_PADDING_SECONDS, ViewUtils, DrawingUtils, MeasureUtils, EntityUtils, CesiumEntityStyler, CesiumAnimatedProperty, CesiumAnimatedInOut, Draw3dPolygon, Draw3dPolyline, MeasureCreator, Walkthrough, Widget, VIEWER_BOOKMARKS_WIDGET_KEY, WidgetBookmarks, WidgetBranding, WidgetCursorBar, WidgetEmbeddedInfoView, WidgetInfoView, WidgetNavCompass$$1 as WidgetNavCompass, VIEWER_VIEW_BAR_WIDGET_KEY, WidgetViewBar, WidgetControlViewBar, WidgetControlViewBarSearch, VIEWER_LEFT_PANEL_WIDGET_KEY, VIEWER_LEFT_PANEL_CSS_VAR_LEFT, WidgetLeftPanel, WidgetLeftPanelTab, WidgetLeftPanelTabBookmarks };
 //# sourceMappingURL=bruce-cesium.es5.js.map