@itwin/core-geometry 5.1.0-dev.9 → 5.2.0-dev.2

package/lib/esm/polyface/RangeTree/RangeTreeNode.d.ts

@@ -89,14 +89,14 @@ export declare abstract class TwoTreeDistanceMinimizationSearchHandler<AppDataTy
  *     * _range = the union of ranges below in the heap
  *     * _appData = application data associated with the node.
  *       * Construction methods may place multiple _appData items in each node.
- * * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.
+ *       * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.
  * * CONSTRUCTION
  *   * The RangeTreeNode.createByIndexSplits method constructs the tree with simple right-left splits within an array of input items.
  *     * The appData is placed entirely in the leaves.
- *     * caller can specify:
+ *     * The caller can specify:
  *       * the number of _appData items per leaf
  *       * the number of children per node within the tree.
- *     * "deep" trees (2 children per node and one appData per leaf) may have (compared to shallow trees with many children per node and many appData per leaf)
+ *     * Compared to "shallow" trees with many children per node and many appData per leaf, "deep" trees with 2 children per node and 1 appData per leaf may have:
  *       * faster search because lower nodes have smaller ranges that will be skipped by search algorithms.
  *       * larger memory use because of more nodes
  *   * For future construction methods:

package/lib/esm/polyface/RangeTree/RangeTreeNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"RangeTreeNode.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeNode.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAEjD;;;;GAIG;AACH,KAAK,QAAQ,CAAC,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;AACvC;;;;GAIG;AACH,KAAK,WAAW,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,CAAC,CAAC;AA0CnD;;;GAGG;AACH,8BAAsB,uBAAuB,CAAC,WAAW;IACvD,qFAAqF;aACrE,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IACtD;;;;OAIG;aACa,cAAc,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;IACvD;;;;OAIG;IAEI,SAAS,IAAI,OAAO;CAC5B;AACD;;;GAGG;AACH,8BAAsB,oBAAoB,CAAC,WAAW;IACpD,0FAA0F;aAC1E,iBAAiB,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;IACnF;;;;;OAKG;aACa,kBAAkB,CAAC,QAAQ,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,GAAG,IAAI;IACvF;;;;OAIG;IAEI,SAAS,IAAI,OAAO;CAC5B;AACD;;;;;GAKG;AACH,8BAAsB,wCAAwC,CAAC,WAAW,CAAE,SAAQ,oBAAoB,CAAC,WAAW,CAAC;IACnH;;;;OAIG;aACa,kBAAkB,IAAI,MAAM;IAC5C;;;;;OAKG;IACa,iBAAiB,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;CAQpF;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,qBAAa,aAAa,CAAC,WAAW;IACpC,OAAO,CAAC,MAAM,CAAU;IACxB,OAAO,CAAC,QAAQ,CAAwB;IACxC,OAAO,CAAC,SAAS,CAAuC;IACxD,iFAAiF;IACjF,OAAO,CAAC,GAAG,CAAS;IACpB;;;;;;OAMG;IACH,OAAO;IAaP,wEAAwE;WAC1D,aAAa,CAAC,WAAW,EACrC,KAAK,EAAE,OAAO,EACd,OAAO,EAAE,QAAQ,CAAC,WAAW,CAAC,EAC9B,QAAQ,EAAE,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,GAAG,aAAa,CAAC,WAAW,CAAC;IAG7E,2EAA2E;IACpE,QAAQ,CAAC,IAAI,EAAE,OAAO;IAG7B,sDAAsD;IAC/C,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO;IAGxC,2DAA2D;IACpD,WAAW,IAAI,OAAO;IAG7B;;;;;;OAMG;IACI,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,aAAa,CAAC,WAAW,CAAC,GAAG,SAAS;IAG7E;;;;;;OAMG;IACI,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAGhE,qDAAqD;IAC9C,cAAc,IAAI,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;IAG7D,8DAA8D;IACvD,aAAa,IAAI,QAAQ,CAAC,WAAW,CAAC;IAG7C;;;OAGG;IACI,cAAc,IAAI,MAAM;IAG/B;;;OAGG;IACI,aAAa,IAAI,MAAM;IAG9B;;;OAGG;IACI,eAAe,CAAC,YAAY,EAAE,CAAC,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,KAAK,OAAO;IAWlF;;;;OAIG;IACI,aAAa,CAAC,OAAO,EAAE,uBAAuB,CAAC,WAAW,CAAC;IAgBlE;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,6BAA6B;IA0B5C;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAqBvC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,SAAS;IAUxB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ;IAWvB;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,MAAM,CAAC,mBAAmB;IA8ClC;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAmBtC;;;;;OAKG;WACW,qBAAqB,CAAC,WAAW,EAC7C,QAAQ,EAAE,aAAa,CAAC,WAAW,CAAC,EACpC,SAAS,EAAE,aAAa,CAAC,WAAW,CAAC,EACrC,OAAO,EAAE,oBAAoB,CAAC,WAAW,CAAC;CAI7C;AACD;;;GAGG;AACH,qBAAa,YAAY;IACvB,gCAAgC;WAClB,qBAAqB,CAAC,WAAW,EAAE,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,GAAG,MAAM;IAK1F,kCAAkC;WACpB,wBAAwB,CAAC,WAAW,EAAE,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,GAAG,MAAM;IAM7F;;;;;;;;OAQG;IACH,OAAO,CAAC,MAAM,CAAC,sBAAsB;IAgBrC;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAuC3C;;;;;;;;;;OAUG;WACW,mBAAmB,CAAC,WAAW,EAC3C,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,EAC5B,OAAO,EAAE,WAAW,CAAC,WAAW,CAAC,EACjC,WAAW,EAAE,MAAM,EACnB,kBAAkB,GAAE,MAAU,EAC9B,iBAAiB,GAAE,MAAU,GAC5B,aAAa,CAAC,WAAW,CAAC,GAAG,SAAS;CAY1C"}
+{"version":3,"file":"RangeTreeNode.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeNode.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAEjD;;;;GAIG;AACH,KAAK,QAAQ,CAAC,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;AACvC;;;;GAIG;AACH,KAAK,WAAW,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,CAAC,CAAC;AA0CnD;;;GAGG;AACH,8BAAsB,uBAAuB,CAAC,WAAW;IACvD,qFAAqF;aACrE,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IACtD;;;;OAIG;aACa,cAAc,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;IACvD;;;;OAIG;IAEI,SAAS,IAAI,OAAO;CAC5B;AACD;;;GAGG;AACH,8BAAsB,oBAAoB,CAAC,WAAW;IACpD,0FAA0F;aAC1E,iBAAiB,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;IACnF;;;;;OAKG;aACa,kBAAkB,CAAC,QAAQ,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,GAAG,IAAI;IACvF;;;;OAIG;IAEI,SAAS,IAAI,OAAO;CAC5B;AACD;;;;;GAKG;AACH,8BAAsB,wCAAwC,CAAC,WAAW,CAAE,SAAQ,oBAAoB,CAAC,WAAW,CAAC;IACnH;;;;OAIG;aACa,kBAAkB,IAAI,MAAM;IAC5C;;;;;OAKG;IACa,iBAAiB,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;CAQpF;AAID;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,qBAAa,aAAa,CAAC,WAAW;IACpC,OAAO,CAAC,MAAM,CAAU;IACxB,OAAO,CAAC,QAAQ,CAAwB;IACxC,OAAO,CAAC,SAAS,CAAuC;IACxD,iFAAiF;IACjF,OAAO,CAAC,GAAG,CAAS;IACpB;;;;;;OAMG;IACH,OAAO;IAaP,wEAAwE;WAC1D,aAAa,CAAC,WAAW,EACrC,KAAK,EAAE,OAAO,EACd,OAAO,EAAE,QAAQ,CAAC,WAAW,CAAC,EAC9B,QAAQ,EAAE,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,GAAG,aAAa,CAAC,WAAW,CAAC;IAG7E,2EAA2E;IACpE,QAAQ,CAAC,IAAI,EAAE,OAAO;IAG7B,sDAAsD;IAC/C,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO;IAGxC,2DAA2D;IACpD,WAAW,IAAI,OAAO;IAG7B;;;;;;OAMG;IACI,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,aAAa,CAAC,WAAW,CAAC,GAAG,SAAS;IAG7E;;;;;;OAMG;IACI,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAGhE,qDAAqD;IAC9C,cAAc,IAAI,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;IAG7D,8DAA8D;IACvD,aAAa,IAAI,QAAQ,CAAC,WAAW,CAAC;IAG7C;;;OAGG;IACI,cAAc,IAAI,MAAM;IAG/B;;;OAGG;IACI,aAAa,IAAI,MAAM;IAG9B;;;OAGG;IACI,eAAe,CAAC,YAAY,EAAE,CAAC,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,KAAK,OAAO;IAWlF;;;;OAIG;IACI,aAAa,CAAC,OAAO,EAAE,uBAAuB,CAAC,WAAW,CAAC;IAgBlE;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,6BAA6B;IA0B5C;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAqBvC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,SAAS;IAUxB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ;IAWvB;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,MAAM,CAAC,mBAAmB;IA8ClC;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAmBtC;;;;;OAKG;WACW,qBAAqB,CAAC,WAAW,EAC7C,QAAQ,EAAE,aAAa,CAAC,WAAW,CAAC,EACpC,SAAS,EAAE,aAAa,CAAC,WAAW,CAAC,EACrC,OAAO,EAAE,oBAAoB,CAAC,WAAW,CAAC;CAI7C;AACD;;;GAGG;AACH,qBAAa,YAAY;IACvB,gCAAgC;WAClB,qBAAqB,CAAC,WAAW,EAAE,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,GAAG,MAAM;IAK1F,kCAAkC;WACpB,wBAAwB,CAAC,WAAW,EAAE,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,GAAG,MAAM;IAM7F;;;;;;;;OAQG;IACH,OAAO,CAAC,MAAM,CAAC,sBAAsB;IAgBrC;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAuC3C;;;;;;;;;;OAUG;WACW,mBAAmB,CAAC,WAAW,EAC3C,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,EAC5B,OAAO,EAAE,WAAW,CAAC,WAAW,CAAC,EACjC,WAAW,EAAE,MAAM,EACnB,kBAAkB,GAAE,MAAU,EAC9B,iBAAiB,GAAE,MAAU,GAC5B,aAAa,CAAC,WAAW,CAAC,GAAG,SAAS;CAY1C"}

package/lib/esm/polyface/RangeTree/RangeTreeNode.js

@@ -111,14 +111,14 @@ let numNodeCreated = 0;
  *     * _range = the union of ranges below in the heap
  *     * _appData = application data associated with the node.
  *       * Construction methods may place multiple _appData items in each node.
- * * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.
+ *       * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.
  * * CONSTRUCTION
  *   * The RangeTreeNode.createByIndexSplits method constructs the tree with simple right-left splits within an array of input items.
  *     * The appData is placed entirely in the leaves.
- *     * caller can specify:
+ *     * The caller can specify:
  *       * the number of _appData items per leaf
  *       * the number of children per node within the tree.
- *     * "deep" trees (2 children per node and one appData per leaf) may have (compared to shallow trees with many children per node and many appData per leaf)
+ *     * Compared to "shallow" trees with many children per node and many appData per leaf, "deep" trees with 2 children per node and 1 appData per leaf may have:
  *       * faster search because lower nodes have smaller ranges that will be skipped by search algorithms.
  *       * larger memory use because of more nodes
  *   * For future construction methods:

package/lib/esm/polyface/RangeTree/RangeTreeNode.js.map

@@ -1 +1 @@
-{"version":3,"file":"RangeTreeNode.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeNode.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAejD;;;;;GAKG;AACH,SAAS,mBAAmB,CAAI,IAAoB,EAAE,KAAa;IACjE,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;AACrB,CAAC;AACD;;;GAGG;AACH,SAAS,UAAU,CAAI,KAAa,EAAE,IAAiB;IACrD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM;gBACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AACD;;;GAGG;AACH,SAAS,gBAAgB,CAAI,IAAiB;IAC5C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AACD;;;GAGG;AACH,MAAM,OAAgB,uBAAuB;IAS3C;;;;OAIG;IACH,6CAA6C;IACtC,SAAS,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;CAC9C;AACD;;;GAGG;AACH,MAAM,OAAgB,oBAAoB;IAUxC;;;;OAIG;IACH,6CAA6C;IACtC,SAAS,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;CAC9C;AACD;;;;;GAKG;AACH,MAAM,OAAgB,wCAAsD,SAAQ,oBAAiC;IAOnH;;;;;OAKG;IACa,iBAAiB,CAAC,SAAkB,EAAE,UAAmB;QACvE,MAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAClD,MAAM,qBAAqB,GAAG,SAAS,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QACpE,IAAI,qBAAqB,IAAI,eAAe,EAAE,CAAC;YAC7C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AACD,IAAI,cAAc,GAAG,CAAC,CAAC;AACvB;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,OAAO,aAAa;IAChB,MAAM,CAAU;IAChB,QAAQ,CAAwB;IAChC,SAAS,CAAuC;IACxD,iFAAiF;IACzE,GAAG,CAAS;IACpB;;;;;;OAMG;IACH,YAAoB,KAAc,EAAE,OAA8B,EAAE,QAA8C;QAChH,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,GAAG,GAAG,cAAc,EAAE,CAAC;QAC5B,iCAAiC;QACjC,qCAAqC;QACrC,0DAA0D;QAC1D,oDAAoD;QACpD,uCAAuC;QACvC,gDAAgD;QAChD,uDAAuD;IACzD,CAAC;IACD,wEAAwE;IACjE,MAAM,CAAC,aAAa,CACzB,KAAc,EACd,OAA8B,EAC9B,QAA8C;QAC9C,OAAO,IAAI,aAAa,CAAc,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAClE,CAAC;IACD,2EAA2E;IACpE,QAAQ,CAAC,IAAa;QAC3B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD,sDAAsD;IAC/C,QAAQ,CAAC,IAAc;QAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IACD,2DAA2D;IACpD,WAAW;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD;;;;;;OAMG;IACI,eAAe,CAAC,KAAa;QAClC,OAAO,UAAU,CAA6B,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACvE,CAAC;IACD;;;;;;OAMG;IACI,iBAAiB,CAAC,KAAa;QACpC,OAAO,UAAU,CAAc,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IACD,qDAAqD;IAC9C,cAAc;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,8DAA8D;IACvD,aAAa;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IACD;;;OAGG;IACI,cAAc;QACnB,OAAO,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IACD;;;OAGG;IACI,aAAa;QAClB,OAAO,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACzC,CAAC;IACD;;;OAGG;IACI,eAAe,CAAC,YAA2D;QAChF,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAClC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS;oBAChC,KAAK,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;YACxC,CAAC;iBAAM,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACxC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,OAA6C;QAChE,IAAI,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACvC,IAAI,aAAsC,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/E,8BAA8B;gBAC9B,OAAO,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;gBACtC,IAAI,OAAO,CAAC,SAAS,EAAE;oBACrB,OAAO;YACX,CAAC;YACD,IAAI,KAA6C,CAAC;YAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrE,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,6BAA6B,CAC1C,WAAkC,EAClC,UAAwC,EACxC,WAAoB,EACpB,OAA0C;QAE1C,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC9B,IAAI,QAAiC,CAAC;YACtC,IAAI,SAAkC,CAAC;YACvC,yGAAyG;YACzG,KAAK,IAAI,UAAU,GAAG,UAAU,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,CAAC,GAAG,CAAC;gBAC3D,MAAM,YAAY,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC;gBACrD,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAAc,UAAU,EAAE,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;oBACrH,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAc,SAAS,EAAE,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;wBAChH,IAAI,CAAC,WAAW;4BACd,OAAO,CAAC,kBAAkB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;;4BAEhD,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;wBAClD,IAAI,OAAO,CAAC,SAAS,EAAE;4BACrB,OAAO;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,wBAAwB,CACrC,WAAkC,EAClC,YAAmC,EACnC,WAAoB,EACpB,OAA0C;QAE1C,IAAI,WAAW,KAAK,SAAS,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC5D,IAAI,QAAiC,CAAC;YACtC,IAAI,SAAkC,CAAC;YACvC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAAc,UAAU,EAAE,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;gBACrH,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAc,SAAS,EAAE,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;oBAChH,IAAI,CAAC,WAAW;wBACd,OAAO,CAAC,kBAAkB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;;wBAEhD,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAClD,IAAI,OAAO,CAAC,SAAS,EAAE;wBACrB,OAAO;gBACX,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,SAAS,CACtB,GAA+B,EAC/B,QAAsC,EACtC,WAAyC;QAEzC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,QAAQ,CACrB,GAA+B,EAC/B,QAAsC,EACtC,WAAyC;QAEzC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QAC9C,QAAQ,CAAC,GAAG,EAAE,CAAC;QACf,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACK,MAAM,CAAC,mBAAmB,CAChC,OAAmC,EACnC,SAAuC,EACvC,oBAAkD,EAClD,QAAoC,EACpC,UAAwC,EACxC,qBAAmD,EACnD,OAA0C;QAE1C,+DAA+D;QAC/D,MAAM,iBAAiB,GAAG,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC;QACzD,MAAM,kBAAkB,GAAG,QAAQ,CAAC,QAAQ,KAAK,SAAS,CAAC;QAC3D,IAAI,SAAiD,CAAC;QACtD,IAAI,UAAkD,CAAC;QAEvD,kIAAkI;QAClI,IAAI,iBAAiB,IAAI,qBAAqB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1D,IAAI,CAAC,6BAA6B,CAAc,OAAO,CAAC,QAAQ,EAAE,qBAAqB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAC3G,CAAC;QACD,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,IAAI,kBAAkB,EAAE,CAAC;YAC1D,IAAI,CAAC,6BAA6B,CAAc,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1G,CAAC;QAED,IAAI,OAAO,CAAC,iBAAiB,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/D,IAAI,CAAC,wBAAwB,CAAc,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAEhG,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACxE,IAAI,CAAC,SAAS,CAAc,OAAO,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;gBACtE,IAAI,CAAC,SAAS,CAAc,QAAQ,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;gBACzE,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAA6B,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;oBACtI,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,UAAU,GAAG,UAAU,CAA6B,UAAU,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;wBAC3I,IAAI,CAAC,mBAAmB,CACtB,SAAS,EAAE,SAAS,EAAE,oBAAoB,EAC1C,UAAU,EAAE,UAAU,EAAE,qBAAqB,EAC7C,OAAO,CAAC,CAAC;oBACb,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,QAAQ,CAAc,OAAO,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;gBACrE,IAAI,CAAC,QAAQ,CAAc,QAAQ,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;YAC1E,CAAC;iBAAM,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC3C,IAAI,CAAC,uBAAuB,CAAc,OAAO,EAAE,QAAQ,EAAE,qBAAqB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YACtG,CAAC;iBAAM,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5C,IAAI,CAAC,uBAAuB,CAAc,QAAQ,EAAE,OAAO,EAAE,oBAAoB,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;YACpG,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,uBAAuB,CACpC,OAAmC,EACnC,QAAoC,EACpC,qBAAmD,EACnD,WAAoB,EACpB,OAA0C;QAE1C,MAAM,CAAC,QAAQ,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;QACzC,kGAAkG;QAClG,wJAAwJ;QACxJ,IAAI,SAAiD,CAAC;QACtD,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAA6B,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;YACtI,IAAI,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjE,IAAI,CAAC,wBAAwB,CAAc,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;gBACxG,IAAI,CAAC,6BAA6B,CAAc,SAAS,CAAC,QAAQ,EAAE,qBAAqB,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;gBACjH,IAAI,CAAC,uBAAuB,CAAc,SAAS,EAAE,QAAQ,EAAE,qBAAqB,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;YAC9G,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,qBAAqB,CACjC,QAAoC,EACpC,SAAqC,EACrC,OAA0C;QAE1C,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;IACzE,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,YAAY;IACvB,gCAAgC;IACzB,MAAM,CAAC,qBAAqB,CAAc,IAAgC;QAC/E,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,eAAe,CAAC,CAAC,KAAiC,EAAW,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kCAAkC;IAC3B,MAAM,CAAC,wBAAwB,CAAc,IAAgC;QAClF,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,eAAe,CAClB,CAAC,IAAgC,EAAW,EAAE,GAAG,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAClG,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;OAQG;IACK,MAAM,CAAC,sBAAsB,CACnC,MAA4B,EAC5B,OAAiC,EACjC,MAAc,EACd,MAAc,EACd,WAAmB;QACnB,MAAM,YAAY,GAAkB,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACvC,iDAAiD;QACjD,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,YAAY,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,KAAK,CAAC,WAAW,CAAC,mBAAmB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;IACrE,CAAC;IACD;;;;;;;;;;OAUG;IACK,MAAM,CAAC,4BAA4B,CACzC,MAA4B,EAC5B,OAAiC,EACjC,MAAc,EACd,MAAc,EACd,WAAmB,EACnB,eAAuB,EACvB,iBAAyB;QAEzB,IAAI,MAAM,GAAG,WAAW;YACtB,MAAM,GAAG,WAAW,CAAC;QAEvB,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAClD,MAAM,kBAAkB,GAAG,eAAe,GAAG,iBAAiB,CAAC;QAC/D,gFAAgF;QAEhF,IAAI,MAAM,IAAI,MAAM,GAAG,kBAAkB,EAAE,CAAC,CAAE,mEAAmE;YAC/G,uDAAuD;YACvD,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,iBAAiB,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,iBAAiB,EAAE,MAAM,CAAC,EAAE,CAAC;gBACtI,MAAM,IAAI,GAAG,YAAY,CAAC,sBAAsB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC/F,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;oBACtC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC,CAAE,qDAAqD;YAC7D,qDAAqD;YACrD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC;YAClE,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,CAAC,EAAE,CAAC;gBACxH,MAAM,KAAK,GAAG,IAAI,CAAC,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,iBAAiB,CAAC,CAAC;gBAClI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;oBACvC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrG,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAA4B,EAC5B,OAAiC,EACjC,WAAmB,EACnB,qBAA6B,CAAC,EAC9B,oBAA4B,CAAC;QAE7B,iBAAiB;QACjB,6CAA6C;QAC7C,4BAA4B;QAC5B,IAAI,WAAW,IAAI,CAAC;eACf,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,CAAC;eACxD,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,CAAC;YAC7D,OAAO,SAAS,CAAC;QACnB,IAAI,kBAAkB,GAAG,CAAC;YACxB,kBAAkB,GAAG,CAAC,CAAC;QACzB,OAAO,YAAY,CAAC,4BAA4B,CAAc,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,WAAW,EAAE,kBAAkB,EAAE,iBAAiB,CAAC,CAAC;IACrJ,CAAC;CACF","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 RangeSearch\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Range3d } from \"../../geometry3d/Range\";\n\n/** Type name FlexData is shorthand for a member or parameter which can be:\n * * undefined\n * * an array of values of type T\n * * a singleton of type T\n */\ntype FlexData<T> = undefined | T[] | T;\n/**\n * Type name IndexToType is shorthand for a member or parameter which can be:\n * * an array of values of type T\n * * a function from integers to type T.\n */\ntype IndexToType<T> = T[] | ((index: number) => T);\n\n/**\n * Map an (unchecked) integer to a parameterized type T, where the data argument can be either:\n * * an array of type T\n * * a function which takes an index and returns type T\n * @internal\n */\nfunction evaluateIndexToType<T>(data: IndexToType<T>, index: number): T {\n  if (Array.isArray(data))\n    return data[index];\n  return data(index);\n}\n/**\n * Get data by index from a source that may be undefined, an array of item of type T, or a singleton of the item type.\n * @internal\n */\nfunction getByIndex<T>(index: number, data: FlexData<T>): T | undefined {\n  if (data !== undefined) {\n    if (Array.isArray(data)) {\n      if (index < data.length)\n        return data[index];\n    } else {\n      return data;\n    }\n  }\n  return undefined;\n}\n/**\n * Return the number of items in an object that can be undefined, an array of item of type T, or a singleton of the item type.\n * @internal\n */\nfunction getFlexDataCount<T>(data: FlexData<T>): number {\n  if (data !== undefined) {\n    if (Array.isArray(data)) {\n      return data.length;\n    } else {\n      return 1;\n    }\n  }\n  return 0;\n}\n/**\n * Abstract class for handler objects called during traversal of a single range tree.\n * @internal\n */\nexport abstract class SingleTreeSearchHandler<AppDataType> {\n  /** Return true if appData within the range should be offered to `processAppData`. */\n  public abstract isRangeActive(range: Range3d): boolean;\n  /**\n   * Called for a (single) child referenced by a tree.\n   * * This is only called when range checks on the path from root have been passed.\n   * @param item child (of type AppDataType) in the tree.\n   */\n  public abstract processAppData(item: AppDataType): void;\n  /**\n   * Query to see if the active search has been aborted.\n   * * Default implementation returns false so query runs to completion.\n   * * Search processes check this after range tests and child processing.\n   */\n  // eslint-disable-next-line @itwin/prefer-get\n  public isAborted(): boolean { return false; }\n}\n/**\n * Abstract class for handler objects called during traversal of two range trees.\n * @internal\n */\nexport abstract class TwoTreeSearchHandler<AppDataType> {\n  /** Return true if appData within the ranges should be offered to `processAppDataPair`. */\n  public abstract isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean;\n  /**\n   * Called with AppDataType items from left tree and right tree.\n   * * This is only called when range tests have been passed.\n   * @param leftItem\n   * @param rightItem\n   */\n  public abstract processAppDataPair(leftItem: AppDataType, rightItem: AppDataType): void;\n  /**\n   * Query to see if the active search has been aborted.\n   * * Default implementation returns false so query runs to completion.\n   * * Search processes check this after range tests and child processing.\n   */\n  // eslint-disable-next-line @itwin/prefer-get\n  public isAborted(): boolean { return false; }\n}\n/**\n * This class refines the TwoTreeSearchHandler with an implementation of `isRangePairActive` appropriate for computing the minimum distance between trees.\n * * The concrete class must implement `getCurrentDistance()` method to provide the best-so-far distance.\n * * The implementation of `isRangePairActive` returns true if the distance between ranges is less than or equal to the `getCurrentDistance()` value.\n * @internal\n */\nexport abstract class TwoTreeDistanceMinimizationSearchHandler<AppDataType> extends TwoTreeSearchHandler<AppDataType>{\n  /**\n   * Provides the allowable distance between ranges.\n   * * Range pairs with more than this distance separation are rejected.\n   * * The implementation may alter (probably reduce) the getCurrentDistance() value as the search progresses.\n   */\n  public abstract getCurrentDistance(): number;\n  /**\n   * Method called to decide whether to process subtrees and immediate child appData items from a left tree node and right tree node.\n   * @param leftRange range from a node in the left tree\n   * @param rightRange range from a node in the right tree.\n   * @returns true if the smallest distance from leftRange to rightRange is less than or equal to getCurrentDistance()\n   */\n  public override isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean {\n    const currentDistance = this.getCurrentDistance();\n    const distanceBetweenRanges = leftRange.distanceToRange(rightRange);\n    if (distanceBetweenRanges <= currentDistance) {\n      return true;\n    }\n    return false;\n  }\n}\nlet numNodeCreated = 0;\n/**\n * * TREE STRUCTURE\n *   * A RangeTreeNode is part of a range tree.\n *   * TREE is used here in a strictly _structural_ sense, which has no broad promises about data members.\n *   * Each RangeNode points to 0, 1 or many children.\n *   * Each child has (but does not point back to) a single parent.\n *   * The overall tree has a single root.\n *   * Each node is effectively the root of the tree of its children.\n * * NON-TREE DATA MEMBERS\n *   * Data members in each node (in addition to children) are\n *     * _range = the union of ranges below in the heap\n *     * _appData = application data associated with the node.\n *       * Construction methods may place multiple _appData items in each node.\n * * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.\n * * CONSTRUCTION\n *   * The RangeTreeNode.createByIndexSplits method constructs the tree with simple right-left splits within an array of input items.\n *     * The appData is placed entirely in the leaves.\n *     * caller can specify:\n *       * the number of _appData items per leaf\n *       * the number of children per node within the tree.\n *     * \"deep\" trees (2 children per node and one appData per leaf) may have (compared to shallow trees with many children per node and many appData per leaf)\n *       * faster search because lower nodes have smaller ranges that will be skipped by search algorithms.\n *       * larger memory use because of more nodes\n *   * For future construction methods:\n *      * _appData \"above the leaves\" may allow nodes below to have smaller ranges, but add complexity to search.\n * @internal\n */\nexport class RangeTreeNode<AppDataType> {\n  private _range: Range3d;\n  private _appData: FlexData<AppDataType>;\n  private _children: FlexData<RangeTreeNode<AppDataType>>;\n  /** an id assigned sequentially as nodes are created.  For debugging use only. */\n  private _id: number;\n  /**\n   * CONSTRUCTOR\n   * CAPTURE (not copy)\n   * * range = range for search algorithms\n   * * appData = application data relevant to this node.\n   * * children = child node reference(s).\n   */\n  private constructor(range: Range3d, appData: FlexData<AppDataType>, children: FlexData<RangeTreeNode<AppDataType>>) {\n    this._range = range;\n    this._appData = appData;\n    this._children = children;\n    this._id = numNodeCreated++;\n    // const childIds: number[] = [];\n    // if (Array.isArray(this._children))\n    //   for (const c of this._children) childIds.push(c._id);\n    // else if (this._children instanceof RangeTreeNode)\n    //   childIds.push(this._children._id);\n    // const numAppData = getFlexDataCount(appData);\n    // console.log({ id: this._id, childIds, numAppData });\n  }\n  /** Simplest public create: capture the range, appData, and children. */\n  public static createCapture<AppDataType>(\n    range: Range3d,\n    appData: FlexData<AppDataType>,\n    children: FlexData<RangeTreeNode<AppDataType>>): RangeTreeNode<AppDataType> {\n    return new RangeTreeNode<AppDataType>(range, appData, children);\n  }\n  /** copy (not capture) from given data into the range in this RangeEntry */\n  public setRange(data: Range3d) {\n    this._range.setFrom(data);\n  }\n  /** return (a copy of) the range in this RangeEntry */\n  public getRange(data?: Range3d): Range3d {\n    return this._range.clone(data);\n  }\n  /** return (a reference to) the range in this RangeEntry */\n  public getRangeRef(): Range3d {\n    return this._range;\n  }\n  /**\n   * Access a child by index.\n   * * If the child data is an array, this dereferences the array.\n   * * If the child data is a singleton, treat it as index 0.\n   * * return undefined if there are no children.\n   * @param index index of item to access.\n   */\n  public getChildByIndex(index: number): RangeTreeNode<AppDataType> | undefined {\n    return getByIndex<RangeTreeNode<AppDataType>>(index, this._children);\n  }\n  /**\n   * * Access an appData by index.\n   * * If the appData data is an array, this dereferences the array.\n   * * If the appData data is a singleton, treat it as if it is at index 0 in an array\n   * * return undefined if there are no appData or for any index out of range.\n   * @param index index of item to access.\n   */\n  public getAppDataByIndex(index: number): AppDataType | undefined {\n    return getByIndex<AppDataType>(index, this._appData);\n  }\n  /** Access the children or child (does not clone). */\n  public getAllChildren(): FlexData<RangeTreeNode<AppDataType>> {\n    return this._children;\n  }\n  /** Access the appData array or singleton (does not clone). */\n  public getAllAppData(): FlexData<AppDataType> {\n    return this._appData;\n  }\n  /**\n   * Count the direct children in this node of the tree.\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveNodeCount`.\n   */\n  public getNumChildren(): number {\n    return getFlexDataCount(this._children);\n  }\n  /**\n   * Count the appData items in this node of the tree.\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveAppDataCount`.\n   */\n  public getNumAppData(): number {\n    return getFlexDataCount(this._appData);\n  }\n  /**\n   * Depth-first tree iteration, calling `announceNode` on each node.\n   * @param announceNode callback that returns true to recurse into children\n   */\n  public recurseIntoTree(announceNode: (node: RangeTreeNode<AppDataType>) => boolean) {\n    const doChildren = announceNode(this);\n    if (doChildren) {\n      if (Array.isArray(this._children)) {\n        for (const child of this._children)\n          child.recurseIntoTree(announceNode);\n      } else if (this._children !== undefined) {\n        this._children.recurseIntoTree(announceNode);\n      }\n    }\n  }\n  /**\n   * Depth-first tree iteration via handler.\n   * * if handler decides the instance range is active, process appData, then recurse on children\n   * * if handler decides to abort after processing an appData, skip processing rest of appData and children\n   */\n  public searchTopDown(handler: SingleTreeSearchHandler<AppDataType>) {\n    if (handler.isRangeActive(this._range)) {\n      let itemToProcess: AppDataType | undefined;\n      for (let i = 0; undefined !== (itemToProcess = this.getAppDataByIndex(i)); i++) {\n        // console.log(itemToProcess);\n        handler.processAppData(itemToProcess);\n        if (handler.isAborted())\n          return;\n      }\n      let child: RangeTreeNode<AppDataType> | undefined;\n      for (let i = 0; undefined !== (child = this.getChildByIndex(i)); i++) {\n        child.searchTopDown(handler);\n      }\n    }\n  }\n\n  /**\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightStack.\n   * @param leftAppData singleton or array with data \"from left\"\n   * @param rightStack stack of nodes to process from right path.\n   * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.\n   * @param handler search handler\n   */\n  private static processAppDataAndAppDataStack<AppDataType>(\n    leftAppData: FlexData<AppDataType>,\n    rightStack: RangeTreeNode<AppDataType>[],\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    if (leftAppData !== undefined) {\n      let leftItem: AppDataType | undefined;\n      let rightItem: AppDataType | undefined;\n      // hmm.. we ASSUME that if the tip ranges passed, then all parent ranges would pass without further test.\n      for (let rangeIndex = rightStack.length; rangeIndex-- > 0;) {\n        const rightAppData = rightStack[rangeIndex]._appData;\n        for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\n          for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\n            if (!reverseArgs)\n              handler.processAppDataPair(leftItem, rightItem);\n            else\n              handler.processAppDataPair(rightItem, leftItem);\n            if (handler.isAborted())\n              return;\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightAppData.\n   * @param leftAppData singleton or array with data \"from left\"\n   * @param rightAppData singleton or array with data \"from right\"\n   * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.\n   * @param handler search handler\n   */\n  private static processAppDataAndAppData<AppDataType>(\n    leftAppData: FlexData<AppDataType>,\n    rightAppData: FlexData<AppDataType>,\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    if (leftAppData !== undefined && rightAppData !== undefined) {\n      let leftItem: AppDataType | undefined;\n      let rightItem: AppDataType | undefined;\n      for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\n        for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\n          if (!reverseArgs)\n            handler.processAppDataPair(leftItem, rightItem);\n          else\n            handler.processAppDataPair(rightItem, leftItem);\n          if (handler.isAborted())\n            return;\n        }\n      }\n    }\n  }\n  /**\n   * Push the tip node to stack(s).\n   * @param tip new node (to be pushed)\n   * @param fullPath complete path, which is always extended\n   * @param partialPath partial path, which is only extended if the tip has _appData.\n   */\n  private static pushPaths<AppDataType>(\n    tip: RangeTreeNode<AppDataType>,\n    fullPath: RangeTreeNode<AppDataType>[],\n    partialPath: RangeTreeNode<AppDataType>[],\n  ) {\n    fullPath.push(tip);\n    if (tip._appData !== undefined) {\n      partialPath.push(tip);\n    }\n  }\n  /**\n   * Pop the tip node from stack(s).\n   * @param tip should match the fullPath tip.\n   * @param fullPath complete path, which is always popped\n   * @param partialPath partial path, which is only popped if the tip has _appData.\n   */\n  private static popPaths<AppDataType>(\n    tip: RangeTreeNode<AppDataType>,\n    fullPath: RangeTreeNode<AppDataType>[],\n    partialPath: RangeTreeNode<AppDataType>[],\n  ) {\n    assert(fullPath[fullPath.length - 1] === tip);\n    fullPath.pop();\n    if (tip._appData !== undefined) {\n      partialPath.pop();\n    }\n  }\n  /**\n   * Process nodes from left and right trees of dual search.\n   * * The separate stacks for nodes that have appData is for efficiency.\n   * * If data is entirely in the leaves (or just in a few nodes), the stacks will all be empty (or very small) and no time will be wasted looking up the stacks for appData to process with the other tip.\n   * @param leftTip tip node being explored on left\n   * @param leftStack stack of prior left nodes\n   * @param leftStackWithAppData stack of prior left nodes which have appData.\n   * @param rightTip tip node being explored on right.\n   * @param rightStack stack of prior right nodes.\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\n   * @param handler search handler\n   */\n  private static recursivePairSearch<AppDataType>(\n    leftTip: RangeTreeNode<AppDataType>,\n    leftStack: RangeTreeNode<AppDataType>[],\n    leftStackWithAppData: RangeTreeNode<AppDataType>[],\n    rightTip: RangeTreeNode<AppDataType>,\n    rightStack: RangeTreeNode<AppDataType>[],\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    // console.log({ leftId: leftTip._id, rightId: rightTip._id });\n    const leftTipHasAppData = leftTip._appData !== undefined;\n    const rightTipHasAppData = rightTip._appData !== undefined;\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\n    let rightChild: RangeTreeNode<AppDataType> | undefined;\n\n    // process immediate appData from each tip node with the entire prior path of the other side (each stack currently lacks the tip).\n    if (leftTipHasAppData && rightStackWithAppData.length > 0) {\n      this.processAppDataAndAppDataStack<AppDataType>(leftTip._appData, rightStackWithAppData, false, handler);\n    }\n    if (leftStackWithAppData.length > 0 && rightTipHasAppData) {\n      this.processAppDataAndAppDataStack<AppDataType>(rightTip._appData, leftStackWithAppData, true, handler);\n    }\n\n    if (handler.isRangePairActive(leftTip._range, rightTip._range)) {\n      this.processAppDataAndAppData<AppDataType>(leftTip._appData, rightTip._appData, false, handler);\n\n      if (leftTip._children !== undefined && rightTip._children !== undefined) {\n        this.pushPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\n        this.pushPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\n        for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\n          for (let rightIndex = 0; undefined !== (rightChild = getByIndex<RangeTreeNode<AppDataType>>(rightIndex, rightTip._children)); rightIndex++) {\n            this.recursivePairSearch(\n              leftChild, leftStack, leftStackWithAppData,\n              rightChild, rightStack, rightStackWithAppData,\n              handler);\n          }\n        }\n        this.popPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\n        this.popPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\n      } else if (leftTip._children !== undefined) {\n        this.leftRecursivePairSearch<AppDataType>(leftTip, rightTip, rightStackWithAppData, false, handler);\n      } else if (rightTip._children !== undefined) {\n        this.leftRecursivePairSearch<AppDataType>(rightTip, leftTip, leftStackWithAppData, true, handler);\n      }\n    }\n  }\n  /**\n   * Recurse below the tip of leftTip, offering each level's appData to the appData of rightTip and rightStackWithAppData.\n   * @param leftTip tip node being explored on left. Its appData is not processed.\n   * @param rightTip tip node being explored on right. It has no children.\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\n   * @param reverseArgs true if the caller is exchanging the sense of left and right\n   * @param handler search handler\n   */\n  private static leftRecursivePairSearch<AppDataType>(\n    leftTip: RangeTreeNode<AppDataType>,\n    rightTip: RangeTreeNode<AppDataType>,\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    assert(rightTip._children === undefined);\n    // The (possibly deep) left children appData needs to be offered to the right path (including tip)\n    // Note that there are no stack push/pop operations -- the right stack is already reaching to leaf level, so there are no range or appData nodes to add.\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\n    for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\n      if (handler.isRangePairActive(leftChild._range, rightTip._range)) {\n        this.processAppDataAndAppData<AppDataType>(leftChild._appData, rightTip._appData, reverseArgs, handler);\n        this.processAppDataAndAppDataStack<AppDataType>(leftChild._appData, rightStackWithAppData, reverseArgs, handler);\n        this.leftRecursivePairSearch<AppDataType>(leftChild, rightTip, rightStackWithAppData, reverseArgs, handler);\n      }\n    }\n  }\n  /**\n   * Recursive search down two trees, with range tests and child processing under control of a handler.\n   * @param leftRoot root of left tree\n   * @param rightRoot root of right tree\n   * @param handler handler for range tests and child process\n   */\n  public static searchTwoTreesTopDown<AppDataType>(\n    leftRoot: RangeTreeNode<AppDataType>,\n    rightRoot: RangeTreeNode<AppDataType>,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    this.recursivePairSearch(leftRoot, [], [], rightRoot, [], [], handler);\n  }\n}\n/**\n * Utilities for various operations on RangeTree\n * @internal\n */\nexport class RangeTreeOps {\n  /** Count nodes in this tree. */\n  public static getRecursiveNodeCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\n    let count = 0;\n    root.recurseIntoTree((_node: RangeTreeNode<AppDataType>): boolean => { count++; return true; });\n    return count;\n  }\n  /** Count appData in this tree. */\n  public static getRecursiveAppDataCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\n    let count = 0;\n    root.recurseIntoTree(\n      (node: RangeTreeNode<AppDataType>): boolean => { count += node.getNumAppData(); return true; });\n    return count;\n  }\n  /**\n   * Create a leaf referencing appData items indexed index0<=index<index1 and with combined range of the same indices\n   * @param ranges access to ranges\n   * @param appData access to AppDataType items\n   * @param index0 first index for block of items\n   * @param index1 upper limit index for block of items.\n   * @param arrayLength one more than the largest range/appData index\n   * @returns newly created node.\n   */\n  private static createLeafInIndexRange<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    index0: number,\n    index1: number,\n    arrayLength: number): RangeTreeNode<AppDataType> {\n    const appDataBlock: AppDataType[] = [];\n    const range = Range3d.createNull();\n    index1 = Math.min(index1, arrayLength);\n    // console.log({ case: \"LEAF\", index0, index1 });\n    for (let i = index0; i < index1; i++) {\n      appDataBlock.push(evaluateIndexToType(appData, i));\n      range.extendRange(evaluateIndexToType(ranges, i));\n    }\n    return RangeTreeNode.createCapture(range, appDataBlock, undefined);\n  }\n  /**\n   * Split the array entries appData[index0 <= i < index1] into blocks of at most maxChildPerNode * maxAppDataPerLeaf and assemble into a tree structure.\n   * @param ranges access to ranges\n   * @param appData access to AppDataType items\n   * @param index0 start index of the block to access\n   * @param index1 terminal index for the block (one after final)\n   * @param arrayLength one more than the largest range/appData index\n   * @param maxChildPerNode max number of child nodes in each interior node\n   * @param maxAppDataPerLeaf max number of appData items in each leaf.\n   * @returns\n   */\n  private static createRecursiveByIndexSplits<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    index0: number,\n    index1: number,\n    arrayLength: number,\n    maxChildPerNode: number,\n    maxAppDataPerLeaf: number,\n  ): RangeTreeNode<AppDataType> | undefined {\n    if (index1 > arrayLength)\n      index1 = arrayLength;\n\n    const range = Range3d.createNull();\n    const children: RangeTreeNode<AppDataType>[] = [];\n    const maxChildrenAppData = maxChildPerNode * maxAppDataPerLeaf;\n    // console.log({ name: \"createRecursive\", index0, index1, maxChildrenAppData });\n\n    if (index1 <= index0 + maxChildrenAppData) {  // index range is small enough to hold the appData in leaf children\n      // console.log({ case: \"LEAF GROUP\", index0, index1 });\n      for (let indexA = index0 + maxAppDataPerLeaf; index0 < index1; index0 = indexA, indexA = Math.min(indexA + maxAppDataPerLeaf, index1)) {\n        const leaf = RangeTreeOps.createLeafInIndexRange(ranges, appData, index0, indexA, arrayLength);\n        if (leaf !== undefined) {\n          range.extendRange(leaf.getRangeRef());\n          children.push(leaf);\n        }\n      }\n    } else {  // split the appData among interior and leaf children\n      // console.log({ case: \"INTERIOR\", index0, index1 });\n      const numPerGulp = Math.ceil((index1 - index0) / maxChildPerNode);\n      for (let indexA = index0 + numPerGulp; index0 < index1; index0 = indexA, indexA = Math.min(indexA + numPerGulp, index1)) {\n        const child = this.createRecursiveByIndexSplits(ranges, appData, index0, indexA, arrayLength, maxChildPerNode, maxAppDataPerLeaf);\n        if (child !== undefined) {\n          range.extendRange(child.getRangeRef());\n          children.push(child);\n        }\n      }\n    }\n    return (children.length > 0) ? RangeTreeNode.createCapture(range, undefined, children) : undefined;\n  }\n  /**\n   * Create a range tree by simple left-right split of given ranges.\n   * * Leaves carry the inputs in left-to-right order.\n   * * Each leaf range is labeled by its corresponding object(s) in the appData array.\n   * @param ranges access to ranges.\n   * @param appData access to AppDataType items (for leaves).\n   * @param arrayLength one more than the largest range/appData index\n   * @param maxChildrenPerNode max number of child nodes allowed for each interior node.\n   * @param maxAppDataPerLeaf max number of appData items allowed in each leaf.\n   * @returns the root of the new tree, or undefined if array lengths differ or are zero.\n   */\n  public static createByIndexSplits<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    arrayLength: number,\n    maxChildrenPerNode: number = 2,\n    maxAppDataPerLeaf: number = 2,\n  ): RangeTreeNode<AppDataType> | undefined {\n    // console.log();\n    // const numData = getFlexDataCount(appData);\n    // console.log({ numData });\n    if (arrayLength <= 0\n      || (Array.isArray(ranges) && ranges.length !== arrayLength)\n      || (Array.isArray(appData) && appData.length !== arrayLength))\n      return undefined;\n    if (maxChildrenPerNode < 2)\n      maxChildrenPerNode = 2;\n    return RangeTreeOps.createRecursiveByIndexSplits<AppDataType>(ranges, appData, 0, arrayLength, arrayLength, maxChildrenPerNode, maxAppDataPerLeaf);\n  }\n}\n\n"]}
+{"version":3,"file":"RangeTreeNode.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeNode.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAejD;;;;;GAKG;AACH,SAAS,mBAAmB,CAAI,IAAoB,EAAE,KAAa;IACjE,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;AACrB,CAAC;AACD;;;GAGG;AACH,SAAS,UAAU,CAAI,KAAa,EAAE,IAAiB;IACrD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM;gBACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AACD;;;GAGG;AACH,SAAS,gBAAgB,CAAI,IAAiB;IAC5C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AACD;;;GAGG;AACH,MAAM,OAAgB,uBAAuB;IAS3C;;;;OAIG;IACH,6CAA6C;IACtC,SAAS,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;CAC9C;AACD;;;GAGG;AACH,MAAM,OAAgB,oBAAoB;IAUxC;;;;OAIG;IACH,6CAA6C;IACtC,SAAS,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;CAC9C;AACD;;;;;GAKG;AACH,MAAM,OAAgB,wCAAsD,SAAQ,oBAAiC;IAOnH;;;;;OAKG;IACa,iBAAiB,CAAC,SAAkB,EAAE,UAAmB;QACvE,MAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAClD,MAAM,qBAAqB,GAAG,SAAS,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QACpE,IAAI,qBAAqB,IAAI,eAAe,EAAE,CAAC;YAC7C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED,IAAI,cAAc,GAAG,CAAC,CAAC;AAEvB;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,OAAO,aAAa;IAChB,MAAM,CAAU;IAChB,QAAQ,CAAwB;IAChC,SAAS,CAAuC;IACxD,iFAAiF;IACzE,GAAG,CAAS;IACpB;;;;;;OAMG;IACH,YAAoB,KAAc,EAAE,OAA8B,EAAE,QAA8C;QAChH,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,GAAG,GAAG,cAAc,EAAE,CAAC;QAC5B,iCAAiC;QACjC,qCAAqC;QACrC,0DAA0D;QAC1D,oDAAoD;QACpD,uCAAuC;QACvC,gDAAgD;QAChD,uDAAuD;IACzD,CAAC;IACD,wEAAwE;IACjE,MAAM,CAAC,aAAa,CACzB,KAAc,EACd,OAA8B,EAC9B,QAA8C;QAC9C,OAAO,IAAI,aAAa,CAAc,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAClE,CAAC;IACD,2EAA2E;IACpE,QAAQ,CAAC,IAAa;QAC3B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD,sDAAsD;IAC/C,QAAQ,CAAC,IAAc;QAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IACD,2DAA2D;IACpD,WAAW;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD;;;;;;OAMG;IACI,eAAe,CAAC,KAAa;QAClC,OAAO,UAAU,CAA6B,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACvE,CAAC;IACD;;;;;;OAMG;IACI,iBAAiB,CAAC,KAAa;QACpC,OAAO,UAAU,CAAc,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IACD,qDAAqD;IAC9C,cAAc;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,8DAA8D;IACvD,aAAa;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IACD;;;OAGG;IACI,cAAc;QACnB,OAAO,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IACD;;;OAGG;IACI,aAAa;QAClB,OAAO,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACzC,CAAC;IACD;;;OAGG;IACI,eAAe,CAAC,YAA2D;QAChF,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAClC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS;oBAChC,KAAK,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;YACxC,CAAC;iBAAM,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACxC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,OAA6C;QAChE,IAAI,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACvC,IAAI,aAAsC,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/E,8BAA8B;gBAC9B,OAAO,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;gBACtC,IAAI,OAAO,CAAC,SAAS,EAAE;oBACrB,OAAO;YACX,CAAC;YACD,IAAI,KAA6C,CAAC;YAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrE,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,6BAA6B,CAC1C,WAAkC,EAClC,UAAwC,EACxC,WAAoB,EACpB,OAA0C;QAE1C,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC9B,IAAI,QAAiC,CAAC;YACtC,IAAI,SAAkC,CAAC;YACvC,yGAAyG;YACzG,KAAK,IAAI,UAAU,GAAG,UAAU,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,CAAC,GAAG,CAAC;gBAC3D,MAAM,YAAY,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC;gBACrD,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAAc,UAAU,EAAE,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;oBACrH,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAc,SAAS,EAAE,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;wBAChH,IAAI,CAAC,WAAW;4BACd,OAAO,CAAC,kBAAkB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;;4BAEhD,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;wBAClD,IAAI,OAAO,CAAC,SAAS,EAAE;4BACrB,OAAO;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,wBAAwB,CACrC,WAAkC,EAClC,YAAmC,EACnC,WAAoB,EACpB,OAA0C;QAE1C,IAAI,WAAW,KAAK,SAAS,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC5D,IAAI,QAAiC,CAAC;YACtC,IAAI,SAAkC,CAAC;YACvC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAAc,UAAU,EAAE,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;gBACrH,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAc,SAAS,EAAE,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;oBAChH,IAAI,CAAC,WAAW;wBACd,OAAO,CAAC,kBAAkB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;;wBAEhD,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAClD,IAAI,OAAO,CAAC,SAAS,EAAE;wBACrB,OAAO;gBACX,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,SAAS,CACtB,GAA+B,EAC/B,QAAsC,EACtC,WAAyC;QAEzC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,QAAQ,CACrB,GAA+B,EAC/B,QAAsC,EACtC,WAAyC;QAEzC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QAC9C,QAAQ,CAAC,GAAG,EAAE,CAAC;QACf,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACK,MAAM,CAAC,mBAAmB,CAChC,OAAmC,EACnC,SAAuC,EACvC,oBAAkD,EAClD,QAAoC,EACpC,UAAwC,EACxC,qBAAmD,EACnD,OAA0C;QAE1C,+DAA+D;QAC/D,MAAM,iBAAiB,GAAG,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC;QACzD,MAAM,kBAAkB,GAAG,QAAQ,CAAC,QAAQ,KAAK,SAAS,CAAC;QAC3D,IAAI,SAAiD,CAAC;QACtD,IAAI,UAAkD,CAAC;QAEvD,kIAAkI;QAClI,IAAI,iBAAiB,IAAI,qBAAqB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1D,IAAI,CAAC,6BAA6B,CAAc,OAAO,CAAC,QAAQ,EAAE,qBAAqB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAC3G,CAAC;QACD,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,IAAI,kBAAkB,EAAE,CAAC;YAC1D,IAAI,CAAC,6BAA6B,CAAc,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1G,CAAC;QAED,IAAI,OAAO,CAAC,iBAAiB,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/D,IAAI,CAAC,wBAAwB,CAAc,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAEhG,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACxE,IAAI,CAAC,SAAS,CAAc,OAAO,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;gBACtE,IAAI,CAAC,SAAS,CAAc,QAAQ,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;gBACzE,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAA6B,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;oBACtI,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,UAAU,GAAG,UAAU,CAA6B,UAAU,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;wBAC3I,IAAI,CAAC,mBAAmB,CACtB,SAAS,EAAE,SAAS,EAAE,oBAAoB,EAC1C,UAAU,EAAE,UAAU,EAAE,qBAAqB,EAC7C,OAAO,CAAC,CAAC;oBACb,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,QAAQ,CAAc,OAAO,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;gBACrE,IAAI,CAAC,QAAQ,CAAc,QAAQ,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;YAC1E,CAAC;iBAAM,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC3C,IAAI,CAAC,uBAAuB,CAAc,OAAO,EAAE,QAAQ,EAAE,qBAAqB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YACtG,CAAC;iBAAM,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5C,IAAI,CAAC,uBAAuB,CAAc,QAAQ,EAAE,OAAO,EAAE,oBAAoB,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;YACpG,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,uBAAuB,CACpC,OAAmC,EACnC,QAAoC,EACpC,qBAAmD,EACnD,WAAoB,EACpB,OAA0C;QAE1C,MAAM,CAAC,QAAQ,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;QACzC,kGAAkG;QAClG,wJAAwJ;QACxJ,IAAI,SAAiD,CAAC;QACtD,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAA6B,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;YACtI,IAAI,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjE,IAAI,CAAC,wBAAwB,CAAc,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;gBACxG,IAAI,CAAC,6BAA6B,CAAc,SAAS,CAAC,QAAQ,EAAE,qBAAqB,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;gBACjH,IAAI,CAAC,uBAAuB,CAAc,SAAS,EAAE,QAAQ,EAAE,qBAAqB,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;YAC9G,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,qBAAqB,CACjC,QAAoC,EACpC,SAAqC,EACrC,OAA0C;QAE1C,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;IACzE,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,YAAY;IACvB,gCAAgC;IACzB,MAAM,CAAC,qBAAqB,CAAc,IAAgC;QAC/E,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,eAAe,CAAC,CAAC,KAAiC,EAAW,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kCAAkC;IAC3B,MAAM,CAAC,wBAAwB,CAAc,IAAgC;QAClF,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,eAAe,CAClB,CAAC,IAAgC,EAAW,EAAE,GAAG,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAClG,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;OAQG;IACK,MAAM,CAAC,sBAAsB,CACnC,MAA4B,EAC5B,OAAiC,EACjC,MAAc,EACd,MAAc,EACd,WAAmB;QACnB,MAAM,YAAY,GAAkB,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACvC,iDAAiD;QACjD,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,YAAY,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,KAAK,CAAC,WAAW,CAAC,mBAAmB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;IACrE,CAAC;IACD;;;;;;;;;;OAUG;IACK,MAAM,CAAC,4BAA4B,CACzC,MAA4B,EAC5B,OAAiC,EACjC,MAAc,EACd,MAAc,EACd,WAAmB,EACnB,eAAuB,EACvB,iBAAyB;QAEzB,IAAI,MAAM,GAAG,WAAW;YACtB,MAAM,GAAG,WAAW,CAAC;QAEvB,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAClD,MAAM,kBAAkB,GAAG,eAAe,GAAG,iBAAiB,CAAC;QAC/D,gFAAgF;QAEhF,IAAI,MAAM,IAAI,MAAM,GAAG,kBAAkB,EAAE,CAAC,CAAE,mEAAmE;YAC/G,uDAAuD;YACvD,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,iBAAiB,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,iBAAiB,EAAE,MAAM,CAAC,EAAE,CAAC;gBACtI,MAAM,IAAI,GAAG,YAAY,CAAC,sBAAsB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC/F,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;oBACtC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC,CAAE,qDAAqD;YAC7D,qDAAqD;YACrD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC;YAClE,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,CAAC,EAAE,CAAC;gBACxH,MAAM,KAAK,GAAG,IAAI,CAAC,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,iBAAiB,CAAC,CAAC;gBAClI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;oBACvC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrG,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAA4B,EAC5B,OAAiC,EACjC,WAAmB,EACnB,qBAA6B,CAAC,EAC9B,oBAA4B,CAAC;QAE7B,iBAAiB;QACjB,6CAA6C;QAC7C,4BAA4B;QAC5B,IAAI,WAAW,IAAI,CAAC;eACf,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,CAAC;eACxD,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,CAAC;YAC7D,OAAO,SAAS,CAAC;QACnB,IAAI,kBAAkB,GAAG,CAAC;YACxB,kBAAkB,GAAG,CAAC,CAAC;QACzB,OAAO,YAAY,CAAC,4BAA4B,CAAc,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,WAAW,EAAE,kBAAkB,EAAE,iBAAiB,CAAC,CAAC;IACrJ,CAAC;CACF","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 RangeSearch\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Range3d } from \"../../geometry3d/Range\";\n\n/** Type name FlexData is shorthand for a member or parameter which can be:\n * * undefined\n * * an array of values of type T\n * * a singleton of type T\n */\ntype FlexData<T> = undefined | T[] | T;\n/**\n * Type name IndexToType is shorthand for a member or parameter which can be:\n * * an array of values of type T\n * * a function from integers to type T.\n */\ntype IndexToType<T> = T[] | ((index: number) => T);\n\n/**\n * Map an (unchecked) integer to a parameterized type T, where the data argument can be either:\n * * an array of type T\n * * a function which takes an index and returns type T\n * @internal\n */\nfunction evaluateIndexToType<T>(data: IndexToType<T>, index: number): T {\n  if (Array.isArray(data))\n    return data[index];\n  return data(index);\n}\n/**\n * Get data by index from a source that may be undefined, an array of item of type T, or a singleton of the item type.\n * @internal\n */\nfunction getByIndex<T>(index: number, data: FlexData<T>): T | undefined {\n  if (data !== undefined) {\n    if (Array.isArray(data)) {\n      if (index < data.length)\n        return data[index];\n    } else {\n      return data;\n    }\n  }\n  return undefined;\n}\n/**\n * Return the number of items in an object that can be undefined, an array of item of type T, or a singleton of the item type.\n * @internal\n */\nfunction getFlexDataCount<T>(data: FlexData<T>): number {\n  if (data !== undefined) {\n    if (Array.isArray(data)) {\n      return data.length;\n    } else {\n      return 1;\n    }\n  }\n  return 0;\n}\n/**\n * Abstract class for handler objects called during traversal of a single range tree.\n * @internal\n */\nexport abstract class SingleTreeSearchHandler<AppDataType> {\n  /** Return true if appData within the range should be offered to `processAppData`. */\n  public abstract isRangeActive(range: Range3d): boolean;\n  /**\n   * Called for a (single) child referenced by a tree.\n   * * This is only called when range checks on the path from root have been passed.\n   * @param item child (of type AppDataType) in the tree.\n   */\n  public abstract processAppData(item: AppDataType): void;\n  /**\n   * Query to see if the active search has been aborted.\n   * * Default implementation returns false so query runs to completion.\n   * * Search processes check this after range tests and child processing.\n   */\n  // eslint-disable-next-line @itwin/prefer-get\n  public isAborted(): boolean { return false; }\n}\n/**\n * Abstract class for handler objects called during traversal of two range trees.\n * @internal\n */\nexport abstract class TwoTreeSearchHandler<AppDataType> {\n  /** Return true if appData within the ranges should be offered to `processAppDataPair`. */\n  public abstract isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean;\n  /**\n   * Called with AppDataType items from left tree and right tree.\n   * * This is only called when range tests have been passed.\n   * @param leftItem\n   * @param rightItem\n   */\n  public abstract processAppDataPair(leftItem: AppDataType, rightItem: AppDataType): void;\n  /**\n   * Query to see if the active search has been aborted.\n   * * Default implementation returns false so query runs to completion.\n   * * Search processes check this after range tests and child processing.\n   */\n  // eslint-disable-next-line @itwin/prefer-get\n  public isAborted(): boolean { return false; }\n}\n/**\n * This class refines the TwoTreeSearchHandler with an implementation of `isRangePairActive` appropriate for computing the minimum distance between trees.\n * * The concrete class must implement `getCurrentDistance()` method to provide the best-so-far distance.\n * * The implementation of `isRangePairActive` returns true if the distance between ranges is less than or equal to the `getCurrentDistance()` value.\n * @internal\n */\nexport abstract class TwoTreeDistanceMinimizationSearchHandler<AppDataType> extends TwoTreeSearchHandler<AppDataType>{\n  /**\n   * Provides the allowable distance between ranges.\n   * * Range pairs with more than this distance separation are rejected.\n   * * The implementation may alter (probably reduce) the getCurrentDistance() value as the search progresses.\n   */\n  public abstract getCurrentDistance(): number;\n  /**\n   * Method called to decide whether to process subtrees and immediate child appData items from a left tree node and right tree node.\n   * @param leftRange range from a node in the left tree\n   * @param rightRange range from a node in the right tree.\n   * @returns true if the smallest distance from leftRange to rightRange is less than or equal to getCurrentDistance()\n   */\n  public override isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean {\n    const currentDistance = this.getCurrentDistance();\n    const distanceBetweenRanges = leftRange.distanceToRange(rightRange);\n    if (distanceBetweenRanges <= currentDistance) {\n      return true;\n    }\n    return false;\n  }\n}\n\nlet numNodeCreated = 0;\n\n/**\n * * TREE STRUCTURE\n *   * A RangeTreeNode is part of a range tree.\n *   * TREE is used here in a strictly _structural_ sense, which has no broad promises about data members.\n *   * Each RangeNode points to 0, 1 or many children.\n *   * Each child has (but does not point back to) a single parent.\n *   * The overall tree has a single root.\n *   * Each node is effectively the root of the tree of its children.\n * * NON-TREE DATA MEMBERS\n *   * Data members in each node (in addition to children) are\n *     * _range = the union of ranges below in the heap\n *     * _appData = application data associated with the node.\n *       * Construction methods may place multiple _appData items in each node.\n *       * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.\n * * CONSTRUCTION\n *   * The RangeTreeNode.createByIndexSplits method constructs the tree with simple right-left splits within an array of input items.\n *     * The appData is placed entirely in the leaves.\n *     * The caller can specify:\n *       * the number of _appData items per leaf\n *       * the number of children per node within the tree.\n *     * Compared to \"shallow\" trees with many children per node and many appData per leaf, \"deep\" trees with 2 children per node and 1 appData per leaf may have:\n *       * faster search because lower nodes have smaller ranges that will be skipped by search algorithms.\n *       * larger memory use because of more nodes\n *   * For future construction methods:\n *      * _appData \"above the leaves\" may allow nodes below to have smaller ranges, but add complexity to search.\n * @internal\n */\nexport class RangeTreeNode<AppDataType> {\n  private _range: Range3d;\n  private _appData: FlexData<AppDataType>;\n  private _children: FlexData<RangeTreeNode<AppDataType>>;\n  /** an id assigned sequentially as nodes are created.  For debugging use only. */\n  private _id: number;\n  /**\n   * CONSTRUCTOR\n   * CAPTURE (not copy)\n   * * range = range for search algorithms\n   * * appData = application data relevant to this node.\n   * * children = child node reference(s).\n   */\n  private constructor(range: Range3d, appData: FlexData<AppDataType>, children: FlexData<RangeTreeNode<AppDataType>>) {\n    this._range = range;\n    this._appData = appData;\n    this._children = children;\n    this._id = numNodeCreated++;\n    // const childIds: number[] = [];\n    // if (Array.isArray(this._children))\n    //   for (const c of this._children) childIds.push(c._id);\n    // else if (this._children instanceof RangeTreeNode)\n    //   childIds.push(this._children._id);\n    // const numAppData = getFlexDataCount(appData);\n    // console.log({ id: this._id, childIds, numAppData });\n  }\n  /** Simplest public create: capture the range, appData, and children. */\n  public static createCapture<AppDataType>(\n    range: Range3d,\n    appData: FlexData<AppDataType>,\n    children: FlexData<RangeTreeNode<AppDataType>>): RangeTreeNode<AppDataType> {\n    return new RangeTreeNode<AppDataType>(range, appData, children);\n  }\n  /** copy (not capture) from given data into the range in this RangeEntry */\n  public setRange(data: Range3d) {\n    this._range.setFrom(data);\n  }\n  /** return (a copy of) the range in this RangeEntry */\n  public getRange(data?: Range3d): Range3d {\n    return this._range.clone(data);\n  }\n  /** return (a reference to) the range in this RangeEntry */\n  public getRangeRef(): Range3d {\n    return this._range;\n  }\n  /**\n   * Access a child by index.\n   * * If the child data is an array, this dereferences the array.\n   * * If the child data is a singleton, treat it as index 0.\n   * * return undefined if there are no children.\n   * @param index index of item to access.\n   */\n  public getChildByIndex(index: number): RangeTreeNode<AppDataType> | undefined {\n    return getByIndex<RangeTreeNode<AppDataType>>(index, this._children);\n  }\n  /**\n   * * Access an appData by index.\n   * * If the appData data is an array, this dereferences the array.\n   * * If the appData data is a singleton, treat it as if it is at index 0 in an array\n   * * return undefined if there are no appData or for any index out of range.\n   * @param index index of item to access.\n   */\n  public getAppDataByIndex(index: number): AppDataType | undefined {\n    return getByIndex<AppDataType>(index, this._appData);\n  }\n  /** Access the children or child (does not clone). */\n  public getAllChildren(): FlexData<RangeTreeNode<AppDataType>> {\n    return this._children;\n  }\n  /** Access the appData array or singleton (does not clone). */\n  public getAllAppData(): FlexData<AppDataType> {\n    return this._appData;\n  }\n  /**\n   * Count the direct children in this node of the tree.\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveNodeCount`.\n   */\n  public getNumChildren(): number {\n    return getFlexDataCount(this._children);\n  }\n  /**\n   * Count the appData items in this node of the tree.\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveAppDataCount`.\n   */\n  public getNumAppData(): number {\n    return getFlexDataCount(this._appData);\n  }\n  /**\n   * Depth-first tree iteration, calling `announceNode` on each node.\n   * @param announceNode callback that returns true to recurse into children\n   */\n  public recurseIntoTree(announceNode: (node: RangeTreeNode<AppDataType>) => boolean) {\n    const doChildren = announceNode(this);\n    if (doChildren) {\n      if (Array.isArray(this._children)) {\n        for (const child of this._children)\n          child.recurseIntoTree(announceNode);\n      } else if (this._children !== undefined) {\n        this._children.recurseIntoTree(announceNode);\n      }\n    }\n  }\n  /**\n   * Depth-first tree iteration via handler.\n   * * if handler decides the instance range is active, process appData, then recurse on children\n   * * if handler decides to abort after processing an appData, skip processing rest of appData and children\n   */\n  public searchTopDown(handler: SingleTreeSearchHandler<AppDataType>) {\n    if (handler.isRangeActive(this._range)) {\n      let itemToProcess: AppDataType | undefined;\n      for (let i = 0; undefined !== (itemToProcess = this.getAppDataByIndex(i)); i++) {\n        // console.log(itemToProcess);\n        handler.processAppData(itemToProcess);\n        if (handler.isAborted())\n          return;\n      }\n      let child: RangeTreeNode<AppDataType> | undefined;\n      for (let i = 0; undefined !== (child = this.getChildByIndex(i)); i++) {\n        child.searchTopDown(handler);\n      }\n    }\n  }\n\n  /**\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightStack.\n   * @param leftAppData singleton or array with data \"from left\"\n   * @param rightStack stack of nodes to process from right path.\n   * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.\n   * @param handler search handler\n   */\n  private static processAppDataAndAppDataStack<AppDataType>(\n    leftAppData: FlexData<AppDataType>,\n    rightStack: RangeTreeNode<AppDataType>[],\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    if (leftAppData !== undefined) {\n      let leftItem: AppDataType | undefined;\n      let rightItem: AppDataType | undefined;\n      // hmm.. we ASSUME that if the tip ranges passed, then all parent ranges would pass without further test.\n      for (let rangeIndex = rightStack.length; rangeIndex-- > 0;) {\n        const rightAppData = rightStack[rangeIndex]._appData;\n        for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\n          for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\n            if (!reverseArgs)\n              handler.processAppDataPair(leftItem, rightItem);\n            else\n              handler.processAppDataPair(rightItem, leftItem);\n            if (handler.isAborted())\n              return;\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightAppData.\n   * @param leftAppData singleton or array with data \"from left\"\n   * @param rightAppData singleton or array with data \"from right\"\n   * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.\n   * @param handler search handler\n   */\n  private static processAppDataAndAppData<AppDataType>(\n    leftAppData: FlexData<AppDataType>,\n    rightAppData: FlexData<AppDataType>,\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    if (leftAppData !== undefined && rightAppData !== undefined) {\n      let leftItem: AppDataType | undefined;\n      let rightItem: AppDataType | undefined;\n      for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\n        for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\n          if (!reverseArgs)\n            handler.processAppDataPair(leftItem, rightItem);\n          else\n            handler.processAppDataPair(rightItem, leftItem);\n          if (handler.isAborted())\n            return;\n        }\n      }\n    }\n  }\n  /**\n   * Push the tip node to stack(s).\n   * @param tip new node (to be pushed)\n   * @param fullPath complete path, which is always extended\n   * @param partialPath partial path, which is only extended if the tip has _appData.\n   */\n  private static pushPaths<AppDataType>(\n    tip: RangeTreeNode<AppDataType>,\n    fullPath: RangeTreeNode<AppDataType>[],\n    partialPath: RangeTreeNode<AppDataType>[],\n  ) {\n    fullPath.push(tip);\n    if (tip._appData !== undefined) {\n      partialPath.push(tip);\n    }\n  }\n  /**\n   * Pop the tip node from stack(s).\n   * @param tip should match the fullPath tip.\n   * @param fullPath complete path, which is always popped\n   * @param partialPath partial path, which is only popped if the tip has _appData.\n   */\n  private static popPaths<AppDataType>(\n    tip: RangeTreeNode<AppDataType>,\n    fullPath: RangeTreeNode<AppDataType>[],\n    partialPath: RangeTreeNode<AppDataType>[],\n  ) {\n    assert(fullPath[fullPath.length - 1] === tip);\n    fullPath.pop();\n    if (tip._appData !== undefined) {\n      partialPath.pop();\n    }\n  }\n  /**\n   * Process nodes from left and right trees of dual search.\n   * * The separate stacks for nodes that have appData is for efficiency.\n   * * If data is entirely in the leaves (or just in a few nodes), the stacks will all be empty (or very small) and no time will be wasted looking up the stacks for appData to process with the other tip.\n   * @param leftTip tip node being explored on left\n   * @param leftStack stack of prior left nodes\n   * @param leftStackWithAppData stack of prior left nodes which have appData.\n   * @param rightTip tip node being explored on right.\n   * @param rightStack stack of prior right nodes.\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\n   * @param handler search handler\n   */\n  private static recursivePairSearch<AppDataType>(\n    leftTip: RangeTreeNode<AppDataType>,\n    leftStack: RangeTreeNode<AppDataType>[],\n    leftStackWithAppData: RangeTreeNode<AppDataType>[],\n    rightTip: RangeTreeNode<AppDataType>,\n    rightStack: RangeTreeNode<AppDataType>[],\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    // console.log({ leftId: leftTip._id, rightId: rightTip._id });\n    const leftTipHasAppData = leftTip._appData !== undefined;\n    const rightTipHasAppData = rightTip._appData !== undefined;\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\n    let rightChild: RangeTreeNode<AppDataType> | undefined;\n\n    // process immediate appData from each tip node with the entire prior path of the other side (each stack currently lacks the tip).\n    if (leftTipHasAppData && rightStackWithAppData.length > 0) {\n      this.processAppDataAndAppDataStack<AppDataType>(leftTip._appData, rightStackWithAppData, false, handler);\n    }\n    if (leftStackWithAppData.length > 0 && rightTipHasAppData) {\n      this.processAppDataAndAppDataStack<AppDataType>(rightTip._appData, leftStackWithAppData, true, handler);\n    }\n\n    if (handler.isRangePairActive(leftTip._range, rightTip._range)) {\n      this.processAppDataAndAppData<AppDataType>(leftTip._appData, rightTip._appData, false, handler);\n\n      if (leftTip._children !== undefined && rightTip._children !== undefined) {\n        this.pushPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\n        this.pushPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\n        for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\n          for (let rightIndex = 0; undefined !== (rightChild = getByIndex<RangeTreeNode<AppDataType>>(rightIndex, rightTip._children)); rightIndex++) {\n            this.recursivePairSearch(\n              leftChild, leftStack, leftStackWithAppData,\n              rightChild, rightStack, rightStackWithAppData,\n              handler);\n          }\n        }\n        this.popPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\n        this.popPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\n      } else if (leftTip._children !== undefined) {\n        this.leftRecursivePairSearch<AppDataType>(leftTip, rightTip, rightStackWithAppData, false, handler);\n      } else if (rightTip._children !== undefined) {\n        this.leftRecursivePairSearch<AppDataType>(rightTip, leftTip, leftStackWithAppData, true, handler);\n      }\n    }\n  }\n  /**\n   * Recurse below the tip of leftTip, offering each level's appData to the appData of rightTip and rightStackWithAppData.\n   * @param leftTip tip node being explored on left. Its appData is not processed.\n   * @param rightTip tip node being explored on right. It has no children.\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\n   * @param reverseArgs true if the caller is exchanging the sense of left and right\n   * @param handler search handler\n   */\n  private static leftRecursivePairSearch<AppDataType>(\n    leftTip: RangeTreeNode<AppDataType>,\n    rightTip: RangeTreeNode<AppDataType>,\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    assert(rightTip._children === undefined);\n    // The (possibly deep) left children appData needs to be offered to the right path (including tip)\n    // Note that there are no stack push/pop operations -- the right stack is already reaching to leaf level, so there are no range or appData nodes to add.\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\n    for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\n      if (handler.isRangePairActive(leftChild._range, rightTip._range)) {\n        this.processAppDataAndAppData<AppDataType>(leftChild._appData, rightTip._appData, reverseArgs, handler);\n        this.processAppDataAndAppDataStack<AppDataType>(leftChild._appData, rightStackWithAppData, reverseArgs, handler);\n        this.leftRecursivePairSearch<AppDataType>(leftChild, rightTip, rightStackWithAppData, reverseArgs, handler);\n      }\n    }\n  }\n  /**\n   * Recursive search down two trees, with range tests and child processing under control of a handler.\n   * @param leftRoot root of left tree\n   * @param rightRoot root of right tree\n   * @param handler handler for range tests and child process\n   */\n  public static searchTwoTreesTopDown<AppDataType>(\n    leftRoot: RangeTreeNode<AppDataType>,\n    rightRoot: RangeTreeNode<AppDataType>,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    this.recursivePairSearch(leftRoot, [], [], rightRoot, [], [], handler);\n  }\n}\n/**\n * Utilities for various operations on RangeTree\n * @internal\n */\nexport class RangeTreeOps {\n  /** Count nodes in this tree. */\n  public static getRecursiveNodeCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\n    let count = 0;\n    root.recurseIntoTree((_node: RangeTreeNode<AppDataType>): boolean => { count++; return true; });\n    return count;\n  }\n  /** Count appData in this tree. */\n  public static getRecursiveAppDataCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\n    let count = 0;\n    root.recurseIntoTree(\n      (node: RangeTreeNode<AppDataType>): boolean => { count += node.getNumAppData(); return true; });\n    return count;\n  }\n  /**\n   * Create a leaf referencing appData items indexed index0<=index<index1 and with combined range of the same indices\n   * @param ranges access to ranges\n   * @param appData access to AppDataType items\n   * @param index0 first index for block of items\n   * @param index1 upper limit index for block of items.\n   * @param arrayLength one more than the largest range/appData index\n   * @returns newly created node.\n   */\n  private static createLeafInIndexRange<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    index0: number,\n    index1: number,\n    arrayLength: number): RangeTreeNode<AppDataType> {\n    const appDataBlock: AppDataType[] = [];\n    const range = Range3d.createNull();\n    index1 = Math.min(index1, arrayLength);\n    // console.log({ case: \"LEAF\", index0, index1 });\n    for (let i = index0; i < index1; i++) {\n      appDataBlock.push(evaluateIndexToType(appData, i));\n      range.extendRange(evaluateIndexToType(ranges, i));\n    }\n    return RangeTreeNode.createCapture(range, appDataBlock, undefined);\n  }\n  /**\n   * Split the array entries appData[index0 <= i < index1] into blocks of at most maxChildPerNode * maxAppDataPerLeaf and assemble into a tree structure.\n   * @param ranges access to ranges\n   * @param appData access to AppDataType items\n   * @param index0 start index of the block to access\n   * @param index1 terminal index for the block (one after final)\n   * @param arrayLength one more than the largest range/appData index\n   * @param maxChildPerNode max number of child nodes in each interior node\n   * @param maxAppDataPerLeaf max number of appData items in each leaf.\n   * @returns\n   */\n  private static createRecursiveByIndexSplits<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    index0: number,\n    index1: number,\n    arrayLength: number,\n    maxChildPerNode: number,\n    maxAppDataPerLeaf: number,\n  ): RangeTreeNode<AppDataType> | undefined {\n    if (index1 > arrayLength)\n      index1 = arrayLength;\n\n    const range = Range3d.createNull();\n    const children: RangeTreeNode<AppDataType>[] = [];\n    const maxChildrenAppData = maxChildPerNode * maxAppDataPerLeaf;\n    // console.log({ name: \"createRecursive\", index0, index1, maxChildrenAppData });\n\n    if (index1 <= index0 + maxChildrenAppData) {  // index range is small enough to hold the appData in leaf children\n      // console.log({ case: \"LEAF GROUP\", index0, index1 });\n      for (let indexA = index0 + maxAppDataPerLeaf; index0 < index1; index0 = indexA, indexA = Math.min(indexA + maxAppDataPerLeaf, index1)) {\n        const leaf = RangeTreeOps.createLeafInIndexRange(ranges, appData, index0, indexA, arrayLength);\n        if (leaf !== undefined) {\n          range.extendRange(leaf.getRangeRef());\n          children.push(leaf);\n        }\n      }\n    } else {  // split the appData among interior and leaf children\n      // console.log({ case: \"INTERIOR\", index0, index1 });\n      const numPerGulp = Math.ceil((index1 - index0) / maxChildPerNode);\n      for (let indexA = index0 + numPerGulp; index0 < index1; index0 = indexA, indexA = Math.min(indexA + numPerGulp, index1)) {\n        const child = this.createRecursiveByIndexSplits(ranges, appData, index0, indexA, arrayLength, maxChildPerNode, maxAppDataPerLeaf);\n        if (child !== undefined) {\n          range.extendRange(child.getRangeRef());\n          children.push(child);\n        }\n      }\n    }\n    return (children.length > 0) ? RangeTreeNode.createCapture(range, undefined, children) : undefined;\n  }\n  /**\n   * Create a range tree by simple left-right split of given ranges.\n   * * Leaves carry the inputs in left-to-right order.\n   * * Each leaf range is labeled by its corresponding object(s) in the appData array.\n   * @param ranges access to ranges.\n   * @param appData access to AppDataType items (for leaves).\n   * @param arrayLength one more than the largest range/appData index\n   * @param maxChildrenPerNode max number of child nodes allowed for each interior node.\n   * @param maxAppDataPerLeaf max number of appData items allowed in each leaf.\n   * @returns the root of the new tree, or undefined if array lengths differ or are zero.\n   */\n  public static createByIndexSplits<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    arrayLength: number,\n    maxChildrenPerNode: number = 2,\n    maxAppDataPerLeaf: number = 2,\n  ): RangeTreeNode<AppDataType> | undefined {\n    // console.log();\n    // const numData = getFlexDataCount(appData);\n    // console.log({ numData });\n    if (arrayLength <= 0\n      || (Array.isArray(ranges) && ranges.length !== arrayLength)\n      || (Array.isArray(appData) && appData.length !== arrayLength))\n      return undefined;\n    if (maxChildrenPerNode < 2)\n      maxChildrenPerNode = 2;\n    return RangeTreeOps.createRecursiveByIndexSplits<AppDataType>(ranges, appData, 0, arrayLength, arrayLength, maxChildrenPerNode, maxAppDataPerLeaf);\n  }\n}\n\n"]}

package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.d.ts

@@ -1,18 +1,19 @@
 /** @packageDocumentation
  * @module Polyface
  */
+import { ClipPlane } from "../../clipping/ClipPlane";
+import { ConvexClipPlaneSet } from "../../clipping/ConvexClipPlaneSet";
 import { GrowableXYZArray } from "../../geometry3d/GrowableXYZArray";
+import { IndexedXYZCollection } from "../../geometry3d/IndexedXYZCollection";
 import { Point3d, Vector3d } from "../../geometry3d/Point3dVector3d";
-import { AnnounceDrapePanel } from "../PolyfaceQuery";
 import { Polyface } from "../Polyface";
-import { ClipPlane } from "../../clipping/ClipPlane";
-import { ConvexClipPlaneSet } from "../../clipping/ConvexClipPlaneSet";
+import { AnnounceDrapePanel } from "../PolyfaceQuery";
 export declare class SweepLineStringToFacetContext {
     private _spacePoints;
     private _spacePointsRange;
     private _numSpacePoints;
     private constructor();
-    static create(xyz: GrowableXYZArray): SweepLineStringToFacetContext | undefined;
+    static create(xyz: IndexedXYZCollection): SweepLineStringToFacetContext | undefined;
     private _segmentPoint0;
     private _segmentPoint1;
     private _localSegmentPoint0;
@@ -41,7 +42,7 @@ export declare class EdgeClipData {
     /** create object from segment and sweep. Inputs are not captured. */
     static createPointPointSweep(pointA: Point3d, pointB: Point3d, sweep: Vector3d): EdgeClipData | undefined;
     /** Intersect this edge plane with the given convex polygon and announce the intersection segment to the callback. */
-    processPolygon(polygon: Point3d[] | GrowableXYZArray, announceEdge: (pointA: Point3d, pointB: Point3d) => void): void;
+    processPolygon(polygon: Point3d[] | IndexedXYZCollection, announceEdge: (pointA: Point3d, pointB: Point3d) => void): void;
 }
 /**
  * Context for sweeping a line string onto a convex polygon.
@@ -53,7 +54,7 @@ export declare class ClipSweptLineStringContext {
     private _worldToLocal?;
     private _localRange?;
     private constructor();
-    static create(xyz: GrowableXYZArray, sweepVector: Vector3d | undefined): ClipSweptLineStringContext | undefined;
+    static create(xyz: IndexedXYZCollection, sweepVector: Vector3d | undefined): ClipSweptLineStringContext | undefined;
     /**
      * Intersect a polygon with each of the edgeClippers.
      * * If transforms and local range are defined, test the polygon's local range to see if it offers a quick exit.

package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"SweepLineStringToFacetContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/SweepLineStringToFacetContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AAErE,OAAO,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAGtD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACrD,OAAO,EAAE,kBAAkB,EAAE,MAAM,mCAAmC,CAAC;AAIvE,qBAAa,6BAA6B;IACxC,OAAO,CAAC,YAAY,CAAmB;IACvC,OAAO,CAAC,iBAAiB,CAAU;IACnC,OAAO,CAAC,eAAe,CAAS;IAChC,OAAO;WAMO,MAAM,CAAC,GAAG,EAAE,gBAAgB,GAAG,6BAA6B,GAAG,SAAS;IAQtF,OAAO,CAAC,cAAc,CAAoB;IAC1C,OAAO,CAAC,cAAc,CAAoB;IAC1C,OAAO,CAAC,mBAAmB,CAAoB;IAC/C,OAAO,CAAC,mBAAmB,CAAoB;IAC/C,OAAO,CAAC,cAAc,CAA0B;IAChD,OAAO,CAAC,WAAW,CAA8B;IACjD,OAAO,CAAC,aAAa,CAAoB;IAEzC;;OAEG;IACI,gBAAgB,CAAC,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,kBAAkB,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM;CAoDhI;AAED;;;GAGG;AACH,qBAAa,YAAY;IACvB,iDAAiD;IAC1C,SAAS,EAAE,SAAS,CAAC;IAC5B,gEAAgE;IACzD,IAAI,EAAE,kBAAkB,CAAC;IAChC,oCAAoC;IACpC,OAAO,CAAC,eAAe,CAAY;IAEnC,yBAAyB;gBACN,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,kBAAkB;IAKjE,qEAAqE;WACvD,qBAAqB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,GAAG,YAAY,GAAG,SAAS;IAiBhH,qHAAqH;IAC9G,cAAc,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,gBAAgB,EAAE,YAAY,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,KAAK,IAAI;CAgBtH;AACD;;;GAGG;AACH,qBAAa,0BAA0B;IACrC,OAAO,CAAC,aAAa,CAAiB;IACtC,OAAO,CAAC,aAAa,CAAC,CAAY;IAClC,OAAO,CAAC,aAAa,CAAC,CAAY;IAClC,OAAO,CAAC,WAAW,CAAC,CAAU;IAC9B,OAAO;WAQO,MAAM,CAAC,GAAG,EAAE,gBAAgB,EAAE,WAAW,EAAE,QAAQ,GAAG,SAAS,GAAG,0BAA0B,GAAG,SAAS;IA2BtH;;;OAGG;IACI,cAAc,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,YAAY,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,KAAK,IAAI;CAUnG"}
+{"version":3,"file":"SweepLineStringToFacetContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/SweepLineStringToFacetContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACrD,OAAO,EAAE,kBAAkB,EAAE,MAAM,mCAAmC,CAAC;AAEvE,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EAAE,oBAAoB,EAAE,MAAM,uCAAuC,CAAC;AAE7E,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AAKrE,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAEtD,qBAAa,6BAA6B;IACxC,OAAO,CAAC,YAAY,CAAuB;IAC3C,OAAO,CAAC,iBAAiB,CAAU;IACnC,OAAO,CAAC,eAAe,CAAS;IAChC,OAAO;WAKO,MAAM,CAAC,GAAG,EAAE,oBAAoB,GAAG,6BAA6B,GAAG,SAAS;IAQ1F,OAAO,CAAC,cAAc,CAAoB;IAC1C,OAAO,CAAC,cAAc,CAAoB;IAC1C,OAAO,CAAC,mBAAmB,CAAoB;IAC/C,OAAO,CAAC,mBAAmB,CAAoB;IAC/C,OAAO,CAAC,cAAc,CAA0B;IAChD,OAAO,CAAC,WAAW,CAA8B;IACjD,OAAO,CAAC,aAAa,CAAoB;IAEzC;;OAEG;IACI,gBAAgB,CAAC,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,kBAAkB,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM;CAoDhI;AAED;;;GAGG;AACH,qBAAa,YAAY;IACvB,iDAAiD;IAC1C,SAAS,EAAE,SAAS,CAAC;IAC5B,gEAAgE;IACzD,IAAI,EAAE,kBAAkB,CAAC;IAChC,oCAAoC;IACpC,OAAO,CAAC,eAAe,CAAY;IAEnC,yBAAyB;gBACN,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,kBAAkB;IAKjE,qEAAqE;WACvD,qBAAqB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,GAAG,YAAY,GAAG,SAAS;IAiBhH,qHAAqH;IAC9G,cAAc,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,oBAAoB,EAAE,YAAY,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,KAAK,IAAI;CAgB1H;AACD;;;GAGG;AACH,qBAAa,0BAA0B;IACrC,OAAO,CAAC,aAAa,CAAiB;IACtC,OAAO,CAAC,aAAa,CAAC,CAAY;IAClC,OAAO,CAAC,aAAa,CAAC,CAAY;IAClC,OAAO,CAAC,WAAW,CAAC,CAAU;IAC9B,OAAO;WAQO,MAAM,CAAC,GAAG,EAAE,oBAAoB,EAAE,WAAW,EAAE,QAAQ,GAAG,SAAS,GAAG,0BAA0B,GAAG,SAAS;IA2B1H;;;OAGG;IACI,cAAc,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,YAAY,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,KAAK,IAAI;CAUnG"}

package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.js

@@ -5,28 +5,27 @@
 /** @packageDocumentation
  * @module Polyface
  */
-import { Transform } from "../../geometry3d/Transform";
-import { Point3d, Vector3d } from "../../geometry3d/Point3dVector3d";
-import { Segment1d } from "../../geometry3d/Segment1d";
-import { Range3d } from "../../geometry3d/Range";
-import { Geometry } from "../../Geometry";
 import { ClipPlane } from "../../clipping/ClipPlane";
 import { ConvexClipPlaneSet } from "../../clipping/ConvexClipPlaneSet";
-import { IndexedXYZCollectionPolygonOps, Point3dArrayPolygonOps } from "../../geometry3d/PolygonOps";
+import { Geometry } from "../../Geometry";
 import { Matrix3d } from "../../geometry3d/Matrix3d";
+import { Point3d, Vector3d } from "../../geometry3d/Point3dVector3d";
+import { IndexedXYZCollectionPolygonOps, Point3dArrayPolygonOps } from "../../geometry3d/PolygonOps";
+import { Range3d } from "../../geometry3d/Range";
+import { Segment1d } from "../../geometry3d/Segment1d";
+import { Transform } from "../../geometry3d/Transform";
 export class SweepLineStringToFacetContext {
     _spacePoints;
     _spacePointsRange;
     _numSpacePoints;
     constructor(spacePoints) {
         this._spacePoints = spacePoints;
-        this._spacePointsRange = new Range3d();
-        spacePoints.setRange(this._spacePointsRange);
+        this._spacePointsRange = spacePoints.getRange();
         this._numSpacePoints = this._spacePoints.length;
     }
     static create(xyz) {
         if (xyz.length > 1) {
-            return new SweepLineStringToFacetContext(xyz.clone());
+            return new SweepLineStringToFacetContext(xyz);
         }
         return undefined;
     }

package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.js.map

@@ -1 +1 @@
-{"version":3,"file":"SweepLineStringToFacetContext.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/SweepLineStringToFacetContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAEvD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AACrE,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAEvD,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,OAAO,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACrD,OAAO,EAAE,kBAAkB,EAAE,MAAM,mCAAmC,CAAC;AACvE,OAAO,EAAE,8BAA8B,EAAE,sBAAsB,EAAE,MAAM,6BAA6B,CAAC;AACrG,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAErD,MAAM,OAAO,6BAA6B;IAChC,YAAY,CAAmB;IAC/B,iBAAiB,CAAU;IAC3B,eAAe,CAAS;IAChC,YAAoB,WAA6B;QAC/C,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,iBAAiB,GAAG,IAAI,OAAO,EAAE,CAAC;QACvC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAC7C,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IAClD,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,GAAqB;QACxC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnB,OAAO,IAAI,6BAA6B,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,wEAAwE;IAChE,cAAc,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAClC,cAAc,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAClC,mBAAmB,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IACvC,mBAAmB,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IACvC,cAAc,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxC,WAAW,GAAG,SAAS,CAAC,cAAc,EAAE,CAAC;IACzC,aAAa,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAEzC;;OAEG;IACI,gBAAgB,CAAC,OAAyB,EAAE,QAA4B,EAAE,QAAkB,EAAE,SAAiB;QACpH,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACrC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC,IAAI,CAAC,iBAAiB,CAAC;YAC/D,OAAO,WAAW,CAAC;QACrB,aAAa;QACb,yCAAyC;QACzC,wEAAwE;QACxE,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC/C,WAAW,EAAE,CAAC;YACd,MAAM,KAAK,GAAG,OAAO,CAAC,wBAAwB,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAChF,IAAI,KAAK,EAAE,CAAC;gBACV,wCAAwC;gBACxC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,eAAe,EAAE,EAAE,EAAE,EAAE,CAAC;oBACjD,WAAW,EAAE,CAAC;oBACd,IAAI,CAAC,YAAY,CAAC,6BAA6B,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;oBAC7E,IAAI,CAAC,YAAY,CAAC,6BAA6B,CAAC,EAAE,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;oBACzE,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;oBAC5E,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;oBAC5E,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC9B,kEAAkE;oBAClE,IAAI,IAAI,CAAC,cAAc,CAAC,8BAA8B,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;2BACzG,IAAI,CAAC,cAAc,CAAC,8BAA8B,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;2BAC1G,IAAI,CAAC,cAAc,CAAC,8BAA8B,CACnD,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAC3D,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,CAAC;wBACjE,mDAAmD;wBACnD,WAAW,EAAE,CAAC;wBACd,MAAM,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;wBAClH,MAAM,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;wBAClH,MAAM,kBAAkB,GAAG,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,kBAAkB,CAAC,CAAC;wBAChF,MAAM,kBAAkB,GAAG,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,kBAAkB,CAAC,CAAC;wBAChF,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;wBAClG,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;wBAClG,MAAM,cAAc,GAAG,QAAQ,CAAC,oBAAoB,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;wBAC7G,kFAAkF;wBAClF,IAAI,cAAc,KAAK,SAAS,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC;4BACvH,WAAW,EAAE,CAAC;4BACd,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;4BAC1F,MAAM,YAAY,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,CAAG,6DAA6D;4BAC1G,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,kBAAkB,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;4BAChH,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,kBAAkB,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;wBAClH,CAAC;6BAAM,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAE,4BAA4B;4BACxE,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,kBAAkB,EAAE,kBAAkB,EAAE,WAAW,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;wBACrI,CAAC;6BAAM,4BAA4B;4BACjC,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,kBAAkB,EAAE,kBAAkB,EAAE,WAAW,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBACvI,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,YAAY;IACvB,iDAAiD;IAC1C,SAAS,CAAY;IAC5B,gEAAgE;IACzD,IAAI,CAAqB;IAChC,oCAAoC;IAC5B,eAAe,CAAY;IAEnC,yBAAyB;IACzB,YAAmB,SAAoB,EAAE,IAAwB;QAC/D,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,eAAe,GAAG,EAAE,CAAC;IAC5B,CAAC;IACD,qEAAqE;IAC9D,MAAM,CAAC,qBAAqB,CAAC,MAAe,EAAE,MAAe,EAAE,KAAe;QACnF,MAAM,UAAU,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,UAAU,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC;QAChE,sHAAsH;QACtH,gJAAgJ;QAChJ,MAAM,UAAU,GAAG,UAAU,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC;QAC3D,MAAM,MAAM,GAAG,SAAS,CAAC,oBAAoB,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAClE,MAAM,MAAM,GAAG,SAAS,CAAC,oBAAoB,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAClE,MAAM,SAAS,GAAG,SAAS,CAAC,sBAAsB,CAAC,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QAC9E,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5E,MAAM,CAAC,aAAa,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,kBAAkB,CAAC,YAAY,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;YAClE,OAAO,IAAI,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,qHAAqH;IAC9G,cAAc,CAAC,OAAqC,EAAE,YAAwD;QACnH,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC;QAChC,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YACxB,sBAAsB,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC;;YAE5F,8BAA8B,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC;QACtG,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtC,6DAA6D;YAC7D,IAAI,CAAC,IAAI,CAAC,+BAA+B,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAC9F,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE;gBACzB,YAAY,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAC3E,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtE,CAAC,CACF,CAAC;QACJ,CAAC;IACH,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,0BAA0B;IAC7B,aAAa,CAAiB;IAC9B,aAAa,CAAa;IAC1B,aAAa,CAAa;IAC1B,WAAW,CAAW;IAC9B,YAAoB,QAAwB,EAAE,SAAgG;QAC5I,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC;QAC9B,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC,YAAY,CAAC;YAC5C,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC,YAAY,CAAC;YAC5C,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC;QAC1C,CAAC;IACH,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,GAAqB,EAAE,WAAiC;QAC3E,IAAI,WAAW,KAAK,SAAS;YAC3B,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnB,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACnC,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACtC,MAAM,QAAQ,GAAmB,EAAE,CAAC;YACpC,GAAG,CAAC,+BAA+B,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAE9C,IAAI,kBAAkB,GAAG,QAAQ,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;YAClE,IAAI,kBAAkB,KAAK,SAAS;gBAClC,kBAAkB,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACjD,MAAM,YAAY,GAAG,SAAS,CAAC,qBAAqB,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;YAChF,MAAM,YAAY,GAAG,YAAY,CAAC,OAAO,EAAG,CAAC;YAC7C,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,GAAG,CAAC,+BAA+B,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;gBACjD,MAAM,OAAO,GAAG,YAAY,CAAC,qBAAqB,CAAC,KAAK,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;gBACjF,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;oBAC1B,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACxB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;YACD,OAAO,IAAI,0BAA0B,CAAC,QAAQ,EAAE,EAAE,YAAY,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,CAAC;QAC9F,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,cAAc,CAAC,OAAkB,EAAE,YAAwD;QAChG,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;YACvE,MAAM,YAAY,GAAG,OAAO,CAAC,sBAAsB,CAAC,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;YACjF,IAAI,CAAC,YAAY,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC;gBACnD,OAAO;QACX,CAAC;QACD,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACzC,OAAO,CAAC,cAAc,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;CACF","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 Polyface\n */\n\nimport { Transform } from \"../../geometry3d/Transform\";\nimport { GrowableXYZArray } from \"../../geometry3d/GrowableXYZArray\";\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Segment1d } from \"../../geometry3d/Segment1d\";\nimport { AnnounceDrapePanel } from \"../PolyfaceQuery\";\nimport { Range3d } from \"../../geometry3d/Range\";\nimport { Geometry } from \"../../Geometry\";\nimport { Polyface } from \"../Polyface\";\nimport { ClipPlane } from \"../../clipping/ClipPlane\";\nimport { ConvexClipPlaneSet } from \"../../clipping/ConvexClipPlaneSet\";\nimport { IndexedXYZCollectionPolygonOps, Point3dArrayPolygonOps } from \"../../geometry3d/PolygonOps\";\nimport { Matrix3d } from \"../../geometry3d/Matrix3d\";\n\nexport class SweepLineStringToFacetContext {\n  private _spacePoints: GrowableXYZArray;\n  private _spacePointsRange: Range3d;\n  private _numSpacePoints: number;\n  private constructor(spacePoints: GrowableXYZArray) {\n    this._spacePoints = spacePoints;\n    this._spacePointsRange = new Range3d();\n    spacePoints.setRange(this._spacePointsRange);\n    this._numSpacePoints = this._spacePoints.length;\n  }\n  public static create(xyz: GrowableXYZArray): SweepLineStringToFacetContext | undefined {\n    if (xyz.length > 1) {\n      return new SweepLineStringToFacetContext(xyz.clone());\n    }\n    return undefined;\n  }\n\n  // temporaries reused over multiple calls to process a single facet . ..\n  private _segmentPoint0 = Point3d.create();\n  private _segmentPoint1 = Point3d.create();\n  private _localSegmentPoint0 = Point3d.create();\n  private _localSegmentPoint1 = Point3d.create();\n  private _clipFractions = Segment1d.create(0, 1);\n  private _localFrame = Transform.createIdentity();\n  private _polygonRange = Range3d.create();\n\n  /** process a single polygon.\n   * @returns number crudely indicating how much work was done.\n   */\n  public projectToPolygon(polygon: GrowableXYZArray, announce: AnnounceDrapePanel, polyface: Polyface, readIndex: number): number {\n    polygon.setRange(this._polygonRange);\n    let workCounter = 0;\n    if (!this._polygonRange.intersectsRangeXY(this._spacePointsRange))\n      return workCounter;\n    // numTest++;\n    // For each triangle within the facet ...\n    // remark: this loop only runs once in triangle mesh, twice in quads ...\n    for (let k1 = 1; k1 + 1 < polygon.length; k1++) {\n      workCounter++;\n      const frame = polygon.fillLocalXYTriangleFrame(0, k1, k1 + 1, this._localFrame);\n      if (frame) {\n        // For each stroke of the linestring ...\n        for (let i1 = 1; i1 < this._numSpacePoints; i1++) {\n          workCounter++;\n          this._spacePoints.getPoint3dAtCheckedPointIndex(i1 - 1, this._segmentPoint0);\n          this._spacePoints.getPoint3dAtCheckedPointIndex(i1, this._segmentPoint1);\n          frame.multiplyInversePoint3d(this._segmentPoint0, this._localSegmentPoint0);\n          frame.multiplyInversePoint3d(this._segmentPoint1, this._localSegmentPoint1);\n          this._clipFractions.set(0, 1);\n          /** (x,y,1-x-y) are barycentric coordinates in the triangle !!! */\n          if (this._clipFractions.clipBy01FunctionValuesPositive(this._localSegmentPoint0.x, this._localSegmentPoint1.x)\n            && this._clipFractions.clipBy01FunctionValuesPositive(this._localSegmentPoint0.y, this._localSegmentPoint1.y)\n            && this._clipFractions.clipBy01FunctionValuesPositive(\n              1 - this._localSegmentPoint0.x - this._localSegmentPoint0.y,\n              1 - this._localSegmentPoint1.x - this._localSegmentPoint1.y)) {\n            /* project the local segment point to the plane. */\n            workCounter++;\n            const localClippedPointA = this._localSegmentPoint0.interpolate(this._clipFractions.x0, this._localSegmentPoint1);\n            const localClippedPointB = this._localSegmentPoint0.interpolate(this._clipFractions.x1, this._localSegmentPoint1);\n            const worldClippedPointA = this._localFrame.multiplyPoint3d(localClippedPointA);\n            const worldClippedPointB = this._localFrame.multiplyPoint3d(localClippedPointB);\n            const planePointA = this._localFrame.multiplyXYZ(localClippedPointA.x, localClippedPointA.y, 0.0);\n            const planePointB = this._localFrame.multiplyXYZ(localClippedPointB.x, localClippedPointB.y, 0.0);\n            const splitParameter = Geometry.inverseInterpolate01(this._localSegmentPoint0.z, this._localSegmentPoint1.z);\n            // emit 1 or 2 panels, oriented so panel normal is always to the left of the line.\n            if (splitParameter !== undefined && splitParameter > this._clipFractions.x0 && splitParameter < this._clipFractions.x1) {\n              workCounter++;\n              const piercePointX = this._segmentPoint0.interpolate(splitParameter, this._segmentPoint1);\n              const piercePointY = piercePointX.clone();   // so points are distinct for the two triangle announcements.\n              announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointA, piercePointX, planePointA], 2, 1);\n              announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointB, piercePointY, planePointB], 1, 2);\n            } else if (this._localSegmentPoint0.z > 0) {  // segment is entirely above\n              announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointA, worldClippedPointB, planePointB, planePointA], 3, 2);\n            } else // segment is entirely under\n              announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointB, worldClippedPointA, planePointA, planePointB], 2, 3);\n          }\n        }\n      }\n    }\n    return workCounter;\n  }\n}\n\n/**\n * Context for sweeping a line segment onto a convex polygon.\n * @internal\n */\nexport class EdgeClipData {\n  /** Plane containing the edge and sweep vector */\n  public edgePlane: ClipPlane;\n  /** Two clip planes facing each other at each end of the edge */\n  public clip: ConvexClipPlaneSet;\n  /** work array for clipper method */\n  private _crossingPoints: Point3d[];\n\n  /** CAPTURE the planes */\n  public constructor(edgePlane: ClipPlane, clip: ConvexClipPlaneSet) {\n    this.edgePlane = edgePlane;\n    this.clip = clip;\n    this._crossingPoints = [];\n  }\n  /** create object from segment and sweep. Inputs are not captured. */\n  public static createPointPointSweep(pointA: Point3d, pointB: Point3d, sweep: Vector3d): EdgeClipData | undefined {\n    const edgeVector = Vector3d.createStartEnd(pointA, pointB);\n    const fraction = edgeVector.fractionOfProjectionToVector(sweep);\n    // The unbounded plane of the swept edge will intersect facets in lines that may extend beyond the swept bounded line.\n    // That linework will be clipped between two facing planes with normal along the perpendicular dropped from the edge vector to the sweep vector.\n    const clipNormal = edgeVector.plusScaled(sweep, -fraction);\n    const planeA = ClipPlane.createNormalAndPoint(clipNormal, pointA);\n    const planeB = ClipPlane.createNormalAndPoint(clipNormal, pointB);\n    const edgePlane = ClipPlane.createOriginAndVectors(pointA, edgeVector, sweep);\n    if (planeA !== undefined && planeB !== undefined && edgePlane !== undefined) {\n      planeB.negateInPlace();\n      const clipper = ConvexClipPlaneSet.createPlanes([planeA, planeB]);\n      return new EdgeClipData(edgePlane, clipper);\n    }\n    return undefined;\n  }\n\n  /** Intersect this edge plane with the given convex polygon and announce the intersection segment to the callback. */\n  public processPolygon(polygon: Point3d[] | GrowableXYZArray, announceEdge: (pointA: Point3d, pointB: Point3d) => void) {\n    this._crossingPoints.length = 0;\n    if (Array.isArray(polygon))\n      Point3dArrayPolygonOps.polygonPlaneCrossings(this.edgePlane, polygon, this._crossingPoints);\n    else\n      IndexedXYZCollectionPolygonOps.polygonPlaneCrossings(this.edgePlane, polygon, this._crossingPoints);\n    if (this._crossingPoints.length === 2) {\n      // use the end planes to clip the [0,1] swept edge to [f0,f1]\n      this.clip.announceClippedSegmentIntervals(0, 1, this._crossingPoints[0], this._crossingPoints[1],\n        (f0: number, f1: number) => {\n          announceEdge(this._crossingPoints[0].interpolate(f0, this._crossingPoints[1]),\n            this._crossingPoints[0].interpolate(f1, this._crossingPoints[1]));\n        },\n      );\n    }\n  }\n}\n/**\n * Context for sweeping a line string onto a convex polygon.\n * @internal\n */\nexport class ClipSweptLineStringContext {\n  private _edgeClippers: EdgeClipData[];\n  private _localToWorld?: Transform;\n  private _worldToLocal?: Transform;\n  private _localRange?: Range3d;\n  private constructor(edgeData: EdgeClipData[], localData: undefined | { localToWorld: Transform, worldToLocal: Transform, localRange: Range3d }) {\n    this._edgeClippers = edgeData;\n    if (localData !== undefined) {\n      this._localToWorld = localData.localToWorld;\n      this._worldToLocal = localData.worldToLocal;\n      this._localRange = localData.localRange;\n    }\n  }\n  public static create(xyz: GrowableXYZArray, sweepVector: Vector3d | undefined): ClipSweptLineStringContext | undefined {\n    if (sweepVector === undefined)\n      sweepVector = Vector3d.create(0, 0, 1);\n    if (xyz.length > 1) {\n      const point = Point3d.createZero();\n      const newPoint = Point3d.createZero();\n      const edgeData: EdgeClipData[] = [];\n      xyz.getPoint3dAtUncheckedPointIndex(0, point);\n\n      let localToWorldMatrix = Matrix3d.createRigidHeadsUp(sweepVector);\n      if (localToWorldMatrix === undefined)\n        localToWorldMatrix = Matrix3d.createIdentity();\n      const localToWorld = Transform.createOriginAndMatrix(point, localToWorldMatrix);\n      const worldToLocal = localToWorld.inverse()!;\n      const localRange = xyz.getRange(worldToLocal);\n      for (let i = 1; i < xyz.length; i++) {\n        xyz.getPoint3dAtUncheckedPointIndex(i, newPoint);\n        const clipper = EdgeClipData.createPointPointSweep(point, newPoint, sweepVector);\n        if (clipper !== undefined) {\n          point.setFrom(newPoint);\n          edgeData.push(clipper);\n        }\n      }\n      return new ClipSweptLineStringContext(edgeData, { localToWorld, worldToLocal, localRange });\n    }\n    return undefined;\n  }\n  /**\n   * Intersect a polygon with each of the edgeClippers.\n   * * If transforms and local range are defined, test the polygon's local range to see if it offers a quick exit.\n   */\n  public processPolygon(polygon: Point3d[], announceEdge: (pointA: Point3d, pointB: Point3d) => void) {\n    if (this._worldToLocal !== undefined && this._localRange !== undefined) {\n      const polygonRange = Range3d.createTransformedArray(this._worldToLocal, polygon);\n      if (!polygonRange.intersectsRangeXY(this._localRange))\n        return;\n    }\n    for (const clipper of this._edgeClippers) {\n      clipper.processPolygon(polygon, announceEdge);\n    }\n  }\n}\n"]}
+{"version":3,"file":"SweepLineStringToFacetContext.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/SweepLineStringToFacetContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACrD,OAAO,EAAE,kBAAkB,EAAE,MAAM,mCAAmC,CAAC;AACvE,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAG1C,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AACrD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AACrE,OAAO,EAAE,8BAA8B,EAAE,sBAAsB,EAAE,MAAM,6BAA6B,CAAC;AACrG,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAIvD,MAAM,OAAO,6BAA6B;IAChC,YAAY,CAAuB;IACnC,iBAAiB,CAAU;IAC3B,eAAe,CAAS;IAChC,YAAoB,WAAiC;QACnD,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,iBAAiB,GAAG,WAAW,CAAC,QAAQ,EAAE,CAAC;QAChD,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IAClD,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,GAAyB;QAC5C,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnB,OAAO,IAAI,6BAA6B,CAAC,GAAG,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,wEAAwE;IAChE,cAAc,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAClC,cAAc,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAClC,mBAAmB,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IACvC,mBAAmB,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IACvC,cAAc,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxC,WAAW,GAAG,SAAS,CAAC,cAAc,EAAE,CAAC;IACzC,aAAa,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAEzC;;OAEG;IACI,gBAAgB,CAAC,OAAyB,EAAE,QAA4B,EAAE,QAAkB,EAAE,SAAiB;QACpH,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACrC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC,IAAI,CAAC,iBAAiB,CAAC;YAC/D,OAAO,WAAW,CAAC;QACrB,aAAa;QACb,yCAAyC;QACzC,wEAAwE;QACxE,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC/C,WAAW,EAAE,CAAC;YACd,MAAM,KAAK,GAAG,OAAO,CAAC,wBAAwB,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAChF,IAAI,KAAK,EAAE,CAAC;gBACV,wCAAwC;gBACxC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,eAAe,EAAE,EAAE,EAAE,EAAE,CAAC;oBACjD,WAAW,EAAE,CAAC;oBACd,IAAI,CAAC,YAAY,CAAC,6BAA6B,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;oBAC7E,IAAI,CAAC,YAAY,CAAC,6BAA6B,CAAC,EAAE,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;oBACzE,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;oBAC5E,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;oBAC5E,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC9B,kEAAkE;oBAClE,IAAI,IAAI,CAAC,cAAc,CAAC,8BAA8B,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;2BACzG,IAAI,CAAC,cAAc,CAAC,8BAA8B,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;2BAC1G,IAAI,CAAC,cAAc,CAAC,8BAA8B,CACnD,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAC3D,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,CAAC;wBACjE,mDAAmD;wBACnD,WAAW,EAAE,CAAC;wBACd,MAAM,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;wBAClH,MAAM,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;wBAClH,MAAM,kBAAkB,GAAG,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,kBAAkB,CAAC,CAAC;wBAChF,MAAM,kBAAkB,GAAG,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,kBAAkB,CAAC,CAAC;wBAChF,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;wBAClG,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;wBAClG,MAAM,cAAc,GAAG,QAAQ,CAAC,oBAAoB,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;wBAC7G,kFAAkF;wBAClF,IAAI,cAAc,KAAK,SAAS,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC;4BACvH,WAAW,EAAE,CAAC;4BACd,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;4BAC1F,MAAM,YAAY,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,CAAG,6DAA6D;4BAC1G,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,kBAAkB,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;4BAChH,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,kBAAkB,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;wBAClH,CAAC;6BAAM,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAE,4BAA4B;4BACxE,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,kBAAkB,EAAE,kBAAkB,EAAE,WAAW,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;wBACrI,CAAC;6BAAM,4BAA4B;4BACjC,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,kBAAkB,EAAE,kBAAkB,EAAE,WAAW,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBACvI,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,YAAY;IACvB,iDAAiD;IAC1C,SAAS,CAAY;IAC5B,gEAAgE;IACzD,IAAI,CAAqB;IAChC,oCAAoC;IAC5B,eAAe,CAAY;IAEnC,yBAAyB;IACzB,YAAmB,SAAoB,EAAE,IAAwB;QAC/D,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,eAAe,GAAG,EAAE,CAAC;IAC5B,CAAC;IACD,qEAAqE;IAC9D,MAAM,CAAC,qBAAqB,CAAC,MAAe,EAAE,MAAe,EAAE,KAAe;QACnF,MAAM,UAAU,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,UAAU,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC;QAChE,sHAAsH;QACtH,gJAAgJ;QAChJ,MAAM,UAAU,GAAG,UAAU,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC;QAC3D,MAAM,MAAM,GAAG,SAAS,CAAC,oBAAoB,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAClE,MAAM,MAAM,GAAG,SAAS,CAAC,oBAAoB,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAClE,MAAM,SAAS,GAAG,SAAS,CAAC,sBAAsB,CAAC,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QAC9E,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5E,MAAM,CAAC,aAAa,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,kBAAkB,CAAC,YAAY,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;YAClE,OAAO,IAAI,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,qHAAqH;IAC9G,cAAc,CAAC,OAAyC,EAAE,YAAwD;QACvH,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC;QAChC,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YACxB,sBAAsB,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC;;YAE5F,8BAA8B,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC;QACtG,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtC,6DAA6D;YAC7D,IAAI,CAAC,IAAI,CAAC,+BAA+B,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAC9F,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE;gBACzB,YAAY,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAC3E,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtE,CAAC,CACF,CAAC;QACJ,CAAC;IACH,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,0BAA0B;IAC7B,aAAa,CAAiB;IAC9B,aAAa,CAAa;IAC1B,aAAa,CAAa;IAC1B,WAAW,CAAW;IAC9B,YAAoB,QAAwB,EAAE,SAAgG;QAC5I,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC;QAC9B,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC,YAAY,CAAC;YAC5C,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC,YAAY,CAAC;YAC5C,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC;QAC1C,CAAC;IACH,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,GAAyB,EAAE,WAAiC;QAC/E,IAAI,WAAW,KAAK,SAAS;YAC3B,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnB,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACnC,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACtC,MAAM,QAAQ,GAAmB,EAAE,CAAC;YACpC,GAAG,CAAC,+BAA+B,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAE9C,IAAI,kBAAkB,GAAG,QAAQ,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;YAClE,IAAI,kBAAkB,KAAK,SAAS;gBAClC,kBAAkB,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACjD,MAAM,YAAY,GAAG,SAAS,CAAC,qBAAqB,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;YAChF,MAAM,YAAY,GAAG,YAAY,CAAC,OAAO,EAAG,CAAC;YAC7C,MAAM,UAAU,GAAG,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,GAAG,CAAC,+BAA+B,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;gBACjD,MAAM,OAAO,GAAG,YAAY,CAAC,qBAAqB,CAAC,KAAK,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;gBACjF,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;oBAC1B,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACxB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;YACD,OAAO,IAAI,0BAA0B,CAAC,QAAQ,EAAE,EAAE,YAAY,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,CAAC;QAC9F,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,cAAc,CAAC,OAAkB,EAAE,YAAwD;QAChG,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;YACvE,MAAM,YAAY,GAAG,OAAO,CAAC,sBAAsB,CAAC,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;YACjF,IAAI,CAAC,YAAY,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC;gBACnD,OAAO;QACX,CAAC;QACD,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACzC,OAAO,CAAC,cAAc,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;CACF","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 Polyface\n */\n\nimport { ClipPlane } from \"../../clipping/ClipPlane\";\nimport { ConvexClipPlaneSet } from \"../../clipping/ConvexClipPlaneSet\";\nimport { Geometry } from \"../../Geometry\";\nimport { GrowableXYZArray } from \"../../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"../../geometry3d/IndexedXYZCollection\";\nimport { Matrix3d } from \"../../geometry3d/Matrix3d\";\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\nimport { IndexedXYZCollectionPolygonOps, Point3dArrayPolygonOps } from \"../../geometry3d/PolygonOps\";\nimport { Range3d } from \"../../geometry3d/Range\";\nimport { Segment1d } from \"../../geometry3d/Segment1d\";\nimport { Transform } from \"../../geometry3d/Transform\";\nimport { Polyface } from \"../Polyface\";\nimport { AnnounceDrapePanel } from \"../PolyfaceQuery\";\n\nexport class SweepLineStringToFacetContext {\n  private _spacePoints: IndexedXYZCollection;\n  private _spacePointsRange: Range3d;\n  private _numSpacePoints: number;\n  private constructor(spacePoints: IndexedXYZCollection) {\n    this._spacePoints = spacePoints;\n    this._spacePointsRange = spacePoints.getRange();\n    this._numSpacePoints = this._spacePoints.length;\n  }\n  public static create(xyz: IndexedXYZCollection): SweepLineStringToFacetContext | undefined {\n    if (xyz.length > 1) {\n      return new SweepLineStringToFacetContext(xyz);\n    }\n    return undefined;\n  }\n\n  // temporaries reused over multiple calls to process a single facet . ..\n  private _segmentPoint0 = Point3d.create();\n  private _segmentPoint1 = Point3d.create();\n  private _localSegmentPoint0 = Point3d.create();\n  private _localSegmentPoint1 = Point3d.create();\n  private _clipFractions = Segment1d.create(0, 1);\n  private _localFrame = Transform.createIdentity();\n  private _polygonRange = Range3d.create();\n\n  /** process a single polygon.\n   * @returns number crudely indicating how much work was done.\n   */\n  public projectToPolygon(polygon: GrowableXYZArray, announce: AnnounceDrapePanel, polyface: Polyface, readIndex: number): number {\n    polygon.setRange(this._polygonRange);\n    let workCounter = 0;\n    if (!this._polygonRange.intersectsRangeXY(this._spacePointsRange))\n      return workCounter;\n    // numTest++;\n    // For each triangle within the facet ...\n    // remark: this loop only runs once in triangle mesh, twice in quads ...\n    for (let k1 = 1; k1 + 1 < polygon.length; k1++) {\n      workCounter++;\n      const frame = polygon.fillLocalXYTriangleFrame(0, k1, k1 + 1, this._localFrame);\n      if (frame) {\n        // For each stroke of the linestring ...\n        for (let i1 = 1; i1 < this._numSpacePoints; i1++) {\n          workCounter++;\n          this._spacePoints.getPoint3dAtCheckedPointIndex(i1 - 1, this._segmentPoint0);\n          this._spacePoints.getPoint3dAtCheckedPointIndex(i1, this._segmentPoint1);\n          frame.multiplyInversePoint3d(this._segmentPoint0, this._localSegmentPoint0);\n          frame.multiplyInversePoint3d(this._segmentPoint1, this._localSegmentPoint1);\n          this._clipFractions.set(0, 1);\n          /** (x,y,1-x-y) are barycentric coordinates in the triangle !!! */\n          if (this._clipFractions.clipBy01FunctionValuesPositive(this._localSegmentPoint0.x, this._localSegmentPoint1.x)\n            && this._clipFractions.clipBy01FunctionValuesPositive(this._localSegmentPoint0.y, this._localSegmentPoint1.y)\n            && this._clipFractions.clipBy01FunctionValuesPositive(\n              1 - this._localSegmentPoint0.x - this._localSegmentPoint0.y,\n              1 - this._localSegmentPoint1.x - this._localSegmentPoint1.y)) {\n            /* project the local segment point to the plane. */\n            workCounter++;\n            const localClippedPointA = this._localSegmentPoint0.interpolate(this._clipFractions.x0, this._localSegmentPoint1);\n            const localClippedPointB = this._localSegmentPoint0.interpolate(this._clipFractions.x1, this._localSegmentPoint1);\n            const worldClippedPointA = this._localFrame.multiplyPoint3d(localClippedPointA);\n            const worldClippedPointB = this._localFrame.multiplyPoint3d(localClippedPointB);\n            const planePointA = this._localFrame.multiplyXYZ(localClippedPointA.x, localClippedPointA.y, 0.0);\n            const planePointB = this._localFrame.multiplyXYZ(localClippedPointB.x, localClippedPointB.y, 0.0);\n            const splitParameter = Geometry.inverseInterpolate01(this._localSegmentPoint0.z, this._localSegmentPoint1.z);\n            // emit 1 or 2 panels, oriented so panel normal is always to the left of the line.\n            if (splitParameter !== undefined && splitParameter > this._clipFractions.x0 && splitParameter < this._clipFractions.x1) {\n              workCounter++;\n              const piercePointX = this._segmentPoint0.interpolate(splitParameter, this._segmentPoint1);\n              const piercePointY = piercePointX.clone();   // so points are distinct for the two triangle announcements.\n              announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointA, piercePointX, planePointA], 2, 1);\n              announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointB, piercePointY, planePointB], 1, 2);\n            } else if (this._localSegmentPoint0.z > 0) {  // segment is entirely above\n              announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointA, worldClippedPointB, planePointB, planePointA], 3, 2);\n            } else // segment is entirely under\n              announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointB, worldClippedPointA, planePointA, planePointB], 2, 3);\n          }\n        }\n      }\n    }\n    return workCounter;\n  }\n}\n\n/**\n * Context for sweeping a line segment onto a convex polygon.\n * @internal\n */\nexport class EdgeClipData {\n  /** Plane containing the edge and sweep vector */\n  public edgePlane: ClipPlane;\n  /** Two clip planes facing each other at each end of the edge */\n  public clip: ConvexClipPlaneSet;\n  /** work array for clipper method */\n  private _crossingPoints: Point3d[];\n\n  /** CAPTURE the planes */\n  public constructor(edgePlane: ClipPlane, clip: ConvexClipPlaneSet) {\n    this.edgePlane = edgePlane;\n    this.clip = clip;\n    this._crossingPoints = [];\n  }\n  /** create object from segment and sweep. Inputs are not captured. */\n  public static createPointPointSweep(pointA: Point3d, pointB: Point3d, sweep: Vector3d): EdgeClipData | undefined {\n    const edgeVector = Vector3d.createStartEnd(pointA, pointB);\n    const fraction = edgeVector.fractionOfProjectionToVector(sweep);\n    // The unbounded plane of the swept edge will intersect facets in lines that may extend beyond the swept bounded line.\n    // That linework will be clipped between two facing planes with normal along the perpendicular dropped from the edge vector to the sweep vector.\n    const clipNormal = edgeVector.plusScaled(sweep, -fraction);\n    const planeA = ClipPlane.createNormalAndPoint(clipNormal, pointA);\n    const planeB = ClipPlane.createNormalAndPoint(clipNormal, pointB);\n    const edgePlane = ClipPlane.createOriginAndVectors(pointA, edgeVector, sweep);\n    if (planeA !== undefined && planeB !== undefined && edgePlane !== undefined) {\n      planeB.negateInPlace();\n      const clipper = ConvexClipPlaneSet.createPlanes([planeA, planeB]);\n      return new EdgeClipData(edgePlane, clipper);\n    }\n    return undefined;\n  }\n\n  /** Intersect this edge plane with the given convex polygon and announce the intersection segment to the callback. */\n  public processPolygon(polygon: Point3d[] | IndexedXYZCollection, announceEdge: (pointA: Point3d, pointB: Point3d) => void) {\n    this._crossingPoints.length = 0;\n    if (Array.isArray(polygon))\n      Point3dArrayPolygonOps.polygonPlaneCrossings(this.edgePlane, polygon, this._crossingPoints);\n    else\n      IndexedXYZCollectionPolygonOps.polygonPlaneCrossings(this.edgePlane, polygon, this._crossingPoints);\n    if (this._crossingPoints.length === 2) {\n      // use the end planes to clip the [0,1] swept edge to [f0,f1]\n      this.clip.announceClippedSegmentIntervals(0, 1, this._crossingPoints[0], this._crossingPoints[1],\n        (f0: number, f1: number) => {\n          announceEdge(this._crossingPoints[0].interpolate(f0, this._crossingPoints[1]),\n            this._crossingPoints[0].interpolate(f1, this._crossingPoints[1]));\n        },\n      );\n    }\n  }\n}\n/**\n * Context for sweeping a line string onto a convex polygon.\n * @internal\n */\nexport class ClipSweptLineStringContext {\n  private _edgeClippers: EdgeClipData[];\n  private _localToWorld?: Transform;\n  private _worldToLocal?: Transform;\n  private _localRange?: Range3d;\n  private constructor(edgeData: EdgeClipData[], localData: undefined | { localToWorld: Transform, worldToLocal: Transform, localRange: Range3d }) {\n    this._edgeClippers = edgeData;\n    if (localData !== undefined) {\n      this._localToWorld = localData.localToWorld;\n      this._worldToLocal = localData.worldToLocal;\n      this._localRange = localData.localRange;\n    }\n  }\n  public static create(xyz: IndexedXYZCollection, sweepVector: Vector3d | undefined): ClipSweptLineStringContext | undefined {\n    if (sweepVector === undefined)\n      sweepVector = Vector3d.create(0, 0, 1);\n    if (xyz.length > 1) {\n      const point = Point3d.createZero();\n      const newPoint = Point3d.createZero();\n      const edgeData: EdgeClipData[] = [];\n      xyz.getPoint3dAtUncheckedPointIndex(0, point);\n\n      let localToWorldMatrix = Matrix3d.createRigidHeadsUp(sweepVector);\n      if (localToWorldMatrix === undefined)\n        localToWorldMatrix = Matrix3d.createIdentity();\n      const localToWorld = Transform.createOriginAndMatrix(point, localToWorldMatrix);\n      const worldToLocal = localToWorld.inverse()!;\n      const localRange = xyz.getRange(worldToLocal);\n      for (let i = 1; i < xyz.length; i++) {\n        xyz.getPoint3dAtUncheckedPointIndex(i, newPoint);\n        const clipper = EdgeClipData.createPointPointSweep(point, newPoint, sweepVector);\n        if (clipper !== undefined) {\n          point.setFrom(newPoint);\n          edgeData.push(clipper);\n        }\n      }\n      return new ClipSweptLineStringContext(edgeData, { localToWorld, worldToLocal, localRange });\n    }\n    return undefined;\n  }\n  /**\n   * Intersect a polygon with each of the edgeClippers.\n   * * If transforms and local range are defined, test the polygon's local range to see if it offers a quick exit.\n   */\n  public processPolygon(polygon: Point3d[], announceEdge: (pointA: Point3d, pointB: Point3d) => void) {\n    if (this._worldToLocal !== undefined && this._localRange !== undefined) {\n      const polygonRange = Range3d.createTransformedArray(this._worldToLocal, polygon);\n      if (!polygonRange.intersectsRangeXY(this._localRange))\n        return;\n    }\n    for (const clipper of this._edgeClippers) {\n      clipper.processPolygon(polygon, announceEdge);\n    }\n  }\n}\n"]}

package/lib/esm/serialization/BGFBReader.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BGFBReader.d.ts","sourceRoot":"","sources":["../../../src/serialization/BGFBReader.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,YAAY,EAAuB,MAAM,yBAAyB,CAAC;AAC5E,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAY,MAAM,2BAA2B,CAAC;AAC1F,OAAO,EAAE,oBAAoB,EAA+B,MAAM,iCAAiC,CAAC;AAEpG,OAAO,EAAe,eAAe,EAAE,MAAM,0BAA0B,CAAC;AACxE,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAMvD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAGvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oCAAoC,CAAC;AAUxE,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAClF,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAMlE,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAGzD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD;;;;GAIG;AACH,qBAAa,UAAU;;IAGrB;;;OAGG;IACI,6BAA6B,CAAC,aAAa,EAAE,aAAa,CAAC,eAAe,GAAG,gBAAgB,GAAG,iBAAiB,GAAG,SAAS;IA6CpI;;;MAGE;IACK,wBAAwB,CAAC,MAAM,EAAE,aAAa,CAAC,kBAAkB,GAAG,oBAAoB,GAAG,SAAS;IAqB3G;;;OAGG;IACI,gBAAgB,CAAC,MAAM,EAAE,aAAa,CAAC,UAAU,GAAG,YAAY,GAAG,SAAS;IAQnF;;;SAGK;IACE,gBAAgB,CAAC,MAAM,EAAE,aAAa,CAAC,YAAY,GAAG,cAAc,GAAG,eAAe,GAAG,SAAS;IA8BzG;;;OAGG;IACI,oBAAoB,CAAC,MAAM,EAAE,aAAa,CAAC,gBAAgB,GAAG,kBAAkB,GAAG,SAAS;IA4CnG;;;OAGG;IACI,6BAA6B,CAAC,OAAO,EAAE,aAAa,CAAC,eAAe,GAAG,cAAc,GAAG,SAAS;IA2CxG;;;OAGG;IACI,0BAA0B,CAAC,OAAO,EAAE,aAAa,CAAC,eAAe,GAAG,aAAa,GAAG,SAAS;IAapG,8CAA8C;IACvC,0BAA0B,CAAC,iBAAiB,EAAE,aAAa,CAAC,sBAAsB,GAAG,IAAI,GAAG,cAAc,GAAG,SAAS;IAU7H,yCAAyC;IAClC,sBAAsB,CAAC,aAAa,EAAE,aAAa,CAAC,kBAAkB,GAAG,IAAI,GAAG,UAAU,GAAG,SAAS;IAiB7G,oFAAoF;IACpF,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAuBhC,kDAAkD;IAClD,OAAO,CAAC,aAAa;IAerB;;;;;;OAMG;IACI,mBAAmB,CAAC,UAAU,EAAE,aAAa,CAAC,QAAQ,GAAG,IAAI,EAAE,SAAS,EAAE,aAAa,CAAC,eAAe,GAAG,IAAI,GAAG,eAAe,GAAG,SAAS;IA2DnJ,6CAA6C;IACtC,qBAAqB,CAAC,QAAQ,EAAE,aAAa,CAAC,iBAAiB,GAAG,SAAS,GAAG,iBAAiB,GAAG,SAAS;IAqBlH;;;OAGG;IACI,uBAAuB,CAAC,OAAO,EAAE,aAAa,CAAC,eAAe,GAAG,eAAe,GAAG,SAAS;IAoG5F,uCAAuC,CAAC,OAAO,EAAE,aAAa,CAAC,WAAW,GAAG,eAAe;IAmBnG;;;KAGC;IACM,sCAAsC,CAAC,OAAO,EAAE,aAAa,CAAC,eAAe,GAAG,eAAe,GAAG,SAAS;IAQlH;;;KAGC;IACM,6BAA6B,CAAC,OAAO,EAAE,aAAa,CAAC,eAAe,GAAG,cAAc,GAAG,SAAS;IAmFxG;;;OAGG;IACI,4BAA4B,CAAC,OAAO,EAAE,aAAa,CAAC,eAAe,GAAG,aAAa,GAAG,aAAa,EAAE,GAAG,SAAS;IAoDxH;;;OAGG;WACW,eAAe,CAAC,QAAQ,EAAE,UAAU,EAAE,SAAS,CAAC,EAAE,UAAU,GAAG,aAAa,GAAG,aAAa,EAAE,GAAG,SAAS;CAezH;AAkBD;;;GAGG;AACH,qBAAa,oBAAoB;IAG/B,OAAO,CAAC,MAAM,CAAC,iBAAiB,CAoB9B;IACF,8EAA8E;WAChE,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAQpE,uDAAuD;WACzC,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,iBAAiB,GAAE,OAAc,GAAG,MAAM,GAAG,SAAS;IAOhG,0DAA0D;WAC5C,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;CAG5D"}
+{"version":3,"file":"BGFBReader.d.ts","sourceRoot":"","sources":["../../../src/serialization/BGFBReader.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,YAAY,EAAuB,MAAM,yBAAyB,CAAC;AAC5E,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAY,MAAM,2BAA2B,CAAC;AAC1F,OAAO,EAAE,oBAAoB,EAA+B,MAAM,iCAAiC,CAAC;AAEpG,OAAO,EAAe,eAAe,EAAE,MAAM,0BAA0B,CAAC;AACxE,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAMvD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAGvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oCAAoC,CAAC;AAUxE,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAClF,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAMlE,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAGzD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD;;;;GAIG;AACH,qBAAa,UAAU;;IAGrB;;;OAGG;IACI,6BAA6B,CAAC,aAAa,EAAE,aAAa,CAAC,eAAe,GAAG,gBAAgB,GAAG,iBAAiB,GAAG,SAAS;IA6CpI;;;MAGE;IACK,wBAAwB,CAAC,MAAM,EAAE,aAAa,CAAC,kBAAkB,GAAG,oBAAoB,GAAG,SAAS;IAqB3G;;;OAGG;IACI,gBAAgB,CAAC,MAAM,EAAE,aAAa,CAAC,UAAU,GAAG,YAAY,GAAG,SAAS;IAQnF;;;SAGK;IACE,gBAAgB,CAAC,MAAM,EAAE,aAAa,CAAC,YAAY,GAAG,cAAc,GAAG,eAAe,GAAG,SAAS;IA8BzG;;;OAGG;IACI,oBAAoB,CAAC,MAAM,EAAE,aAAa,CAAC,gBAAgB,GAAG,kBAAkB,GAAG,SAAS;IA4CnG;;;OAGG;IACI,6BAA6B,CAAC,OAAO,EAAE,aAAa,CAAC,eAAe,GAAG,cAAc,GAAG,SAAS;IA2CxG;;;OAGG;IACI,0BAA0B,CAAC,OAAO,EAAE,aAAa,CAAC,eAAe,GAAG,aAAa,GAAG,SAAS;IAapG,8CAA8C;IACvC,0BAA0B,CAAC,iBAAiB,EAAE,aAAa,CAAC,sBAAsB,GAAG,IAAI,GAAG,cAAc,GAAG,SAAS;IAU7H,yCAAyC;IAClC,sBAAsB,CAAC,aAAa,EAAE,aAAa,CAAC,kBAAkB,GAAG,IAAI,GAAG,UAAU,GAAG,SAAS;IAiB7G,oFAAoF;IACpF,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAuBhC,kDAAkD;IAClD,OAAO,CAAC,aAAa;IAerB;;;;;;OAMG;IACI,mBAAmB,CAAC,UAAU,EAAE,aAAa,CAAC,QAAQ,GAAG,IAAI,EAAE,SAAS,EAAE,aAAa,CAAC,eAAe,GAAG,IAAI,GAAG,eAAe,GAAG,SAAS;IA2DnJ,6CAA6C;IACtC,qBAAqB,CAAC,QAAQ,EAAE,aAAa,CAAC,iBAAiB,GAAG,SAAS,GAAG,iBAAiB,GAAG,SAAS;IAqBlH;;;OAGG;IACI,uBAAuB,CAAC,OAAO,EAAE,aAAa,CAAC,eAAe,GAAG,eAAe,GAAG,SAAS;IAmG5F,uCAAuC,CAAC,OAAO,EAAE,aAAa,CAAC,WAAW,GAAG,eAAe;IAmBnG;;;KAGC;IACM,sCAAsC,CAAC,OAAO,EAAE,aAAa,CAAC,eAAe,GAAG,eAAe,GAAG,SAAS;IAQlH;;;KAGC;IACM,6BAA6B,CAAC,OAAO,EAAE,aAAa,CAAC,eAAe,GAAG,cAAc,GAAG,SAAS;IAmFxG;;;OAGG;IACI,4BAA4B,CAAC,OAAO,EAAE,aAAa,CAAC,eAAe,GAAG,aAAa,GAAG,aAAa,EAAE,GAAG,SAAS;IAoDxH;;;OAGG;WACW,eAAe,CAAC,QAAQ,EAAE,UAAU,EAAE,SAAS,CAAC,EAAE,UAAU,GAAG,aAAa,GAAG,aAAa,EAAE,GAAG,SAAS;CAezH;AAkBD;;;GAGG;AACH,qBAAa,oBAAoB;IAG/B,OAAO,CAAC,MAAM,CAAC,iBAAiB,CAoB9B;IACF,8EAA8E;WAChE,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAQpE,uDAAuD;WACzC,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,iBAAiB,GAAE,OAAc,GAAG,MAAM,GAAG,SAAS;IAOhG,0DAA0D;WAC5C,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;CAG5D"}

package/lib/esm/serialization/BGFBReader.js

@@ -452,10 +452,9 @@ export class BGFBReader {
                     // -2 for "no edgeMate", maps to `undefined` in TypeScript
                     if (edgeMateIndexI32) {
                         const edgeMateIndex = [];
-                        if (!SerializationHelpers.announceCompressedZeroBasedReflexiveIndices(edgeMateIndexI32, numPerFace, SerializationHelpers.EdgeMateIndex.BlockSeparator, SerializationHelpers.EdgeMateIndex.NoEdgeMate, (i) => edgeMateIndex.push(i))) {
-                            assert(false, "unable to deserialize flatbuffer edgeMateIndex array");
+                        if (SerializationHelpers.announceCompressedZeroBasedReflexiveIndices(edgeMateIndexI32, numPerFace, SerializationHelpers.EdgeMateIndex.BlockSeparator, SerializationHelpers.EdgeMateIndex.NoEdgeMate, (i) => edgeMateIndex.push(i))) {
+                            polyface.data.edgeMateIndex = edgeMateIndex;
                         }
-                        polyface.data.edgeMateIndex = edgeMateIndex;
                     }
                     if (!polyface.validateAllIndices())
                         return undefined;