@itwin/core-geometry 4.10.0-dev.9 → 5.0.0-dev.1

package/lib/cjs/numerics/Range1dArray.js

@@ -4,7 +4,8 @@
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.compareRange1dLexicalLowHigh = exports.Range1dArray = void 0;
+exports.Range1dArray = void 0;
+exports.compareRange1dLexicalLowHigh = compareRange1dLexicalLowHigh;
 /** @packageDocumentation
  * @module Numerics
  */
@@ -359,5 +360,4 @@ function compareRange1dLexicalLowHigh(a, b) {
         return 1;
     return 0;
 }
-exports.compareRange1dLexicalLowHigh = compareRange1dLexicalLowHigh;
 //# sourceMappingURL=Range1dArray.js.map

package/lib/cjs/numerics/Range1dArray.js.map

@@ -1 +1 @@
-{"version":3,"file":"Range1dArray.js","sourceRoot":"","sources":["../../../src/numerics/Range1dArray.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,6EAA0E;AAC1E,+CAA8C;AAE9C;;;GAGG;AACH,MAAa,YAAY;IACvB;;;;OAIG;IACK,MAAM,CAAC,yBAAyB,CAAC,MAAe,EAAE,KAAgB,EAAE,EAAU,EAAE,MAAiB;QACvG,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;QACrB,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QACvB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,MAAM,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC;gBACtB,EAAE,EAAE,CAAC;YACP,CAAC;iBAAM,IAAI,MAAM,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;gBAC/B,IAAI,MAAM,CAAC,GAAG,GAAG,GAAG;oBAClB,MAAM,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBACjD,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC;gBAClB,EAAE,EAAE,CAAC;YACP,CAAC;iBAAM,CAAC;gBACN,0BAA0B;gBAC1B,IAAI,MAAM,CAAC,GAAG,GAAG,IAAI;oBACnB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC;gBACpB,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,GAAG,GAAG,IAAI;YACZ,MAAM,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;QAE3C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,8FAA8F;IACvF,MAAM,CAAC,gBAAgB,CAAC,KAAgB,EAAE,KAAgB;QAC/D,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,MAAM,EAAE,GAAG,CAAC,CAAC;QACb,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAC/B,YAAY,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;QACvE,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,MAAM,CAAC,2BAA2B,CAAC,MAAe,EAAE,MAAe,EAAE,MAAiB;QAC5F,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACvD,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACvD,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,8DAA8D;IACvD,MAAM,CAAC,eAAe,CAAC,KAAgB,EAAE,KAAgB;QAC9D,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACzB,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC;gBAC7B,IAAI,YAAY,CAAC,2BAA2B,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;oBAClE,EAAE,EAAE,CAAC;;oBAEL,EAAE,EAAE,CAAC;YACT,CAAC;iBAAM,CAAC;gBACN,IAAI,YAAY,CAAC,2BAA2B,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;oBAClE,EAAE,EAAE,CAAC;;oBAEL,EAAE,EAAE,CAAC;YACT,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,oBAAoB,CAAC,SAAkB,EAAE,MAAiB,EAAE,SAAiB;QAC1F,IAAI,SAAS,IAAI,MAAM,CAAC,MAAM;YAC5B,OAAO,KAAK,CAAC;QACf,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,SAAS,CAAC,GAAG,GAAG,SAAS,CAAC,IAAI;YAChC,OAAO,KAAK,CAAC;QACf,IAAI,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI;YACjC,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,uDAAuD;IAChD,MAAM,CAAC,WAAW,CAAC,KAAgB,EAAE,KAAgB;QAC1D,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACzB,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,SAAkB,CAAC;YACvB,6HAA6H;YAC7H,IAAI,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC;gBAC7B,SAAS,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;gBAC3B,EAAE,EAAE,CAAC;YACP,CAAC;iBAAM,CAAC;gBACN,SAAS,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;gBAC3B,EAAE,EAAE,CAAC;YACP,CAAC;YAED,IAAI,MAAM,GAAG,IAAI,CAAC;YAClB,GAAG,CAAC;gBACF,MAAM,OAAO,GAAG,YAAY,CAAC,oBAAoB,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;gBACxE,MAAM,OAAO,GAAG,YAAY,CAAC,oBAAoB,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;gBACxE,IAAI,OAAO;oBACT,EAAE,EAAE,CAAC;gBACP,IAAI,OAAO;oBACT,EAAE,EAAE,CAAC;gBACP,IAAI,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC;oBACvB,MAAM,GAAG,KAAK,CAAC;YACnB,CAAC,QAAQ,MAAM,EAAE;YAEjB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACzB,CAAC;QAED,OAAO,EAAE,GAAG,EAAE;YACZ,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3B,OAAO,EAAE,GAAG,EAAE;YACZ,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE3B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,wDAAwD;IACjD,MAAM,CAAC,YAAY,CAAC,KAAgB,EAAE,KAAgB;QAC3D,8FAA8F;QAC9F,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,KAAK,MAAM,KAAK,IAAI,KAAK;YACvB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QAC7B,KAAK,MAAM,KAAK,IAAI,KAAK;YACvB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QAE7B,iBAAiB;QACjB,MAAM,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;QAE1C,YAAY,CAAC,kBAAkB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC9C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,gHAAgH;IACzG,MAAM,CAAC,IAAI,CAAC,IAAe;QAChC,IAAI,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;IAC1C,CAAC;IAED,wJAAwJ;IACjJ,MAAM,CAAC,iBAAiB,CAAC,IAAe,EAAE,yBAAkC,KAAK;QACtF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YACjB,OAAO;QAET,IAAI,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;QAExC,IAAI,YAAY,GAAG,CAAC,CAAC,CAAG,yBAAyB;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC3C,2BAA2B;gBAC3B,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI;oBACxC,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC3C,CAAC;iBAAM,CAAC;gBACN,0BAA0B;gBAC1B,YAAY,EAAE,CAAC;gBACf,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,YAAY,GAAG,CAAC,CAAC;QAC/B,IAAI,sBAAsB,EAAE,CAAC;YAC3B,YAAY,GAAG,CAAC,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;oBAC/B,IAAI,YAAY,GAAG,CAAC;wBAClB,IAAI,CAAC,EAAE,YAAY,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,gEAAgE;IACzD,MAAM,CAAC,kBAAkB,CAAC,IAAe,EAAE,yBAAkC,KAAK;QACvF,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC7B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACxB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;YAC5C,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAO,CAAC,CAAC;YACpB,OAAO,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QAEH,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,CAAC;QACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAChB,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,sBAAsB,EAAE,CAAC;gBAC5B,eAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAC5C,CAAC;iBAAM,CAAC;gBACN,+CAA+C;gBAC/C,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;oBAC1C,CAAC,IAAI,CAAC,CAAC;oBACP,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtB,CAAC;gBACD,IAAI,EAAE,GAAG,EAAE;oBACT,eAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC;IACxB,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,SAAS,CAAC,IAAe,EAAE,KAAa;QACpD,OAAO,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IACD;;OAEG;IACI,MAAM,CAAC,UAAU,CAAC,IAAe,EAAE,KAAa;QACrD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC;gBACxB,MAAM,GAAG,CAAC,MAAM,CAAC;QACrB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;OACG;IACI,MAAM,CAAC,qBAAqB,CAAC,IAAe,EAAE,KAAa;QAChE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC;gBACxB,CAAC,EAAE,CAAC;QACR,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,SAAS,CAAC,IAAe,EAAE,MAA6B,EAAE,OAAgB,KAAK,EAAE,WAAoB,KAAK,EAAE,QAAiB,IAAI;QAC7I,IAAI,CAAC,MAAM;YAAE,MAAM,GAAG,IAAI,2CAAoB,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAChE,IAAI,KAAK;YAAE,MAAM,CAAC,KAAK,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QACD,IAAI,IAAI;YACN,MAAM,CAAC,IAAI,EAAE,CAAC;QAChB,IAAI,QAAQ;YACV,MAAM,CAAC,0BAA0B,EAAE,CAAC;QAEtC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,sBAAsB,CAAC,IAAe,EAAE,oBAAwC,EAAE,aAAiC,EAAE,sBAA+B,EAChK,WAA+B,EAAE,oBAA6B,EAC9D,kBAAsC,EAAE,MAAuC;QAC/E,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;QAC7B,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjB,IAAI,SAAS,KAAK,oBAAoB;gBACpC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,oBAAoB,CAAC,CAAC,CAAC;YAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,IAAI,aAAa,KAAK,SAAS,IAAI,CAAC,sBAAsB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;oBACzF,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC,CAAC;gBACtD,IAAI,CAAC,GAAG,CAAC,IAAI,WAAW,KAAK,SAAS,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;oBAC9F,MAAM,CAAC,IAAI,CAAC,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClF,CAAC;YACD,IAAI,SAAS,KAAK,kBAAkB;gBAClC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,kBAAkB,CAAC,CAAC,CAAC;QACxE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,qGAAqG;IAC9F,MAAM,CAAC,kBAAkB,CAAC,IAAe;QAC9C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACnB,OAAO,eAAO,CAAC,UAAU,EAAE,CAAC;QAC9B,OAAO,eAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnE,CAAC;IACD,oCAAoC;IAC7B,MAAM,CAAC,UAAU,CAAC,IAAe;QACtC,IAAI,GAAG,GAAG,GAAG,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,GAAG,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACxB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,QAAQ,CAAC,IAAe,EAAE,SAAkB,IAAI;QAC5D,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;oBACjC,OAAO,KAAK,CAAC;YACjB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;oBAChC,OAAO,KAAK,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AA3VD,oCA2VC;AAED;;GAEG;AACH,SAAgB,4BAA4B,CAAC,CAAU,EAAE,CAAU;IACjE,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG;QAAE,OAAO,CAAC,CAAC,CAAC;IAC7B,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC,CAAC;IAC/B,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC;IAC9B,OAAO,CAAC,CAAC;AACX,CAAC;AAND,oEAMC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Numerics\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GrowableFloat64Array } from \"../geometry3d/GrowableFloat64Array\";\r\nimport { Range1d } from \"../geometry3d/Range\";\r\n\r\n/**\r\n * A Range1d array is a set of intervals, such as occur when a line is clipped to a (nonconvex) polygon\r\n * @internal\r\n */\r\nexport class Range1dArray {\r\n  /** Internal step: Caller supplies rangeA = interval from left operand of set difference {A - B}\r\n   *  ib = lowest possible index of overlapping interval of {B}\r\n   *  Output live parts of rangeA, advancing B over intervals that do not extend beyond {rangeA}\r\n   *  iB is advanced to the first interval whose high is to the right of {rangeA.high}\r\n   */\r\n  private static advanceIntervalDifference(rangeA: Range1d, dataB: Range1d[], iB: number, retVal: Range1d[]) {\r\n    const nB = dataB.length;\r\n    let low = rangeA.low;\r\n    let high = rangeA.high;\r\n    while (iB < nB) {\r\n      const rangeB = dataB[iB];\r\n      if (rangeB.high < low) {\r\n        iB++;\r\n      } else if (rangeB.high <= high) {\r\n        if (rangeB.low > low)\r\n          retVal.push(Range1d.createXX(low, rangeB.low));\r\n        low = rangeB.high;\r\n        iB++;\r\n      } else {\r\n        // B ends beyond rangeA...\r\n        if (rangeB.low < high)\r\n          high = rangeB.low;\r\n        break;\r\n      }\r\n    }\r\n\r\n    if (low < high)\r\n      retVal.push(Range1d.createXX(low, high));\r\n\r\n    return retVal;\r\n  }\r\n\r\n  /** Intersect intervals in two pre-sorted sets. Output may NOT be the same as either input. */\r\n  public static differenceSorted(dataA: Range1d[], dataB: Range1d[]): Range1d[] {\r\n    const nA = dataA.length;\r\n    const iB = 0;\r\n    const retVal: Range1d[] = [];\r\n    for (let iA = 0; iA < nA; iA++) {\r\n      Range1dArray.advanceIntervalDifference(dataA[iA], dataB, iB, retVal);\r\n    }\r\n\r\n    return retVal;\r\n  }\r\n\r\n  /** Internal step: Caller ensures rangeA is the \"lower\" interval.\r\n   *  Look rangeB to decide (a) what output interval to create and (b) which read index to advance.\r\n   *  Returns true or false to indicate whether the value associated with rangeA or rangeB should be incremented after this function returns\r\n   */\r\n  private static advanceIntervalIntersection(rangeA: Range1d, rangeB: Range1d, retVal: Range1d[]): boolean {\r\n    if (rangeB.low > rangeA.high) {\r\n      return true;\r\n    } else if (rangeB.high >= rangeA.high) {\r\n      retVal.push(Range1d.createXX(rangeB.low, rangeA.high));\r\n      return true;\r\n    } else {\r\n      retVal.push(Range1d.createXX(rangeB.low, rangeB.high));\r\n      return false;\r\n    }\r\n  }\r\n  /** Boolean intersection among the (presorted) input ranges */\r\n  public static intersectSorted(dataA: Range1d[], dataB: Range1d[]): Range1d[] {\r\n    let iA = 0;\r\n    let iB = 0;\r\n    const nA = dataA.length;\r\n    const nB = dataB.length;\r\n    const retVal: Range1d[] = [];\r\n    while (iA < nA && iB < nB) {\r\n      const rangeA = dataA[iA];\r\n      const rangeB = dataB[iB];\r\n      if (rangeA.low <= rangeB.low) {\r\n        if (Range1dArray.advanceIntervalIntersection(rangeA, rangeB, retVal))\r\n          iA++;\r\n        else\r\n          iB++;\r\n      } else {\r\n        if (Range1dArray.advanceIntervalIntersection(rangeB, rangeA, retVal))\r\n          iB++;\r\n        else\r\n          iA++;\r\n      }\r\n    }\r\n\r\n    return retVal;\r\n  }\r\n\r\n  /** Internal step: Read an interval from the array.\r\n   *  If it overlaps the work interval, advance the work interval, and return true to notify caller to increment read index.\r\n   */\r\n  private static advanceIntervalUnion(workRange: Range1d, source: Range1d[], readIndex: number): boolean {\r\n    if (readIndex >= source.length)\r\n      return false;\r\n    const candidate = source[readIndex];\r\n    if (candidate.low > workRange.high)\r\n      return false;\r\n    if (candidate.high > workRange.high)\r\n      workRange.high = candidate.high;\r\n    return true;\r\n  }\r\n\r\n  /** Boolean union among the (presorted) input ranges */\r\n  public static unionSorted(dataA: Range1d[], dataB: Range1d[]): Range1d[] {\r\n    const nA = dataA.length;\r\n    const nB = dataB.length;\r\n    let iA = 0;\r\n    let iB = 0;\r\n    const retVal: Range1d[] = [];\r\n    while (iA < nA && iB < nB) {\r\n      const rangeA = dataA[iA];\r\n      const rangeB = dataB[iB];\r\n      let workRange: Range1d;\r\n      // Pull from the lower of rangeA and rangeB. This always advances exactly one of the indices -- progress towards getting out.\r\n      if (rangeA.low <= rangeB.low) {\r\n        workRange = rangeA.clone();\r\n        iA++;\r\n      } else {\r\n        workRange = rangeB.clone();\r\n        iB++;\r\n      }\r\n\r\n      let toLoop = true;\r\n      do {\r\n        const resultA = Range1dArray.advanceIntervalUnion(workRange, dataA, iA);\r\n        const resultB = Range1dArray.advanceIntervalUnion(workRange, dataB, iB);\r\n        if (resultA)\r\n          iA++;\r\n        if (resultB)\r\n          iB++;\r\n        if (!(resultA || resultB))\r\n          toLoop = false;\r\n      } while (toLoop);\r\n\r\n      retVal.push(workRange);\r\n    }\r\n\r\n    while (iA < nA)\r\n      retVal.push(dataA[iA++]);\r\n    while (iB < nB)\r\n      retVal.push(dataB[iB++]);\r\n\r\n    return retVal;\r\n  }\r\n\r\n  /** Boolean parity among the (presorted) input ranges */\r\n  public static paritySorted(dataA: Range1d[], dataB: Range1d[]): Range1d[] {\r\n    // Combine the two arrays, and then perform a simplification using simplifySortParity function\r\n    const retVal: Range1d[] = [];\r\n    for (const range of dataA)\r\n      retVal.push(range.clone());\r\n    for (const range of dataB)\r\n      retVal.push(range.clone());\r\n\r\n    // Sort the array\r\n    retVal.sort(compareRange1dLexicalLowHigh);\r\n\r\n    Range1dArray.simplifySortParity(retVal, true);\r\n    return retVal;\r\n  }\r\n\r\n  /** Uses the Range1d specific compare function `compareRange1dLexicalLowHigh` for sorting the array of ranges */\r\n  public static sort(data: Range1d[]) {\r\n    data.sort(compareRange1dLexicalLowHigh);\r\n  }\r\n\r\n  /** Cleans up the array, compressing any overlapping ranges. If removeZeroLengthRanges is set to true, will also remove any Ranges in the form (x, x) */\r\n  public static simplifySortUnion(data: Range1d[], removeZeroLengthRanges: boolean = false) {\r\n    if (data.length < 2)\r\n      return;\r\n\r\n    data.sort(compareRange1dLexicalLowHigh);\r\n\r\n    let currentIndex = 0;   // last accepted interval\r\n    for (let i = 1; i < data.length; i++) {\r\n      if (data[i].low <= data[currentIndex].high) {\r\n        // extend the current range\r\n        if (data[i].high > data[currentIndex].high)\r\n          data[currentIndex].high = data[i].high;\r\n      } else {\r\n        // data[i] is a new entry.\r\n        currentIndex++;\r\n        data[currentIndex].setFrom(data[i]);\r\n      }\r\n    }\r\n\r\n    data.length = currentIndex + 1;\r\n    if (removeZeroLengthRanges) {\r\n      currentIndex = -1;\r\n      for (let i = 0; i < data.length; i++) {\r\n        if (data[i].low < data[i].high) {\r\n          if (currentIndex < i)\r\n            data[++currentIndex].setFrom(data[i]);\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  /** Apply parity logic among ranges which are not pre-sorted. */\r\n  public static simplifySortParity(data: Range1d[], removeZeroLengthRanges: boolean = false) {\r\n    const numData: number[] = [];\r\n    for (const range of data) {\r\n      if (range.low !== range.high) {\r\n        numData.push(range.low);\r\n        numData.push(range.high);\r\n      }\r\n    }\r\n    const n = numData.length;\r\n    numData.sort((a: number, b: number): number => {\r\n      if (a < b) return -1;\r\n      if (a > b) return 1;\r\n      return 0;\r\n    });\r\n\r\n    let currIdx = 0;\r\n    let x0;\r\n    let x1;\r\n    for (let i = 0; i < n; i += 2) {\r\n      x0 = numData[i];\r\n      x1 = numData[i + 1];\r\n      if (!removeZeroLengthRanges) {\r\n        Range1d.createXX(x0, x1, data[currIdx++]);\r\n      } else {\r\n        // coalesce intervals that share end and start:\r\n        while (i + 2 < n && numData[i + 2] === x1) {\r\n          i += 2;\r\n          x1 = numData[i + 1];\r\n        }\r\n        if (x1 > x0)\r\n          Range1d.createXX(x0, x1, data[currIdx++]);\r\n      }\r\n    }\r\n\r\n    data.length = currIdx;\r\n  }\r\n\r\n  /** test if value is \"in\" by union rules.\r\n   * * This considers all intervals-- i.e. does not expect or take advantage of sorting.\r\n   */\r\n  public static testUnion(data: Range1d[], value: number): boolean {\r\n    return this.countContainingRanges(data, value) > 0;\r\n  }\r\n  /** test if value is \"in\" by parity rules.\r\n   * * This considers all intervals-- i.e. does not expect or take advantage of sorting.\r\n   */\r\n  public static testParity(data: Range1d[], value: number): boolean {\r\n    let inside = false;\r\n    for (const range of data) {\r\n      if (range.containsX(value))\r\n        inside = !inside;\r\n    }\r\n    return inside;\r\n  }\r\n\r\n  /** linear search to count number of intervals which contain `value`.\r\n   */\r\n  public static countContainingRanges(data: Range1d[], value: number): number {\r\n    let n = 0;\r\n    for (const range of data) {\r\n      if (range.containsX(value))\r\n        n++;\r\n    }\r\n    return n;\r\n  }\r\n\r\n  /** return an array with all the low and high values of all the ranges.\r\n   * @param data array of ranges.\r\n   * @param sort optionally request immediate sort.\r\n   * @param compress optionally request removal of duplicates.\r\n   */\r\n  public static getBreaks(data: Range1d[], result?: GrowableFloat64Array, sort: boolean = false, compress: boolean = false, clear: boolean = true): GrowableFloat64Array {\r\n    if (!result) result = new GrowableFloat64Array(2 * data.length);\r\n    if (clear) result.clear();\r\n    for (const range of data) {\r\n      result.push(range.low);\r\n      result.push(range.high);\r\n    }\r\n    if (sort)\r\n      result.sort();\r\n    if (compress)\r\n      result.compressAdjacentDuplicates();\r\n\r\n    return result;\r\n  }\r\n\r\n  /**  evaluate a point at an array of given fraction values\r\n   * @param data array of ranges.\r\n   * @param initialRangeFraction fraction coordinate applied only to first range. (typically negative)\r\n   * @param rangeFraction fraction within each range.\r\n   * @param includeDegenerateRange if false, skip rangeFraction for 0-length ranges.\r\n   * @param gapFraction fraction within interval from each range high to successor low\r\n   * @param includeDegenerateGap if false, skip rangeFraction for 0-length gaps.\r\n   * @param finalRangeFraction fraction coordinate applied only to last range (typically an extrapolation above)\r\n   * @param result array to receive values\r\n   */\r\n  public static appendFractionalPoints(data: Range1d[], initialRangeFraction: number | undefined, rangeFraction: number | undefined, includeDegenerateRange: boolean,\r\n    gapFraction: number | undefined, includeDegenerateGap: boolean,\r\n    finalRangeFraction: number | undefined, result: GrowableFloat64Array | number[]): GrowableFloat64Array | number[] {\r\n    const numRange = data.length;\r\n    if (numRange > 0) {\r\n      if (undefined !== initialRangeFraction)\r\n        result.push(data[0].fractionToPoint(initialRangeFraction));\r\n      for (let i = 0; i < numRange; i++) {\r\n        if (rangeFraction !== undefined && (includeDegenerateRange || data[i].low !== data[i].high))\r\n          result.push(data[i].fractionToPoint(rangeFraction));\r\n        if (i > 1 && gapFraction !== undefined && (includeDegenerateGap || data[i].low !== data[i].high))\r\n          result.push(Geometry.interpolate(data[i - 1].high, gapFraction, data[i].low));\r\n      }\r\n      if (undefined !== finalRangeFraction)\r\n        result.push(data[numRange - 1].fractionToPoint(finalRangeFraction));\r\n    }\r\n    return result;\r\n  }\r\n\r\n  /** Return a single range constructed with the low of range 0 and high of final range in the set.  */\r\n  public static firstLowToLastHigh(data: Range1d[]): Range1d {\r\n    if (data.length === 0)\r\n      return Range1d.createNull();\r\n    return Range1d.createXX(data[0].low, data[data.length - 1].high);\r\n  }\r\n  /** sum the lengths of all ranges */\r\n  public static sumLengths(data: Range1d[]): number {\r\n    let sum = 0.0;\r\n    for (const range of data) {\r\n      sum += range.length();\r\n    }\r\n    return sum;\r\n  }\r\n\r\n  /**\r\n   * Test if the low,high values are sorted with no overlap.\r\n   * @param data array of ranges.\r\n   * @param strict if true, consider exact high-to-low match as overlap.\r\n   */\r\n  public static isSorted(data: Range1d[], strict: boolean = true): boolean {\r\n    const n = data.length;\r\n    if (strict) {\r\n      for (let i = 0; i + 1 < n; i++) {\r\n        if (data[i].high >= data[i + 1].low)\r\n          return false;\r\n      }\r\n    } else {\r\n      for (let i = 0; i + 1 < n; i++) {\r\n        if (data[i].high > data[i + 1].low)\r\n          return false;\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n}\r\n\r\n/** Checks low's first, then high's\r\n * @internal\r\n */\r\nexport function compareRange1dLexicalLowHigh(a: Range1d, b: Range1d): number {\r\n  if (a.low < b.low) return -1;\r\n  if (a.low > b.low) return 1;\r\n  if (a.high < b.high) return -1;\r\n  if (a.high > b.high) return 1;\r\n  return 0;\r\n}\r\n"]}
+{"version":3,"file":"Range1dArray.js","sourceRoot":"","sources":["../../../src/numerics/Range1dArray.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AA8W/F,oEAMC;AAlXD;;GAEG;AAEH,0CAAuC;AACvC,6EAA0E;AAC1E,+CAA8C;AAE9C;;;GAGG;AACH,MAAa,YAAY;IACvB;;;;OAIG;IACK,MAAM,CAAC,yBAAyB,CAAC,MAAe,EAAE,KAAgB,EAAE,EAAU,EAAE,MAAiB;QACvG,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;QACrB,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QACvB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,MAAM,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC;gBACtB,EAAE,EAAE,CAAC;YACP,CAAC;iBAAM,IAAI,MAAM,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;gBAC/B,IAAI,MAAM,CAAC,GAAG,GAAG,GAAG;oBAClB,MAAM,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBACjD,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC;gBAClB,EAAE,EAAE,CAAC;YACP,CAAC;iBAAM,CAAC;gBACN,0BAA0B;gBAC1B,IAAI,MAAM,CAAC,GAAG,GAAG,IAAI;oBACnB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC;gBACpB,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,GAAG,GAAG,IAAI;YACZ,MAAM,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;QAE3C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,8FAA8F;IACvF,MAAM,CAAC,gBAAgB,CAAC,KAAgB,EAAE,KAAgB;QAC/D,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,MAAM,EAAE,GAAG,CAAC,CAAC;QACb,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAC/B,YAAY,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;QACvE,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,MAAM,CAAC,2BAA2B,CAAC,MAAe,EAAE,MAAe,EAAE,MAAiB;QAC5F,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACvD,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACvD,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,8DAA8D;IACvD,MAAM,CAAC,eAAe,CAAC,KAAgB,EAAE,KAAgB;QAC9D,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACzB,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC;gBAC7B,IAAI,YAAY,CAAC,2BAA2B,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;oBAClE,EAAE,EAAE,CAAC;;oBAEL,EAAE,EAAE,CAAC;YACT,CAAC;iBAAM,CAAC;gBACN,IAAI,YAAY,CAAC,2BAA2B,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;oBAClE,EAAE,EAAE,CAAC;;oBAEL,EAAE,EAAE,CAAC;YACT,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,oBAAoB,CAAC,SAAkB,EAAE,MAAiB,EAAE,SAAiB;QAC1F,IAAI,SAAS,IAAI,MAAM,CAAC,MAAM;YAC5B,OAAO,KAAK,CAAC;QACf,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,SAAS,CAAC,GAAG,GAAG,SAAS,CAAC,IAAI;YAChC,OAAO,KAAK,CAAC;QACf,IAAI,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI;YACjC,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,uDAAuD;IAChD,MAAM,CAAC,WAAW,CAAC,KAAgB,EAAE,KAAgB;QAC1D,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QACxB,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACzB,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,SAAkB,CAAC;YACvB,6HAA6H;YAC7H,IAAI,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC;gBAC7B,SAAS,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;gBAC3B,EAAE,EAAE,CAAC;YACP,CAAC;iBAAM,CAAC;gBACN,SAAS,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;gBAC3B,EAAE,EAAE,CAAC;YACP,CAAC;YAED,IAAI,MAAM,GAAG,IAAI,CAAC;YAClB,GAAG,CAAC;gBACF,MAAM,OAAO,GAAG,YAAY,CAAC,oBAAoB,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;gBACxE,MAAM,OAAO,GAAG,YAAY,CAAC,oBAAoB,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;gBACxE,IAAI,OAAO;oBACT,EAAE,EAAE,CAAC;gBACP,IAAI,OAAO;oBACT,EAAE,EAAE,CAAC;gBACP,IAAI,CAAC,CAAC,OAAO,IAAI,OAAO,CAAC;oBACvB,MAAM,GAAG,KAAK,CAAC;YACnB,CAAC,QAAQ,MAAM,EAAE;YAEjB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACzB,CAAC;QAED,OAAO,EAAE,GAAG,EAAE;YACZ,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3B,OAAO,EAAE,GAAG,EAAE;YACZ,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE3B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,wDAAwD;IACjD,MAAM,CAAC,YAAY,CAAC,KAAgB,EAAE,KAAgB;QAC3D,8FAA8F;QAC9F,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,KAAK,MAAM,KAAK,IAAI,KAAK;YACvB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QAC7B,KAAK,MAAM,KAAK,IAAI,KAAK;YACvB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QAE7B,iBAAiB;QACjB,MAAM,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;QAE1C,YAAY,CAAC,kBAAkB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC9C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,gHAAgH;IACzG,MAAM,CAAC,IAAI,CAAC,IAAe;QAChC,IAAI,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;IAC1C,CAAC;IAED,wJAAwJ;IACjJ,MAAM,CAAC,iBAAiB,CAAC,IAAe,EAAE,yBAAkC,KAAK;QACtF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YACjB,OAAO;QAET,IAAI,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;QAExC,IAAI,YAAY,GAAG,CAAC,CAAC,CAAG,yBAAyB;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC3C,2BAA2B;gBAC3B,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI;oBACxC,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC3C,CAAC;iBAAM,CAAC;gBACN,0BAA0B;gBAC1B,YAAY,EAAE,CAAC;gBACf,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,YAAY,GAAG,CAAC,CAAC;QAC/B,IAAI,sBAAsB,EAAE,CAAC;YAC3B,YAAY,GAAG,CAAC,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;oBAC/B,IAAI,YAAY,GAAG,CAAC;wBAClB,IAAI,CAAC,EAAE,YAAY,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,gEAAgE;IACzD,MAAM,CAAC,kBAAkB,CAAC,IAAe,EAAE,yBAAkC,KAAK;QACvF,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC7B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACxB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;YAC5C,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAO,CAAC,CAAC;YACpB,OAAO,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QAEH,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,CAAC;QACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAChB,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,sBAAsB,EAAE,CAAC;gBAC5B,eAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAC5C,CAAC;iBAAM,CAAC;gBACN,+CAA+C;gBAC/C,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;oBAC1C,CAAC,IAAI,CAAC,CAAC;oBACP,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtB,CAAC;gBACD,IAAI,EAAE,GAAG,EAAE;oBACT,eAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC;IACxB,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,SAAS,CAAC,IAAe,EAAE,KAAa;QACpD,OAAO,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IACD;;OAEG;IACI,MAAM,CAAC,UAAU,CAAC,IAAe,EAAE,KAAa;QACrD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC;gBACxB,MAAM,GAAG,CAAC,MAAM,CAAC;QACrB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;OACG;IACI,MAAM,CAAC,qBAAqB,CAAC,IAAe,EAAE,KAAa;QAChE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC;gBACxB,CAAC,EAAE,CAAC;QACR,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,SAAS,CAAC,IAAe,EAAE,MAA6B,EAAE,OAAgB,KAAK,EAAE,WAAoB,KAAK,EAAE,QAAiB,IAAI;QAC7I,IAAI,CAAC,MAAM;YAAE,MAAM,GAAG,IAAI,2CAAoB,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAChE,IAAI,KAAK;YAAE,MAAM,CAAC,KAAK,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QACD,IAAI,IAAI;YACN,MAAM,CAAC,IAAI,EAAE,CAAC;QAChB,IAAI,QAAQ;YACV,MAAM,CAAC,0BAA0B,EAAE,CAAC;QAEtC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,sBAAsB,CAAC,IAAe,EAAE,oBAAwC,EAAE,aAAiC,EAAE,sBAA+B,EAChK,WAA+B,EAAE,oBAA6B,EAC9D,kBAAsC,EAAE,MAAuC;QAC/E,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;QAC7B,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjB,IAAI,SAAS,KAAK,oBAAoB;gBACpC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,oBAAoB,CAAC,CAAC,CAAC;YAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,IAAI,aAAa,KAAK,SAAS,IAAI,CAAC,sBAAsB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;oBACzF,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC,CAAC;gBACtD,IAAI,CAAC,GAAG,CAAC,IAAI,WAAW,KAAK,SAAS,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;oBAC9F,MAAM,CAAC,IAAI,CAAC,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClF,CAAC;YACD,IAAI,SAAS,KAAK,kBAAkB;gBAClC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,kBAAkB,CAAC,CAAC,CAAC;QACxE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,qGAAqG;IAC9F,MAAM,CAAC,kBAAkB,CAAC,IAAe;QAC9C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACnB,OAAO,eAAO,CAAC,UAAU,EAAE,CAAC;QAC9B,OAAO,eAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnE,CAAC;IACD,oCAAoC;IAC7B,MAAM,CAAC,UAAU,CAAC,IAAe;QACtC,IAAI,GAAG,GAAG,GAAG,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,GAAG,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACxB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,QAAQ,CAAC,IAAe,EAAE,SAAkB,IAAI;QAC5D,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;oBACjC,OAAO,KAAK,CAAC;YACjB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;oBAChC,OAAO,KAAK,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AA3VD,oCA2VC;AAED;;GAEG;AACH,SAAgB,4BAA4B,CAAC,CAAU,EAAE,CAAU;IACjE,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG;QAAE,OAAO,CAAC,CAAC,CAAC;IAC7B,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC,CAAC;IAC/B,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC;IAC9B,OAAO,CAAC,CAAC;AACX,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Numerics\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GrowableFloat64Array } from \"../geometry3d/GrowableFloat64Array\";\r\nimport { Range1d } from \"../geometry3d/Range\";\r\n\r\n/**\r\n * A Range1d array is a set of intervals, such as occur when a line is clipped to a (nonconvex) polygon\r\n * @internal\r\n */\r\nexport class Range1dArray {\r\n  /** Internal step: Caller supplies rangeA = interval from left operand of set difference {A - B}\r\n   *  ib = lowest possible index of overlapping interval of {B}\r\n   *  Output live parts of rangeA, advancing B over intervals that do not extend beyond {rangeA}\r\n   *  iB is advanced to the first interval whose high is to the right of {rangeA.high}\r\n   */\r\n  private static advanceIntervalDifference(rangeA: Range1d, dataB: Range1d[], iB: number, retVal: Range1d[]) {\r\n    const nB = dataB.length;\r\n    let low = rangeA.low;\r\n    let high = rangeA.high;\r\n    while (iB < nB) {\r\n      const rangeB = dataB[iB];\r\n      if (rangeB.high < low) {\r\n        iB++;\r\n      } else if (rangeB.high <= high) {\r\n        if (rangeB.low > low)\r\n          retVal.push(Range1d.createXX(low, rangeB.low));\r\n        low = rangeB.high;\r\n        iB++;\r\n      } else {\r\n        // B ends beyond rangeA...\r\n        if (rangeB.low < high)\r\n          high = rangeB.low;\r\n        break;\r\n      }\r\n    }\r\n\r\n    if (low < high)\r\n      retVal.push(Range1d.createXX(low, high));\r\n\r\n    return retVal;\r\n  }\r\n\r\n  /** Intersect intervals in two pre-sorted sets. Output may NOT be the same as either input. */\r\n  public static differenceSorted(dataA: Range1d[], dataB: Range1d[]): Range1d[] {\r\n    const nA = dataA.length;\r\n    const iB = 0;\r\n    const retVal: Range1d[] = [];\r\n    for (let iA = 0; iA < nA; iA++) {\r\n      Range1dArray.advanceIntervalDifference(dataA[iA], dataB, iB, retVal);\r\n    }\r\n\r\n    return retVal;\r\n  }\r\n\r\n  /** Internal step: Caller ensures rangeA is the \"lower\" interval.\r\n   *  Look rangeB to decide (a) what output interval to create and (b) which read index to advance.\r\n   *  Returns true or false to indicate whether the value associated with rangeA or rangeB should be incremented after this function returns\r\n   */\r\n  private static advanceIntervalIntersection(rangeA: Range1d, rangeB: Range1d, retVal: Range1d[]): boolean {\r\n    if (rangeB.low > rangeA.high) {\r\n      return true;\r\n    } else if (rangeB.high >= rangeA.high) {\r\n      retVal.push(Range1d.createXX(rangeB.low, rangeA.high));\r\n      return true;\r\n    } else {\r\n      retVal.push(Range1d.createXX(rangeB.low, rangeB.high));\r\n      return false;\r\n    }\r\n  }\r\n  /** Boolean intersection among the (presorted) input ranges */\r\n  public static intersectSorted(dataA: Range1d[], dataB: Range1d[]): Range1d[] {\r\n    let iA = 0;\r\n    let iB = 0;\r\n    const nA = dataA.length;\r\n    const nB = dataB.length;\r\n    const retVal: Range1d[] = [];\r\n    while (iA < nA && iB < nB) {\r\n      const rangeA = dataA[iA];\r\n      const rangeB = dataB[iB];\r\n      if (rangeA.low <= rangeB.low) {\r\n        if (Range1dArray.advanceIntervalIntersection(rangeA, rangeB, retVal))\r\n          iA++;\r\n        else\r\n          iB++;\r\n      } else {\r\n        if (Range1dArray.advanceIntervalIntersection(rangeB, rangeA, retVal))\r\n          iB++;\r\n        else\r\n          iA++;\r\n      }\r\n    }\r\n\r\n    return retVal;\r\n  }\r\n\r\n  /** Internal step: Read an interval from the array.\r\n   *  If it overlaps the work interval, advance the work interval, and return true to notify caller to increment read index.\r\n   */\r\n  private static advanceIntervalUnion(workRange: Range1d, source: Range1d[], readIndex: number): boolean {\r\n    if (readIndex >= source.length)\r\n      return false;\r\n    const candidate = source[readIndex];\r\n    if (candidate.low > workRange.high)\r\n      return false;\r\n    if (candidate.high > workRange.high)\r\n      workRange.high = candidate.high;\r\n    return true;\r\n  }\r\n\r\n  /** Boolean union among the (presorted) input ranges */\r\n  public static unionSorted(dataA: Range1d[], dataB: Range1d[]): Range1d[] {\r\n    const nA = dataA.length;\r\n    const nB = dataB.length;\r\n    let iA = 0;\r\n    let iB = 0;\r\n    const retVal: Range1d[] = [];\r\n    while (iA < nA && iB < nB) {\r\n      const rangeA = dataA[iA];\r\n      const rangeB = dataB[iB];\r\n      let workRange: Range1d;\r\n      // Pull from the lower of rangeA and rangeB. This always advances exactly one of the indices -- progress towards getting out.\r\n      if (rangeA.low <= rangeB.low) {\r\n        workRange = rangeA.clone();\r\n        iA++;\r\n      } else {\r\n        workRange = rangeB.clone();\r\n        iB++;\r\n      }\r\n\r\n      let toLoop = true;\r\n      do {\r\n        const resultA = Range1dArray.advanceIntervalUnion(workRange, dataA, iA);\r\n        const resultB = Range1dArray.advanceIntervalUnion(workRange, dataB, iB);\r\n        if (resultA)\r\n          iA++;\r\n        if (resultB)\r\n          iB++;\r\n        if (!(resultA || resultB))\r\n          toLoop = false;\r\n      } while (toLoop);\r\n\r\n      retVal.push(workRange);\r\n    }\r\n\r\n    while (iA < nA)\r\n      retVal.push(dataA[iA++]);\r\n    while (iB < nB)\r\n      retVal.push(dataB[iB++]);\r\n\r\n    return retVal;\r\n  }\r\n\r\n  /** Boolean parity among the (presorted) input ranges */\r\n  public static paritySorted(dataA: Range1d[], dataB: Range1d[]): Range1d[] {\r\n    // Combine the two arrays, and then perform a simplification using simplifySortParity function\r\n    const retVal: Range1d[] = [];\r\n    for (const range of dataA)\r\n      retVal.push(range.clone());\r\n    for (const range of dataB)\r\n      retVal.push(range.clone());\r\n\r\n    // Sort the array\r\n    retVal.sort(compareRange1dLexicalLowHigh);\r\n\r\n    Range1dArray.simplifySortParity(retVal, true);\r\n    return retVal;\r\n  }\r\n\r\n  /** Uses the Range1d specific compare function `compareRange1dLexicalLowHigh` for sorting the array of ranges */\r\n  public static sort(data: Range1d[]) {\r\n    data.sort(compareRange1dLexicalLowHigh);\r\n  }\r\n\r\n  /** Cleans up the array, compressing any overlapping ranges. If removeZeroLengthRanges is set to true, will also remove any Ranges in the form (x, x) */\r\n  public static simplifySortUnion(data: Range1d[], removeZeroLengthRanges: boolean = false) {\r\n    if (data.length < 2)\r\n      return;\r\n\r\n    data.sort(compareRange1dLexicalLowHigh);\r\n\r\n    let currentIndex = 0;   // last accepted interval\r\n    for (let i = 1; i < data.length; i++) {\r\n      if (data[i].low <= data[currentIndex].high) {\r\n        // extend the current range\r\n        if (data[i].high > data[currentIndex].high)\r\n          data[currentIndex].high = data[i].high;\r\n      } else {\r\n        // data[i] is a new entry.\r\n        currentIndex++;\r\n        data[currentIndex].setFrom(data[i]);\r\n      }\r\n    }\r\n\r\n    data.length = currentIndex + 1;\r\n    if (removeZeroLengthRanges) {\r\n      currentIndex = -1;\r\n      for (let i = 0; i < data.length; i++) {\r\n        if (data[i].low < data[i].high) {\r\n          if (currentIndex < i)\r\n            data[++currentIndex].setFrom(data[i]);\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  /** Apply parity logic among ranges which are not pre-sorted. */\r\n  public static simplifySortParity(data: Range1d[], removeZeroLengthRanges: boolean = false) {\r\n    const numData: number[] = [];\r\n    for (const range of data) {\r\n      if (range.low !== range.high) {\r\n        numData.push(range.low);\r\n        numData.push(range.high);\r\n      }\r\n    }\r\n    const n = numData.length;\r\n    numData.sort((a: number, b: number): number => {\r\n      if (a < b) return -1;\r\n      if (a > b) return 1;\r\n      return 0;\r\n    });\r\n\r\n    let currIdx = 0;\r\n    let x0;\r\n    let x1;\r\n    for (let i = 0; i < n; i += 2) {\r\n      x0 = numData[i];\r\n      x1 = numData[i + 1];\r\n      if (!removeZeroLengthRanges) {\r\n        Range1d.createXX(x0, x1, data[currIdx++]);\r\n      } else {\r\n        // coalesce intervals that share end and start:\r\n        while (i + 2 < n && numData[i + 2] === x1) {\r\n          i += 2;\r\n          x1 = numData[i + 1];\r\n        }\r\n        if (x1 > x0)\r\n          Range1d.createXX(x0, x1, data[currIdx++]);\r\n      }\r\n    }\r\n\r\n    data.length = currIdx;\r\n  }\r\n\r\n  /** test if value is \"in\" by union rules.\r\n   * * This considers all intervals-- i.e. does not expect or take advantage of sorting.\r\n   */\r\n  public static testUnion(data: Range1d[], value: number): boolean {\r\n    return this.countContainingRanges(data, value) > 0;\r\n  }\r\n  /** test if value is \"in\" by parity rules.\r\n   * * This considers all intervals-- i.e. does not expect or take advantage of sorting.\r\n   */\r\n  public static testParity(data: Range1d[], value: number): boolean {\r\n    let inside = false;\r\n    for (const range of data) {\r\n      if (range.containsX(value))\r\n        inside = !inside;\r\n    }\r\n    return inside;\r\n  }\r\n\r\n  /** linear search to count number of intervals which contain `value`.\r\n   */\r\n  public static countContainingRanges(data: Range1d[], value: number): number {\r\n    let n = 0;\r\n    for (const range of data) {\r\n      if (range.containsX(value))\r\n        n++;\r\n    }\r\n    return n;\r\n  }\r\n\r\n  /** return an array with all the low and high values of all the ranges.\r\n   * @param data array of ranges.\r\n   * @param sort optionally request immediate sort.\r\n   * @param compress optionally request removal of duplicates.\r\n   */\r\n  public static getBreaks(data: Range1d[], result?: GrowableFloat64Array, sort: boolean = false, compress: boolean = false, clear: boolean = true): GrowableFloat64Array {\r\n    if (!result) result = new GrowableFloat64Array(2 * data.length);\r\n    if (clear) result.clear();\r\n    for (const range of data) {\r\n      result.push(range.low);\r\n      result.push(range.high);\r\n    }\r\n    if (sort)\r\n      result.sort();\r\n    if (compress)\r\n      result.compressAdjacentDuplicates();\r\n\r\n    return result;\r\n  }\r\n\r\n  /**  evaluate a point at an array of given fraction values\r\n   * @param data array of ranges.\r\n   * @param initialRangeFraction fraction coordinate applied only to first range. (typically negative)\r\n   * @param rangeFraction fraction within each range.\r\n   * @param includeDegenerateRange if false, skip rangeFraction for 0-length ranges.\r\n   * @param gapFraction fraction within interval from each range high to successor low\r\n   * @param includeDegenerateGap if false, skip rangeFraction for 0-length gaps.\r\n   * @param finalRangeFraction fraction coordinate applied only to last range (typically an extrapolation above)\r\n   * @param result array to receive values\r\n   */\r\n  public static appendFractionalPoints(data: Range1d[], initialRangeFraction: number | undefined, rangeFraction: number | undefined, includeDegenerateRange: boolean,\r\n    gapFraction: number | undefined, includeDegenerateGap: boolean,\r\n    finalRangeFraction: number | undefined, result: GrowableFloat64Array | number[]): GrowableFloat64Array | number[] {\r\n    const numRange = data.length;\r\n    if (numRange > 0) {\r\n      if (undefined !== initialRangeFraction)\r\n        result.push(data[0].fractionToPoint(initialRangeFraction));\r\n      for (let i = 0; i < numRange; i++) {\r\n        if (rangeFraction !== undefined && (includeDegenerateRange || data[i].low !== data[i].high))\r\n          result.push(data[i].fractionToPoint(rangeFraction));\r\n        if (i > 1 && gapFraction !== undefined && (includeDegenerateGap || data[i].low !== data[i].high))\r\n          result.push(Geometry.interpolate(data[i - 1].high, gapFraction, data[i].low));\r\n      }\r\n      if (undefined !== finalRangeFraction)\r\n        result.push(data[numRange - 1].fractionToPoint(finalRangeFraction));\r\n    }\r\n    return result;\r\n  }\r\n\r\n  /** Return a single range constructed with the low of range 0 and high of final range in the set.  */\r\n  public static firstLowToLastHigh(data: Range1d[]): Range1d {\r\n    if (data.length === 0)\r\n      return Range1d.createNull();\r\n    return Range1d.createXX(data[0].low, data[data.length - 1].high);\r\n  }\r\n  /** sum the lengths of all ranges */\r\n  public static sumLengths(data: Range1d[]): number {\r\n    let sum = 0.0;\r\n    for (const range of data) {\r\n      sum += range.length();\r\n    }\r\n    return sum;\r\n  }\r\n\r\n  /**\r\n   * Test if the low,high values are sorted with no overlap.\r\n   * @param data array of ranges.\r\n   * @param strict if true, consider exact high-to-low match as overlap.\r\n   */\r\n  public static isSorted(data: Range1d[], strict: boolean = true): boolean {\r\n    const n = data.length;\r\n    if (strict) {\r\n      for (let i = 0; i + 1 < n; i++) {\r\n        if (data[i].high >= data[i + 1].low)\r\n          return false;\r\n      }\r\n    } else {\r\n      for (let i = 0; i + 1 < n; i++) {\r\n        if (data[i].high > data[i + 1].low)\r\n          return false;\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n}\r\n\r\n/** Checks low's first, then high's\r\n * @internal\r\n */\r\nexport function compareRange1dLexicalLowHigh(a: Range1d, b: Range1d): number {\r\n  if (a.low < b.low) return -1;\r\n  if (a.low > b.low) return 1;\r\n  if (a.high < b.high) return -1;\r\n  if (a.high > b.high) return 1;\r\n  return 0;\r\n}\r\n"]}

package/lib/cjs/numerics/SmallSystem.d.ts

@@ -0,0 +1,164 @@
+import { Point2d, Vector2d } from "../geometry3d/Point2dVector2d";
+import { Point3d, Vector3d } from "../geometry3d/Point3dVector3d";
+import { XAndY } from "../geometry3d/XYZProps";
+import { Point4d } from "../geometry4d/Point4d";
+/**
+ * static methods for commonly appearing sets of equations in 2 or 3 variables
+ * @public
+ */
+export declare class SmallSystem {
+    /**
+     * Return true if lines (a0,a1) to (b0, b1) have a simple intersection.
+     * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param a0 start point of line a
+     * @param a1  end point of line a
+     * @param b0  start point of line b
+     * @param b1 end point of line b
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegment2dXYTransverseIntersectionUnbounded(a0: Point2d, a1: Point2d, b0: Point2d, b1: Point2d, result: Vector2d): boolean;
+    /**
+     * * (ax0,ay0) to (ax0+ux,ay0+uy) are line A.
+     * * (bx0,by0) to (bx0+vx,by0+vy) are lineB.
+     * * Return true if the lines have a simple intersection.
+     * * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegmentXYUVTransverseIntersectionUnbounded(ax0: number, ay0: number, ux: number, uy: number, bx0: number, by0: number, vx: number, vy: number, result: Vector2d): boolean;
+    /**
+     * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts
+     * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param a0 start point of line a
+     * @param a1  end point of line a
+     * @param b0  start point of line b
+     * @param b1 end point of line b
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegment3dXYTransverseIntersectionUnbounded(a0: Point3d, a1: Point3d, b0: Point3d, b1: Point3d, result: Vector2d): boolean;
+    /**
+     * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts of WEIGHTED 4D Points
+     * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param hA0 homogeneous start point of line a
+     * @param hA1 homogeneous end point of line a
+     * @param hB0 homogeneous start point of line b
+     * @param hB1 homogeneous end point of line b
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegment3dHXYTransverseIntersectionUnbounded(hA0: Point4d, hA1: Point4d, hB0: Point4d, hB1: Point4d, result?: Vector2d): Vector2d | undefined;
+    /**
+     * Return the line fraction at which the (homogeneous) line is closest to a space point as viewed in xy only.
+     * @param hA0 homogeneous start point of line a
+     * @param hA1 homogeneous end point of line a
+     * @param spacePoint homogeneous point in space
+     */
+    static lineSegment3dHXYClosestPointUnbounded(hA0: Point4d, hA1: Point4d, spacePoint: Point4d): number | undefined;
+    /**
+     * Return the line fraction at which the line is closest to a space point as viewed in xy only.
+     * @param pointA0 start point
+     * @param pointA1 end point
+     * @param spacePoint point in space
+     */
+    static lineSegment3dXYClosestPointUnbounded(pointA0: XAndY, pointA1: XAndY, spacePoint: XAndY): number | undefined;
+    /**
+     * Return the line fraction at which the line is closest to a space point
+     * @param pointA0 start point
+     * @param pointA1 end point
+     * @param spacePoint point in space
+     */
+    static lineSegment3dClosestPointUnbounded(pointA0: Point3d, pointA1: Point3d, spacePoint: Point3d): number | undefined;
+    /**
+     * Return true if lines (a0,a1) to (b0, b1) have closest approach (go by each other) in 3d
+     * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param a0 start point of line a
+     * @param a1  end point of line a
+     * @param b0  start point of line b
+     * @param b1 end point of line b
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegment3dClosestApproachUnbounded(a0: Point3d, a1: Point3d, b0: Point3d, b1: Point3d, result: Vector2d): boolean;
+    /**
+     * Return true if the given rays have closest approach (go by each other) in 3d
+     * Return the fractional (not xy) coordinates as x and y parts of a Point2d.
+     * @param ax x-coordinate of the origin of the first ray
+     * @param ay y-coordinate of the origin of the first ray
+     * @param az z-coordinate of the origin of the first ray
+     * @param au x-coordinate of the direction vector of the first ray
+     * @param av y-coordinate of the direction vector of the first ray
+     * @param aw z-coordinate of the direction vector of the first ray
+     * @param bx x-coordinate of the origin of the second ray
+     * @param by y-coordinate of the origin of the second ray
+     * @param bz z-coordinate of the origin of the second ray
+     * @param bu x-coordinate of the direction vector of the second ray
+     * @param bv y-coordinate of the direction vector of the second ray
+     * @param bw z-coordinate of the direction vector of the second ray
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static ray3dXYZUVWClosestApproachUnbounded(ax: number, ay: number, az: number, au: number, av: number, aw: number, bx: number, by: number, bz: number, bu: number, bv: number, bw: number, result: Vector2d): boolean;
+    /**
+     * Solve the pair of linear equations
+     * * `ux * x + vx * y = cx`
+     * * `uy * x + vy * y = cy`
+     * @param ux xx coefficient
+     * @param vx xy coefficient
+     * @param uy yx coefficient
+     * @param vy yy coefficient
+     * @param cx x right hand side
+     * @param cy y right hand side
+     * @param result (x,y) solution (MUST be preallocated by caller)
+     */
+    static linearSystem2d(ux: number, vx: number, // first row of matrix
+    uy: number, vy: number, // second row of matrix
+    cx: number, cy: number, // right side
+    result: Vector2d): boolean;
+    /**
+     * Solve a linear system:
+     * * x equation: `axx * u + axy * v + axz * w = cx`
+     * * y equation: `ayx * u + ayy * v + ayz * w = cy`
+     * * z equation: `azx * u + azy * v + azz * w = cz`
+     * @param axx row 0, column 0 coefficient
+     * @param axy row 0, column 1 coefficient
+     * @param axz row 0, column 1 coefficient
+     * @param ayx row 1, column 0 coefficient
+     * @param ayy row 1, column 1 coefficient
+     * @param ayz row 1, column 2 coefficient
+     * @param azx row 2, column 0 coefficient
+     * @param azy row 2, column 1 coefficient
+     * @param azz row 2, column 2 coefficient
+     * @param cx right hand side row 0 coefficient
+     * @param cy right hand side row 1 coefficient
+     * @param cz right hand side row 2 coefficient
+     * @param result optional result.
+     * @returns solution vector (u,v,w) or `undefined` if system is singular.
+     */
+    static linearSystem3d(axx: number, axy: number, axz: number, // first row of matrix
+    ayx: number, ayy: number, ayz: number, // second row of matrix
+    azx: number, azy: number, azz: number, // second row of matrix
+    cx: number, cy: number, cz: number, // right side
+    result?: Vector3d): Vector3d | undefined;
+    /**
+     * Compute the intersection of three planes.
+     * @param xyzA point on the first plane
+     * @param normalA normal of the first plane
+     * @param xyzB point on the second plane
+     * @param normalB normal of the second plane
+     * @param xyzC point on the third plane
+     * @param normalC normal of the third plane
+     * @param result optional result
+     * @returns intersection point of the three planes (as a Vector3d), or undefined if at least two planes are parallel.
+     */
+    static intersect3Planes(xyzA: Point3d, normalA: Vector3d, xyzB: Point3d, normalB: Vector3d, xyzC: Point3d, normalC: Vector3d, result?: Vector3d): Vector3d | undefined;
+    /**
+     * * in rowB, replace `rowB[j] += a * rowB[pivot] * rowA[j] / rowA[pivot]` for `j>pivot`
+     * @param rowA row that does not change
+     * @param pivotIndex index of pivot (divisor) in rowA.
+     * @param rowB row where elimination occurs.
+     */
+    static eliminateFromPivot(rowA: Float64Array, pivotIndex: number, rowB: Float64Array, a: number): boolean;
+    /**
+     * Solve a pair of bilinear equations
+     * * First equation: `a0 + b0 * u + c0 * v + d0 * u * v = 0`
+     * * Second equation: `a1 + b1 * u + c1 * v + d1 * u * v = 0`
+     */
+    static solveBilinearPair(a0: number, b0: number, c0: number, d0: number, a1: number, b1: number, c1: number, d1: number): Point2d[] | undefined;
+}
+//# sourceMappingURL=SmallSystem.d.ts.map

package/lib/cjs/numerics/SmallSystem.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SmallSystem.d.ts","sourceRoot":"","sources":["../../../src/numerics/SmallSystem.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAKhD;;;GAGG;AACH,qBAAa,WAAW;IACtB;;;;;;;;OAQG;WACW,8CAA8C,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAC7G,MAAM,EAAE,QAAQ,GAAG,OAAO;IAsB5B;;;;;;OAMG;WACW,8CAA8C,CAC1D,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAChD,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAChD,MAAM,EAAE,QAAQ,GAAG,OAAO;IAkB5B;;;;;;;;OAQG;WACW,8CAA8C,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAC7G,MAAM,EAAE,QAAQ,GAAG,OAAO;IAuB5B;;;;;;;;OAQG;WACW,+CAA+C,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IA6B9J;;;;;OAKG;WACW,qCAAqC,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAmBxH;;;;;OAKG;WACW,oCAAoC,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,GAAG,MAAM,GAAG,SAAS;IAWzH;;;;;OAKG;WACW,kCAAkC,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAY7H;;;;;;;;OAQG;WACW,qCAAqC,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EACpG,MAAM,EAAE,QAAQ,GAAG,OAAO;IAQ5B;;;;;;;;;;;;;;;;OAgBG;WACW,mCAAmC,CAC/C,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EACtE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EACtE,MAAM,EAAE,QAAQ,GAAG,OAAO;IAa5B;;;;;;;;;;;OAWG;WACW,cAAc,CAC1B,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,sBAAsB;IAC9C,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,uBAAuB;IAC/C,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,aAAa;IACrC,MAAM,EAAE,QAAQ,GACf,OAAO;IAaV;;;;;;;;;;;;;;;;;;;OAmBG;WACW,cAAc,CAC1B,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,sBAAsB;IAC7D,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,uBAAuB;IAC9D,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,uBAAuB;IAC9D,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAK,aAAa;IACpD,MAAM,CAAC,EAAE,QAAQ,GAChB,QAAQ,GAAG,SAAS;IAcvB;;;;;;;;;;OAUG;WACW,gBAAgB,CAC5B,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAChC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAChC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAU5E;;;;;OAKG;WACW,kBAAkB,CAAC,IAAI,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IAShH;;;;OAIG;WACW,iBAAiB,CAC7B,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAC9C,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAC7C,OAAO,EAAE,GAAG,SAAS;CAGzB"}

package/lib/cjs/numerics/SmallSystem.js

@@ -0,0 +1,321 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SmallSystem = void 0;
+/** @packageDocumentation
+ * @module Numerics
+ */
+const Geometry_1 = require("../Geometry");
+const Point2dVector2d_1 = require("../geometry3d/Point2dVector2d");
+const Point3dVector3d_1 = require("../geometry3d/Point3dVector3d");
+const Polynomials_1 = require("./Polynomials");
+// cspell:word XYUV
+/**
+ * static methods for commonly appearing sets of equations in 2 or 3 variables
+ * @public
+ */
+class SmallSystem {
+    /**
+     * Return true if lines (a0,a1) to (b0, b1) have a simple intersection.
+     * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param a0 start point of line a
+     * @param a1  end point of line a
+     * @param b0  start point of line b
+     * @param b1 end point of line b
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegment2dXYTransverseIntersectionUnbounded(a0, a1, b0, b1, result) {
+        const ux = a1.x - a0.x;
+        const uy = a1.y - a0.y;
+        const vx = b1.x - b0.x;
+        const vy = b1.y - b0.y;
+        const cx = b0.x - a0.x;
+        const cy = b0.y - a0.y;
+        const uv = Geometry_1.Geometry.crossProductXYXY(ux, uy, vx, vy);
+        const cv = Geometry_1.Geometry.crossProductXYXY(cx, cy, vx, vy);
+        const cu = Geometry_1.Geometry.crossProductXYXY(ux, uy, cx, cy);
+        const s = Geometry_1.Geometry.conditionalDivideFraction(cv, uv);
+        const t = Geometry_1.Geometry.conditionalDivideFraction(cu, uv);
+        if (s !== undefined && t !== undefined) {
+            result.set(s, -t);
+            return true;
+        }
+        result.set(0, 0);
+        return false;
+    }
+    /**
+     * * (ax0,ay0) to (ax0+ux,ay0+uy) are line A.
+     * * (bx0,by0) to (bx0+vx,by0+vy) are lineB.
+     * * Return true if the lines have a simple intersection.
+     * * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegmentXYUVTransverseIntersectionUnbounded(ax0, ay0, ux, uy, bx0, by0, vx, vy, result) {
+        const cx = bx0 - ax0;
+        const cy = by0 - ay0;
+        const uv = Geometry_1.Geometry.crossProductXYXY(ux, uy, vx, vy);
+        const cv = Geometry_1.Geometry.crossProductXYXY(cx, cy, vx, vy);
+        const cu = Geometry_1.Geometry.crossProductXYXY(ux, uy, cx, cy);
+        const s = Geometry_1.Geometry.conditionalDivideFraction(cv, uv);
+        const t = Geometry_1.Geometry.conditionalDivideFraction(cu, uv);
+        if (s !== undefined && t !== undefined) {
+            result.set(s, -t);
+            return true;
+        }
+        result.set(0, 0);
+        return false;
+    }
+    /**
+     * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts
+     * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param a0 start point of line a
+     * @param a1  end point of line a
+     * @param b0  start point of line b
+     * @param b1 end point of line b
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegment3dXYTransverseIntersectionUnbounded(a0, a1, b0, b1, result) {
+        const ux = a1.x - a0.x;
+        const uy = a1.y - a0.y;
+        const vx = b1.x - b0.x;
+        const vy = b1.y - b0.y;
+        const cx = b0.x - a0.x;
+        const cy = b0.y - a0.y;
+        const uv = Geometry_1.Geometry.crossProductXYXY(ux, uy, vx, vy);
+        const cv = Geometry_1.Geometry.crossProductXYXY(cx, cy, vx, vy);
+        const cu = Geometry_1.Geometry.crossProductXYXY(ux, uy, cx, cy);
+        const s = Geometry_1.Geometry.conditionalDivideFraction(cv, uv);
+        const t = Geometry_1.Geometry.conditionalDivideFraction(cu, uv);
+        if (s !== undefined && t !== undefined) {
+            result.set(s, -t);
+            return true;
+        }
+        result.set(0, 0);
+        return false;
+    }
+    /**
+     * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts of WEIGHTED 4D Points
+     * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param hA0 homogeneous start point of line a
+     * @param hA1 homogeneous end point of line a
+     * @param hB0 homogeneous start point of line b
+     * @param hB1 homogeneous end point of line b
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegment3dHXYTransverseIntersectionUnbounded(hA0, hA1, hB0, hB1, result) {
+        // Considering only x,y,w parts....
+        // Point Q along B is (in full homogeneous)  `(1-lambda) B0 + lambda 1`
+        // PointQ is colinear with A0,A1 when the determinant det (A0,A1,Q) is zero.  (Each column takes xyw parts)
+        const alpha0 = Geometry_1.Geometry.tripleProduct(hA0.x, hA1.x, hB0.x, hA0.y, hA1.y, hB0.y, hA0.w, hA1.w, hB0.w);
+        const alpha1 = Geometry_1.Geometry.tripleProduct(hA0.x, hA1.x, hB1.x, hA0.y, hA1.y, hB1.y, hA0.w, hA1.w, hB1.w);
+        const fractionB = Geometry_1.Geometry.conditionalDivideFraction(-alpha0, alpha1 - alpha0);
+        if (fractionB !== undefined) {
+            const beta0 = Geometry_1.Geometry.tripleProduct(hB0.x, hB1.x, hA0.x, hB0.y, hB1.y, hA0.y, hB0.w, hB1.w, hA0.w);
+            const beta1 = Geometry_1.Geometry.tripleProduct(hB0.x, hB1.x, hA1.x, hB0.y, hB1.y, hA1.y, hB0.w, hB1.w, hA1.w);
+            const fractionA = Geometry_1.Geometry.conditionalDivideFraction(-beta0, beta1 - beta0);
+            if (fractionA !== undefined)
+                return Point2dVector2d_1.Vector2d.create(fractionA, fractionB, result);
+        }
+        return undefined;
+    }
+    /**
+     * Return the line fraction at which the (homogeneous) line is closest to a space point as viewed in xy only.
+     * @param hA0 homogeneous start point of line a
+     * @param hA1 homogeneous end point of line a
+     * @param spacePoint homogeneous point in space
+     */
+    static lineSegment3dHXYClosestPointUnbounded(hA0, hA1, spacePoint) {
+        // Considering only x,y,w parts....
+        // weighted difference of (A1 w0 - A0 w1) is (cartesian) tangent vector along the line as viewed.
+        // The perpendicular (pure vector) W = (-y,x) flip is the direction of projection
+        // Point Q along A is (in full homogeneous)  `(1-lambda) A0 + lambda 1 A1`
+        // PointQ is colinear with spacePoint and and W when the xyw homogeneous determinant | Q W spacePoint | is zero.
+        const tx = hA1.x * hA0.w - hA0.x * hA1.w;
+        const ty = hA1.y * hA0.w - hA0.y * hA1.w;
+        const det0 = Geometry_1.Geometry.tripleProduct(hA0.x, -ty, spacePoint.x, hA0.y, tx, spacePoint.y, hA0.w, 0, spacePoint.w);
+        const det1 = Geometry_1.Geometry.tripleProduct(hA1.x, -ty, spacePoint.x, hA1.y, tx, spacePoint.y, hA1.w, 0, spacePoint.w);
+        return Geometry_1.Geometry.conditionalDivideFraction(-det0, det1 - det0);
+    }
+    /**
+     * Return the line fraction at which the line is closest to a space point as viewed in xy only.
+     * @param pointA0 start point
+     * @param pointA1 end point
+     * @param spacePoint point in space
+     */
+    static lineSegment3dXYClosestPointUnbounded(pointA0, pointA1, spacePoint) {
+        // Considering only x,y parts....
+        const ux = pointA1.x - pointA0.x;
+        const uy = pointA1.y - pointA0.y;
+        const uu = ux * ux + uy * uy;
+        const vx = spacePoint.x - pointA0.x;
+        const vy = spacePoint.y - pointA0.y;
+        const uv = ux * vx + uy * vy;
+        return Geometry_1.Geometry.conditionalDivideFraction(uv, uu);
+    }
+    /**
+     * Return the line fraction at which the line is closest to a space point
+     * @param pointA0 start point
+     * @param pointA1 end point
+     * @param spacePoint point in space
+     */
+    static lineSegment3dClosestPointUnbounded(pointA0, pointA1, spacePoint) {
+        const ux = pointA1.x - pointA0.x;
+        const uy = pointA1.y - pointA0.y;
+        const uz = pointA1.z - pointA0.z;
+        const uu = ux * ux + uy * uy + uz * uz;
+        const vx = spacePoint.x - pointA0.x;
+        const vy = spacePoint.y - pointA0.y;
+        const vz = spacePoint.z - pointA0.z;
+        const uv = ux * vx + uy * vy + uz * vz;
+        return Geometry_1.Geometry.conditionalDivideFraction(uv, uu);
+    }
+    /**
+     * Return true if lines (a0,a1) to (b0, b1) have closest approach (go by each other) in 3d
+     * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param a0 start point of line a
+     * @param a1  end point of line a
+     * @param b0  start point of line b
+     * @param b1 end point of line b
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegment3dClosestApproachUnbounded(a0, a1, b0, b1, result) {
+        return this.ray3dXYZUVWClosestApproachUnbounded(a0.x, a0.y, a0.z, a1.x - a0.x, a1.y - a0.y, a1.z - a0.z, b0.x, b0.y, b0.z, b1.x - b0.x, b1.y - b0.y, b1.z - b0.z, result);
+    }
+    /**
+     * Return true if the given rays have closest approach (go by each other) in 3d
+     * Return the fractional (not xy) coordinates as x and y parts of a Point2d.
+     * @param ax x-coordinate of the origin of the first ray
+     * @param ay y-coordinate of the origin of the first ray
+     * @param az z-coordinate of the origin of the first ray
+     * @param au x-coordinate of the direction vector of the first ray
+     * @param av y-coordinate of the direction vector of the first ray
+     * @param aw z-coordinate of the direction vector of the first ray
+     * @param bx x-coordinate of the origin of the second ray
+     * @param by y-coordinate of the origin of the second ray
+     * @param bz z-coordinate of the origin of the second ray
+     * @param bu x-coordinate of the direction vector of the second ray
+     * @param bv y-coordinate of the direction vector of the second ray
+     * @param bw z-coordinate of the direction vector of the second ray
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static ray3dXYZUVWClosestApproachUnbounded(ax, ay, az, au, av, aw, bx, by, bz, bu, bv, bw, result) {
+        const cx = bx - ax;
+        const cy = by - ay;
+        const cz = bz - az;
+        const uu = Geometry_1.Geometry.hypotenuseSquaredXYZ(au, av, aw);
+        const vv = Geometry_1.Geometry.hypotenuseSquaredXYZ(bu, bv, bw);
+        const uv = Geometry_1.Geometry.dotProductXYZXYZ(au, av, aw, bu, bv, bw);
+        const cu = Geometry_1.Geometry.dotProductXYZXYZ(cx, cy, cz, au, av, aw);
+        const cv = Geometry_1.Geometry.dotProductXYZXYZ(cx, cy, cz, bu, bv, bw);
+        return SmallSystem.linearSystem2d(uu, -uv, uv, -vv, cu, cv, result);
+    }
+    /**
+     * Solve the pair of linear equations
+     * * `ux * x + vx * y = cx`
+     * * `uy * x + vy * y = cy`
+     * @param ux xx coefficient
+     * @param vx xy coefficient
+     * @param uy yx coefficient
+     * @param vy yy coefficient
+     * @param cx x right hand side
+     * @param cy y right hand side
+     * @param result (x,y) solution (MUST be preallocated by caller)
+     */
+    static linearSystem2d(ux, vx, // first row of matrix
+    uy, vy, // second row of matrix
+    cx, cy, // right side
+    result) {
+        const uv = Geometry_1.Geometry.crossProductXYXY(ux, uy, vx, vy);
+        const cv = Geometry_1.Geometry.crossProductXYXY(cx, cy, vx, vy);
+        const cu = Geometry_1.Geometry.crossProductXYXY(ux, uy, cx, cy);
+        const s = Geometry_1.Geometry.conditionalDivideFraction(cv, uv);
+        const t = Geometry_1.Geometry.conditionalDivideFraction(cu, uv);
+        if (s !== undefined && t !== undefined) {
+            result.set(s, t);
+            return true;
+        }
+        result.set(0, 0);
+        return false;
+    }
+    /**
+     * Solve a linear system:
+     * * x equation: `axx * u + axy * v + axz * w = cx`
+     * * y equation: `ayx * u + ayy * v + ayz * w = cy`
+     * * z equation: `azx * u + azy * v + azz * w = cz`
+     * @param axx row 0, column 0 coefficient
+     * @param axy row 0, column 1 coefficient
+     * @param axz row 0, column 1 coefficient
+     * @param ayx row 1, column 0 coefficient
+     * @param ayy row 1, column 1 coefficient
+     * @param ayz row 1, column 2 coefficient
+     * @param azx row 2, column 0 coefficient
+     * @param azy row 2, column 1 coefficient
+     * @param azz row 2, column 2 coefficient
+     * @param cx right hand side row 0 coefficient
+     * @param cy right hand side row 1 coefficient
+     * @param cz right hand side row 2 coefficient
+     * @param result optional result.
+     * @returns solution vector (u,v,w) or `undefined` if system is singular.
+     */
+    static linearSystem3d(axx, axy, axz, // first row of matrix
+    ayx, ayy, ayz, // second row of matrix
+    azx, azy, azz, // second row of matrix
+    cx, cy, cz, // right side
+    result) {
+        // determinants of various combinations of columns ...
+        const detXYZ = Geometry_1.Geometry.tripleProduct(axx, ayx, azx, axy, ayy, azy, axz, ayz, azz);
+        const detCYZ = Geometry_1.Geometry.tripleProduct(cx, cy, cz, axy, ayy, azy, axz, ayz, azz);
+        const detXCZ = Geometry_1.Geometry.tripleProduct(axx, ayx, azx, cx, cy, cz, axz, ayz, azz);
+        const detXYC = Geometry_1.Geometry.tripleProduct(axx, ayx, azx, axy, ayy, azy, cx, cy, cz);
+        const s = Geometry_1.Geometry.conditionalDivideFraction(detCYZ, detXYZ);
+        const t = Geometry_1.Geometry.conditionalDivideFraction(detXCZ, detXYZ);
+        const u = Geometry_1.Geometry.conditionalDivideFraction(detXYC, detXYZ);
+        if (s !== undefined && t !== undefined && u !== undefined) {
+            return Point3dVector3d_1.Vector3d.create(s, t, u, result);
+        }
+        return undefined;
+    }
+    /**
+     * Compute the intersection of three planes.
+     * @param xyzA point on the first plane
+     * @param normalA normal of the first plane
+     * @param xyzB point on the second plane
+     * @param normalB normal of the second plane
+     * @param xyzC point on the third plane
+     * @param normalC normal of the third plane
+     * @param result optional result
+     * @returns intersection point of the three planes (as a Vector3d), or undefined if at least two planes are parallel.
+     */
+    static intersect3Planes(xyzA, normalA, xyzB, normalB, xyzC, normalC, result) {
+        return this.linearSystem3d(normalA.x, normalA.y, normalA.z, normalB.x, normalB.y, normalB.z, normalC.x, normalC.y, normalC.z, Geometry_1.Geometry.dotProductXYZXYZ(xyzA.x, xyzA.y, xyzA.z, normalA.x, normalA.y, normalA.z), Geometry_1.Geometry.dotProductXYZXYZ(xyzB.x, xyzB.y, xyzB.z, normalB.x, normalB.y, normalB.z), Geometry_1.Geometry.dotProductXYZXYZ(xyzC.x, xyzC.y, xyzC.z, normalC.x, normalC.y, normalC.z), result);
+    }
+    /**
+     * * in rowB, replace `rowB[j] += a * rowB[pivot] * rowA[j] / rowA[pivot]` for `j>pivot`
+     * @param rowA row that does not change
+     * @param pivotIndex index of pivot (divisor) in rowA.
+     * @param rowB row where elimination occurs.
+     */
+    static eliminateFromPivot(rowA, pivotIndex, rowB, a) {
+        const n = rowA.length;
+        let q = Geometry_1.Geometry.conditionalDivideFraction(rowB[pivotIndex], rowA[pivotIndex]);
+        if (q === undefined)
+            return false;
+        q *= a;
+        for (let j = pivotIndex + 1; j < n; j++)
+            rowB[j] += q * rowA[j];
+        return true;
+    }
+    /**
+     * Solve a pair of bilinear equations
+     * * First equation: `a0 + b0 * u + c0 * v + d0 * u * v = 0`
+     * * Second equation: `a1 + b1 * u + c1 * v + d1 * u * v = 0`
+     */
+    static solveBilinearPair(a0, b0, c0, d0, a1, b1, c1, d1) {
+        return Polynomials_1.BilinearPolynomial.solveBilinearPair(a0, b0, c0, d0, a1, b1, c1, d1);
+    }
+}
+exports.SmallSystem = SmallSystem;
+//# sourceMappingURL=SmallSystem.js.map