/** * @license * Cesium - https://github.com/CesiumGS/cesium * Version 1.98 * * Copyright 2011-2022 Cesium Contributors * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * * Columbus View (Pat. Pend.) * * Portions licensed separately. * See https://github.com/CesiumGS/cesium/blob/main/LICENSE.md for full licensing details. */ define(["exports","./ArcType-24f44850","./arrayRemoveDuplicates-fd3a3f4e","./Matrix2-cf4c6e69","./ComponentDatatype-9b23164a","./defaultValue-50f7432c","./EllipsoidRhumbLine-0cc30625","./GeometryAttribute-10955f8d","./GeometryAttributes-8bab1b25","./GeometryPipeline-51ce1008","./IndexDatatype-ceed713e","./PolygonPipeline-f526e04e","./Transforms-7ac1f9ee"],(function(e,t,n,i,o,r,a,s,c,l,u,h,p){"use strict";function f(){this._array=[],this._offset=0,this._length=0}Object.defineProperties(f.prototype,{length:{get:function(){return this._length}}}),f.prototype.enqueue=function(e){this._array.push(e),this._length++},f.prototype.dequeue=function(){if(0===this._length)return;const e=this._array;let t=this._offset;const n=e[t];return e[t]=void 0,t++,t>10&&2*t>e.length&&(this._array=e.slice(t),t=0),this._offset=t,this._length--,n},f.prototype.peek=function(){if(0!==this._length)return this._array[this._offset]},f.prototype.contains=function(e){return-1!==this._array.indexOf(e)},f.prototype.clear=function(){this._array.length=this._offset=this._length=0},f.prototype.sort=function(e){this._offset>0&&(this._array=this._array.slice(this._offset),this._offset=0),this._array.sort(e)};const d={computeHierarchyPackedLength:function(e,t){let n=0;const i=[e];for(;i.length>0;){const e=i.pop();if(!r.defined(e))continue;n+=2;const o=e.positions,a=e.holes;if(r.defined(o)&&o.length>0&&(n+=o.length*t.packedLength),r.defined(a)){const e=a.length;for(let t=0;t0;){const e=o.pop();if(!r.defined(e))continue;const a=e.positions,s=e.holes;if(t[n++]=r.defined(a)?a.length:0,t[n++]=r.defined(s)?s.length:0,r.defined(a)){const e=a.length;for(let o=0;o0?new Array(o):void 0;for(let o=0;o