@itwin/core-orbitgt 4.0.0-dev.51 → 4.0.0-dev.54

package/lib/cjs/pointcloud/render/ViewTree.js.map

@@ -1 +1 @@
-{"version":3,"file":"ViewTree.js","sourceRoot":"","sources":["../../../../src/pointcloud/render/ViewTree.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAWH,yDAAsD;AACtD,0DAAuD;AAEvD,kDAA+C;AAI/C,mCAAgC;AAIhC;;;;GAIG;AACH,gBAAgB;AAChB,MAAa,QAAQ;IAgBpB;;;;OAIG;IACH,YAAmB,WAAwB,EAAE,MAAoB,EAAE,UAAkB;QACpF,0BAA0B;QAC1B,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,0BAA0B;QAC1B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACK,cAAc;QACrB,qCAAqC;QACrC,IAAI,UAAU,GAAU,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClD,IAAI,UAAU,GAAG,CAAC;YAAE,UAAU,GAAG,CAAC,CAAC;QACnC,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,8CAA8C,GAAG,UAAU,GAAG,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC3H,sBAAsB;QACtB,IAAI,UAAU,GAAiB,IAAI,aAAK,EAAS,CAAC;QAClD,IAAI,cAAc,GAAc,IAAI,qBAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,KAAK,IAAI,CAAC,GAAW,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClE,mCAAmC;YACnC,IAAI,KAAK,GAAU,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,KAAK,IAAI,KAAK,IAAI,KAAK,CAAC,SAAS,EAAE,EAAE;gBACpC,oBAAoB;gBACpB,IAAI,MAAM,GAAY,IAAI,CAAC;gBAC3B,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;oBAChC,kDAAkD;oBAClD,KAAK,CAAC,aAAa,EAAE,CAAC,SAAS,CAAC,iBAAiB,CAAC,cAAc,CAAC,CAAC;oBAClE,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,kBAAkB,CAAC,cAAc,CAAC,IAAI,IAAI,CAAC,CAAC;oBAC1E,IAAI,MAAM;wBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC,SAAS,GAAG,kBAAkB,CAAC,CAAC;iBACvH;gBACD,sBAAsB;gBACtB,IAAI,MAAM;oBAAE,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;aAClC;SACD;QACD,sBAAsB;QACtB,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,GAAG,UAAU,CAAC,IAAI,EAAE,GAAG,cAAc,CAAC,CAAC;QAC9E,OAAO,UAAU,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,aAAa;QACnB,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,KAAY;QAC3B,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACI,aAAa;QACnB,OAAO,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACI,cAAc,CAAC,KAAY,EAAE,YAA+B;QAClE,IAAI,YAAY,IAAI,IAAI;YAAE,OAAO;QACjC,IAAI,SAAS,GAAiB,IAAI,KAAK,CAAQ,YAAY,CAAC,MAAM,CAAC,CAAC;QACpE,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,aAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAC9B,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,GAAG,YAAY,CAAC,MAAM,GAAG,oBAAoB,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3G,CAAC;IAED;;;;OAIG;IACI,aAAa,CAAC,UAAsB,EAAE,WAA6B;QACzE,IAAI,KAAK,GAAU,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAClD,IAAI,KAAK,GAAU,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAC/C,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;IAC7B,CAAC;IAED;;;;;;;;;OASG;IACK,SAAS,CAAC,KAAY,EAAE,IAAe,EAAE,UAAiB,EAAE,QAA0B,EAAE,YAA0B,EAAE,YAA+B;QAC1J,sBAAsB;QACtB,QAAQ,CAAC,KAAK,EAAE,CAAC;QACjB,yBAAyB;QACzB,IAAI,SAAS,GAAqB,IAAI,CAAC,QAAQ,CAAC;QAChD,IAAI,SAAS,IAAI,IAAI,EAAE;YACtB,YAAY;YACZ,KAAK,IAAI,KAAK,IAAI,SAAS;gBAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,IAAI,CAAC;SACZ;QACD,gDAAgD;QAChD,IAAI,QAAQ,GAAY,IAAI,CAAC;QAC7B,qBAAqB;QACrB,IAAI,UAAU,CAAC,aAAa,EAAE,IAAI,CAAC,EAAE;YACpC,uDAAuD;YACvD,IAAI,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,KAAK;gBAAE,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC7E,OAAO,KAAK,CAAC;SACb;QACD,sCAAsC;QACtC,IAAI,KAAK,GAAc,IAAI,CAAC,SAAS,CAAC;QACtC,IAAI,UAAU,GAAc,IAAI,qBAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC3G,gCAAgC;oBAChC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjC,oBAAoB;oBACpB,IAAI,KAAK,GAAU,UAAU,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC;oBAC3D,IAAI,KAAK,IAAI,IAAI,EAAE;wBAClB,4BAA4B;wBAC5B,iBAAO,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,EAAE,4BAA4B,GAAG,UAAU,GAAG,kBAAkB,GAAG,UAAU,CAAC,QAAQ,EAAE,GAAG,IAAI,GAAG,UAAU,CAAC,aAAa,EAAE,GAAG,UAAU,CAAC,CAAC;wBAC/K,QAAQ,GAAG,KAAK,CAAC;wBACjB,SAAS;qBACT;oBACD,gCAAgC;oBAChC,IAAI,KAAK,CAAC,QAAQ,EAAE,IAAI,KAAK,EAAE;wBAC9B,yBAAyB;wBACzB,IAAI,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,IAAI,KAAK;4BAAE,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC;wBACnG,QAAQ,GAAG,KAAK,CAAC;qBACjB;yBACI;wBACJ,oBAAoB;wBACpB,IAAI,KAAK,GAAc,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;wBAClD,IAAI,KAAK,IAAI,IAAI;4BAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;qBACvC;iBACD;QACD,kCAAkC;QAClC,IAAI,QAAQ,EAAE;YACb,WAAW;YACX,IAAI,YAAY,GAAqB,IAAI,KAAK,CAAY,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3E,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,YAAY,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxF,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC;SAC7B;QACD,8BAA8B;QAC9B,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACK,kBAAkB,CAAC,WAAyB,EAAE,KAAuB,EAAE,YAA8B;QAC5G,qBAAqB;QACrB,YAAY,CAAC,KAAK,EAAE,CAAC;QACrB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;YAC9C,uBAAuB;YACvB,IAAI,IAAI,GAAc,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnC,oBAAoB;YACpB,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE;gBACjD,+BAA+B;gBAC/B,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;aACvB;iBACI;gBACJ,qBAAqB;gBACrB,IAAI,CAAC,UAAU,GAAG,WAAW,CAAC,YAAY,EAAE,CAAC;aAC7C;SACD;IACF,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,WAAyB,EAAE,KAAuB;QACzE,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9C,uBAAuB;YACvB,IAAI,IAAI,GAAc,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,oBAAoB;YACpB,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,IAAI;gBAAE,OAAO,KAAK,CAAC;SAC/D;QACD,eAAe;QACf,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACK,cAAc,CAAC,WAAyB,EAAE,KAAY,EAAE,KAAuB,EAAE,YAA0B,EAAE,YAA+B,EAAE,WAA6B,EAAE,aAA+B;QACnN,eAAe;QACf,IAAI,KAAK,IAAI,IAAI;YAAE,OAAO;QAC1B,oBAAoB;QACpB,IAAI,UAAU,GAAqB,IAAI,aAAK,EAAa,CAAC;QAC1D,IAAI,iBAAiB,GAAqB,IAAI,aAAK,EAAa,CAAC;QACjE,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9C,uBAAuB;YACvB,IAAI,IAAI,GAAc,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,QAAQ,CAAC,KAAK;gBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YACrK,cAAc;YACd,IAAI,UAAU,GAAW,KAAK,CAAC,WAAW,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC7G,IAAI,QAAQ,CAAC,KAAK;gBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YAC5E,IAAI,WAAW,CAAC,YAAY,CAAC,UAAU,CAAC,EAAE;gBACzC,+BAA+B;gBAC/B,IAAI,QAAQ,GAAc,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;gBAC/D,IAAI,aAAa,GAAY,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC;gBAChD,IAAI,CAAC,UAAU,GAAG,WAAW,CAAC,YAAY,EAAE,CAAC;gBAC7C,IAAI,QAAQ,CAAC,KAAK;oBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,gBAAgB,GAAG,aAAa,CAAC,CAAC;gBACrF,mEAAmE;gBACnE,IAAI,aAAa,IAAI,KAAK;oBAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClD,qBAAqB;gBACrB,IAAI,WAAW,GAAY,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,IAAI,WAAW,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC1F,IAAI,WAAW,EAAE;oBAChB,IAAI,QAAQ,CAAC,KAAK;wBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,iCAAiC,CAAC,CAAC;oBACtF,0CAA0C;oBAC1C,IAAI,UAAU,GAAU,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC;oBAC3D,IAAI,iBAAiB,GAAY,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;oBACjH,IAAI,iBAAiB,IAAI,KAAK,EAAE;wBAC/B,IAAI,QAAQ,CAAC,KAAK;4BAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,0BAA0B,CAAC,CAAC;wBAC/E,gEAAgE;wBAChE,IAAI,aAAa;4BAAE,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qBAC/C;yBACI;wBACJ,iDAAiD;wBACjD,IAAI,CAAC,kBAAkB,CAAC,WAAW,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAC;wBACpE,IAAI,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE;4BAClC,IAAI,QAAQ,CAAC,KAAK;gCAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC;4BAC5E,sBAAsB;4BACtB,IAAI,WAAW,GAAqB,IAAI,KAAK,CAAY,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;4BAC5E,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE;gCAAE,WAAW,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;4BACxF,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;yBAClH;6BACI;4BACJ,IAAI,QAAQ,CAAC,KAAK;gCAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;4BAC1E,mDAAmD;4BACnD,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;gCAAE,WAAW,CAAC,GAAG,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BACrG,gEAAgE;4BAChE,IAAI,aAAa;gCAAE,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;yBAC/C;qBACD;iBACD;qBACI;oBACJ,sBAAsB;oBACtB,IAAI,QAAQ,CAAC,KAAK;wBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;oBACjE,IAAI,aAAa;wBAAE,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;iBAC/C;aACD;iBACI;gBACJ,SAAS;gBACT,IAAI,QAAQ,CAAC,KAAK;oBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;aACrE;SACD;IACF,CAAC;IAED;;;;;;OAMG;IACI,YAAY,CAAC,WAAyB,EAAE,YAA0B,EAAE,YAA+B,EAAE,WAA6B,EAAE,aAA+B;QACzK,UAAU;QACV,IAAI,QAAQ,CAAC,KAAK;YAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,oCAAoC,CAAC,CAAC;QACzF,IAAI,QAAQ,CAAC,KAAK;YAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QACzF,+EAA+E;QAC/E,kFAAkF;QAClF,0FAA0F;QAC1F,sBAAsB;QACtB,aAAa,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,QAAQ,CAAC,KAAK;YAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,cAAc,CAAC,CAAC;QAC3G,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,4BAA4B;SACtF;YACC,cAAc;YACd,IAAI,KAAK,GAAU,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,UAAU,GAAe,KAAK,CAAC,aAAa,EAAE,CAAC;YACnD,IAAI,KAAK,GAAU,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClD,cAAc;YACd,IAAI,QAAQ,CAAC,KAAK;gBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,4BAA4B,GAAG,UAAU,CAAC,KAAK,GAAG,IAAI,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YACxM,IAAI,WAAW,GAAW,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACxF,IAAI,QAAQ,CAAC,KAAK;gBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,kBAAkB,GAAG,WAAW,CAAC,CAAC;YACrF,IAAI,WAAW,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE;gBAC1C,mBAAmB;gBACnB,IAAI,QAAQ,CAAC,KAAK;oBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;gBACjE,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;aAC9H;SACD;IACF,CAAC;;AAvUF,4BAwUC;AAvUA,8BAA8B;AACN,eAAM,GAAW,UAAU,CAAC;AAEpD,kBAAkB;AACM,cAAK,GAAY,KAAK,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module OrbitGT\r\n */\r\n\r\n//package orbitgt.pointcloud.render;\r\n\r\ntype int8 = number;\r\ntype int16 = number;\r\ntype int32 = number;\r\ntype float32 = number;\r\ntype float64 = number;\r\n\r\nimport { Bounds } from \"../../spatial/geom/Bounds\";\r\nimport { AList } from \"../../system/collection/AList\";\r\nimport { Message } from \"../../system/runtime/Message\";\r\nimport { BlockIndex } from \"../model/BlockIndex\";\r\nimport { GridIndex } from \"../model/GridIndex\";\r\nimport { PointData } from \"../model/PointData\";\r\nimport { TileIndex } from \"../model/TileIndex\";\r\nimport { AViewRequest } from \"./AViewRequest\";\r\nimport { Block } from \"./Block\";\r\nimport { DataManager } from \"./DataManager\";\r\nimport { Level } from \"./Level\";\r\n\r\n/**\r\n * Class TileSpatialIndex manages a spatial index of levels, blocks and tiles in pointcloud. The index does not store data, only block and tile indexes.\r\n *\r\n * @version 1.0 November 2015\r\n */\r\n/** @internal */\r\nexport class ViewTree {\r\n\t/** The name of this module */\r\n\tprivate static readonly MODULE: string = \"ViewTree\";\r\n\r\n\t/** Debug mode? */\r\n\tprivate static readonly DEBUG: boolean = false;\r\n\r\n\t/** The data manager */\r\n\tprivate _dataManager: DataManager;\r\n\t/** The levels */\r\n\tprivate _levels: Array<Level>;\r\n\t/** The data bounds */\r\n\tprivate _dataBounds: Bounds;\r\n\t/** The root blocks */\r\n\tprivate _rootBlocks: AList<Block>;\r\n\r\n\t/**\r\n\t * Create a new tree.\r\n\t * @param levels the levels.\r\n\t * @param dataBounds the data bounds.\r\n\t */\r\n\tpublic constructor(dataManager: DataManager, levels: Array<Level>, dataBounds: Bounds) {\r\n\t\t/* Store the parameters */\r\n\t\tthis._dataManager = dataManager;\r\n\t\tthis._levels = levels;\r\n\t\tthis._dataBounds = dataBounds;\r\n\t\t/* Find the root blocks */\r\n\t\tthis._rootBlocks = this.findRootBlocks();\r\n\t}\r\n\r\n\t/**\r\n\t * Find all root blocks (dropping of single-point tiles during pyramid creation can lead to missing branches).\r\n\t * @return all root blocks.\r\n\t */\r\n\tprivate findRootBlocks(): AList<Block> {\r\n\t\t/* Check some levels below the top */\r\n\t\tlet startLevel: int32 = (this._levels.length - 6);\r\n\t\tif (startLevel < 0) startLevel = 0;\r\n\t\tMessage.print(ViewTree.MODULE, \"Finding root blocks starting at level index \" + startLevel + \" of \" + this._levels.length);\r\n\t\t/* Check the levels */\r\n\t\tlet rootBlocks: AList<Block> = new AList<Block>();\r\n\t\tlet nextLevelIndex: GridIndex = new GridIndex(0, 0, 0);\r\n\t\tfor (let i: number = startLevel; i < this._levels.length - 1; i++) {\r\n\t\t\t/* Check all blocks in the level */\r\n\t\t\tlet level: Level = this._levels[i];\r\n\t\t\tfor (let block of level.getBlocks()) {\r\n\t\t\t\t/* Non-top level? */\r\n\t\t\t\tlet isRoot: boolean = true;\r\n\t\t\t\tif (i < this._levels.length - 2) {\r\n\t\t\t\t\t/* Do we have a parent block in the next level? */\r\n\t\t\t\t\tblock.getBlockIndex().gridIndex.getNextLevelIndex(nextLevelIndex);\r\n\t\t\t\t\tisRoot = (this._levels[i + 1].findBlockGridIndex(nextLevelIndex) == null);\r\n\t\t\t\t\tif (isRoot) Message.print(ViewTree.MODULE, \"Block L\" + i + \" \" + block.getBlockIndex().gridIndex + \" is non-top root\");\r\n\t\t\t\t}\r\n\t\t\t\t/* Add to the list? */\r\n\t\t\t\tif (isRoot) rootBlocks.add(block);\r\n\t\t\t}\r\n\t\t}\r\n\t\t/* Return the roots */\r\n\t\tMessage.print(ViewTree.MODULE, \"Found \" + rootBlocks.size() + \" root blocks\");\r\n\t\treturn rootBlocks;\r\n\t}\r\n\r\n\t/**\r\n\t * Get the number of levels.\r\n\t * @return the number of levels.\r\n\t */\r\n\tpublic getLevelCount(): int32 {\r\n\t\treturn this._levels.length;\r\n\t}\r\n\r\n\t/**\r\n\t * Get a level.\r\n\t * @param index the index of the level.\r\n\t * @return the level.\r\n\t */\r\n\tpublic getLevel(index: int32): Level {\r\n\t\treturn this._levels[index];\r\n\t}\r\n\r\n\t/**\r\n\t * Get the data bounds.\r\n\t * @return the data bounds.\r\n\t */\r\n\tpublic getDataBounds(): Bounds {\r\n\t\treturn this._dataBounds;\r\n\t}\r\n\r\n\t/**\r\n\t * Set the blocks for a level (after a data load operation).\r\n\t * @param level the level.\r\n\t * @param blockIndexes the indexes of the blocks in the level.\r\n\t */\r\n\tpublic setLevelBlocks(level: Level, blockIndexes: Array<BlockIndex>): void {\r\n\t\tif (blockIndexes == null) return;\r\n\t\tlet blockList: Array<Block> = new Array<Block>(blockIndexes.length);\r\n\t\tfor (let i: number = 0; i < blockIndexes.length; i++) blockList[i] = new Block(blockIndexes[i]);\r\n\t\tlevel.setBlockList(blockList);\r\n\t\tMessage.print(ViewTree.MODULE, \"Loaded \" + blockIndexes.length + \" blocks for level \" + level.getIndex());\r\n\t}\r\n\r\n\t/**\r\n\t * Set the tiles for a block (after a data load operation).\r\n\t * @param blockIndex the index of the block.\r\n\t * @param tileIndexes the indexes of the tiles in the block.\r\n\t */\r\n\tpublic setBlockTiles(blockIndex: BlockIndex, tileIndexes: Array<TileIndex>): void {\r\n\t\tlet level: Level = this._levels[blockIndex.level];\r\n\t\tlet block: Block = level.findBlock(blockIndex);\r\n\t\tblock.setTiles(tileIndexes);\r\n\t}\r\n\r\n\t/**\r\n\t * Split a tile into lower-level tiles.\r\n\t * @param level the level of the tile to split.\r\n\t * @param tile the tile to split.\r\n\t * @param childLevel the lower level of the tile.\r\n\t * @param children the list of children to split into.\r\n     * @param levelsToLoad the list of levels to load.\r\n     * @param blocksToLoad the list of blocks to load.\r\n\t * @return true if the list of children is complete.\r\n\t */\r\n\tprivate splitTile(level: Level, tile: TileIndex, childLevel: Level, children: AList<TileIndex>, levelsToLoad: AList<Level>, blocksToLoad: AList<BlockIndex>): boolean {\r\n\t\t/* Clear the result */\r\n\t\tchildren.clear();\r\n\t\t/* Already calculated? */\r\n\t\tlet childList: Array<TileIndex> = tile.children;\r\n\t\tif (childList != null) {\r\n\t\t\t/* Return */\r\n\t\t\tfor (let child of childList) children.add(child);\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\t/* Assume we have a complete list of children */\r\n\t\tlet complete: boolean = true;\r\n\t\t/* Unloaded level? */\r\n\t\tif (childLevel.getBlockCount() == 0) {\r\n\t\t\t/* No need to continue, we need the level block list */\r\n\t\t\tif (levelsToLoad.contains(childLevel) == false) levelsToLoad.add(childLevel);\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\t/* Check the 8 possible child tiles */\r\n\t\tlet index: GridIndex = tile.gridIndex;\r\n\t\tlet childIndex: GridIndex = new GridIndex(0, 0, 0);\r\n\t\tfor (let z: number = 0; z < 2; z++) for (let y: number = 0; y < 2; y++) for (let x: number = 0; x < 2; x++) {\r\n\t\t\t/* Get the index of the child */\r\n\t\t\tchildIndex.x = (2 * index.x + x);\r\n\t\t\tchildIndex.y = (2 * index.y + y);\r\n\t\t\tchildIndex.z = (2 * index.z + z);\r\n\t\t\t/* Find the block */\r\n\t\t\tlet block: Block = childLevel.findBlockForTile(childIndex);\r\n\t\t\tif (block == null) {\r\n\t\t\t\t/* This should not happen */\r\n\t\t\t\tMessage.printWarning(ViewTree.MODULE, \"Unable to find tile block \" + childIndex + \" in child level \" + childLevel.getIndex() + \" (\" + childLevel.getBlockCount() + \" blocks)\");\r\n\t\t\t\tcomplete = false;\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\t/* No tile info in the block? */\r\n\t\t\tif (block.hasTiles() == false) {\r\n\t\t\t\t/* Load the block data */\r\n\t\t\t\tif (blocksToLoad.contains(block.getBlockIndex()) == false) blocksToLoad.add(block.getBlockIndex());\r\n\t\t\t\tcomplete = false;\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\t/* Find the child */\r\n\t\t\t\tlet child: TileIndex = block.findTile(childIndex);\r\n\t\t\t\tif (child != null) children.add(child);\r\n\t\t\t}\r\n\t\t}\r\n\t\t/* Store the result if complete */\r\n\t\tif (complete) {\r\n\t\t\t/* Store */\r\n\t\t\tlet tileChildren: Array<TileIndex> = new Array<TileIndex>(children.size());\r\n\t\t\tfor (let i: number = 0; i < tileChildren.length; i++) tileChildren[i] = children.get(i);\r\n\t\t\ttile.children = tileChildren;\r\n\t\t}\r\n\t\t/* Do we have all children? */\r\n\t\treturn complete;\r\n\t}\r\n\r\n\t/**\r\n\t * Is all tile data available for rendering?\r\n\t * @param viewRequest the view request.\r\n\t * @param tiles a list of tiles to check.\r\n\t * @param missingTiles the list of tiles whose data is missing.\r\n\t */\r\n\tprivate checkDataAvailable(viewRequest: AViewRequest, tiles: AList<TileIndex>, missingTiles: AList<TileIndex>): void {\r\n\t\t/* Check all tiles */\r\n\t\tmissingTiles.clear();\r\n\t\tfor (let i: number = 0; i < tiles.size(); i++) {\r\n\t\t\t/* Get the next tile */\r\n\t\t\tlet tile: TileIndex = tiles.get(i);\r\n\t\t\t/* Not available? */\r\n\t\t\tif (this._dataManager.isTileLoaded(tile) == null) {\r\n\t\t\t\t/* Request to load the block */\r\n\t\t\t\tmissingTiles.add(tile);\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\t/* Touch the block */\r\n\t\t\t\ttile.accessTime = viewRequest.getFrameTime();\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Is all tile data available for rendering?\r\n\t * @param viewRequest the view request.\r\n\t * @param tiles a list of tiles to check.\r\n\t * @return true if the tile data is available.\r\n\t */\r\n\tprivate isDataAvailable(viewRequest: AViewRequest, tiles: Array<TileIndex>): boolean {\r\n\t\t/* Check all tiles */\r\n\t\tfor (let i: number = 0; i < tiles.length; i++) {\r\n\t\t\t/* Get the next tile */\r\n\t\t\tlet tile: TileIndex = tiles[i];\r\n\t\t\t/* Not available? */\r\n\t\t\tif (this._dataManager.isTileLoaded(tile) == null) return false;\r\n\t\t}\r\n\t\t/* Available */\r\n\t\treturn true;\r\n\t}\r\n\r\n\t/**\r\n\t * Add visible tiles to the view.\r\n\t * @param viewRequest the view request.\r\n\t * @param level the level of the tiles.\r\n\t * @param tiles the tiles to check.\r\n\t * @param visibleTiles the list of visible tiles to add to.\r\n\t */\r\n\tprivate addTilesToView(viewRequest: AViewRequest, level: Level, tiles: Array<TileIndex>, levelsToLoad: AList<Level>, blocksToLoad: AList<BlockIndex>, tilesToLoad: AList<TileIndex>, tilesToRender: AList<PointData>): void {\r\n\t\t/* No tiles? */\r\n\t\tif (tiles == null) return;\r\n\t\t/* Make the lists */\r\n\t\tlet childTiles: AList<TileIndex> = new AList<TileIndex>();\r\n\t\tlet missingChildTiles: AList<TileIndex> = new AList<TileIndex>();\r\n\t\t/* Check all tiles */\r\n\t\tfor (let i: number = 0; i < tiles.length; i++) {\r\n\t\t\t/* Get the next tile */\r\n\t\t\tlet tile: TileIndex = tiles[i];\r\n\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"Checking tile L\" + tile.level + \" (\" + tile.gridIndex.x + \",\" + tile.gridIndex.y + \",\" + tile.gridIndex.z + \")\");\r\n\t\t\t/* Visible? */\r\n\t\t\tlet tileBounds: Bounds = level.getTileGrid().getCellBounds(tile.gridIndex).getIntersection(this._dataBounds);\r\n\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"> level \" + tile.level);\r\n\t\t\tif (viewRequest.isVisibleBox(tileBounds)) {\r\n\t\t\t\t/* Has the tile been loaded? */\r\n\t\t\t\tlet tileData: PointData = this._dataManager.isTileLoaded(tile);\r\n\t\t\t\tlet tileAvailable: boolean = (tileData != null);\r\n\t\t\t\ttile.accessTime = viewRequest.getFrameTime();\r\n\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > available? \" + tileAvailable);\r\n\t\t\t\t/* We load all intermediate tiles to avoid holes in the coverage */\r\n\t\t\t\tif (tileAvailable == false) tilesToLoad.add(tile);\r\n\t\t\t\t/* Split the tile? */\r\n\t\t\t\tlet shouldSplit: boolean = (level.getIndex() > 0) && viewRequest.shouldSplit(level, tile);\r\n\t\t\t\tif (shouldSplit) {\r\n\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > visible, but needs splitting\");\r\n\t\t\t\t\t/* Find the children at the lower level */\r\n\t\t\t\t\tlet childLevel: Level = this._levels[level.getIndex() - 1];\r\n\t\t\t\t\tlet completeChildList: boolean = this.splitTile(level, tile, childLevel, childTiles, levelsToLoad, blocksToLoad);\r\n\t\t\t\t\tif (completeChildList == false) {\r\n\t\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > loading child indexes\");\r\n\t\t\t\t\t\t/* Display the tile while we wait for the block-tiles to load */\r\n\t\t\t\t\t\tif (tileAvailable) tilesToRender.add(tileData);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse {\r\n\t\t\t\t\t\t/* Are all children available with their data? */\r\n\t\t\t\t\t\tthis.checkDataAvailable(viewRequest, childTiles, missingChildTiles);\r\n\t\t\t\t\t\tif (missingChildTiles.size() == 0) {\r\n\t\t\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > rendering children\");\r\n\t\t\t\t\t\t\t/* Add the children */\r\n\t\t\t\t\t\t\tlet childTiles2: Array<TileIndex> = new Array<TileIndex>(childTiles.size());\r\n\t\t\t\t\t\t\tfor (let j: number = 0; j < childTiles2.length; j++) childTiles2[j] = childTiles.get(j);\r\n\t\t\t\t\t\t\tthis.addTilesToView(viewRequest, childLevel, childTiles2, levelsToLoad, blocksToLoad, tilesToLoad, tilesToRender);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > loading children\");\r\n\t\t\t\t\t\t\t/* Request for the missing children to be loaded */\r\n\t\t\t\t\t\t\tfor (let j: number = 0; j < missingChildTiles.size(); j++) tilesToLoad.add(missingChildTiles.get(j));\r\n\t\t\t\t\t\t\t/* Display the tile while we wait for the child tiles to load */\r\n\t\t\t\t\t\t\tif (tileAvailable) tilesToRender.add(tileData);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\t/* Display the tile */\r\n\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > visible\");\r\n\t\t\t\t\tif (tileAvailable) tilesToRender.add(tileData);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\t/* Log */\r\n\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > not visible\");\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Find tile indexes for a 3D view.\r\n\t * @param viewRequest the request parameters.\r\n\t * @param visibleTiles the list of visible tiles to add to.\r\n\t * @param availableTiles the set of available tiles.\r\n\t * @param visibleAvailableTiles the list if visible and available tiles to add to.\r\n\t */\r\n\tpublic renderView3D(viewRequest: AViewRequest, levelsToLoad: AList<Level>, blocksToLoad: AList<BlockIndex>, tilesToLoad: AList<TileIndex>, tilesToRender: AList<PointData>): void {\r\n\t\t/* Log? */\r\n\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"Finding pointcloud tiles to render\");\r\n\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > dataBounds: \" + this._dataBounds);\r\n\t\t//if (DEBUG) Message.print(MODULE,\" > view: \"+viewRequest.getViewProjection());\r\n\t\t//if (DEBUG) Message.print(MODULE,\" > distance: \"+viewRequest.getDistanceRange());\r\n\t\t//if (DEBUG) Message.print(MODULE,\" > model-transform: \"+viewRequest.getModelTransform());\r\n\t\t/* Check all blocks */\r\n\t\ttilesToRender.clear();\r\n\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"Checking \" + this._rootBlocks.size() + \" root blocks\");\r\n\t\tfor (let i: number = 0; i < this._rootBlocks.size(); i++) // start from the root tiles\r\n\t\t{\r\n\t\t\t/* Visible? */\r\n\t\t\tlet block: Block = this._rootBlocks.get(i);\r\n\t\t\tlet blockIndex: BlockIndex = block.getBlockIndex();\r\n\t\t\tlet level: Level = this._levels[blockIndex.level];\r\n\t\t\t/* Visible? */\r\n\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"Checking top-level block L\" + blockIndex.level + \" (\" + blockIndex.gridIndex.x + \",\" + blockIndex.gridIndex.y + \",\" + blockIndex.gridIndex.z + \")\");\r\n\t\t\tlet blockBounds: Bounds = block.getBlockBounds(level).getIntersection(this._dataBounds);\r\n\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > blockBounds: \" + blockBounds);\r\n\t\t\tif (viewRequest.isVisibleBox(blockBounds)) {\r\n\t\t\t\t/* Add the tiles */\r\n\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > visible\");\r\n\t\t\t\tthis.addTilesToView(viewRequest, level, block.getTiles(blocksToLoad), levelsToLoad, blocksToLoad, tilesToLoad, tilesToRender);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n"]}
+{"version":3,"file":"ViewTree.js","sourceRoot":"","sources":["../../../../src/pointcloud/render/ViewTree.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAWH,yDAAsD;AACtD,0DAAuD;AAEvD,kDAA+C;AAI/C,mCAAgC;AAIhC;;;;GAIG;AACH,gBAAgB;AAChB,MAAa,QAAQ;IAgBpB;;;;OAIG;IACH,YAAmB,WAAwB,EAAE,MAAoB,EAAE,UAAkB;QACpF,0BAA0B;QAC1B,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,0BAA0B;QAC1B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACK,cAAc;QACrB,qCAAqC;QACrC,IAAI,UAAU,GAAU,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClD,IAAI,UAAU,GAAG,CAAC;YAAE,UAAU,GAAG,CAAC,CAAC;QACnC,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,8CAA8C,GAAG,UAAU,GAAG,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC3H,sBAAsB;QACtB,IAAI,UAAU,GAAiB,IAAI,aAAK,EAAS,CAAC;QAClD,IAAI,cAAc,GAAc,IAAI,qBAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,KAAK,IAAI,CAAC,GAAW,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClE,mCAAmC;YACnC,IAAI,KAAK,GAAU,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,KAAK,IAAI,KAAK,IAAI,KAAK,CAAC,SAAS,EAAE,EAAE;gBACpC,oBAAoB;gBACpB,IAAI,MAAM,GAAY,IAAI,CAAC;gBAC3B,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;oBAChC,kDAAkD;oBAClD,KAAK,CAAC,aAAa,EAAE,CAAC,SAAS,CAAC,iBAAiB,CAAC,cAAc,CAAC,CAAC;oBAClE,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,kBAAkB,CAAC,cAAc,CAAC,IAAI,IAAI,CAAC,CAAC;oBAC1E,IAAI,MAAM;wBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC,SAAS,GAAG,kBAAkB,CAAC,CAAC;iBACvH;gBACD,sBAAsB;gBACtB,IAAI,MAAM;oBAAE,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;aAClC;SACD;QACD,sBAAsB;QACtB,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,GAAG,UAAU,CAAC,IAAI,EAAE,GAAG,cAAc,CAAC,CAAC;QAC9E,OAAO,UAAU,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,aAAa;QACnB,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,KAAY;QAC3B,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACI,aAAa;QACnB,OAAO,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACI,cAAc,CAAC,KAAY,EAAE,YAA+B;QAClE,IAAI,YAAY,IAAI,IAAI;YAAE,OAAO;QACjC,IAAI,SAAS,GAAiB,IAAI,KAAK,CAAQ,YAAY,CAAC,MAAM,CAAC,CAAC;QACpE,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,aAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAC9B,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,GAAG,YAAY,CAAC,MAAM,GAAG,oBAAoB,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3G,CAAC;IAED;;;;OAIG;IACI,aAAa,CAAC,UAAsB,EAAE,WAA6B;QACzE,IAAI,KAAK,GAAU,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAClD,IAAI,KAAK,GAAU,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAC/C,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;IAC7B,CAAC;IAED;;;;;;;;;OASG;IACK,SAAS,CAAC,KAAY,EAAE,IAAe,EAAE,UAAiB,EAAE,QAA0B,EAAE,YAA0B,EAAE,YAA+B;QAC1J,sBAAsB;QACtB,QAAQ,CAAC,KAAK,EAAE,CAAC;QACjB,yBAAyB;QACzB,IAAI,SAAS,GAAqB,IAAI,CAAC,QAAQ,CAAC;QAChD,IAAI,SAAS,IAAI,IAAI,EAAE;YACtB,YAAY;YACZ,KAAK,IAAI,KAAK,IAAI,SAAS;gBAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,IAAI,CAAC;SACZ;QACD,gDAAgD;QAChD,IAAI,QAAQ,GAAY,IAAI,CAAC;QAC7B,qBAAqB;QACrB,IAAI,UAAU,CAAC,aAAa,EAAE,IAAI,CAAC,EAAE;YACpC,uDAAuD;YACvD,IAAI,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,KAAK;gBAAE,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC7E,OAAO,KAAK,CAAC;SACb;QACD,sCAAsC;QACtC,IAAI,KAAK,GAAc,IAAI,CAAC,SAAS,CAAC;QACtC,IAAI,UAAU,GAAc,IAAI,qBAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC3G,gCAAgC;oBAChC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjC,oBAAoB;oBACpB,IAAI,KAAK,GAAU,UAAU,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC;oBAC3D,IAAI,KAAK,IAAI,IAAI,EAAE;wBAClB,4BAA4B;wBAC5B,iBAAO,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,EAAE,4BAA4B,GAAG,UAAU,GAAG,kBAAkB,GAAG,UAAU,CAAC,QAAQ,EAAE,GAAG,IAAI,GAAG,UAAU,CAAC,aAAa,EAAE,GAAG,UAAU,CAAC,CAAC;wBAC/K,QAAQ,GAAG,KAAK,CAAC;wBACjB,SAAS;qBACT;oBACD,gCAAgC;oBAChC,IAAI,KAAK,CAAC,QAAQ,EAAE,IAAI,KAAK,EAAE;wBAC9B,yBAAyB;wBACzB,IAAI,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,IAAI,KAAK;4BAAE,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC;wBACnG,QAAQ,GAAG,KAAK,CAAC;qBACjB;yBACI;wBACJ,oBAAoB;wBACpB,IAAI,KAAK,GAAc,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;wBAClD,IAAI,KAAK,IAAI,IAAI;4BAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;qBACvC;iBACD;QACD,kCAAkC;QAClC,IAAI,QAAQ,EAAE;YACb,WAAW;YACX,IAAI,YAAY,GAAqB,IAAI,KAAK,CAAY,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3E,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,YAAY,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxF,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC;SAC7B;QACD,8BAA8B;QAC9B,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACK,kBAAkB,CAAC,WAAyB,EAAE,KAAuB,EAAE,YAA8B;QAC5G,qBAAqB;QACrB,YAAY,CAAC,KAAK,EAAE,CAAC;QACrB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;YAC9C,uBAAuB;YACvB,IAAI,IAAI,GAAc,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnC,oBAAoB;YACpB,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE;gBACjD,+BAA+B;gBAC/B,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;aACvB;iBACI;gBACJ,qBAAqB;gBACrB,IAAI,CAAC,UAAU,GAAG,WAAW,CAAC,YAAY,EAAE,CAAC;aAC7C;SACD;IACF,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,WAAyB,EAAE,KAAuB;QACzE,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9C,uBAAuB;YACvB,IAAI,IAAI,GAAc,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,oBAAoB;YACpB,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,IAAI;gBAAE,OAAO,KAAK,CAAC;SAC/D;QACD,eAAe;QACf,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACK,cAAc,CAAC,WAAyB,EAAE,KAAY,EAAE,KAAuB,EAAE,YAA0B,EAAE,YAA+B,EAAE,WAA6B,EAAE,aAA+B;QACnN,eAAe;QACf,IAAI,KAAK,IAAI,IAAI;YAAE,OAAO;QAC1B,oBAAoB;QACpB,IAAI,UAAU,GAAqB,IAAI,aAAK,EAAa,CAAC;QAC1D,IAAI,iBAAiB,GAAqB,IAAI,aAAK,EAAa,CAAC;QACjE,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9C,uBAAuB;YACvB,IAAI,IAAI,GAAc,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,QAAQ,CAAC,KAAK;gBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YACrK,cAAc;YACd,IAAI,UAAU,GAAW,KAAK,CAAC,WAAW,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC7G,IAAI,QAAQ,CAAC,KAAK;gBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YAC5E,IAAI,WAAW,CAAC,YAAY,CAAC,UAAU,CAAC,EAAE;gBACzC,+BAA+B;gBAC/B,IAAI,QAAQ,GAAc,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;gBAC/D,IAAI,aAAa,GAAY,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC;gBAChD,IAAI,CAAC,UAAU,GAAG,WAAW,CAAC,YAAY,EAAE,CAAC;gBAC7C,IAAI,QAAQ,CAAC,KAAK;oBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,gBAAgB,GAAG,aAAa,CAAC,CAAC;gBACrF,mEAAmE;gBACnE,IAAI,aAAa,IAAI,KAAK;oBAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClD,qBAAqB;gBACrB,IAAI,WAAW,GAAY,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,IAAI,WAAW,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC1F,IAAI,WAAW,EAAE;oBAChB,IAAI,QAAQ,CAAC,KAAK;wBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,iCAAiC,CAAC,CAAC;oBACtF,0CAA0C;oBAC1C,IAAI,UAAU,GAAU,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC;oBAC3D,IAAI,iBAAiB,GAAY,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;oBACjH,IAAI,iBAAiB,IAAI,KAAK,EAAE;wBAC/B,IAAI,QAAQ,CAAC,KAAK;4BAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,0BAA0B,CAAC,CAAC;wBAC/E,gEAAgE;wBAChE,IAAI,aAAa;4BAAE,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qBAC/C;yBACI;wBACJ,iDAAiD;wBACjD,IAAI,CAAC,kBAAkB,CAAC,WAAW,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAC;wBACpE,IAAI,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE;4BAClC,IAAI,QAAQ,CAAC,KAAK;gCAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC;4BAC5E,sBAAsB;4BACtB,IAAI,WAAW,GAAqB,IAAI,KAAK,CAAY,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;4BAC5E,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE;gCAAE,WAAW,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;4BACxF,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;yBAClH;6BACI;4BACJ,IAAI,QAAQ,CAAC,KAAK;gCAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;4BAC1E,mDAAmD;4BACnD,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;gCAAE,WAAW,CAAC,GAAG,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BACrG,gEAAgE;4BAChE,IAAI,aAAa;gCAAE,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;yBAC/C;qBACD;iBACD;qBACI;oBACJ,sBAAsB;oBACtB,IAAI,QAAQ,CAAC,KAAK;wBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;oBACjE,IAAI,aAAa;wBAAE,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;iBAC/C;aACD;iBACI;gBACJ,SAAS;gBACT,IAAI,QAAQ,CAAC,KAAK;oBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;aACrE;SACD;IACF,CAAC;IAED;;;;;;OAMG;IACI,YAAY,CAAC,WAAyB,EAAE,YAA0B,EAAE,YAA+B,EAAE,WAA6B,EAAE,aAA+B;QACzK,UAAU;QACV,IAAI,QAAQ,CAAC,KAAK;YAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,oCAAoC,CAAC,CAAC;QACzF,IAAI,QAAQ,CAAC,KAAK;YAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QACzF,+EAA+E;QAC/E,kFAAkF;QAClF,0FAA0F;QAC1F,sBAAsB;QACtB,aAAa,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,QAAQ,CAAC,KAAK;YAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,cAAc,CAAC,CAAC;QAC3G,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,4BAA4B;SACtF;YACC,cAAc;YACd,IAAI,KAAK,GAAU,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,UAAU,GAAe,KAAK,CAAC,aAAa,EAAE,CAAC;YACnD,IAAI,KAAK,GAAU,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClD,cAAc;YACd,IAAI,QAAQ,CAAC,KAAK;gBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,4BAA4B,GAAG,UAAU,CAAC,KAAK,GAAG,IAAI,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YACxM,IAAI,WAAW,GAAW,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACxF,IAAI,QAAQ,CAAC,KAAK;gBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,kBAAkB,GAAG,WAAW,CAAC,CAAC;YACrF,IAAI,WAAW,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE;gBAC1C,mBAAmB;gBACnB,IAAI,QAAQ,CAAC,KAAK;oBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;gBACjE,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;aAC9H;SACD;IACF,CAAC;;AAtUD,8BAA8B;AACN,eAAM,GAAW,UAAU,CAAC;AAEpD,kBAAkB;AACM,cAAK,GAAY,KAAK,CAAC;AALnC,4BAAQ","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module OrbitGT\n */\n\n//package orbitgt.pointcloud.render;\n\ntype int8 = number;\ntype int16 = number;\ntype int32 = number;\ntype float32 = number;\ntype float64 = number;\n\nimport { Bounds } from \"../../spatial/geom/Bounds\";\nimport { AList } from \"../../system/collection/AList\";\nimport { Message } from \"../../system/runtime/Message\";\nimport { BlockIndex } from \"../model/BlockIndex\";\nimport { GridIndex } from \"../model/GridIndex\";\nimport { PointData } from \"../model/PointData\";\nimport { TileIndex } from \"../model/TileIndex\";\nimport { AViewRequest } from \"./AViewRequest\";\nimport { Block } from \"./Block\";\nimport { DataManager } from \"./DataManager\";\nimport { Level } from \"./Level\";\n\n/**\n * Class TileSpatialIndex manages a spatial index of levels, blocks and tiles in pointcloud. The index does not store data, only block and tile indexes.\n *\n * @version 1.0 November 2015\n */\n/** @internal */\nexport class ViewTree {\n\t/** The name of this module */\n\tprivate static readonly MODULE: string = \"ViewTree\";\n\n\t/** Debug mode? */\n\tprivate static readonly DEBUG: boolean = false;\n\n\t/** The data manager */\n\tprivate _dataManager: DataManager;\n\t/** The levels */\n\tprivate _levels: Array<Level>;\n\t/** The data bounds */\n\tprivate _dataBounds: Bounds;\n\t/** The root blocks */\n\tprivate _rootBlocks: AList<Block>;\n\n\t/**\n\t * Create a new tree.\n\t * @param levels the levels.\n\t * @param dataBounds the data bounds.\n\t */\n\tpublic constructor(dataManager: DataManager, levels: Array<Level>, dataBounds: Bounds) {\n\t\t/* Store the parameters */\n\t\tthis._dataManager = dataManager;\n\t\tthis._levels = levels;\n\t\tthis._dataBounds = dataBounds;\n\t\t/* Find the root blocks */\n\t\tthis._rootBlocks = this.findRootBlocks();\n\t}\n\n\t/**\n\t * Find all root blocks (dropping of single-point tiles during pyramid creation can lead to missing branches).\n\t * @return all root blocks.\n\t */\n\tprivate findRootBlocks(): AList<Block> {\n\t\t/* Check some levels below the top */\n\t\tlet startLevel: int32 = (this._levels.length - 6);\n\t\tif (startLevel < 0) startLevel = 0;\n\t\tMessage.print(ViewTree.MODULE, \"Finding root blocks starting at level index \" + startLevel + \" of \" + this._levels.length);\n\t\t/* Check the levels */\n\t\tlet rootBlocks: AList<Block> = new AList<Block>();\n\t\tlet nextLevelIndex: GridIndex = new GridIndex(0, 0, 0);\n\t\tfor (let i: number = startLevel; i < this._levels.length - 1; i++) {\n\t\t\t/* Check all blocks in the level */\n\t\t\tlet level: Level = this._levels[i];\n\t\t\tfor (let block of level.getBlocks()) {\n\t\t\t\t/* Non-top level? */\n\t\t\t\tlet isRoot: boolean = true;\n\t\t\t\tif (i < this._levels.length - 2) {\n\t\t\t\t\t/* Do we have a parent block in the next level? */\n\t\t\t\t\tblock.getBlockIndex().gridIndex.getNextLevelIndex(nextLevelIndex);\n\t\t\t\t\tisRoot = (this._levels[i + 1].findBlockGridIndex(nextLevelIndex) == null);\n\t\t\t\t\tif (isRoot) Message.print(ViewTree.MODULE, \"Block L\" + i + \" \" + block.getBlockIndex().gridIndex + \" is non-top root\");\n\t\t\t\t}\n\t\t\t\t/* Add to the list? */\n\t\t\t\tif (isRoot) rootBlocks.add(block);\n\t\t\t}\n\t\t}\n\t\t/* Return the roots */\n\t\tMessage.print(ViewTree.MODULE, \"Found \" + rootBlocks.size() + \" root blocks\");\n\t\treturn rootBlocks;\n\t}\n\n\t/**\n\t * Get the number of levels.\n\t * @return the number of levels.\n\t */\n\tpublic getLevelCount(): int32 {\n\t\treturn this._levels.length;\n\t}\n\n\t/**\n\t * Get a level.\n\t * @param index the index of the level.\n\t * @return the level.\n\t */\n\tpublic getLevel(index: int32): Level {\n\t\treturn this._levels[index];\n\t}\n\n\t/**\n\t * Get the data bounds.\n\t * @return the data bounds.\n\t */\n\tpublic getDataBounds(): Bounds {\n\t\treturn this._dataBounds;\n\t}\n\n\t/**\n\t * Set the blocks for a level (after a data load operation).\n\t * @param level the level.\n\t * @param blockIndexes the indexes of the blocks in the level.\n\t */\n\tpublic setLevelBlocks(level: Level, blockIndexes: Array<BlockIndex>): void {\n\t\tif (blockIndexes == null) return;\n\t\tlet blockList: Array<Block> = new Array<Block>(blockIndexes.length);\n\t\tfor (let i: number = 0; i < blockIndexes.length; i++) blockList[i] = new Block(blockIndexes[i]);\n\t\tlevel.setBlockList(blockList);\n\t\tMessage.print(ViewTree.MODULE, \"Loaded \" + blockIndexes.length + \" blocks for level \" + level.getIndex());\n\t}\n\n\t/**\n\t * Set the tiles for a block (after a data load operation).\n\t * @param blockIndex the index of the block.\n\t * @param tileIndexes the indexes of the tiles in the block.\n\t */\n\tpublic setBlockTiles(blockIndex: BlockIndex, tileIndexes: Array<TileIndex>): void {\n\t\tlet level: Level = this._levels[blockIndex.level];\n\t\tlet block: Block = level.findBlock(blockIndex);\n\t\tblock.setTiles(tileIndexes);\n\t}\n\n\t/**\n\t * Split a tile into lower-level tiles.\n\t * @param level the level of the tile to split.\n\t * @param tile the tile to split.\n\t * @param childLevel the lower level of the tile.\n\t * @param children the list of children to split into.\n     * @param levelsToLoad the list of levels to load.\n     * @param blocksToLoad the list of blocks to load.\n\t * @return true if the list of children is complete.\n\t */\n\tprivate splitTile(level: Level, tile: TileIndex, childLevel: Level, children: AList<TileIndex>, levelsToLoad: AList<Level>, blocksToLoad: AList<BlockIndex>): boolean {\n\t\t/* Clear the result */\n\t\tchildren.clear();\n\t\t/* Already calculated? */\n\t\tlet childList: Array<TileIndex> = tile.children;\n\t\tif (childList != null) {\n\t\t\t/* Return */\n\t\t\tfor (let child of childList) children.add(child);\n\t\t\treturn true;\n\t\t}\n\t\t/* Assume we have a complete list of children */\n\t\tlet complete: boolean = true;\n\t\t/* Unloaded level? */\n\t\tif (childLevel.getBlockCount() == 0) {\n\t\t\t/* No need to continue, we need the level block list */\n\t\t\tif (levelsToLoad.contains(childLevel) == false) levelsToLoad.add(childLevel);\n\t\t\treturn false;\n\t\t}\n\t\t/* Check the 8 possible child tiles */\n\t\tlet index: GridIndex = tile.gridIndex;\n\t\tlet childIndex: GridIndex = new GridIndex(0, 0, 0);\n\t\tfor (let z: number = 0; z < 2; z++) for (let y: number = 0; y < 2; y++) for (let x: number = 0; x < 2; x++) {\n\t\t\t/* Get the index of the child */\n\t\t\tchildIndex.x = (2 * index.x + x);\n\t\t\tchildIndex.y = (2 * index.y + y);\n\t\t\tchildIndex.z = (2 * index.z + z);\n\t\t\t/* Find the block */\n\t\t\tlet block: Block = childLevel.findBlockForTile(childIndex);\n\t\t\tif (block == null) {\n\t\t\t\t/* This should not happen */\n\t\t\t\tMessage.printWarning(ViewTree.MODULE, \"Unable to find tile block \" + childIndex + \" in child level \" + childLevel.getIndex() + \" (\" + childLevel.getBlockCount() + \" blocks)\");\n\t\t\t\tcomplete = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t/* No tile info in the block? */\n\t\t\tif (block.hasTiles() == false) {\n\t\t\t\t/* Load the block data */\n\t\t\t\tif (blocksToLoad.contains(block.getBlockIndex()) == false) blocksToLoad.add(block.getBlockIndex());\n\t\t\t\tcomplete = false;\n\t\t\t}\n\t\t\telse {\n\t\t\t\t/* Find the child */\n\t\t\t\tlet child: TileIndex = block.findTile(childIndex);\n\t\t\t\tif (child != null) children.add(child);\n\t\t\t}\n\t\t}\n\t\t/* Store the result if complete */\n\t\tif (complete) {\n\t\t\t/* Store */\n\t\t\tlet tileChildren: Array<TileIndex> = new Array<TileIndex>(children.size());\n\t\t\tfor (let i: number = 0; i < tileChildren.length; i++) tileChildren[i] = children.get(i);\n\t\t\ttile.children = tileChildren;\n\t\t}\n\t\t/* Do we have all children? */\n\t\treturn complete;\n\t}\n\n\t/**\n\t * Is all tile data available for rendering?\n\t * @param viewRequest the view request.\n\t * @param tiles a list of tiles to check.\n\t * @param missingTiles the list of tiles whose data is missing.\n\t */\n\tprivate checkDataAvailable(viewRequest: AViewRequest, tiles: AList<TileIndex>, missingTiles: AList<TileIndex>): void {\n\t\t/* Check all tiles */\n\t\tmissingTiles.clear();\n\t\tfor (let i: number = 0; i < tiles.size(); i++) {\n\t\t\t/* Get the next tile */\n\t\t\tlet tile: TileIndex = tiles.get(i);\n\t\t\t/* Not available? */\n\t\t\tif (this._dataManager.isTileLoaded(tile) == null) {\n\t\t\t\t/* Request to load the block */\n\t\t\t\tmissingTiles.add(tile);\n\t\t\t}\n\t\t\telse {\n\t\t\t\t/* Touch the block */\n\t\t\t\ttile.accessTime = viewRequest.getFrameTime();\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Is all tile data available for rendering?\n\t * @param viewRequest the view request.\n\t * @param tiles a list of tiles to check.\n\t * @return true if the tile data is available.\n\t */\n\tprivate isDataAvailable(viewRequest: AViewRequest, tiles: Array<TileIndex>): boolean {\n\t\t/* Check all tiles */\n\t\tfor (let i: number = 0; i < tiles.length; i++) {\n\t\t\t/* Get the next tile */\n\t\t\tlet tile: TileIndex = tiles[i];\n\t\t\t/* Not available? */\n\t\t\tif (this._dataManager.isTileLoaded(tile) == null) return false;\n\t\t}\n\t\t/* Available */\n\t\treturn true;\n\t}\n\n\t/**\n\t * Add visible tiles to the view.\n\t * @param viewRequest the view request.\n\t * @param level the level of the tiles.\n\t * @param tiles the tiles to check.\n\t * @param visibleTiles the list of visible tiles to add to.\n\t */\n\tprivate addTilesToView(viewRequest: AViewRequest, level: Level, tiles: Array<TileIndex>, levelsToLoad: AList<Level>, blocksToLoad: AList<BlockIndex>, tilesToLoad: AList<TileIndex>, tilesToRender: AList<PointData>): void {\n\t\t/* No tiles? */\n\t\tif (tiles == null) return;\n\t\t/* Make the lists */\n\t\tlet childTiles: AList<TileIndex> = new AList<TileIndex>();\n\t\tlet missingChildTiles: AList<TileIndex> = new AList<TileIndex>();\n\t\t/* Check all tiles */\n\t\tfor (let i: number = 0; i < tiles.length; i++) {\n\t\t\t/* Get the next tile */\n\t\t\tlet tile: TileIndex = tiles[i];\n\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"Checking tile L\" + tile.level + \" (\" + tile.gridIndex.x + \",\" + tile.gridIndex.y + \",\" + tile.gridIndex.z + \")\");\n\t\t\t/* Visible? */\n\t\t\tlet tileBounds: Bounds = level.getTileGrid().getCellBounds(tile.gridIndex).getIntersection(this._dataBounds);\n\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"> level \" + tile.level);\n\t\t\tif (viewRequest.isVisibleBox(tileBounds)) {\n\t\t\t\t/* Has the tile been loaded? */\n\t\t\t\tlet tileData: PointData = this._dataManager.isTileLoaded(tile);\n\t\t\t\tlet tileAvailable: boolean = (tileData != null);\n\t\t\t\ttile.accessTime = viewRequest.getFrameTime();\n\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > available? \" + tileAvailable);\n\t\t\t\t/* We load all intermediate tiles to avoid holes in the coverage */\n\t\t\t\tif (tileAvailable == false) tilesToLoad.add(tile);\n\t\t\t\t/* Split the tile? */\n\t\t\t\tlet shouldSplit: boolean = (level.getIndex() > 0) && viewRequest.shouldSplit(level, tile);\n\t\t\t\tif (shouldSplit) {\n\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > visible, but needs splitting\");\n\t\t\t\t\t/* Find the children at the lower level */\n\t\t\t\t\tlet childLevel: Level = this._levels[level.getIndex() - 1];\n\t\t\t\t\tlet completeChildList: boolean = this.splitTile(level, tile, childLevel, childTiles, levelsToLoad, blocksToLoad);\n\t\t\t\t\tif (completeChildList == false) {\n\t\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > loading child indexes\");\n\t\t\t\t\t\t/* Display the tile while we wait for the block-tiles to load */\n\t\t\t\t\t\tif (tileAvailable) tilesToRender.add(tileData);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\t/* Are all children available with their data? */\n\t\t\t\t\t\tthis.checkDataAvailable(viewRequest, childTiles, missingChildTiles);\n\t\t\t\t\t\tif (missingChildTiles.size() == 0) {\n\t\t\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > rendering children\");\n\t\t\t\t\t\t\t/* Add the children */\n\t\t\t\t\t\t\tlet childTiles2: Array<TileIndex> = new Array<TileIndex>(childTiles.size());\n\t\t\t\t\t\t\tfor (let j: number = 0; j < childTiles2.length; j++) childTiles2[j] = childTiles.get(j);\n\t\t\t\t\t\t\tthis.addTilesToView(viewRequest, childLevel, childTiles2, levelsToLoad, blocksToLoad, tilesToLoad, tilesToRender);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > loading children\");\n\t\t\t\t\t\t\t/* Request for the missing children to be loaded */\n\t\t\t\t\t\t\tfor (let j: number = 0; j < missingChildTiles.size(); j++) tilesToLoad.add(missingChildTiles.get(j));\n\t\t\t\t\t\t\t/* Display the tile while we wait for the child tiles to load */\n\t\t\t\t\t\t\tif (tileAvailable) tilesToRender.add(tileData);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\t/* Display the tile */\n\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > visible\");\n\t\t\t\t\tif (tileAvailable) tilesToRender.add(tileData);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\t/* Log */\n\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > not visible\");\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Find tile indexes for a 3D view.\n\t * @param viewRequest the request parameters.\n\t * @param visibleTiles the list of visible tiles to add to.\n\t * @param availableTiles the set of available tiles.\n\t * @param visibleAvailableTiles the list if visible and available tiles to add to.\n\t */\n\tpublic renderView3D(viewRequest: AViewRequest, levelsToLoad: AList<Level>, blocksToLoad: AList<BlockIndex>, tilesToLoad: AList<TileIndex>, tilesToRender: AList<PointData>): void {\n\t\t/* Log? */\n\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"Finding pointcloud tiles to render\");\n\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > dataBounds: \" + this._dataBounds);\n\t\t//if (DEBUG) Message.print(MODULE,\" > view: \"+viewRequest.getViewProjection());\n\t\t//if (DEBUG) Message.print(MODULE,\" > distance: \"+viewRequest.getDistanceRange());\n\t\t//if (DEBUG) Message.print(MODULE,\" > model-transform: \"+viewRequest.getModelTransform());\n\t\t/* Check all blocks */\n\t\ttilesToRender.clear();\n\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"Checking \" + this._rootBlocks.size() + \" root blocks\");\n\t\tfor (let i: number = 0; i < this._rootBlocks.size(); i++) // start from the root tiles\n\t\t{\n\t\t\t/* Visible? */\n\t\t\tlet block: Block = this._rootBlocks.get(i);\n\t\t\tlet blockIndex: BlockIndex = block.getBlockIndex();\n\t\t\tlet level: Level = this._levels[blockIndex.level];\n\t\t\t/* Visible? */\n\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"Checking top-level block L\" + blockIndex.level + \" (\" + blockIndex.gridIndex.x + \",\" + blockIndex.gridIndex.y + \",\" + blockIndex.gridIndex.z + \")\");\n\t\t\tlet blockBounds: Bounds = block.getBlockBounds(level).getIntersection(this._dataBounds);\n\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > blockBounds: \" + blockBounds);\n\t\t\tif (viewRequest.isVisibleBox(blockBounds)) {\n\t\t\t\t/* Add the tiles */\n\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > visible\");\n\t\t\t\tthis.addTilesToView(viewRequest, level, block.getTiles(blocksToLoad), levelsToLoad, blocksToLoad, tilesToLoad, tilesToRender);\n\t\t\t}\n\t\t}\n\t}\n}\n"]}

package/lib/cjs/spatial/crs/CRSEngine.d.ts

@@ -1,56 +1,56 @@
-/** @packageDocumentation
- * @module OrbitGT
- */
-import { Bounds } from "../geom/Bounds";
-import { Coordinate } from "../geom/Coordinate";
-/**
- * Abstract class CRSEngine provides a model for CRS transformation engines to implement.
- */
-/** @internal */
-export declare class CRSEngine {
-    /**
-     * Create a new engine.
-     */
-    constructor();
-    /**
-     * Prepare a CRS for making transforms in a certain area.
-     * @param crs the CRS to prepare.
-     * @param area the area to prepare for (can be invalid to prepare only for the crs).
-     */
-    prepareForArea(crs: string, area: Bounds): Promise<Bounds>;
-    /**
-     * Transform a coordinate from one CRS to another.
-     * @param point the point coordinate.
-     * @param sourceCRS the source CRS.
-     * @param targetCRS the target CRS.
-     * @return the transformed coordinate.
-     */
-    transformPoint(point: Coordinate, sourceCRS: string, targetCRS: string): Coordinate;
-    /**
-     * Check if a CRS is geocentric.
-     * @param crs the CRS to check.
-     * @return true if geocentric.
-     */
-    isGeocentricCRS(crs: string): boolean;
-    /**
-     * Check if a CRS is geographic.
-     * @param crs the CRS to check.
-     * @return true if geocentric.
-     */
-    isGeographicCRS(crs: string): boolean;
-    /**
-     * Check if a CRS is projected.
-     * @param crs the CRS to check.
-     * @return true if geocentric.
-     */
-    isProjectedCRS(crs: string): boolean;
-    /**
-     * Transform spatial bounds from one CRS to another.
-     * @param point the point coordinate.
-     * @param sourceCRS the source CRS.
-     * @param targetCRS the target CRS.
-     * @return the transformed bounds.
-     */
-    transformBounds(bounds: Bounds, sourceCRS: string, targetCRS: string): Bounds;
-}
+/** @packageDocumentation
+ * @module OrbitGT
+ */
+import { Bounds } from "../geom/Bounds";
+import { Coordinate } from "../geom/Coordinate";
+/**
+ * Abstract class CRSEngine provides a model for CRS transformation engines to implement.
+ */
+/** @internal */
+export declare class CRSEngine {
+    /**
+     * Create a new engine.
+     */
+    constructor();
+    /**
+     * Prepare a CRS for making transforms in a certain area.
+     * @param crs the CRS to prepare.
+     * @param area the area to prepare for (can be invalid to prepare only for the crs).
+     */
+    prepareForArea(crs: string, area: Bounds): Promise<Bounds>;
+    /**
+     * Transform a coordinate from one CRS to another.
+     * @param point the point coordinate.
+     * @param sourceCRS the source CRS.
+     * @param targetCRS the target CRS.
+     * @return the transformed coordinate.
+     */
+    transformPoint(point: Coordinate, sourceCRS: string, targetCRS: string): Coordinate;
+    /**
+     * Check if a CRS is geocentric.
+     * @param crs the CRS to check.
+     * @return true if geocentric.
+     */
+    isGeocentricCRS(crs: string): boolean;
+    /**
+     * Check if a CRS is geographic.
+     * @param crs the CRS to check.
+     * @return true if geocentric.
+     */
+    isGeographicCRS(crs: string): boolean;
+    /**
+     * Check if a CRS is projected.
+     * @param crs the CRS to check.
+     * @return true if geocentric.
+     */
+    isProjectedCRS(crs: string): boolean;
+    /**
+     * Transform spatial bounds from one CRS to another.
+     * @param point the point coordinate.
+     * @param sourceCRS the source CRS.
+     * @param targetCRS the target CRS.
+     * @return the transformed bounds.
+     */
+    transformBounds(bounds: Bounds, sourceCRS: string, targetCRS: string): Bounds;
+}
 //# sourceMappingURL=CRSEngine.d.ts.map

package/lib/cjs/spatial/crs/CRSEngine.js

@@ -1,94 +1,94 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-/** @packageDocumentation
- * @module OrbitGT
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.CRSEngine = void 0;
-const Bounds_1 = require("../geom/Bounds");
-const Coordinate_1 = require("../geom/Coordinate");
-/**
- * Abstract class CRSEngine provides a model for CRS transformation engines to implement.
- */
-/** @internal */
-class CRSEngine {
-    /**
-     * Create a new engine.
-     */
-    constructor() {
-    }
-    /**
-     * Prepare a CRS for making transforms in a certain area.
-     * @param crs the CRS to prepare.
-     * @param area the area to prepare for (can be invalid to prepare only for the crs).
-     */
-    async prepareForArea(crs, area) {
-        // subclasses should override this method if they need to download some part of a grid correction file, or the CRS declaration
-        return area;
-    }
-    /**
-     * Transform a coordinate from one CRS to another.
-     * @param point the point coordinate.
-     * @param sourceCRS the source CRS.
-     * @param targetCRS the target CRS.
-     * @return the transformed coordinate.
-     */
-    transformPoint(point, sourceCRS, targetCRS) {
-        // subclasses should override this method
-        return point;
-    }
-    /**
-     * Check if a CRS is geocentric.
-     * @param crs the CRS to check.
-     * @return true if geocentric.
-     */
-    isGeocentricCRS(crs) {
-        // subclasses should override this method
-        return false;
-    }
-    /**
-     * Check if a CRS is geographic.
-     * @param crs the CRS to check.
-     * @return true if geocentric.
-     */
-    isGeographicCRS(crs) {
-        // subclasses should override this method
-        return false;
-    }
-    /**
-     * Check if a CRS is projected.
-     * @param crs the CRS to check.
-     * @return true if geocentric.
-     */
-    isProjectedCRS(crs) {
-        // subclasses should override this method
-        return false;
-    }
-    /**
-     * Transform spatial bounds from one CRS to another.
-     * @param point the point coordinate.
-     * @param sourceCRS the source CRS.
-     * @param targetCRS the target CRS.
-     * @return the transformed bounds.
-     */
-    transformBounds(bounds, sourceCRS, targetCRS) {
-        // no real need to override this method in subclasses
-        /* Create new bounds */
-        let targetBounds = new Bounds_1.Bounds();
-        if (bounds.isValid()) {
-            /* Transform all 8 corners */
-            let corner = Coordinate_1.Coordinate.create();
-            for (let i = 0; i < 8; i++) {
-                bounds.getCorner(i, corner);
-                targetBounds.add(this.transformPoint(corner, sourceCRS, targetCRS));
-            }
-        }
-        /* Return the target bounds */
-        return targetBounds;
-    }
-}
-exports.CRSEngine = CRSEngine;
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module OrbitGT
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CRSEngine = void 0;
+const Bounds_1 = require("../geom/Bounds");
+const Coordinate_1 = require("../geom/Coordinate");
+/**
+ * Abstract class CRSEngine provides a model for CRS transformation engines to implement.
+ */
+/** @internal */
+class CRSEngine {
+    /**
+     * Create a new engine.
+     */
+    constructor() {
+    }
+    /**
+     * Prepare a CRS for making transforms in a certain area.
+     * @param crs the CRS to prepare.
+     * @param area the area to prepare for (can be invalid to prepare only for the crs).
+     */
+    async prepareForArea(crs, area) {
+        // subclasses should override this method if they need to download some part of a grid correction file, or the CRS declaration
+        return area;
+    }
+    /**
+     * Transform a coordinate from one CRS to another.
+     * @param point the point coordinate.
+     * @param sourceCRS the source CRS.
+     * @param targetCRS the target CRS.
+     * @return the transformed coordinate.
+     */
+    transformPoint(point, sourceCRS, targetCRS) {
+        // subclasses should override this method
+        return point;
+    }
+    /**
+     * Check if a CRS is geocentric.
+     * @param crs the CRS to check.
+     * @return true if geocentric.
+     */
+    isGeocentricCRS(crs) {
+        // subclasses should override this method
+        return false;
+    }
+    /**
+     * Check if a CRS is geographic.
+     * @param crs the CRS to check.
+     * @return true if geocentric.
+     */
+    isGeographicCRS(crs) {
+        // subclasses should override this method
+        return false;
+    }
+    /**
+     * Check if a CRS is projected.
+     * @param crs the CRS to check.
+     * @return true if geocentric.
+     */
+    isProjectedCRS(crs) {
+        // subclasses should override this method
+        return false;
+    }
+    /**
+     * Transform spatial bounds from one CRS to another.
+     * @param point the point coordinate.
+     * @param sourceCRS the source CRS.
+     * @param targetCRS the target CRS.
+     * @return the transformed bounds.
+     */
+    transformBounds(bounds, sourceCRS, targetCRS) {
+        // no real need to override this method in subclasses
+        /* Create new bounds */
+        let targetBounds = new Bounds_1.Bounds();
+        if (bounds.isValid()) {
+            /* Transform all 8 corners */
+            let corner = Coordinate_1.Coordinate.create();
+            for (let i = 0; i < 8; i++) {
+                bounds.getCorner(i, corner);
+                targetBounds.add(this.transformPoint(corner, sourceCRS, targetCRS));
+            }
+        }
+        /* Return the target bounds */
+        return targetBounds;
+    }
+}
+exports.CRSEngine = CRSEngine;
 //# sourceMappingURL=CRSEngine.js.map

package/lib/cjs/spatial/crs/CRSEngine.js.map

@@ -1 +1 @@
-{"version":3,"file":"CRSEngine.js","sourceRoot":"","sources":["../../../../src/spatial/crs/CRSEngine.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAUH,2CAAwC;AACxC,mDAAgD;AAEhD;;GAEG;AACH,gBAAgB;AAChB,MAAa,SAAS;IAClB;;OAEG;IACH;IACA,CAAC;IAED;;;;OAIG;IACI,KAAK,CAAC,cAAc,CAAC,GAAW,EAAE,IAAY;QACjD,8HAA8H;QAC9H,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACI,cAAc,CAAC,KAAiB,EAAE,SAAiB,EAAE,SAAiB;QACzE,yCAAyC;QACzC,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,GAAW;QAC9B,yCAAyC;QACzC,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,GAAW;QAC9B,yCAAyC;QACzC,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACI,cAAc,CAAC,GAAW;QAC7B,yCAAyC;QACzC,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACI,eAAe,CAAC,MAAc,EAAE,SAAiB,EAAE,SAAiB;QACvE,qDAAqD;QACrD,uBAAuB;QACvB,IAAI,YAAY,GAAW,IAAI,eAAM,EAAE,CAAC;QACxC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE;YAClB,6BAA6B;YAC7B,IAAI,MAAM,GAAe,uBAAU,CAAC,MAAM,EAAE,CAAC;YAC7C,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAChC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;gBAC5B,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;aACvE;SACJ;QACD,8BAA8B;QAC9B,OAAO,YAAY,CAAC;IACxB,CAAC;CACJ;AAjFD,8BAiFC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module OrbitGT\r\n */\r\n\r\n//package orbitgt.spatial.crs;\r\n\r\ntype int8 = number;\r\ntype int16 = number;\r\ntype int32 = number;\r\ntype float32 = number;\r\ntype float64 = number;\r\n\r\nimport { Bounds } from \"../geom/Bounds\";\r\nimport { Coordinate } from \"../geom/Coordinate\";\r\n\r\n/**\r\n * Abstract class CRSEngine provides a model for CRS transformation engines to implement.\r\n */\r\n/** @internal */\r\nexport class CRSEngine {\r\n    /**\r\n     * Create a new engine.\r\n     */\r\n    public constructor() {\r\n    }\r\n\r\n    /**\r\n     * Prepare a CRS for making transforms in a certain area.\r\n     * @param crs the CRS to prepare.\r\n     * @param area the area to prepare for (can be invalid to prepare only for the crs).\r\n     */\r\n    public async prepareForArea(crs: string, area: Bounds): Promise<Bounds> {\r\n        // subclasses should override this method if they need to download some part of a grid correction file, or the CRS declaration\r\n        return area;\r\n    }\r\n\r\n    /**\r\n     * Transform a coordinate from one CRS to another.\r\n     * @param point the point coordinate.\r\n     * @param sourceCRS the source CRS.\r\n     * @param targetCRS the target CRS.\r\n     * @return the transformed coordinate.\r\n     */\r\n    public transformPoint(point: Coordinate, sourceCRS: string, targetCRS: string): Coordinate {\r\n        // subclasses should override this method\r\n        return point;\r\n    }\r\n\r\n    /**\r\n     * Check if a CRS is geocentric.\r\n     * @param crs the CRS to check.\r\n     * @return true if geocentric.\r\n     */\r\n    public isGeocentricCRS(crs: string): boolean {\r\n        // subclasses should override this method\r\n        return false;\r\n    }\r\n\r\n    /**\r\n     * Check if a CRS is geographic.\r\n     * @param crs the CRS to check.\r\n     * @return true if geocentric.\r\n     */\r\n    public isGeographicCRS(crs: string): boolean {\r\n        // subclasses should override this method\r\n        return false;\r\n    }\r\n\r\n    /**\r\n     * Check if a CRS is projected.\r\n     * @param crs the CRS to check.\r\n     * @return true if geocentric.\r\n     */\r\n    public isProjectedCRS(crs: string): boolean {\r\n        // subclasses should override this method\r\n        return false;\r\n    }\r\n\r\n    /**\r\n     * Transform spatial bounds from one CRS to another.\r\n     * @param point the point coordinate.\r\n     * @param sourceCRS the source CRS.\r\n     * @param targetCRS the target CRS.\r\n     * @return the transformed bounds.\r\n     */\r\n    public transformBounds(bounds: Bounds, sourceCRS: string, targetCRS: string): Bounds {\r\n        // no real need to override this method in subclasses\r\n        /* Create new bounds */\r\n        let targetBounds: Bounds = new Bounds();\r\n        if (bounds.isValid()) {\r\n            /* Transform all 8 corners */\r\n            let corner: Coordinate = Coordinate.create();\r\n            for (let i: number = 0; i < 8; i++) {\r\n                bounds.getCorner(i, corner);\r\n                targetBounds.add(this.transformPoint(corner, sourceCRS, targetCRS));\r\n            }\r\n        }\r\n        /* Return the target bounds */\r\n        return targetBounds;\r\n    }\r\n}\r\n"]}
+{"version":3,"file":"CRSEngine.js","sourceRoot":"","sources":["../../../../src/spatial/crs/CRSEngine.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAUH,2CAAwC;AACxC,mDAAgD;AAEhD;;GAEG;AACH,gBAAgB;AAChB,MAAa,SAAS;IAClB;;OAEG;IACH;IACA,CAAC;IAED;;;;OAIG;IACI,KAAK,CAAC,cAAc,CAAC,GAAW,EAAE,IAAY;QACjD,8HAA8H;QAC9H,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACI,cAAc,CAAC,KAAiB,EAAE,SAAiB,EAAE,SAAiB;QACzE,yCAAyC;QACzC,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,GAAW;QAC9B,yCAAyC;QACzC,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,GAAW;QAC9B,yCAAyC;QACzC,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACI,cAAc,CAAC,GAAW;QAC7B,yCAAyC;QACzC,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACI,eAAe,CAAC,MAAc,EAAE,SAAiB,EAAE,SAAiB;QACvE,qDAAqD;QACrD,uBAAuB;QACvB,IAAI,YAAY,GAAW,IAAI,eAAM,EAAE,CAAC;QACxC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE;YAClB,6BAA6B;YAC7B,IAAI,MAAM,GAAe,uBAAU,CAAC,MAAM,EAAE,CAAC;YAC7C,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAChC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;gBAC5B,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;aACvE;SACJ;QACD,8BAA8B;QAC9B,OAAO,YAAY,CAAC;IACxB,CAAC;CACJ;AAjFD,8BAiFC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module OrbitGT\n */\n\n//package orbitgt.spatial.crs;\n\ntype int8 = number;\ntype int16 = number;\ntype int32 = number;\ntype float32 = number;\ntype float64 = number;\n\nimport { Bounds } from \"../geom/Bounds\";\nimport { Coordinate } from \"../geom/Coordinate\";\n\n/**\n * Abstract class CRSEngine provides a model for CRS transformation engines to implement.\n */\n/** @internal */\nexport class CRSEngine {\n    /**\n     * Create a new engine.\n     */\n    public constructor() {\n    }\n\n    /**\n     * Prepare a CRS for making transforms in a certain area.\n     * @param crs the CRS to prepare.\n     * @param area the area to prepare for (can be invalid to prepare only for the crs).\n     */\n    public async prepareForArea(crs: string, area: Bounds): Promise<Bounds> {\n        // subclasses should override this method if they need to download some part of a grid correction file, or the CRS declaration\n        return area;\n    }\n\n    /**\n     * Transform a coordinate from one CRS to another.\n     * @param point the point coordinate.\n     * @param sourceCRS the source CRS.\n     * @param targetCRS the target CRS.\n     * @return the transformed coordinate.\n     */\n    public transformPoint(point: Coordinate, sourceCRS: string, targetCRS: string): Coordinate {\n        // subclasses should override this method\n        return point;\n    }\n\n    /**\n     * Check if a CRS is geocentric.\n     * @param crs the CRS to check.\n     * @return true if geocentric.\n     */\n    public isGeocentricCRS(crs: string): boolean {\n        // subclasses should override this method\n        return false;\n    }\n\n    /**\n     * Check if a CRS is geographic.\n     * @param crs the CRS to check.\n     * @return true if geocentric.\n     */\n    public isGeographicCRS(crs: string): boolean {\n        // subclasses should override this method\n        return false;\n    }\n\n    /**\n     * Check if a CRS is projected.\n     * @param crs the CRS to check.\n     * @return true if geocentric.\n     */\n    public isProjectedCRS(crs: string): boolean {\n        // subclasses should override this method\n        return false;\n    }\n\n    /**\n     * Transform spatial bounds from one CRS to another.\n     * @param point the point coordinate.\n     * @param sourceCRS the source CRS.\n     * @param targetCRS the target CRS.\n     * @return the transformed bounds.\n     */\n    public transformBounds(bounds: Bounds, sourceCRS: string, targetCRS: string): Bounds {\n        // no real need to override this method in subclasses\n        /* Create new bounds */\n        let targetBounds: Bounds = new Bounds();\n        if (bounds.isValid()) {\n            /* Transform all 8 corners */\n            let corner: Coordinate = Coordinate.create();\n            for (let i: number = 0; i < 8; i++) {\n                bounds.getCorner(i, corner);\n                targetBounds.add(this.transformPoint(corner, sourceCRS, targetCRS));\n            }\n        }\n        /* Return the target bounds */\n        return targetBounds;\n    }\n}\n"]}

package/lib/cjs/spatial/crs/CRSManager.d.ts

@@ -1,50 +1,50 @@
-/** @packageDocumentation
- * @module OrbitGT
- */
-import { Bounds } from "../geom/Bounds";
-import { Coordinate } from "../geom/Coordinate";
-import { Transform } from "../geom/Transform";
-import { CRSEngine } from "./CRSEngine";
-/**
- * Class CRSManager defines the main access point to the CRS transformation engine.
- */
-/** @internal */
-export declare class CRSManager {
-    /** The main instance of the CRS engine. This needs to be set by the application on startup. */
-    static ENGINE: CRSEngine;
-    /**
-     * Allow no instances, all methods are static.
-     */
-    private constructor();
-    /**
-     * Prepare a CRS for making transforms in a certain area.
-     * @param crs the CRS to prepare.
-     * @param area the area to prepare for (can be invalid to prepare only for the crs).
-     */
-    static prepareForArea(crs: string, area: Bounds): Promise<Bounds>;
-    /**
-     * Transform a coordinate from one CRS to another.
-     * @param point the point coordinate.
-     * @param sourceCRS the source CRS.
-     * @param targetCRS the target CRS.
-     * @return the transformed coordinate.
-     */
-    static transformPoint(point: Coordinate, sourceCRS: string, targetCRS: string): Coordinate;
-    /**
-     * Transform spatial bounds from one CRS to another.
-     * @param point the point coordinate.
-     * @param sourceCRS the source CRS.
-     * @param targetCRS the target CRS.
-     * @return the transformed bounds.
-     */
-    static transformBounds(bounds: Bounds, sourceCRS: string, targetCRS: string): Bounds;
-    /**
-     * Create an approximate 3D transformation from a source to a target CRS.
-     * @param sourceCRS the source CRS.
-     * @param sourcePoint the origin point in the source CRS.
-     * @param targetCRS the target CRS.
-     * @return the transform.
-     */
-    static createTransform(sourceCRS: string, sourcePoint: Coordinate, targetCRS: string): Transform;
-}
+/** @packageDocumentation
+ * @module OrbitGT
+ */
+import { Bounds } from "../geom/Bounds";
+import { Coordinate } from "../geom/Coordinate";
+import { Transform } from "../geom/Transform";
+import { CRSEngine } from "./CRSEngine";
+/**
+ * Class CRSManager defines the main access point to the CRS transformation engine.
+ */
+/** @internal */
+export declare class CRSManager {
+    /** The main instance of the CRS engine. This needs to be set by the application on startup. */
+    static ENGINE: CRSEngine;
+    /**
+     * Allow no instances, all methods are static.
+     */
+    private constructor();
+    /**
+     * Prepare a CRS for making transforms in a certain area.
+     * @param crs the CRS to prepare.
+     * @param area the area to prepare for (can be invalid to prepare only for the crs).
+     */
+    static prepareForArea(crs: string, area: Bounds): Promise<Bounds>;
+    /**
+     * Transform a coordinate from one CRS to another.
+     * @param point the point coordinate.
+     * @param sourceCRS the source CRS.
+     * @param targetCRS the target CRS.
+     * @return the transformed coordinate.
+     */
+    static transformPoint(point: Coordinate, sourceCRS: string, targetCRS: string): Coordinate;
+    /**
+     * Transform spatial bounds from one CRS to another.
+     * @param point the point coordinate.
+     * @param sourceCRS the source CRS.
+     * @param targetCRS the target CRS.
+     * @return the transformed bounds.
+     */
+    static transformBounds(bounds: Bounds, sourceCRS: string, targetCRS: string): Bounds;
+    /**
+     * Create an approximate 3D transformation from a source to a target CRS.
+     * @param sourceCRS the source CRS.
+     * @param sourcePoint the origin point in the source CRS.
+     * @param targetCRS the target CRS.
+     * @return the transform.
+     */
+    static createTransform(sourceCRS: string, sourcePoint: Coordinate, targetCRS: string): Transform;
+}
 //# sourceMappingURL=CRSManager.d.ts.map