@itwin/core-geometry 4.1.0-dev.7 → 4.1.0-dev.70

package/lib/cjs/geometry3d/FrameBuilder.js

@@ -240,18 +240,20 @@ class FrameBuilder {
                 return result;
             }
         }
-        // try direct evaluation of curve primitives?
+        const evaluatePrimitiveFrame = (curve) => {
+            return curve.fractionToFrenetFrame(0.0);
+        };
+        // try direct evaluation of curve primitives using the above lambda
         for (const data of params) {
-            if (data instanceof CurveCollection_1.CurveCollection) {
-                const children = data.children;
-                if (children) {
-                    for (const curve of children) {
-                        if (curve instanceof CurvePrimitive_1.CurvePrimitive) {
-                            const frenetFrame = curve.fractionToFrenetFrame(0.0);
-                            if (frenetFrame)
-                                return frenetFrame;
-                        }
-                    }
+            if (data instanceof CurvePrimitive_1.CurvePrimitive) {
+                return evaluatePrimitiveFrame(data);
+            }
+            else if (data instanceof CurveCollection_1.CurveCollection) {
+                const children = data.collectCurvePrimitives();
+                for (const curve of children) {
+                    const frenetFrame = evaluatePrimitiveFrame(curve);
+                    if (frenetFrame)
+                        return frenetFrame;
                 }
             }
         }

package/lib/cjs/geometry3d/FrameBuilder.js.map

@@ -1 +1 @@
-{"version":3,"file":"FrameBuilder.js","sourceRoot":"","sources":["../../../src/geometry3d/FrameBuilder.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAA0C;AAC1C,0DAAyD;AACzD,0EAAuE;AACvE,0CAAuC;AACvC,8DAA2D;AAC3D,4DAAyD;AACzD,0DAAuD;AACvD,wDAAqD;AACrD,mEAAmE;AACnE,0CAAmE;AACnE,yDAAsD;AACtD,yCAAsC;AACtC,uDAAsD;AACtD,iDAA8C;AAC9C,6CAA0C;AAE1C,2CAAwC;AAExC;;;;;;;;;;;;;;;GAeG;AACH,MAAa,YAAY;IAKvB,uEAAuE;IAC/D,6BAA6B,CAAC,OAAiB,EAAE,OAAiB,EAAE,mBAA2B,mBAAQ,CAAC,iBAAiB;QAC/H,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE;YAClD,MAAM,CAAC,GAAG,OAAO,CAAC,0BAA0B,CAAC,OAAO,CAAC,CAAC;YACtD,OAAO,CAAC,GAAG,gBAAgB,CAAC;SAC7B;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,KAAK,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC;IAC7H,gBAAgB,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC/B;;;;OAIG;IACI,iBAAiB,CAAC,kBAA2B,KAAK;QACvD,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClD,IAAI,CAAC,eAAe,EAAE;gBACpB,MAAM,MAAM,GAAG,mBAAQ,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,oBAAS,CAAC,GAAG,CAAC,CAAC;gBAC5F,IAAI,MAAM;oBACR,OAAO,qBAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBAC/D,gFAAgF;gBAChF,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;aAC3C;iBAAM,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACxB,MAAM,MAAM,GAAG,mBAAQ,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,oBAAS,CAAC,GAAG,CAAC,CAAC;gBAC5F,IAAI,MAAM,EAAE;oBACV,IAAI,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;wBAC/D,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;oBACtC,OAAO,qBAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;iBAC9D;gBACD,sFAAsF;gBACtF,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAC9B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAC1C,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;aAC9B;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,kGAAkG;IAC3F,oBAAoB,CAAC,MAAiB;QAC3C,IAAI,MAAM,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;YACpF,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SACpD;IACH,CAAC;IACD,8DAA8D;IAC9D,IAAW,SAAS,KAAc,OAAO,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC;IACtE;OACG;IACI,gBAAgB;QACrB,IAAI,CAAC,IAAI,CAAC,QAAQ;YAChB,OAAO,CAAC,CAAC;QACX,IAAI,CAAC,IAAI,CAAC,QAAQ;YAChB,OAAO,CAAC,CAAC;QACX,IAAI,CAAC,IAAI,CAAC,QAAQ;YAChB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;IACD,8HAA8H;IACvH,aAAa,CAAC,KAAc;QACjC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;YACjB,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC;SAChC;QACD,iDAAiD;QACjD,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC;YACnC,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACjC,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAC3D,CAAC;IACD,6BAA6B;IACtB,cAAc,CAAC,MAAgB;QACpC,IAAI,MAAM,CAAC,YAAY;YACrB,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAEjC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YAAE,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAAC,OAAO,CAAC,CAAC;SAAE;QAE9E,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YAClB,IAAI,IAAI,CAAC,6BAA6B,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE;gBACrE,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC5C,OAAO,CAAC,CAAC;aACV;YACD,OAAO,CAAC,CAAC;SACV;QAED,uCAAuC;QACvC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YAClB,MAAM,iBAAiB,GAAG,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACxE,IAAI,iBAAiB,IAAI,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,CAAC,EAAE,iBAAiB,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE;gBAC5F,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC5C,OAAO,CAAC,CAAC;aACV;YACD,OAAO,CAAC,CAAC;SACV;QACD,0EAA0E;QAC1E,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;OAEG;IACI,QAAQ,CAAC,IAAS;QACvB,IAAI,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC;YAAE,OAAO;QACxC,IAAI,IAAI,YAAY,yBAAO;YACzB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;aACtB,IAAI,IAAI,YAAY,0BAAQ;YAC/B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;aACvB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC5B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;gBACxB,IAAI,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC;oBAC7B,MAAM;gBACR,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;aACtB;SACF;aAAM,IAAI,IAAI,YAAY,+BAAc,EAAE;YACzC,IAAI,IAAI,YAAY,6BAAa,EAAE;gBACjC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;gBACtC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;aACrC;iBAAM,IAAI,IAAI,YAAY,aAAK,EAAE;gBAChC,MAAM,GAAG,GAAG,IAAI,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC;gBACnD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC/B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACnC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;aACvE;iBAAM,IAAI,IAAI,YAAY,2BAAY,EAAE;gBACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;oBAC/B,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;oBAC1B,IAAI,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC;wBAC7B,MAAM;iBACT;aACF;iBAAM,IAAI,IAAI,YAAY,6BAAc,EAAE;gBACzC,MAAM,KAAK,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;gBAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAChD,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,KAAK,CAAC,YAAY,yBAAO;wBAClD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;;wBACvB,MAAM;iBACZ;aACF;iBAAM,IAAI,IAAI,YAAY,2CAAoB,EAAE;gBAC/C,MAAM,KAAK,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;gBAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAChD,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,EAAE;wBACrC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;wBACzC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;qBAC3B;;wBAAM,MAAM;iBACd;aACF;iBAAM,EAAE,oCAAoC;gBAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;gBAC9C,IAAI,SAAS,KAAK,KAAK,EAAE;oBACvB,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC;oBACtC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;iBAChD;aACF;SACF;aAAM,IAAI,IAAI,YAAY,iCAAe,EAAE;YAC1C,IAAI,IAAI,CAAC,QAAQ;gBACf,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;oBACjC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;oBACrB,IAAI,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC;wBAC7B,MAAM;iBACT;SACJ;aAAM,IAAI,IAAI,YAAY,mCAAgB,EAAE;YAC3C,MAAM,KAAK,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAChD,IAAI,IAAI,CAAC,6BAA6B,CAAC,CAAC,EAAE,KAAK,CAAC,YAAY,yBAAO;oBACjE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;;oBACvB,MAAM;aACZ;SACF;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,sBAAsB,CAAC,eAAqC,EAAE,GAAG,MAAa;QAC1F,MAAM,OAAO,GAAG,IAAI,YAAY,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE;YACzB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACvB,OAAO,CAAC,oBAAoB,CAAC,eAAe,CAAC,CAAC;YAC9C,MAAM,MAAM,GAAG,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAChD,IAAI,MAAM,KAAK,SAAS,EAAE;gBACxB,IAAI,eAAe,EAAE;oBACnB,IAAI,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,GAAG;wBACjD,MAAM,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;iBAChD;gBACD,OAAO,MAAM,CAAC;aACf;SACF;QACD,6CAA6C;QAC7C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE;YACzB,IAAI,IAAI,YAAY,iCAAe,EAAE;gBACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAC/B,IAAI,QAAQ,EAAE;oBACZ,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;wBAC5B,IAAI,KAAK,YAAY,+BAAc,EAAE;4BACnC,MAAM,WAAW,GAAG,KAAK,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;4BACrD,IAAI,WAAW;gCACb,OAAO,WAAW,CAAC;yBACtB;qBACF;iBACF;aACF;SAEF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,6BAA6B,CAAC,GAAG,MAAa;QAC1D,MAAM,OAAO,GAAG,IAAI,YAAY,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE;YACzB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACvB,MAAM,YAAY,GAAG,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;YACtD,IAAI,YAAY,KAAK,SAAS;gBAC5B,OAAO,YAAY,CAAC;SACvB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,0BAA0B,CAAC,MAAiB;QACxD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YACrB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,0BAAQ,CAAC,MAAM,EAAE,CAAC;YACnC,2BAAY,CAAC,uBAAuB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAClE,MAAM,QAAQ,GAAG,0BAAQ,CAAC,MAAM,EAAE,CAAC;YACnC,2BAAY,CAAC,wCAAwC,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAC1F,MAAM,MAAM,GAAG,mBAAQ,CAAC,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,EAAE,oBAAS,CAAC,GAAG,CAAC,CAAC;YAClF,IAAI,MAAM;gBACR,OAAO,qBAAS,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;SAC/C;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,yBAAyB,CAAC,MAAiB;QACvD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YACrB,MAAM,GAAG,GAAG,uBAAU,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,GAAG,EAAE;gBACP,OAAO,GAAG,CAAC,aAAa,EAAE,CAAC;aAC5B;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,kCAAkC,CAC9C,KAAc,EACd,cAA+B,0BAAe,CAAC,0BAA0B,EACzE,YAAoB,CAAC,EACrB,YAAoB,CAAC,EACrB,YAAoB,CAAC,EACrB,oBAA4B,GAAG;QAC/B,IAAI,KAAK,CAAC,MAAM;YACd,OAAO,qBAAS,CAAC,cAAc,EAAE,CAAC;QACpC,IAAI,CAAC,GAAG,GAAG,CAAC;QACZ,IAAI,CAAC,GAAG,GAAG,CAAC;QACZ,IAAI,CAAC,GAAG,GAAG,CAAC;QACZ,IAAI,WAAW,KAAK,0BAAe,CAAC,qBAAqB,EAAE;YACzD,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,mBAAQ,CAAC,0BAA0B,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,iBAAiB,CAAC,CAAC;SACvF;aAAM,IAAI,WAAW,KAAK,0BAAe,CAAC,0BAA0B,EAAE;YACrE,CAAC,GAAG,mBAAQ,CAAC,0BAA0B,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,iBAAiB,CAAC,GAAG,mBAAQ,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnH,CAAC,GAAG,mBAAQ,CAAC,0BAA0B,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,iBAAiB,CAAC,GAAG,mBAAQ,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnH,CAAC,GAAG,mBAAQ,CAAC,0BAA0B,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,iBAAiB,CAAC,GAAG,mBAAQ,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;SACpH;QACD,OAAO,qBAAS,CAAC,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,mBAAQ,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrH,CAAC;CAEF;AAnSD,oCAmSC","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 CartesianGeometry\r\n */\r\n\r\n// import { Point2d } from \"./Geometry2d\";\r\nimport { BSplineCurve3d } from \"../bspline/BSplineCurve\";\r\nimport { InterpolationCurve3d } from \"../bspline/InterpolationCurve3d\";\r\nimport { Arc3d } from \"../curve/Arc3d\";\r\nimport { CurveCollection } from \"../curve/CurveCollection\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\nimport { AxisOrder, AxisScaleSelect, Geometry } from \"../Geometry\";\r\nimport { GrowableXYZArray } from \"./GrowableXYZArray\";\r\nimport { Matrix3d } from \"./Matrix3d\";\r\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\r\nimport { Point3dArray } from \"./PointHelpers\";\r\nimport { PolygonOps } from \"./PolygonOps\";\r\nimport { Range3d } from \"./Range\";\r\nimport { Transform } from \"./Transform\";\r\n\r\n/**\r\n * Helper class to accumulate points and vectors until there is enough data to define a coordinate system.\r\n *\r\n * * For the common case of building a right handed frame:\r\n *   * create the FrameBuilder and make calls to announcePoint and announceVector.\r\n *   * the frame will be fully determined by an origin and two vectors.\r\n *   * the first call to announcePoint will set the origin.\r\n *   *  additional calls to announcePoint will produce announceVector call with the vector from the origin.\r\n *   * After each announcement, call getValidatedFrame(false)\r\n *   * getValidatedFrame will succeed when it has two independent vectors.\r\n * *  to build a left handed frame,\r\n *   *  an origin and 3 independent vectors are required.\r\n *   *  announce as above, but query with getValidatedFrame (true).\r\n *   *  this will use the third vector to select right or left handed frame.\r\n * @public\r\n */\r\nexport class FrameBuilder {\r\n  private _origin: undefined | Point3d;\r\n  private _vector0: undefined | Vector3d;\r\n  private _vector1: undefined | Vector3d;\r\n  private _vector2: undefined | Vector3d;\r\n  // test if both vectors are defined and have significant angle between.\r\n  private areStronglyIndependentVectors(vector0: Vector3d, vector1: Vector3d, radiansTolerance: number = Geometry.smallAngleRadians): boolean {\r\n    if (vector0 !== undefined && vector1 !== undefined) {\r\n      const q = vector0.smallerUnorientedRadiansTo(vector1);\r\n      return q > radiansTolerance;\r\n    }\r\n    return false;\r\n  }\r\n  /** clear all accumulated point and vector data */\r\n  public clear() { this._origin = undefined; this._vector0 = undefined; this._vector1 = undefined; this._vector2 = undefined; }\r\n  constructor() { this.clear(); }\r\n  /** Try to assemble the data into a non-singular transform.\r\n   *\r\n   * * If allowLeftHanded is false, vector0 and vector1 determine a right handed coordinate system.\r\n   * * if allowLeftHanded is true, the z vector of the right handed system can be flipped to agree with vector2 direction.\r\n   */\r\n  public getValidatedFrame(allowLeftHanded: boolean = false): Transform | undefined {\r\n    if (this._origin && this._vector0 && this._vector1) {\r\n      if (!allowLeftHanded) {\r\n        const matrix = Matrix3d.createRigidFromColumns(this._vector0, this._vector1, AxisOrder.XYZ);\r\n        if (matrix)\r\n          return Transform.createOriginAndMatrix(this._origin, matrix);\r\n        // uh oh -- vector1 was not really independent.  clear everything after vector0.\r\n        this._vector1 = this._vector2 = undefined;\r\n      } else if (this._vector2) {\r\n        const matrix = Matrix3d.createRigidFromColumns(this._vector0, this._vector1, AxisOrder.XYZ);\r\n        if (matrix) {\r\n          if (this._vector0.tripleProduct(this._vector1, this._vector2) < 0)\r\n            matrix.scaleColumns(1.0, 1.0, -1.0);\r\n          return Transform.createOriginAndMatrix(this._origin, matrix);\r\n        }\r\n        // uh oh again -- clear vector1 and vector2, re-announce vector2 as possible vector1??\r\n        const vector2 = this._vector2;\r\n        this._vector1 = this._vector2 = undefined;\r\n        this.announceVector(vector2);\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** If vector0 is known but vector1 is not, make vector1 the cross of the up-vector and vector0 */\r\n  public applyDefaultUpVector(vector?: Vector3d) {\r\n    if (vector && this._vector0 && !this._vector1 && !vector.isParallelTo(this._vector0)) {\r\n      this._vector1 = vector.crossProduct(this._vector0);\r\n    }\r\n  }\r\n  /** Ask if there is a defined origin for the evolving frame */\r\n  public get hasOrigin(): boolean { return this._origin !== undefined; }\r\n  /** Return the number of vectors saved.   Because the save process checks numerics, this should be the rank of the system.\r\n   */\r\n  public savedVectorCount(): number {\r\n    if (!this._vector0)\r\n      return 0;\r\n    if (!this._vector1)\r\n      return 1;\r\n    if (!this._vector2)\r\n      return 2;\r\n    return 3;\r\n  }\r\n  /** announce a new point.  If this point is different from the origin, also compute and announce the vector from the origin.*/\r\n  public announcePoint(point: Point3d): number {\r\n    if (!this._origin) {\r\n      this._origin = point.clone();\r\n      return this.savedVectorCount();\r\n    }\r\n    // the new point may provide an additional vector\r\n    if (this._origin.isAlmostEqual(point))\r\n      return this.savedVectorCount();\r\n    return this.announceVector(this._origin.vectorTo(point));\r\n  }\r\n  /** announce a new vector. */\r\n  public announceVector(vector: Vector3d): number {\r\n    if (vector.isAlmostZero)\r\n      return this.savedVectorCount();\r\n\r\n    if (!this._vector0) { this._vector0 = vector.clone(this._vector0); return 1; }\r\n\r\n    if (!this._vector1) {\r\n      if (this.areStronglyIndependentVectors(vector, this._vector0, 1.0e-5)) {\r\n        this._vector1 = vector.clone(this._vector1);\r\n        return 2;\r\n      }\r\n      return 1;\r\n    }\r\n\r\n    // vector0 and vector1 are independent.\r\n    if (!this._vector2) {\r\n      const unitPerpendicular = this._vector0.unitCrossProduct(this._vector1);\r\n      if (unitPerpendicular && !Geometry.isSameCoordinate(0, unitPerpendicular.dotProduct(vector))) {\r\n        this._vector2 = vector.clone(this._vector2);\r\n        return 3;\r\n      }\r\n      return 2;\r\n    }\r\n    // fall through if prior vectors are all there -- no need for the new one.\r\n    return 3;\r\n  }\r\n  /** Inspect the content of the data.  Announce points and vectors.   Return when savedVectorCount becomes\r\n   * sufficient for a coordinate system.\r\n   */\r\n  public announce(data: any) {\r\n    if (this.savedVectorCount() > 1) return;\r\n    if (data instanceof Point3d)\r\n      this.announcePoint(data);\r\n    else if (data instanceof Vector3d)\r\n      this.announceVector(data);\r\n    else if (Array.isArray(data)) {\r\n      for (const child of data) {\r\n        if (this.savedVectorCount() > 1)\r\n          break;\r\n        this.announce(child);\r\n      }\r\n    } else if (data instanceof CurvePrimitive) {\r\n      if (data instanceof LineSegment3d) {\r\n        this.announcePoint(data.startPoint());\r\n        this.announcePoint(data.endPoint());\r\n      } else if (data instanceof Arc3d) {\r\n        const ray = data.fractionToPointAndDerivative(0.0);\r\n        this.announcePoint(ray.origin);\r\n        this.announceVector(ray.direction);\r\n        this.announceVector(data.matrixRef.columnZCrossVector(ray.direction));\r\n      } else if (data instanceof LineString3d) {\r\n        for (const point of data.points) {\r\n          this.announcePoint(point);\r\n          if (this.savedVectorCount() > 1)\r\n            break;\r\n        }\r\n      } else if (data instanceof BSplineCurve3d) {\r\n        const point = Point3d.create();\r\n        for (let i = 0; this.savedVectorCount() < 2; i++) {\r\n          if (data.getPolePoint3d(i, point) instanceof Point3d)\r\n            this.announcePoint(point);\r\n          else break;\r\n        }\r\n      } else if (data instanceof InterpolationCurve3d) {\r\n        const point = Point3d.create();\r\n        for (let i = 0; this.savedVectorCount() < 2; i++) {\r\n          if (i < data.options.fitPoints.length) {\r\n            point.setFrom(data.options.fitPoints[i]);\r\n            this.announcePoint(point);\r\n          } else break;\r\n        }\r\n      } else { // unimplemented CurvePrimitive type\r\n        const frame = data.fractionToFrenetFrame(0.0);\r\n        if (undefined !== frame) {\r\n          this.announcePoint(frame.getOrigin());\r\n          this.announceVector(frame.matrix.getColumn(0));\r\n          this.announceVector(frame.matrix.getColumn(1));\r\n        }\r\n      }\r\n    } else if (data instanceof CurveCollection) {\r\n      if (data.children)\r\n        for (const child of data.children) {\r\n          this.announce(child);\r\n          if (this.savedVectorCount() > 1)\r\n            break;\r\n        }\r\n    } else if (data instanceof GrowableXYZArray) {\r\n      const point = Point3d.create();\r\n      for (let i = 0; this.savedVectorCount() < 2; i++) {\r\n        if (data.getPoint3dAtCheckedPointIndex(i, point) instanceof Point3d)\r\n          this.announcePoint(point);\r\n        else break;\r\n      }\r\n    }\r\n  }\r\n  /** create a localToWorld frame for the given data.\r\n   *\r\n   * *  origin is at first point\r\n   * *  x axis in direction of first nonzero vector present or implied by the input.\r\n   * *  y axis is perpendicular to x and contains (in positive side) the next vector present or implied by the input.\r\n   */\r\n  public static createRightHandedFrame(defaultUpVector: Vector3d | undefined, ...params: any[]): Transform | undefined {\r\n    const builder = new FrameBuilder();\r\n    for (const data of params) {\r\n      builder.announce(data);\r\n      builder.applyDefaultUpVector(defaultUpVector);\r\n      const result = builder.getValidatedFrame(false);\r\n      if (result !== undefined) {\r\n        if (defaultUpVector) {\r\n          if (result.matrix.dotColumnZ(defaultUpVector) < 0.0)\r\n            result.matrix.scaleColumnsInPlace(1, -1, -1);\r\n        }\r\n        return result;\r\n      }\r\n    }\r\n    // try direct evaluation of curve primitives?\r\n    for (const data of params) {\r\n      if (data instanceof CurveCollection) {\r\n        const children = data.children;\r\n        if (children) {\r\n          for (const curve of children) {\r\n            if (curve instanceof CurvePrimitive) {\r\n              const frenetFrame = curve.fractionToFrenetFrame(0.0);\r\n              if (frenetFrame)\r\n                return frenetFrame;\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n    }\r\n    return undefined;\r\n  }\r\n  /** create a transform containing points or vectors in the given data.\r\n   * * The xy columns of the transform contain the first points or vectors of the data.\r\n   * * The z column is perpendicular to that xy plane.\r\n   * * The calculation favors the first points found.  It does not try to get a \"best\" plane.\r\n   */\r\n  public static createRightHandedLocalToWorld(...params: any[]): Transform | undefined {\r\n    const builder = new FrameBuilder();\r\n    for (const data of params) {\r\n      builder.announce(data);\r\n      const localToWorld = builder.getValidatedFrame(false);\r\n      if (localToWorld !== undefined)\r\n        return localToWorld;\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /**\r\n   * try to create a frame whose xy plane is through points.\r\n   *\r\n   * *  if 3 or more distinct points are present, the x axis is from the first point to the most distance, and y direction is toward the\r\n   * point most distant from that line.\r\n   * @param points array of points\r\n   */\r\n  public static createFrameToDistantPoints(points: Point3d[]): Transform | undefined {\r\n    if (points.length > 2) {\r\n      const origin = points[0].clone();\r\n      const vector01 = Vector3d.create();\r\n      Point3dArray.indexOfMostDistantPoint(points, points[0], vector01);\r\n      const vector02 = Vector3d.create();\r\n      Point3dArray.indexOfPointWithMaxCrossProductMagnitude(points, origin, vector01, vector02);\r\n      const matrix = Matrix3d.createRigidFromColumns(vector01, vector02, AxisOrder.XYZ);\r\n      if (matrix)\r\n        return Transform.createRefs(origin, matrix);\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * try to create a frame whose xy plane is through points, with the points appearing CCW in the local frame.\r\n   *\r\n   * *  if 3 or more distinct points are present, the x axis is from the first point to the most distance, and y direction is toward the\r\n   * point most distant from that line.\r\n   * @param points array of points\r\n   */\r\n  public static createFrameWithCCWPolygon(points: Point3d[]): Transform | undefined {\r\n    if (points.length > 2) {\r\n      const ray = PolygonOps.centroidAreaNormal(points);\r\n      if (ray) {\r\n        return ray.toRigidZFrame();\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Create the localToWorld transform from a range to axes of its parent coordinate system.\r\n   * @param range [in] range to inspect\r\n   * @param fractionX  [in] fractional coordinate of frame origin x\r\n   * @param fractionY [in] fractional coordinate of frame origin y\r\n   * @param fractionZ [in] fractional coordinate of frame origin z\r\n   * @param scaleSelect [in] selects size of localToWorld axes.\r\n   * @param defaultAxisLength [in] if true and any axis length is 0, that axis vector takes this physical length.\r\n   */\r\n  public static createLocalToWorldTransformInRange(\r\n    range: Range3d,\r\n    scaleSelect: AxisScaleSelect = AxisScaleSelect.NonUniformRangeContainment,\r\n    fractionX: number = 0,\r\n    fractionY: number = 0,\r\n    fractionZ: number = 0,\r\n    defaultAxisLength: number = 1.0): Transform {\r\n    if (range.isNull)\r\n      return Transform.createIdentity();\r\n    let a = 1.0;\r\n    let b = 1.0;\r\n    let c = 1.0;\r\n    if (scaleSelect === AxisScaleSelect.LongestRangeDirection) {\r\n      a = b = c = Geometry.correctSmallMetricDistance(range.maxLength(), defaultAxisLength);\r\n    } else if (scaleSelect === AxisScaleSelect.NonUniformRangeContainment) {\r\n      a = Geometry.correctSmallMetricDistance(range.xLength(), defaultAxisLength) * Geometry.maxAbsDiff(fractionX, 0, 1);\r\n      b = Geometry.correctSmallMetricDistance(range.yLength(), defaultAxisLength) * Geometry.maxAbsDiff(fractionY, 0, 1);\r\n      c = Geometry.correctSmallMetricDistance(range.zLength(), defaultAxisLength) * Geometry.maxAbsDiff(fractionZ, 0, 1);\r\n    }\r\n    return Transform.createRefs(range.fractionToPoint(fractionX, fractionY, fractionZ), Matrix3d.createScale(a, b, c));\r\n  }\r\n\r\n}\r\n"]}
+{"version":3,"file":"FrameBuilder.js","sourceRoot":"","sources":["../../../src/geometry3d/FrameBuilder.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAA0C;AAC1C,0DAAyD;AACzD,0EAAuE;AACvE,0CAAuC;AACvC,8DAA2D;AAC3D,4DAAyD;AACzD,0DAAuD;AACvD,wDAAqD;AACrD,mEAAmE;AACnE,0CAAmE;AACnE,yDAAsD;AACtD,yCAAsC;AACtC,uDAAsD;AACtD,iDAA8C;AAC9C,6CAA0C;AAE1C,2CAAwC;AAExC;;;;;;;;;;;;;;;GAeG;AACH,MAAa,YAAY;IAKvB,uEAAuE;IAC/D,6BAA6B,CAAC,OAAiB,EAAE,OAAiB,EAAE,mBAA2B,mBAAQ,CAAC,iBAAiB;QAC/H,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE;YAClD,MAAM,CAAC,GAAG,OAAO,CAAC,0BAA0B,CAAC,OAAO,CAAC,CAAC;YACtD,OAAO,CAAC,GAAG,gBAAgB,CAAC;SAC7B;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,KAAK,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC;IAC7H,gBAAgB,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC/B;;;;OAIG;IACI,iBAAiB,CAAC,kBAA2B,KAAK;QACvD,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClD,IAAI,CAAC,eAAe,EAAE;gBACpB,MAAM,MAAM,GAAG,mBAAQ,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,oBAAS,CAAC,GAAG,CAAC,CAAC;gBAC5F,IAAI,MAAM;oBACR,OAAO,qBAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBAC/D,gFAAgF;gBAChF,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;aAC3C;iBAAM,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACxB,MAAM,MAAM,GAAG,mBAAQ,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,oBAAS,CAAC,GAAG,CAAC,CAAC;gBAC5F,IAAI,MAAM,EAAE;oBACV,IAAI,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;wBAC/D,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;oBACtC,OAAO,qBAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;iBAC9D;gBACD,sFAAsF;gBACtF,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAC9B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAC1C,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;aAC9B;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,kGAAkG;IAC3F,oBAAoB,CAAC,MAAiB;QAC3C,IAAI,MAAM,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;YACpF,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SACpD;IACH,CAAC;IACD,8DAA8D;IAC9D,IAAW,SAAS,KAAc,OAAO,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC;IACtE;OACG;IACI,gBAAgB;QACrB,IAAI,CAAC,IAAI,CAAC,QAAQ;YAChB,OAAO,CAAC,CAAC;QACX,IAAI,CAAC,IAAI,CAAC,QAAQ;YAChB,OAAO,CAAC,CAAC;QACX,IAAI,CAAC,IAAI,CAAC,QAAQ;YAChB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;IACD,8HAA8H;IACvH,aAAa,CAAC,KAAc;QACjC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;YACjB,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC;SAChC;QACD,iDAAiD;QACjD,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC;YACnC,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACjC,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAC3D,CAAC;IACD,6BAA6B;IACtB,cAAc,CAAC,MAAgB;QACpC,IAAI,MAAM,CAAC,YAAY;YACrB,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAEjC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YAAE,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAAC,OAAO,CAAC,CAAC;SAAE;QAE9E,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YAClB,IAAI,IAAI,CAAC,6BAA6B,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE;gBACrE,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC5C,OAAO,CAAC,CAAC;aACV;YACD,OAAO,CAAC,CAAC;SACV;QAED,uCAAuC;QACvC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YAClB,MAAM,iBAAiB,GAAG,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACxE,IAAI,iBAAiB,IAAI,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,CAAC,EAAE,iBAAiB,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE;gBAC5F,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC5C,OAAO,CAAC,CAAC;aACV;YACD,OAAO,CAAC,CAAC;SACV;QACD,0EAA0E;QAC1E,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;OAEG;IACI,QAAQ,CAAC,IAAS;QACvB,IAAI,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC;YAAE,OAAO;QACxC,IAAI,IAAI,YAAY,yBAAO;YACzB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;aACtB,IAAI,IAAI,YAAY,0BAAQ;YAC/B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;aACvB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC5B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;gBACxB,IAAI,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC;oBAC7B,MAAM;gBACR,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;aACtB;SACF;aAAM,IAAI,IAAI,YAAY,+BAAc,EAAE;YACzC,IAAI,IAAI,YAAY,6BAAa,EAAE;gBACjC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;gBACtC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;aACrC;iBAAM,IAAI,IAAI,YAAY,aAAK,EAAE;gBAChC,MAAM,GAAG,GAAG,IAAI,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC;gBACnD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC/B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACnC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;aACvE;iBAAM,IAAI,IAAI,YAAY,2BAAY,EAAE;gBACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;oBAC/B,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;oBAC1B,IAAI,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC;wBAC7B,MAAM;iBACT;aACF;iBAAM,IAAI,IAAI,YAAY,6BAAc,EAAE;gBACzC,MAAM,KAAK,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;gBAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAChD,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,KAAK,CAAC,YAAY,yBAAO;wBAClD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;;wBACvB,MAAM;iBACZ;aACF;iBAAM,IAAI,IAAI,YAAY,2CAAoB,EAAE;gBAC/C,MAAM,KAAK,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;gBAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAChD,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,EAAE;wBACrC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;wBACzC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;qBAC3B;;wBAAM,MAAM;iBACd;aACF;iBAAM,EAAE,oCAAoC;gBAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;gBAC9C,IAAI,SAAS,KAAK,KAAK,EAAE;oBACvB,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC;oBACtC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;iBAChD;aACF;SACF;aAAM,IAAI,IAAI,YAAY,iCAAe,EAAE;YAC1C,IAAI,IAAI,CAAC,QAAQ;gBACf,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;oBACjC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;oBACrB,IAAI,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC;wBAC7B,MAAM;iBACT;SACJ;aAAM,IAAI,IAAI,YAAY,mCAAgB,EAAE;YAC3C,MAAM,KAAK,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAChD,IAAI,IAAI,CAAC,6BAA6B,CAAC,CAAC,EAAE,KAAK,CAAC,YAAY,yBAAO;oBACjE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;;oBACvB,MAAM;aACZ;SACF;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,sBAAsB,CAAC,eAAqC,EAAE,GAAG,MAAa;QAC1F,MAAM,OAAO,GAAG,IAAI,YAAY,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE;YACzB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACvB,OAAO,CAAC,oBAAoB,CAAC,eAAe,CAAC,CAAC;YAC9C,MAAM,MAAM,GAAG,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAChD,IAAI,MAAM,KAAK,SAAS,EAAE;gBACxB,IAAI,eAAe,EAAE;oBACnB,IAAI,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,GAAG;wBACjD,MAAM,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;iBAChD;gBACD,OAAO,MAAM,CAAC;aACf;SACF;QAED,MAAM,sBAAsB,GAAG,CAAC,KAAqB,EAAyB,EAAE;YAC9E,OAAO,KAAK,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC,CAAC;QAEF,mEAAmE;QACnE,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE;YACzB,IAAI,IAAI,YAAY,+BAAc,EAAE;gBAClC,OAAO,sBAAsB,CAAC,IAAI,CAAC,CAAC;aACrC;iBAAM,IAAI,IAAI,YAAY,iCAAe,EAAE;gBAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;gBAC/C,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;oBAC5B,MAAM,WAAW,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;oBAClD,IAAI,WAAW;wBACb,OAAO,WAAW,CAAC;iBACtB;aACF;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,6BAA6B,CAAC,GAAG,MAAa;QAC1D,MAAM,OAAO,GAAG,IAAI,YAAY,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE;YACzB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACvB,MAAM,YAAY,GAAG,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;YACtD,IAAI,YAAY,KAAK,SAAS;gBAC5B,OAAO,YAAY,CAAC;SACvB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,0BAA0B,CAAC,MAAiB;QACxD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YACrB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,0BAAQ,CAAC,MAAM,EAAE,CAAC;YACnC,2BAAY,CAAC,uBAAuB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAClE,MAAM,QAAQ,GAAG,0BAAQ,CAAC,MAAM,EAAE,CAAC;YACnC,2BAAY,CAAC,wCAAwC,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAC1F,MAAM,MAAM,GAAG,mBAAQ,CAAC,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,EAAE,oBAAS,CAAC,GAAG,CAAC,CAAC;YAClF,IAAI,MAAM;gBACR,OAAO,qBAAS,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;SAC/C;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,yBAAyB,CAAC,MAAiB;QACvD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YACrB,MAAM,GAAG,GAAG,uBAAU,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,GAAG,EAAE;gBACP,OAAO,GAAG,CAAC,aAAa,EAAE,CAAC;aAC5B;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,kCAAkC,CAC9C,KAAc,EACd,cAA+B,0BAAe,CAAC,0BAA0B,EACzE,YAAoB,CAAC,EACrB,YAAoB,CAAC,EACrB,YAAoB,CAAC,EACrB,oBAA4B,GAAG;QAC/B,IAAI,KAAK,CAAC,MAAM;YACd,OAAO,qBAAS,CAAC,cAAc,EAAE,CAAC;QACpC,IAAI,CAAC,GAAG,GAAG,CAAC;QACZ,IAAI,CAAC,GAAG,GAAG,CAAC;QACZ,IAAI,CAAC,GAAG,GAAG,CAAC;QACZ,IAAI,WAAW,KAAK,0BAAe,CAAC,qBAAqB,EAAE;YACzD,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,mBAAQ,CAAC,0BAA0B,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,iBAAiB,CAAC,CAAC;SACvF;aAAM,IAAI,WAAW,KAAK,0BAAe,CAAC,0BAA0B,EAAE;YACrE,CAAC,GAAG,mBAAQ,CAAC,0BAA0B,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,iBAAiB,CAAC,GAAG,mBAAQ,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnH,CAAC,GAAG,mBAAQ,CAAC,0BAA0B,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,iBAAiB,CAAC,GAAG,mBAAQ,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnH,CAAC,GAAG,mBAAQ,CAAC,0BAA0B,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,iBAAiB,CAAC,GAAG,mBAAQ,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;SACpH;QACD,OAAO,qBAAS,CAAC,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,mBAAQ,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrH,CAAC;CAEF;AArSD,oCAqSC","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 CartesianGeometry\r\n */\r\n\r\n// import { Point2d } from \"./Geometry2d\";\r\nimport { BSplineCurve3d } from \"../bspline/BSplineCurve\";\r\nimport { InterpolationCurve3d } from \"../bspline/InterpolationCurve3d\";\r\nimport { Arc3d } from \"../curve/Arc3d\";\r\nimport { CurveCollection } from \"../curve/CurveCollection\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\nimport { AxisOrder, AxisScaleSelect, Geometry } from \"../Geometry\";\r\nimport { GrowableXYZArray } from \"./GrowableXYZArray\";\r\nimport { Matrix3d } from \"./Matrix3d\";\r\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\r\nimport { Point3dArray } from \"./PointHelpers\";\r\nimport { PolygonOps } from \"./PolygonOps\";\r\nimport { Range3d } from \"./Range\";\r\nimport { Transform } from \"./Transform\";\r\n\r\n/**\r\n * Helper class to accumulate points and vectors until there is enough data to define a coordinate system.\r\n *\r\n * * For the common case of building a right handed frame:\r\n *   * create the FrameBuilder and make calls to announcePoint and announceVector.\r\n *   * the frame will be fully determined by an origin and two vectors.\r\n *   * the first call to announcePoint will set the origin.\r\n *   *  additional calls to announcePoint will produce announceVector call with the vector from the origin.\r\n *   * After each announcement, call getValidatedFrame(false)\r\n *   * getValidatedFrame will succeed when it has two independent vectors.\r\n * *  to build a left handed frame,\r\n *   *  an origin and 3 independent vectors are required.\r\n *   *  announce as above, but query with getValidatedFrame (true).\r\n *   *  this will use the third vector to select right or left handed frame.\r\n * @public\r\n */\r\nexport class FrameBuilder {\r\n  private _origin: undefined | Point3d;\r\n  private _vector0: undefined | Vector3d;\r\n  private _vector1: undefined | Vector3d;\r\n  private _vector2: undefined | Vector3d;\r\n  // test if both vectors are defined and have significant angle between.\r\n  private areStronglyIndependentVectors(vector0: Vector3d, vector1: Vector3d, radiansTolerance: number = Geometry.smallAngleRadians): boolean {\r\n    if (vector0 !== undefined && vector1 !== undefined) {\r\n      const q = vector0.smallerUnorientedRadiansTo(vector1);\r\n      return q > radiansTolerance;\r\n    }\r\n    return false;\r\n  }\r\n  /** clear all accumulated point and vector data */\r\n  public clear() { this._origin = undefined; this._vector0 = undefined; this._vector1 = undefined; this._vector2 = undefined; }\r\n  constructor() { this.clear(); }\r\n  /** Try to assemble the data into a non-singular transform.\r\n   *\r\n   * * If allowLeftHanded is false, vector0 and vector1 determine a right handed coordinate system.\r\n   * * if allowLeftHanded is true, the z vector of the right handed system can be flipped to agree with vector2 direction.\r\n   */\r\n  public getValidatedFrame(allowLeftHanded: boolean = false): Transform | undefined {\r\n    if (this._origin && this._vector0 && this._vector1) {\r\n      if (!allowLeftHanded) {\r\n        const matrix = Matrix3d.createRigidFromColumns(this._vector0, this._vector1, AxisOrder.XYZ);\r\n        if (matrix)\r\n          return Transform.createOriginAndMatrix(this._origin, matrix);\r\n        // uh oh -- vector1 was not really independent.  clear everything after vector0.\r\n        this._vector1 = this._vector2 = undefined;\r\n      } else if (this._vector2) {\r\n        const matrix = Matrix3d.createRigidFromColumns(this._vector0, this._vector1, AxisOrder.XYZ);\r\n        if (matrix) {\r\n          if (this._vector0.tripleProduct(this._vector1, this._vector2) < 0)\r\n            matrix.scaleColumns(1.0, 1.0, -1.0);\r\n          return Transform.createOriginAndMatrix(this._origin, matrix);\r\n        }\r\n        // uh oh again -- clear vector1 and vector2, re-announce vector2 as possible vector1??\r\n        const vector2 = this._vector2;\r\n        this._vector1 = this._vector2 = undefined;\r\n        this.announceVector(vector2);\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** If vector0 is known but vector1 is not, make vector1 the cross of the up-vector and vector0 */\r\n  public applyDefaultUpVector(vector?: Vector3d) {\r\n    if (vector && this._vector0 && !this._vector1 && !vector.isParallelTo(this._vector0)) {\r\n      this._vector1 = vector.crossProduct(this._vector0);\r\n    }\r\n  }\r\n  /** Ask if there is a defined origin for the evolving frame */\r\n  public get hasOrigin(): boolean { return this._origin !== undefined; }\r\n  /** Return the number of vectors saved.   Because the save process checks numerics, this should be the rank of the system.\r\n   */\r\n  public savedVectorCount(): number {\r\n    if (!this._vector0)\r\n      return 0;\r\n    if (!this._vector1)\r\n      return 1;\r\n    if (!this._vector2)\r\n      return 2;\r\n    return 3;\r\n  }\r\n  /** announce a new point.  If this point is different from the origin, also compute and announce the vector from the origin.*/\r\n  public announcePoint(point: Point3d): number {\r\n    if (!this._origin) {\r\n      this._origin = point.clone();\r\n      return this.savedVectorCount();\r\n    }\r\n    // the new point may provide an additional vector\r\n    if (this._origin.isAlmostEqual(point))\r\n      return this.savedVectorCount();\r\n    return this.announceVector(this._origin.vectorTo(point));\r\n  }\r\n  /** announce a new vector. */\r\n  public announceVector(vector: Vector3d): number {\r\n    if (vector.isAlmostZero)\r\n      return this.savedVectorCount();\r\n\r\n    if (!this._vector0) { this._vector0 = vector.clone(this._vector0); return 1; }\r\n\r\n    if (!this._vector1) {\r\n      if (this.areStronglyIndependentVectors(vector, this._vector0, 1.0e-5)) {\r\n        this._vector1 = vector.clone(this._vector1);\r\n        return 2;\r\n      }\r\n      return 1;\r\n    }\r\n\r\n    // vector0 and vector1 are independent.\r\n    if (!this._vector2) {\r\n      const unitPerpendicular = this._vector0.unitCrossProduct(this._vector1);\r\n      if (unitPerpendicular && !Geometry.isSameCoordinate(0, unitPerpendicular.dotProduct(vector))) {\r\n        this._vector2 = vector.clone(this._vector2);\r\n        return 3;\r\n      }\r\n      return 2;\r\n    }\r\n    // fall through if prior vectors are all there -- no need for the new one.\r\n    return 3;\r\n  }\r\n  /** Inspect the content of the data.  Announce points and vectors.   Return when savedVectorCount becomes\r\n   * sufficient for a coordinate system.\r\n   */\r\n  public announce(data: any) {\r\n    if (this.savedVectorCount() > 1) return;\r\n    if (data instanceof Point3d)\r\n      this.announcePoint(data);\r\n    else if (data instanceof Vector3d)\r\n      this.announceVector(data);\r\n    else if (Array.isArray(data)) {\r\n      for (const child of data) {\r\n        if (this.savedVectorCount() > 1)\r\n          break;\r\n        this.announce(child);\r\n      }\r\n    } else if (data instanceof CurvePrimitive) {\r\n      if (data instanceof LineSegment3d) {\r\n        this.announcePoint(data.startPoint());\r\n        this.announcePoint(data.endPoint());\r\n      } else if (data instanceof Arc3d) {\r\n        const ray = data.fractionToPointAndDerivative(0.0);\r\n        this.announcePoint(ray.origin);\r\n        this.announceVector(ray.direction);\r\n        this.announceVector(data.matrixRef.columnZCrossVector(ray.direction));\r\n      } else if (data instanceof LineString3d) {\r\n        for (const point of data.points) {\r\n          this.announcePoint(point);\r\n          if (this.savedVectorCount() > 1)\r\n            break;\r\n        }\r\n      } else if (data instanceof BSplineCurve3d) {\r\n        const point = Point3d.create();\r\n        for (let i = 0; this.savedVectorCount() < 2; i++) {\r\n          if (data.getPolePoint3d(i, point) instanceof Point3d)\r\n            this.announcePoint(point);\r\n          else break;\r\n        }\r\n      } else if (data instanceof InterpolationCurve3d) {\r\n        const point = Point3d.create();\r\n        for (let i = 0; this.savedVectorCount() < 2; i++) {\r\n          if (i < data.options.fitPoints.length) {\r\n            point.setFrom(data.options.fitPoints[i]);\r\n            this.announcePoint(point);\r\n          } else break;\r\n        }\r\n      } else { // unimplemented CurvePrimitive type\r\n        const frame = data.fractionToFrenetFrame(0.0);\r\n        if (undefined !== frame) {\r\n          this.announcePoint(frame.getOrigin());\r\n          this.announceVector(frame.matrix.getColumn(0));\r\n          this.announceVector(frame.matrix.getColumn(1));\r\n        }\r\n      }\r\n    } else if (data instanceof CurveCollection) {\r\n      if (data.children)\r\n        for (const child of data.children) {\r\n          this.announce(child);\r\n          if (this.savedVectorCount() > 1)\r\n            break;\r\n        }\r\n    } else if (data instanceof GrowableXYZArray) {\r\n      const point = Point3d.create();\r\n      for (let i = 0; this.savedVectorCount() < 2; i++) {\r\n        if (data.getPoint3dAtCheckedPointIndex(i, point) instanceof Point3d)\r\n          this.announcePoint(point);\r\n        else break;\r\n      }\r\n    }\r\n  }\r\n  /** create a localToWorld frame for the given data.\r\n   *\r\n   * *  origin is at first point\r\n   * *  x axis in direction of first nonzero vector present or implied by the input.\r\n   * *  y axis is perpendicular to x and contains (in positive side) the next vector present or implied by the input.\r\n   */\r\n  public static createRightHandedFrame(defaultUpVector: Vector3d | undefined, ...params: any[]): Transform | undefined {\r\n    const builder = new FrameBuilder();\r\n    for (const data of params) {\r\n      builder.announce(data);\r\n      builder.applyDefaultUpVector(defaultUpVector);\r\n      const result = builder.getValidatedFrame(false);\r\n      if (result !== undefined) {\r\n        if (defaultUpVector) {\r\n          if (result.matrix.dotColumnZ(defaultUpVector) < 0.0)\r\n            result.matrix.scaleColumnsInPlace(1, -1, -1);\r\n        }\r\n        return result;\r\n      }\r\n    }\r\n\r\n    const evaluatePrimitiveFrame = (curve: CurvePrimitive): Transform | undefined => {\r\n      return curve.fractionToFrenetFrame(0.0);\r\n    };\r\n\r\n    // try direct evaluation of curve primitives using the above lambda\r\n    for (const data of params) {\r\n      if (data instanceof CurvePrimitive) {\r\n        return evaluatePrimitiveFrame(data);\r\n      } else if (data instanceof CurveCollection) {\r\n        const children = data.collectCurvePrimitives();\r\n        for (const curve of children) {\r\n          const frenetFrame = evaluatePrimitiveFrame(curve);\r\n          if (frenetFrame)\r\n            return frenetFrame;\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** create a transform containing points or vectors in the given data.\r\n   * * The xy columns of the transform contain the first points or vectors of the data.\r\n   * * The z column is perpendicular to that xy plane.\r\n   * * The calculation favors the first points found.  It does not try to get a \"best\" plane.\r\n   */\r\n  public static createRightHandedLocalToWorld(...params: any[]): Transform | undefined {\r\n    const builder = new FrameBuilder();\r\n    for (const data of params) {\r\n      builder.announce(data);\r\n      const localToWorld = builder.getValidatedFrame(false);\r\n      if (localToWorld !== undefined)\r\n        return localToWorld;\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /**\r\n   * try to create a frame whose xy plane is through points.\r\n   *\r\n   * *  if 3 or more distinct points are present, the x axis is from the first point to the most distance, and y direction is toward the\r\n   * point most distant from that line.\r\n   * @param points array of points\r\n   */\r\n  public static createFrameToDistantPoints(points: Point3d[]): Transform | undefined {\r\n    if (points.length > 2) {\r\n      const origin = points[0].clone();\r\n      const vector01 = Vector3d.create();\r\n      Point3dArray.indexOfMostDistantPoint(points, points[0], vector01);\r\n      const vector02 = Vector3d.create();\r\n      Point3dArray.indexOfPointWithMaxCrossProductMagnitude(points, origin, vector01, vector02);\r\n      const matrix = Matrix3d.createRigidFromColumns(vector01, vector02, AxisOrder.XYZ);\r\n      if (matrix)\r\n        return Transform.createRefs(origin, matrix);\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * try to create a frame whose xy plane is through points, with the points appearing CCW in the local frame.\r\n   *\r\n   * *  if 3 or more distinct points are present, the x axis is from the first point to the most distance, and y direction is toward the\r\n   * point most distant from that line.\r\n   * @param points array of points\r\n   */\r\n  public static createFrameWithCCWPolygon(points: Point3d[]): Transform | undefined {\r\n    if (points.length > 2) {\r\n      const ray = PolygonOps.centroidAreaNormal(points);\r\n      if (ray) {\r\n        return ray.toRigidZFrame();\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Create the localToWorld transform from a range to axes of its parent coordinate system.\r\n   * @param range [in] range to inspect\r\n   * @param fractionX  [in] fractional coordinate of frame origin x\r\n   * @param fractionY [in] fractional coordinate of frame origin y\r\n   * @param fractionZ [in] fractional coordinate of frame origin z\r\n   * @param scaleSelect [in] selects size of localToWorld axes.\r\n   * @param defaultAxisLength [in] if true and any axis length is 0, that axis vector takes this physical length.\r\n   */\r\n  public static createLocalToWorldTransformInRange(\r\n    range: Range3d,\r\n    scaleSelect: AxisScaleSelect = AxisScaleSelect.NonUniformRangeContainment,\r\n    fractionX: number = 0,\r\n    fractionY: number = 0,\r\n    fractionZ: number = 0,\r\n    defaultAxisLength: number = 1.0): Transform {\r\n    if (range.isNull)\r\n      return Transform.createIdentity();\r\n    let a = 1.0;\r\n    let b = 1.0;\r\n    let c = 1.0;\r\n    if (scaleSelect === AxisScaleSelect.LongestRangeDirection) {\r\n      a = b = c = Geometry.correctSmallMetricDistance(range.maxLength(), defaultAxisLength);\r\n    } else if (scaleSelect === AxisScaleSelect.NonUniformRangeContainment) {\r\n      a = Geometry.correctSmallMetricDistance(range.xLength(), defaultAxisLength) * Geometry.maxAbsDiff(fractionX, 0, 1);\r\n      b = Geometry.correctSmallMetricDistance(range.yLength(), defaultAxisLength) * Geometry.maxAbsDiff(fractionY, 0, 1);\r\n      c = Geometry.correctSmallMetricDistance(range.zLength(), defaultAxisLength) * Geometry.maxAbsDiff(fractionZ, 0, 1);\r\n    }\r\n    return Transform.createRefs(range.fractionToPoint(fractionX, fractionY, fractionZ), Matrix3d.createScale(a, b, c));\r\n  }\r\n\r\n}\r\n"]}

package/lib/cjs/geometry3d/GeometryHandler.d.ts

@@ -304,18 +304,18 @@ export interface IStrokeHandler {
  */
 export interface UVSurface {
     /**
-     * Convert fractional u and v coordinates to surface point
+     * Convert fractional u and v coordinates to surface point.
      * @param uFraction fractional coordinate in u direction
-     * @param vFraction fractional coordinate in the v direction
+     * @param vFraction fractional coordinate in v direction
      * @param result optional pre-allocated point
      */
     uvFractionToPoint(uFraction: number, vFraction: number, result?: Point3d): Point3d;
     /**
      * Convert fractional u and v coordinates to surface point and in-surface tangent directions.
-     * * Remark: the vectors are expected to be non-zero tangents which can be crossed to get a normal.
-     * * Hence the are NOT precisely either (a) partial derivatives or (b) frenet vectors
+     * * The vectors are expected to be non-zero tangents which can be crossed to get a normal.
+     * * Hence they are not necessarily (a) partial derivatives or (b) Frenet vectors.
      * @param uFraction fractional coordinate in u direction
-     * @param vFraction fractional coordinate in the v direction
+     * @param vFraction fractional coordinate in v direction
      * @param result optional pre-allocated carrier for point and vectors
      */
     uvFractionToPointAndTangents(uFraction: number, vFraction: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors;

package/lib/cjs/geometry3d/GeometryHandler.js.map

@@ -1 +1 @@
-{"version":3,"file":"GeometryHandler.js","sourceRoot":"","sources":["../../../src/geometry3d/GeometryHandler.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAuC/F;;;;;GAKG;AACH,MAAsB,eAAe;IAOnC,kDAAkD;IAC3C,qBAAqB,CAAC,EAAmB,IAAS,CAAC;IAsB1D,iFAAiF;IAC1E,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,kFAAkF;IAC3E,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,0FAA0F;IACnF,kBAAkB,CAAC,CAAe,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,yFAAyF;IAClF,iBAAiB,CAAC,CAAc,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,yFAAyF;IAClF,iBAAiB,CAAC,CAAc,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAsBxF;AA7DD,0CA6DC;AACD;;;;;;;;;;;GAWG;AACH,MAAa,mBAAoB,SAAQ,eAAe;IACtD,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtE,+BAA+B;IACxB,WAAW,CAAC,EAAS,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxD,+BAA+B;IACf,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACrF,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC1E,+BAA+B;IACxB,0BAA0B,CAAC,EAAwB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtF,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtE,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E,+BAA+B;IACxB,sBAAsB,CAAC,EAAoB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAE9E,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,uBAAuB,CAAC,EAAqB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChF,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E;;OAEG;IACI,sBAAsB,CAAC,EAAsB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAEhF,+BAA+B;IACf,UAAU,CAAC,EAAQ,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC/D,+BAA+B;IACf,UAAU,CAAC,EAAQ,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC/D,+BAA+B;IACf,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC/E,+BAA+B;IACf,iBAAiB,CAAC,EAAe,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC7E,+BAA+B;IACf,iBAAiB,CAAC,EAAe,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAE7E,+BAA+B;IACxB,YAAY,CAAC,EAAU,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC1D,+BAA+B;IACxB,UAAU,CAAC,EAAQ,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtD,+BAA+B;IACxB,SAAS,CAAC,EAAO,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACpD,+BAA+B;IACxB,eAAe,CAAC,EAAa,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChE,+BAA+B;IACxB,iBAAiB,CAAC,EAAe,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACpE,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E,+BAA+B;IACxB,gBAAgB,CAAC,EAAc,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAClE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;CAC3E;AA9DD,kDA8DC;AACD;;;GAGG;AACH,MAAa,8BAA+B,SAAQ,eAAe;IACjE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtE,+BAA+B;IACxB,WAAW,CAAC,EAAS,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxD,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC1E,+BAA+B;IACxB,0BAA0B,CAAC,EAAwB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtF,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtE,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E,+BAA+B;IACxB,sBAAsB,CAAC,EAAoB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAE9E,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,uBAAuB,CAAC,EAAqB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChF,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E;;OAEG;IACI,sBAAsB,CAAC,EAAsB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChF,oHAAoH;IAC7G,cAAc,CAAC,CAAgB;QACpC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QAC5B,IAAI,QAAQ;YACV,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;gBAC5B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;aACvC;IACL,CAAC;IACD,0BAA0B;IACV,qBAAqB,CAAC,CAAkB,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjG,0BAA0B;IACV,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,0BAA0B;IACV,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,0BAA0B;IACV,kBAAkB,CAAC,CAAe,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3F,0BAA0B;IACV,iBAAiB,CAAC,CAAc,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,0BAA0B;IACV,iBAAiB,CAAC,CAAc,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzF,+BAA+B;IACxB,YAAY,CAAC,EAAU,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC1D,+BAA+B;IACxB,UAAU,CAAC,EAAQ,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtD,+BAA+B;IACxB,SAAS,CAAC,EAAO,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACpD,+BAA+B;IACxB,eAAe,CAAC,EAAa,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChE,+BAA+B;IACxB,iBAAiB,CAAC,EAAe,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACpE,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E,+BAA+B;IACxB,gBAAgB,CAAC,EAAc,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAClE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;CAC3E;AAtED,wEAsEC","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 ArraysAndInterfaces\r\n */\r\n\r\nimport { AkimaCurve3d } from \"../bspline/AkimaCurve3d\";\r\nimport { BezierCurve3d } from \"../bspline/BezierCurve3d\";\r\nimport { BezierCurve3dH } from \"../bspline/BezierCurve3dH\";\r\nimport { BezierCurveBase } from \"../bspline/BezierCurveBase\";\r\nimport { BSplineCurve3d } from \"../bspline/BSplineCurve\";\r\nimport { BSplineCurve3dH } from \"../bspline/BSplineCurve3dH\";\r\nimport { BSplineSurface3d, BSplineSurface3dH } from \"../bspline/BSplineSurface\";\r\nimport { InterpolationCurve3d } from \"../bspline/InterpolationCurve3d\";\r\nimport { Arc3d } from \"../curve/Arc3d\";\r\nimport { CoordinateXYZ } from \"../curve/CoordinateXYZ\";\r\nimport { BagOfCurves, CurveCollection } from \"../curve/CurveCollection\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { Loop } from \"../curve/Loop\";\r\nimport { ParityRegion } from \"../curve/ParityRegion\";\r\nimport { Path } from \"../curve/Path\";\r\nimport { PointString3d } from \"../curve/PointString3d\";\r\nimport { TransitionSpiral3d } from \"../curve/spiral/TransitionSpiral3d\";\r\nimport { UnionRegion } from \"../curve/UnionRegion\";\r\nimport { IndexedPolyface } from \"../polyface/Polyface\";\r\nimport { Box } from \"../solid/Box\";\r\nimport { Cone } from \"../solid/Cone\";\r\nimport { LinearSweep } from \"../solid/LinearSweep\";\r\nimport { RotationalSweep } from \"../solid/RotationalSweep\";\r\nimport { RuledSweep } from \"../solid/RuledSweep\";\r\nimport { Sphere } from \"../solid/Sphere\";\r\nimport { TorusPipe } from \"../solid/TorusPipe\";\r\nimport { Plane3dByOriginAndVectors } from \"./Plane3dByOriginAndVectors\";\r\nimport { Vector2d } from \"./Point2dVector2d\";\r\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\r\n\r\n/**\r\n * * `GeometryHandler` defines the base abstract methods for double-dispatch geometry computation.\r\n * * User code that wants to handle one or all of the commonly known geometry types implements a handler class.\r\n * * User code that does not handle all types is most likely to start with `NullGeometryHandler`, which will provide no-action implementations for all types.\r\n * @public\r\n */\r\nexport abstract class GeometryHandler {\r\n  /** handle strongly typed [[LineSegment3d]] */\r\n  public abstract handleLineSegment3d(g: LineSegment3d): any;\r\n  /** handle strongly typed  [[LineString3d]]  */\r\n  public abstract handleLineString3d(g: LineString3d): any;\r\n  /** handle strongly typed  [[Arc3d]]  */\r\n  public abstract handleArc3d(g: Arc3d): any;\r\n  /** handle strongly typed  [[CurveCollection]]  */\r\n  public handleCurveCollection(_g: CurveCollection): any { }\r\n  /** handle strongly typed  [[BSplineCurve3d]]  */\r\n  public abstract handleBSplineCurve3d(g: BSplineCurve3d): any;\r\n  /** handle strongly typed  [[InterpolationCurve3d]]  */\r\n  public abstract handleInterpolationCurve3d(g: InterpolationCurve3d): any;\r\n  /** handle strongly typed  [[AkimaCurve3d]]  */\r\n  public abstract handleAkimaCurve3d(g: AkimaCurve3d): any;\r\n  /** handle strongly typed  [[BSplineCurve3dH]]  */\r\n  public abstract handleBSplineCurve3dH(g: BSplineCurve3dH): any;\r\n  /** handle strongly typed  [[BSplineSurface3d]]  */\r\n  public abstract handleBSplineSurface3d(g: BSplineSurface3d): any;\r\n  /** handle strongly typed  [[CoordinateXYZ]]  */\r\n  public abstract handleCoordinateXYZ(g: CoordinateXYZ): any;\r\n  /** handle strongly typed  [[BSplineSurface3dH]]  */\r\n  public abstract handleBSplineSurface3dH(g: BSplineSurface3dH): any;\r\n  /** handle strongly typed  [[IndexedPolyface]]  */\r\n  public abstract handleIndexedPolyface(g: IndexedPolyface): any;\r\n  /** handle strongly typed [[TransitionSpiral3d]]\r\n   * @alpha\r\n   */\r\n  public abstract handleTransitionSpiral(g: TransitionSpiral3d): any;\r\n\r\n  /** handle strongly typed Path (base class method calls handleCurveCollection) */\r\n  public handlePath(g: Path): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  Loop (base class method calls handleCurveCollection) */\r\n  public handleLoop(g: Loop): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  ParityRegion (base class method calls handleCurveCollection) */\r\n  public handleParityRegion(g: ParityRegion): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  UnionRegion (base class method calls handleCurveCollection) */\r\n  public handleUnionRegion(g: UnionRegion): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  BagOfCurves (base class method calls handleCurveCollection) */\r\n  public handleBagOfCurves(g: BagOfCurves): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  BagOfCurves (base class method calls handleCurveCollection) */\r\n  /** handle strongly typed  Sphere */\r\n  public abstract handleSphere(g: Sphere): any;\r\n  /** handle strongly typed  Cone */\r\n  public abstract handleCone(g: Cone): any;\r\n  /** handle strongly typed  Box */\r\n  public abstract handleBox(g: Box): any;\r\n  /** handle strongly typed  TorusPipe */\r\n  public abstract handleTorusPipe(g: TorusPipe): any;\r\n  /** handle strongly typed  LinearSweep */\r\n  public abstract handleLinearSweep(g: LinearSweep): any;\r\n  /** handle strongly typed  RotationalSweep */\r\n  public abstract handleRotationalSweep(g: RotationalSweep): any;\r\n  /** handle strongly typed  RuledSweep */\r\n  public abstract handleRuledSweep(g: RuledSweep): any;\r\n  /** handle strongly typed  PointString3d */\r\n  public abstract handlePointString3d(g: PointString3d): any;\r\n  /** handle strongly typed  BezierCurve3d */\r\n  public abstract handleBezierCurve3d(g: BezierCurve3d): any;\r\n  /** handle strongly typed  BezierCurve3dH */\r\n  public abstract handleBezierCurve3dH(g: BezierCurve3dH): any;\r\n}\r\n/**\r\n * `NullGeometryHandler` is a base class for dispatching various geometry types to\r\n * application specific implementation of some service.\r\n *\r\n * To use:\r\n * * Derive a class from `NullGeometryHandler`\r\n * * Reimplement any or all of the specific `handleXXXX` methods\r\n * * Create a handler instance `myHandler`\r\n * * To send a `GeometryQuery` object `candidateGeometry` through the (fast) dispatch, invoke   `candidateGeometry.dispatchToHandler (myHandler)\r\n * * The appropriate method or methods will get called with a strongly typed `_g ` value.\r\n * @public\r\n */\r\nexport class NullGeometryHandler extends GeometryHandler {\r\n  /** no-action implementation */\r\n  public handleLineSegment3d(_g: LineSegment3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleLineString3d(_g: LineString3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleArc3d(_g: Arc3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleCurveCollection(_g: CurveCollection): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineCurve3d(_g: BSplineCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleInterpolationCurve3d(_g: InterpolationCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleAkimaCurve3d(_g: AkimaCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineCurve3dH(_g: BSplineCurve3dH): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineSurface3d(_g: BSplineSurface3d): any { return undefined; }\r\n\r\n  /** no-action implementation */\r\n  public handleCoordinateXYZ(_g: CoordinateXYZ): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineSurface3dH(_g: BSplineSurface3dH): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleIndexedPolyface(_g: IndexedPolyface): any { return undefined; }\r\n  /** no-action implementation\r\n   * @alpha\r\n   */\r\n  public handleTransitionSpiral(_g: TransitionSpiral3d): any { return undefined; }\r\n\r\n  /** no-action implementation */\r\n  public override handlePath(_g: Path): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleLoop(_g: Loop): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleParityRegion(_g: ParityRegion): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleUnionRegion(_g: UnionRegion): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleBagOfCurves(_g: BagOfCurves): any { return undefined; }\r\n\r\n  /** no-action implementation */\r\n  public handleSphere(_g: Sphere): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleCone(_g: Cone): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBox(_g: Box): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleTorusPipe(_g: TorusPipe): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleLinearSweep(_g: LinearSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleRotationalSweep(_g: RotationalSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleRuledSweep(_g: RuledSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handlePointString3d(_g: PointString3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBezierCurve3d(_g: BezierCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBezierCurve3dH(_g: BezierCurve3dH): any { return undefined; }\r\n}\r\n/**\r\n * Implement GeometryHandler methods, with all curve collection methods recursing to children.\r\n * @public\r\n */\r\nexport class RecurseToCurvesGeometryHandler extends GeometryHandler {\r\n  /** no-action implementation */\r\n  public handleLineSegment3d(_g: LineSegment3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleLineString3d(_g: LineString3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleArc3d(_g: Arc3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineCurve3d(_g: BSplineCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleInterpolationCurve3d(_g: InterpolationCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleAkimaCurve3d(_g: AkimaCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineCurve3dH(_g: BSplineCurve3dH): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineSurface3d(_g: BSplineSurface3d): any { return undefined; }\r\n\r\n  /** no-action implementation */\r\n  public handleCoordinateXYZ(_g: CoordinateXYZ): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineSurface3dH(_g: BSplineSurface3dH): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleIndexedPolyface(_g: IndexedPolyface): any { return undefined; }\r\n  /** no-action implementation\r\n   * @alpha\r\n   */\r\n  public handleTransitionSpiral(_g: TransitionSpiral3d): any { return undefined; }\r\n  /** Invoke `child.dispatchToGeometryHandler(this)` for each child in the array returned by the query `g.children` */\r\n  public handleChildren(g: GeometryQuery): any {\r\n    const children = g.children;\r\n    if (children)\r\n      for (const child of children) {\r\n        child.dispatchToGeometryHandler(this);\r\n      }\r\n  }\r\n  /** Recurse to children */\r\n  public override handleCurveCollection(g: CurveCollection): any { return this.handleChildren(g); }\r\n\r\n  /** Recurse to children */\r\n  public override handlePath(g: Path): any { return this.handleChildren(g); }\r\n  /** Recurse to children */\r\n  public override handleLoop(g: Loop): any { return this.handleChildren(g); }\r\n  /** Recurse to children */\r\n  public override handleParityRegion(g: ParityRegion): any { return this.handleChildren(g); }\r\n  /** Recurse to children */\r\n  public override handleUnionRegion(g: UnionRegion): any { return this.handleChildren(g); }\r\n  /** Recurse to children */\r\n  public override handleBagOfCurves(g: BagOfCurves): any { return this.handleChildren(g); }\r\n\r\n  /** no-action implementation */\r\n  public handleSphere(_g: Sphere): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleCone(_g: Cone): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBox(_g: Box): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleTorusPipe(_g: TorusPipe): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleLinearSweep(_g: LinearSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleRotationalSweep(_g: RotationalSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleRuledSweep(_g: RuledSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handlePointString3d(_g: PointString3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBezierCurve3d(_g: BezierCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBezierCurve3dH(_g: BezierCurve3dH): any { return undefined; }\r\n}\r\n\r\n/** IStrokeHandler is an interface with methods to receive data about curves being stroked.\r\n * CurvePrimitives emitStrokes () methods emit calls to a handler object with these methods.\r\n * The various CurvePrimitive types are free to announce either single points (announcePoint), linear fragments,\r\n * or fractional intervals of the parent curve.\r\n * * handler.startCurvePrimitive (cp) -- announce the curve primitive whose strokes will follow.\r\n * * announcePointTangent (xyz, fraction, tangent) -- announce a single point on the curve.\r\n * * announceIntervalForUniformStepStrokes (cp, numStrokes, fraction0, fraction1) -- announce a fraction\r\n * interval in which the curve can be evaluated (e.g. the handler can call cp->fractionToPointAndDerivative ())\r\n * * announceSegmentInterval (cp, point0, point1, numStrokes, fraction0, fraction1) -- announce\r\n *    that the fractional interval fraction0, fraction1 is a straight line which should be broken into\r\n *    numStrokes strokes.\r\n *   * A LineSegment would make a single call to this.\r\n *   * A LineString would make one call to this for each of its segments, with fractions indicating position\r\n * within the linestring.\r\n * * endCurvePrimitive (cp) -- announce the end of the curve primitive.\r\n * @public\r\n */\r\nexport interface IStrokeHandler {\r\n  /** announce a parent curve primitive\r\n   * * startParentCurvePrimitive() ...endParentCurvePrimitive() are wrapped around startCurvePrimitive and endCurvePrimitive when the interior primitive is a proxy.\r\n   */\r\n  startParentCurvePrimitive(cp: CurvePrimitive): void;\r\n  /** Announce the curve primitive that will be described in subsequent calls. */\r\n  startCurvePrimitive(cp: CurvePrimitive): void;\r\n  /**\r\n   * announce a single point with its fraction and tangent.\r\n   * * (IMPORTANT) the same Point3d and Vector3d will be reset and passed on multiple calls.\r\n   * * (THEREFORE) if the implementation is saving coordinates, it must copy the xyz data out into its own data structure rather than save the references.\r\n   */\r\n  announcePointTangent(xyz: Point3d, fraction: number, tangent: Vector3d): void;\r\n\r\n  /** Announce that curve primitive cp should be evaluated in the specified fraction interval.\r\n   * * Note that this method is permitted (expected) to provide pre-stroked data if available.\r\n   * * In th pre-stroked case, the cp passed to the handler will be the stroked image, not the original.\r\n   * * Callers that want summary data should implement (and return true from) needPrimaryDataForStrokes\r\n  */\r\n  announceIntervalForUniformStepStrokes(\r\n    cp: CurvePrimitive,\r\n    numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void;\r\n  /**\r\n   * OPTIONAL method for a handler to indicate that it wants primary geometry (e.g. spirals) rather than strokes.\r\n   * @returns true if primary geometry should be passed (rather than stroked or otherwise simplified)\r\n  */\r\n  needPrimaryGeometryForStrokes?(): boolean;\r\n  /** Announce numPoints interpolated between point0 and point1, with associated fractions */\r\n  announceSegmentInterval(\r\n    cp: CurvePrimitive,\r\n    point0: Point3d,\r\n    point1: Point3d,\r\n    numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void;\r\n  /** Announce that all data about `cp` has been announced. */\r\n  endCurvePrimitive(cp: CurvePrimitive): void;\r\n  /** Announce that all data about the parent primitive has been announced. */\r\n  endParentCurvePrimitive(cp: CurvePrimitive): void;\r\n  /**\r\n   * Announce a bezier curve fragment.\r\n   * * this is usually a section of BsplineCurve\r\n   * * If this function is missing, the same interval will be passed to announceIntervalForUniformSteps.\r\n   * @param bezier bezier fragment\r\n   * @param numStrokes suggested number of strokes (uniform in bezier interval 0..1)\r\n   * @param parent parent curve\r\n   * @param spanIndex spanIndex within parent\r\n   * @param fraction0 start fraction on parent curve\r\n   * @param fraction1 end fraction on parent curve\r\n   */\r\n  announceBezierCurve?(\r\n    bezier: BezierCurveBase,\r\n    numStrokes: number,\r\n    parent: CurvePrimitive,\r\n    spandex: number,\r\n    fraction0: number,\r\n    fraction1: number): void;\r\n}\r\n\r\n/**\r\n * Interface with methods for mapping (u,v) fractional coordinates to surface xyz and derivatives.\r\n * @public\r\n */\r\nexport interface UVSurface {\r\n  /**\r\n   * Convert fractional u and v coordinates to surface point\r\n   * @param uFraction fractional coordinate in u direction\r\n   * @param vFraction fractional coordinate in the v direction\r\n   * @param result optional pre-allocated point\r\n   */\r\n  uvFractionToPoint(uFraction: number, vFraction: number, result?: Point3d): Point3d;\r\n  /**\r\n   * Convert fractional u and v coordinates to surface point and in-surface tangent directions.\r\n   * * Remark: the vectors are expected to be non-zero tangents which can be crossed to get a normal.\r\n   * * Hence the are NOT precisely either (a) partial derivatives or (b) frenet vectors\r\n   * @param uFraction fractional coordinate in u direction\r\n   * @param vFraction fractional coordinate in the v direction\r\n   * @param result optional pre-allocated carrier for point and vectors\r\n   */\r\n  uvFractionToPointAndTangents(uFraction: number, vFraction: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors;\r\n}\r\n/**\r\n * Interface for queries of distance-along in u and v directions\r\n * @public\r\n */\r\nexport interface UVSurfaceIsoParametricDistance {\r\n  /**\r\n   * * Return a vector whose x and y parts are \"size\" of the surface in the u and v directions.\r\n   * * Sizes are use for applying scaling to mesh parameters\r\n   * * These sizes are (reasonable approximations of) the max curve length along u and v isoparameter lines.\r\n   *   * e.g. for a sphere, these are:\r\n   *      * u direction = distance around the equator\r\n   *      * v direction = distance from south pole to north pole.\r\n   */\r\n  maxIsoParametricDistance(): Vector2d;\r\n}\r\n"]}
+{"version":3,"file":"GeometryHandler.js","sourceRoot":"","sources":["../../../src/geometry3d/GeometryHandler.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAuC/F;;;;;GAKG;AACH,MAAsB,eAAe;IAOnC,kDAAkD;IAC3C,qBAAqB,CAAC,EAAmB,IAAS,CAAC;IAsB1D,iFAAiF;IAC1E,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,kFAAkF;IAC3E,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,0FAA0F;IACnF,kBAAkB,CAAC,CAAe,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,yFAAyF;IAClF,iBAAiB,CAAC,CAAc,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,yFAAyF;IAClF,iBAAiB,CAAC,CAAc,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAsBxF;AA7DD,0CA6DC;AACD;;;;;;;;;;;GAWG;AACH,MAAa,mBAAoB,SAAQ,eAAe;IACtD,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtE,+BAA+B;IACxB,WAAW,CAAC,EAAS,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxD,+BAA+B;IACf,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACrF,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC1E,+BAA+B;IACxB,0BAA0B,CAAC,EAAwB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtF,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtE,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E,+BAA+B;IACxB,sBAAsB,CAAC,EAAoB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAE9E,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,uBAAuB,CAAC,EAAqB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChF,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E;;OAEG;IACI,sBAAsB,CAAC,EAAsB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAEhF,+BAA+B;IACf,UAAU,CAAC,EAAQ,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC/D,+BAA+B;IACf,UAAU,CAAC,EAAQ,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC/D,+BAA+B;IACf,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC/E,+BAA+B;IACf,iBAAiB,CAAC,EAAe,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC7E,+BAA+B;IACf,iBAAiB,CAAC,EAAe,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAE7E,+BAA+B;IACxB,YAAY,CAAC,EAAU,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC1D,+BAA+B;IACxB,UAAU,CAAC,EAAQ,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtD,+BAA+B;IACxB,SAAS,CAAC,EAAO,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACpD,+BAA+B;IACxB,eAAe,CAAC,EAAa,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChE,+BAA+B;IACxB,iBAAiB,CAAC,EAAe,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACpE,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E,+BAA+B;IACxB,gBAAgB,CAAC,EAAc,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAClE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;CAC3E;AA9DD,kDA8DC;AACD;;;GAGG;AACH,MAAa,8BAA+B,SAAQ,eAAe;IACjE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtE,+BAA+B;IACxB,WAAW,CAAC,EAAS,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxD,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC1E,+BAA+B;IACxB,0BAA0B,CAAC,EAAwB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtF,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtE,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E,+BAA+B;IACxB,sBAAsB,CAAC,EAAoB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAE9E,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,uBAAuB,CAAC,EAAqB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChF,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E;;OAEG;IACI,sBAAsB,CAAC,EAAsB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChF,oHAAoH;IAC7G,cAAc,CAAC,CAAgB;QACpC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QAC5B,IAAI,QAAQ;YACV,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;gBAC5B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;aACvC;IACL,CAAC;IACD,0BAA0B;IACV,qBAAqB,CAAC,CAAkB,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjG,0BAA0B;IACV,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,0BAA0B;IACV,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,0BAA0B;IACV,kBAAkB,CAAC,CAAe,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3F,0BAA0B;IACV,iBAAiB,CAAC,CAAc,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,0BAA0B;IACV,iBAAiB,CAAC,CAAc,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzF,+BAA+B;IACxB,YAAY,CAAC,EAAU,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC1D,+BAA+B;IACxB,UAAU,CAAC,EAAQ,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtD,+BAA+B;IACxB,SAAS,CAAC,EAAO,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACpD,+BAA+B;IACxB,eAAe,CAAC,EAAa,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChE,+BAA+B;IACxB,iBAAiB,CAAC,EAAe,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACpE,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E,+BAA+B;IACxB,gBAAgB,CAAC,EAAc,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAClE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;CAC3E;AAtED,wEAsEC","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 ArraysAndInterfaces\r\n */\r\n\r\nimport { AkimaCurve3d } from \"../bspline/AkimaCurve3d\";\r\nimport { BezierCurve3d } from \"../bspline/BezierCurve3d\";\r\nimport { BezierCurve3dH } from \"../bspline/BezierCurve3dH\";\r\nimport { BezierCurveBase } from \"../bspline/BezierCurveBase\";\r\nimport { BSplineCurve3d } from \"../bspline/BSplineCurve\";\r\nimport { BSplineCurve3dH } from \"../bspline/BSplineCurve3dH\";\r\nimport { BSplineSurface3d, BSplineSurface3dH } from \"../bspline/BSplineSurface\";\r\nimport { InterpolationCurve3d } from \"../bspline/InterpolationCurve3d\";\r\nimport { Arc3d } from \"../curve/Arc3d\";\r\nimport { CoordinateXYZ } from \"../curve/CoordinateXYZ\";\r\nimport { BagOfCurves, CurveCollection } from \"../curve/CurveCollection\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { Loop } from \"../curve/Loop\";\r\nimport { ParityRegion } from \"../curve/ParityRegion\";\r\nimport { Path } from \"../curve/Path\";\r\nimport { PointString3d } from \"../curve/PointString3d\";\r\nimport { TransitionSpiral3d } from \"../curve/spiral/TransitionSpiral3d\";\r\nimport { UnionRegion } from \"../curve/UnionRegion\";\r\nimport { IndexedPolyface } from \"../polyface/Polyface\";\r\nimport { Box } from \"../solid/Box\";\r\nimport { Cone } from \"../solid/Cone\";\r\nimport { LinearSweep } from \"../solid/LinearSweep\";\r\nimport { RotationalSweep } from \"../solid/RotationalSweep\";\r\nimport { RuledSweep } from \"../solid/RuledSweep\";\r\nimport { Sphere } from \"../solid/Sphere\";\r\nimport { TorusPipe } from \"../solid/TorusPipe\";\r\nimport { Plane3dByOriginAndVectors } from \"./Plane3dByOriginAndVectors\";\r\nimport { Vector2d } from \"./Point2dVector2d\";\r\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\r\n\r\n/**\r\n * * `GeometryHandler` defines the base abstract methods for double-dispatch geometry computation.\r\n * * User code that wants to handle one or all of the commonly known geometry types implements a handler class.\r\n * * User code that does not handle all types is most likely to start with `NullGeometryHandler`, which will provide no-action implementations for all types.\r\n * @public\r\n */\r\nexport abstract class GeometryHandler {\r\n  /** handle strongly typed [[LineSegment3d]] */\r\n  public abstract handleLineSegment3d(g: LineSegment3d): any;\r\n  /** handle strongly typed  [[LineString3d]]  */\r\n  public abstract handleLineString3d(g: LineString3d): any;\r\n  /** handle strongly typed  [[Arc3d]]  */\r\n  public abstract handleArc3d(g: Arc3d): any;\r\n  /** handle strongly typed  [[CurveCollection]]  */\r\n  public handleCurveCollection(_g: CurveCollection): any { }\r\n  /** handle strongly typed  [[BSplineCurve3d]]  */\r\n  public abstract handleBSplineCurve3d(g: BSplineCurve3d): any;\r\n  /** handle strongly typed  [[InterpolationCurve3d]]  */\r\n  public abstract handleInterpolationCurve3d(g: InterpolationCurve3d): any;\r\n  /** handle strongly typed  [[AkimaCurve3d]]  */\r\n  public abstract handleAkimaCurve3d(g: AkimaCurve3d): any;\r\n  /** handle strongly typed  [[BSplineCurve3dH]]  */\r\n  public abstract handleBSplineCurve3dH(g: BSplineCurve3dH): any;\r\n  /** handle strongly typed  [[BSplineSurface3d]]  */\r\n  public abstract handleBSplineSurface3d(g: BSplineSurface3d): any;\r\n  /** handle strongly typed  [[CoordinateXYZ]]  */\r\n  public abstract handleCoordinateXYZ(g: CoordinateXYZ): any;\r\n  /** handle strongly typed  [[BSplineSurface3dH]]  */\r\n  public abstract handleBSplineSurface3dH(g: BSplineSurface3dH): any;\r\n  /** handle strongly typed  [[IndexedPolyface]]  */\r\n  public abstract handleIndexedPolyface(g: IndexedPolyface): any;\r\n  /** handle strongly typed [[TransitionSpiral3d]]\r\n   * @alpha\r\n   */\r\n  public abstract handleTransitionSpiral(g: TransitionSpiral3d): any;\r\n\r\n  /** handle strongly typed Path (base class method calls handleCurveCollection) */\r\n  public handlePath(g: Path): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  Loop (base class method calls handleCurveCollection) */\r\n  public handleLoop(g: Loop): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  ParityRegion (base class method calls handleCurveCollection) */\r\n  public handleParityRegion(g: ParityRegion): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  UnionRegion (base class method calls handleCurveCollection) */\r\n  public handleUnionRegion(g: UnionRegion): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  BagOfCurves (base class method calls handleCurveCollection) */\r\n  public handleBagOfCurves(g: BagOfCurves): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  BagOfCurves (base class method calls handleCurveCollection) */\r\n  /** handle strongly typed  Sphere */\r\n  public abstract handleSphere(g: Sphere): any;\r\n  /** handle strongly typed  Cone */\r\n  public abstract handleCone(g: Cone): any;\r\n  /** handle strongly typed  Box */\r\n  public abstract handleBox(g: Box): any;\r\n  /** handle strongly typed  TorusPipe */\r\n  public abstract handleTorusPipe(g: TorusPipe): any;\r\n  /** handle strongly typed  LinearSweep */\r\n  public abstract handleLinearSweep(g: LinearSweep): any;\r\n  /** handle strongly typed  RotationalSweep */\r\n  public abstract handleRotationalSweep(g: RotationalSweep): any;\r\n  /** handle strongly typed  RuledSweep */\r\n  public abstract handleRuledSweep(g: RuledSweep): any;\r\n  /** handle strongly typed  PointString3d */\r\n  public abstract handlePointString3d(g: PointString3d): any;\r\n  /** handle strongly typed  BezierCurve3d */\r\n  public abstract handleBezierCurve3d(g: BezierCurve3d): any;\r\n  /** handle strongly typed  BezierCurve3dH */\r\n  public abstract handleBezierCurve3dH(g: BezierCurve3dH): any;\r\n}\r\n/**\r\n * `NullGeometryHandler` is a base class for dispatching various geometry types to\r\n * application specific implementation of some service.\r\n *\r\n * To use:\r\n * * Derive a class from `NullGeometryHandler`\r\n * * Reimplement any or all of the specific `handleXXXX` methods\r\n * * Create a handler instance `myHandler`\r\n * * To send a `GeometryQuery` object `candidateGeometry` through the (fast) dispatch, invoke   `candidateGeometry.dispatchToHandler (myHandler)\r\n * * The appropriate method or methods will get called with a strongly typed `_g ` value.\r\n * @public\r\n */\r\nexport class NullGeometryHandler extends GeometryHandler {\r\n  /** no-action implementation */\r\n  public handleLineSegment3d(_g: LineSegment3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleLineString3d(_g: LineString3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleArc3d(_g: Arc3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleCurveCollection(_g: CurveCollection): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineCurve3d(_g: BSplineCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleInterpolationCurve3d(_g: InterpolationCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleAkimaCurve3d(_g: AkimaCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineCurve3dH(_g: BSplineCurve3dH): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineSurface3d(_g: BSplineSurface3d): any { return undefined; }\r\n\r\n  /** no-action implementation */\r\n  public handleCoordinateXYZ(_g: CoordinateXYZ): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineSurface3dH(_g: BSplineSurface3dH): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleIndexedPolyface(_g: IndexedPolyface): any { return undefined; }\r\n  /** no-action implementation\r\n   * @alpha\r\n   */\r\n  public handleTransitionSpiral(_g: TransitionSpiral3d): any { return undefined; }\r\n\r\n  /** no-action implementation */\r\n  public override handlePath(_g: Path): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleLoop(_g: Loop): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleParityRegion(_g: ParityRegion): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleUnionRegion(_g: UnionRegion): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleBagOfCurves(_g: BagOfCurves): any { return undefined; }\r\n\r\n  /** no-action implementation */\r\n  public handleSphere(_g: Sphere): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleCone(_g: Cone): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBox(_g: Box): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleTorusPipe(_g: TorusPipe): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleLinearSweep(_g: LinearSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleRotationalSweep(_g: RotationalSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleRuledSweep(_g: RuledSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handlePointString3d(_g: PointString3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBezierCurve3d(_g: BezierCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBezierCurve3dH(_g: BezierCurve3dH): any { return undefined; }\r\n}\r\n/**\r\n * Implement GeometryHandler methods, with all curve collection methods recursing to children.\r\n * @public\r\n */\r\nexport class RecurseToCurvesGeometryHandler extends GeometryHandler {\r\n  /** no-action implementation */\r\n  public handleLineSegment3d(_g: LineSegment3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleLineString3d(_g: LineString3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleArc3d(_g: Arc3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineCurve3d(_g: BSplineCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleInterpolationCurve3d(_g: InterpolationCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleAkimaCurve3d(_g: AkimaCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineCurve3dH(_g: BSplineCurve3dH): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineSurface3d(_g: BSplineSurface3d): any { return undefined; }\r\n\r\n  /** no-action implementation */\r\n  public handleCoordinateXYZ(_g: CoordinateXYZ): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineSurface3dH(_g: BSplineSurface3dH): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleIndexedPolyface(_g: IndexedPolyface): any { return undefined; }\r\n  /** no-action implementation\r\n   * @alpha\r\n   */\r\n  public handleTransitionSpiral(_g: TransitionSpiral3d): any { return undefined; }\r\n  /** Invoke `child.dispatchToGeometryHandler(this)` for each child in the array returned by the query `g.children` */\r\n  public handleChildren(g: GeometryQuery): any {\r\n    const children = g.children;\r\n    if (children)\r\n      for (const child of children) {\r\n        child.dispatchToGeometryHandler(this);\r\n      }\r\n  }\r\n  /** Recurse to children */\r\n  public override handleCurveCollection(g: CurveCollection): any { return this.handleChildren(g); }\r\n\r\n  /** Recurse to children */\r\n  public override handlePath(g: Path): any { return this.handleChildren(g); }\r\n  /** Recurse to children */\r\n  public override handleLoop(g: Loop): any { return this.handleChildren(g); }\r\n  /** Recurse to children */\r\n  public override handleParityRegion(g: ParityRegion): any { return this.handleChildren(g); }\r\n  /** Recurse to children */\r\n  public override handleUnionRegion(g: UnionRegion): any { return this.handleChildren(g); }\r\n  /** Recurse to children */\r\n  public override handleBagOfCurves(g: BagOfCurves): any { return this.handleChildren(g); }\r\n\r\n  /** no-action implementation */\r\n  public handleSphere(_g: Sphere): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleCone(_g: Cone): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBox(_g: Box): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleTorusPipe(_g: TorusPipe): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleLinearSweep(_g: LinearSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleRotationalSweep(_g: RotationalSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleRuledSweep(_g: RuledSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handlePointString3d(_g: PointString3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBezierCurve3d(_g: BezierCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBezierCurve3dH(_g: BezierCurve3dH): any { return undefined; }\r\n}\r\n\r\n/** IStrokeHandler is an interface with methods to receive data about curves being stroked.\r\n * CurvePrimitives emitStrokes () methods emit calls to a handler object with these methods.\r\n * The various CurvePrimitive types are free to announce either single points (announcePoint), linear fragments,\r\n * or fractional intervals of the parent curve.\r\n * * handler.startCurvePrimitive (cp) -- announce the curve primitive whose strokes will follow.\r\n * * announcePointTangent (xyz, fraction, tangent) -- announce a single point on the curve.\r\n * * announceIntervalForUniformStepStrokes (cp, numStrokes, fraction0, fraction1) -- announce a fraction\r\n * interval in which the curve can be evaluated (e.g. the handler can call cp->fractionToPointAndDerivative ())\r\n * * announceSegmentInterval (cp, point0, point1, numStrokes, fraction0, fraction1) -- announce\r\n *    that the fractional interval fraction0, fraction1 is a straight line which should be broken into\r\n *    numStrokes strokes.\r\n *   * A LineSegment would make a single call to this.\r\n *   * A LineString would make one call to this for each of its segments, with fractions indicating position\r\n * within the linestring.\r\n * * endCurvePrimitive (cp) -- announce the end of the curve primitive.\r\n * @public\r\n */\r\nexport interface IStrokeHandler {\r\n  /** announce a parent curve primitive\r\n   * * startParentCurvePrimitive() ...endParentCurvePrimitive() are wrapped around startCurvePrimitive and endCurvePrimitive when the interior primitive is a proxy.\r\n   */\r\n  startParentCurvePrimitive(cp: CurvePrimitive): void;\r\n  /** Announce the curve primitive that will be described in subsequent calls. */\r\n  startCurvePrimitive(cp: CurvePrimitive): void;\r\n  /**\r\n   * announce a single point with its fraction and tangent.\r\n   * * (IMPORTANT) the same Point3d and Vector3d will be reset and passed on multiple calls.\r\n   * * (THEREFORE) if the implementation is saving coordinates, it must copy the xyz data out into its own data structure rather than save the references.\r\n   */\r\n  announcePointTangent(xyz: Point3d, fraction: number, tangent: Vector3d): void;\r\n\r\n  /** Announce that curve primitive cp should be evaluated in the specified fraction interval.\r\n   * * Note that this method is permitted (expected) to provide pre-stroked data if available.\r\n   * * In th pre-stroked case, the cp passed to the handler will be the stroked image, not the original.\r\n   * * Callers that want summary data should implement (and return true from) needPrimaryDataForStrokes\r\n  */\r\n  announceIntervalForUniformStepStrokes(\r\n    cp: CurvePrimitive,\r\n    numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void;\r\n  /**\r\n   * OPTIONAL method for a handler to indicate that it wants primary geometry (e.g. spirals) rather than strokes.\r\n   * @returns true if primary geometry should be passed (rather than stroked or otherwise simplified)\r\n  */\r\n  needPrimaryGeometryForStrokes?(): boolean;\r\n  /** Announce numPoints interpolated between point0 and point1, with associated fractions */\r\n  announceSegmentInterval(\r\n    cp: CurvePrimitive,\r\n    point0: Point3d,\r\n    point1: Point3d,\r\n    numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void;\r\n  /** Announce that all data about `cp` has been announced. */\r\n  endCurvePrimitive(cp: CurvePrimitive): void;\r\n  /** Announce that all data about the parent primitive has been announced. */\r\n  endParentCurvePrimitive(cp: CurvePrimitive): void;\r\n  /**\r\n   * Announce a bezier curve fragment.\r\n   * * this is usually a section of BsplineCurve\r\n   * * If this function is missing, the same interval will be passed to announceIntervalForUniformSteps.\r\n   * @param bezier bezier fragment\r\n   * @param numStrokes suggested number of strokes (uniform in bezier interval 0..1)\r\n   * @param parent parent curve\r\n   * @param spanIndex spanIndex within parent\r\n   * @param fraction0 start fraction on parent curve\r\n   * @param fraction1 end fraction on parent curve\r\n   */\r\n  announceBezierCurve?(\r\n    bezier: BezierCurveBase,\r\n    numStrokes: number,\r\n    parent: CurvePrimitive,\r\n    spandex: number,\r\n    fraction0: number,\r\n    fraction1: number): void;\r\n}\r\n\r\n/**\r\n * Interface with methods for mapping (u,v) fractional coordinates to surface xyz and derivatives.\r\n * @public\r\n */\r\nexport interface UVSurface {\r\n  /**\r\n   * Convert fractional u and v coordinates to surface point.\r\n   * @param uFraction fractional coordinate in u direction\r\n   * @param vFraction fractional coordinate in v direction\r\n   * @param result optional pre-allocated point\r\n   */\r\n  uvFractionToPoint(uFraction: number, vFraction: number, result?: Point3d): Point3d;\r\n  /**\r\n   * Convert fractional u and v coordinates to surface point and in-surface tangent directions.\r\n   * * The vectors are expected to be non-zero tangents which can be crossed to get a normal.\r\n   * * Hence they are not necessarily (a) partial derivatives or (b) Frenet vectors.\r\n   * @param uFraction fractional coordinate in u direction\r\n   * @param vFraction fractional coordinate in v direction\r\n   * @param result optional pre-allocated carrier for point and vectors\r\n   */\r\n  uvFractionToPointAndTangents(uFraction: number, vFraction: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors;\r\n}\r\n/**\r\n * Interface for queries of distance-along in u and v directions\r\n * @public\r\n */\r\nexport interface UVSurfaceIsoParametricDistance {\r\n  /**\r\n   * * Return a vector whose x and y parts are \"size\" of the surface in the u and v directions.\r\n   * * Sizes are use for applying scaling to mesh parameters\r\n   * * These sizes are (reasonable approximations of) the max curve length along u and v isoparameter lines.\r\n   *   * e.g. for a sphere, these are:\r\n   *      * u direction = distance around the equator\r\n   *      * v direction = distance from south pole to north pole.\r\n   */\r\n  maxIsoParametricDistance(): Vector2d;\r\n}\r\n"]}

package/lib/cjs/geometry3d/GrowableBlockedArray.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"GrowableBlockedArray.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/GrowableBlockedArray.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AAEjE;;;;GAIG;AACH,qBAAa,oBAAoB;IAC/B,+CAA+C;IAC/C,SAAS,CAAC,KAAK,EAAE,YAAY,CAAC;IAC9B,6CAA6C;IAC7C,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC;IACzB;;OAEG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,CAAC;IAC7B;;OAEG;IACH,SAAS,CAAC,aAAa,EAAE,MAAM,CAAC;IAEhC;;;;;;;OAOG;gBACgB,SAAS,EAAE,MAAM,EAAE,aAAa,GAAE,MAAU,EAAE,YAAY,CAAC,EAAE,MAAM;IAOtF;;;;;OAKG;IACH,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAC;IA2B/H;;;OAGG;IACI,KAAK,IAAI,oBAAoB;IAOpC,yDAAyD;IACzD,IAAW,MAAM,IAAI,MAAM,CAAwB;IACnD,yDAAyD;IACzD,IAAW,SAAS,IAAI,MAAM,CAAwB;IACtD,gDAAgD;IAChD,IAAW,WAAW,IAAI,MAAM,CAA4B;IAC5D;;;;OAIG;IACI,cAAc,CAAC,UAAU,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,GAAG,MAAM;IAG3E,uEAAuE;IAChE,KAAK;IACZ,kDAAkD;IAC3C,aAAa;IAGpB,+CAA+C;IACxC,mBAAmB,CAAC,aAAa,EAAE,MAAM,EAAE,iBAAiB,GAAE,OAAc;IASnF;;;OAGG;IACI,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE;IAQjC;;;;;;OAMG;IACH,SAAS,CAAC,aAAa,IAAI,MAAM;IASjC,qCAAqC;IAC9B,QAAQ;IAIf,gFAAgF;IAChF,SAAS,CAAC,uBAAuB,CAAC,UAAU,EAAE,MAAM;IACpD,wHAAwH;IACjH,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAKvF,oFAAoF;IAC7E,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,MAAM;IAGpE;;;;;OAKG;WACW,mBAAmB,CAAC,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM;IAWxG,+EAA+E;IACxE,kBAAkB,CAAC,aAAa,GAAE,uBAAkE,GAAG,WAAW;IAezH,qFAAqF;IAC9E,qBAAqB,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM;IAa9E,2HAA2H;IACpH,wBAAwB,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM;CAYhH"}
+{"version":3,"file":"GrowableBlockedArray.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/GrowableBlockedArray.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AAEjE;;;;GAIG;AACH,qBAAa,oBAAoB;IAC/B,+CAA+C;IAC/C,SAAS,CAAC,KAAK,EAAE,YAAY,CAAC;IAC9B,6CAA6C;IAC7C,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC;IACzB;;OAEG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,CAAC;IAC7B;;OAEG;IACH,SAAS,CAAC,aAAa,EAAE,MAAM,CAAC;IAEhC;;;;;;;OAOG;gBACgB,SAAS,EAAE,MAAM,EAAE,aAAa,GAAE,MAAU,EAAE,YAAY,CAAC,EAAE,MAAM;IAOtF;;;;;OAKG;IACH,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAC;IA2B/H;;;OAGG;IACI,KAAK,IAAI,oBAAoB;IAOpC,yDAAyD;IACzD,IAAW,MAAM,IAAI,MAAM,CAAwB;IACnD,yDAAyD;IACzD,IAAW,SAAS,IAAI,MAAM,CAAwB;IACtD,gDAAgD;IAChD,IAAW,WAAW,IAAI,MAAM,CAA4B;IAC5D;;;;OAIG;IACI,cAAc,CAAC,UAAU,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,GAAG,MAAM;IAG3E,uEAAuE;IAChE,KAAK;IACZ,kDAAkD;IAC3C,aAAa;IAGpB,+CAA+C;IACxC,mBAAmB,CAAC,aAAa,EAAE,MAAM,EAAE,iBAAiB,GAAE,OAAc;IASnF;;;OAGG;IACI,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE;IAQjC;;;;;;OAMG;IACH,SAAS,CAAC,aAAa,IAAI,MAAM;IASjC,qCAAqC;IAC9B,QAAQ;IAIf,gFAAgF;IAChF,SAAS,CAAC,uBAAuB,CAAC,UAAU,EAAE,MAAM;IACpD,wHAAwH;IACjH,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAKvF,oFAAoF;IAC7E,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,MAAM;IAGpE;;;;;OAKG;WACW,mBAAmB,CAAC,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM;IAWxG,+EAA+E;IACxE,kBAAkB,CAAC,aAAa,GAAE,uBAAwH,GAAG,WAAW;IAe/K,qFAAqF;IAC9E,qBAAqB,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM;IAa9E,2HAA2H;IACpH,wBAAwB,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM;CAYhH"}

package/lib/cjs/geometry3d/GrowableBlockedArray.js

@@ -165,7 +165,7 @@ class GrowableBlockedArray {
         return ia - ib; // so original order is maintained among duplicates !!!!
     }
     /** Return an array of block indices sorted per compareLexicalBlock function */
-    sortIndicesLexical(compareBlocks = GrowableBlockedArray.compareLexicalBlock) {
+    sortIndicesLexical(compareBlocks = (dataArray, size, iA, iB) => GrowableBlockedArray.compareLexicalBlock(dataArray, size, iA, iB)) {
         const n = this._inUse;
         // let numCompare = 0;
         const result = new Uint32Array(n);

package/lib/cjs/geometry3d/GrowableBlockedArray.js.map

@@ -1 +1 @@
-{"version":3,"file":"GrowableBlockedArray.js","sourceRoot":"","sources":["../../../src/geometry3d/GrowableBlockedArray.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAIH;;;;GAIG;AACH,MAAa,oBAAoB;IAc/B;;;;;;;OAOG;IACH,YAAmB,SAAiB,EAAE,gBAAwB,CAAC,EAAE,YAAqB;QACpF,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,SAAS,CAAC,CAAC;QACzD,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,UAAU,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,aAAa,GAAG,CAAC,SAAS,KAAK,YAAY,IAAI,YAAY,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACO,QAAQ,CAAC,MAA+B,EAAE,WAAoB,EAAE,UAAmB;QAC3F,qDAAqD;QACrD,IAAI,QAAQ,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAC/B,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,CAAC,SAAS,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC3F,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM;gBACzB,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1B,IAAI,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBACxC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;YACzC,IAAI,OAAO,GAAG,IAAI,CAAC,WAAW,KAAK,CAAC;gBAClC,OAAO,IAAI,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC;SACzC;QACD,IAAI,OAAO,IAAI,CAAC;YACd,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,KAAK,MAAM,CAAC,MAAM;YAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;aAC9B,IAAI,MAAM,YAAY,YAAY;YACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;;YAEtD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,OAAO,EAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAC,CAAC;IAClF,CAAC;IAED;;;OAGG;IACI,KAAK;QACV,MAAM,SAAS,GAAG,IAAI,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QACjG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/C,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC;QAClC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,yDAAyD;IACzD,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACnD,yDAAyD;IACzD,IAAW,SAAS,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACtD,gDAAgD;IAChD,IAAW,WAAW,KAAa,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC5D;;;;OAIG;IACI,cAAc,CAAC,UAAkB,EAAE,gBAAwB;QAChE,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,gBAAgB,CAAC,CAAC;IACrE,CAAC;IACD,uEAAuE;IAChE,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACnC,kDAAkD;IAC3C,aAAa;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC;IAC7C,CAAC;IACD,+CAA+C;IACxC,mBAAmB,CAAC,aAAqB,EAAE,oBAA6B,IAAI;QACjF,IAAI,aAAa,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE;YACxC,IAAI,iBAAiB;gBACnB,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC;YACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;YAC/D,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;SACpC;IACL,CAAC;IACD;;;OAGG;IACI,QAAQ,CAAC,OAAiB;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QAChC,IAAI,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,IAAI,QAAQ,GAAG,IAAI,CAAC,UAAU;YAC5B,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;YAC/B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;OAMG;IACO,aAAa;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;YACjC,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE;YAClD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qCAAqC;IAC9B,QAAQ;QACb,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;IACD,gFAAgF;IACtE,uBAAuB,CAAC,UAAkB,IAAI,OAAO,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC;IAC9F,wHAAwH;IACjH,gBAAgB,CAAC,UAAkB,EAAE,cAAsB;QAChE,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,IAAI,UAAU,GAAG,CAAC,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,IAAI,IAAI,CAAC,UAAU;YACxG,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,GAAG,cAAc,CAAC,CAAC;IACnE,CAAC;IACD,oFAAoF;IAC7E,SAAS,CAAC,UAAkB,EAAE,cAAsB;QACzD,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,GAAG,cAAc,CAAC,CAAC;IACnE,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,mBAAmB,CAAC,IAAkB,EAAE,SAAiB,EAAE,EAAU,EAAE,EAAU;QAC7F,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YAClC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAClB,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAClB,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,CAAC,CAAC;YACtB,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,CAAC,CAAC,CAAC;SACxB;QACD,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,wDAAwD;IAC1E,CAAC;IACD,+EAA+E;IACxE,kBAAkB,CAAC,gBAAyC,oBAAoB,CAAC,mBAAmB;QACzG,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,sBAAsB;QACtB,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CACT,CAAC,WAAmB,EAAE,WAAmB,EAAE,EAAE;YAC3C,gBAAgB;YAChB,OAAO,aAAa,CAAC,IAAI,EAAE,SAAS,EAAE,WAAW,GAAG,SAAS,EAAE,WAAW,GAAG,SAAS,CAAC,CAAC;QAC1F,CAAC,CAAC,CAAC;QACL,+BAA+B;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,qFAAqF;IAC9E,qBAAqB,CAAC,WAAmB,EAAE,WAAmB;QACnE,IAAI,EAAE,GAAG,GAAG,CAAC;QACb,IAAI,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;YACxC,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5B,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;SACb;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;IAED,2HAA2H;IACpH,wBAAwB,CAAC,WAAmB,EAAE,WAAmB,EAAE,MAAc,EAAE,IAAY;QACpG,IAAI,EAAE,GAAG,GAAG,CAAC;QACb,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACrD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YAClC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAChC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;SACb;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;CACF;AAhND,oDAgNC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module ArraysAndInterfaces\r\n */\r\n\r\nimport { BlockComparisonFunction } from \"./GrowableFloat64Array\";\r\n\r\n/**\r\n * Array of contiguous doubles, indexed by block number and index within block.\r\n * * This is essentially a rectangular matrix (two dimensional array), with each block being a row of the matrix.\r\n * @public\r\n */\r\nexport class GrowableBlockedArray {\r\n  /** underlying contiguous, oversized buffer. */\r\n  protected _data: Float64Array;\r\n  /** Number of blocks (matrix rows) in use. */\r\n  protected _inUse: number;\r\n  /** number of numbers per block in the array.\r\n   * * If viewing the array as a two dimensional array, this is the row size.\r\n   */\r\n  protected _blockSize: number;  // positive integer !!!\r\n  /**\r\n   * multiplier used by ensureBlockCapacity to expand requested reallocation size\r\n   */\r\n  protected _growthFactor: number;\r\n\r\n  /**\r\n   * Construct an array whose contents are in blocked (row-major) order, possibly with extra capacity.\r\n   * * Total capacity is `this._data.length`\r\n   * * Actual in-use count is `this._inUse * this._blockSize`\r\n   * @param blockSize number of entries in each block, i.e., row size\r\n   * @param initialBlocks initial capacity in blocks (default 8)\r\n   * @param growthFactor used by ensureBlockCapacity to expand requested reallocation size (default 1.5)\r\n   */\r\n  public constructor(blockSize: number, initialBlocks: number = 8, growthFactor?: number) {\r\n    this._data = new Float64Array(initialBlocks * blockSize);\r\n    this._inUse = 0;\r\n    this._blockSize = blockSize > 0 ? blockSize : 1;\r\n    this._growthFactor = (undefined !== growthFactor && growthFactor >= 1.0) ? growthFactor : 1.5;\r\n  }\r\n\r\n  /** Copy data from source array. Does not reallocate or change active block count.\r\n   * @param source array to copy from\r\n   * @param sourceCount copy the first sourceCount blocks; all blocks if undefined\r\n   * @param destOffset copy to instance array starting at this block index; zero if undefined\r\n   * @return count and offset of blocks copied\r\n   */\r\n  protected copyData(source: Float64Array | number[], sourceCount?: number, destOffset?: number): {count: number, offset: number} {\r\n    // validate inputs and convert from blocks to entries\r\n    let myOffset = (undefined !== destOffset) ? destOffset * this.numPerBlock : 0;\r\n    if (myOffset < 0)\r\n      myOffset = 0;\r\n    if (myOffset >= this._data.length)\r\n      return {count: 0, offset: 0};\r\n    let myCount = (undefined !== sourceCount) ? sourceCount * this.numPerBlock : source.length;\r\n    if (myCount > 0) {\r\n      if (myCount > source.length)\r\n        myCount = source.length;\r\n      if (myOffset + myCount > this._data.length)\r\n        myCount = this._data.length - myOffset;\r\n      if (myCount % this.numPerBlock !== 0)\r\n        myCount -= myCount % this.numPerBlock;\r\n    }\r\n    if (myCount <= 0)\r\n      return {count: 0, offset: 0};\r\n    if (myCount === source.length)\r\n      this._data.set(source, myOffset);\r\n    else if (source instanceof Float64Array)\r\n      this._data.set(source.subarray(0, myCount), myOffset);\r\n    else\r\n      this._data.set(source.slice(0, myCount), myOffset);\r\n    return {count: myCount / this.numPerBlock, offset: myOffset / this.numPerBlock};\r\n  }\r\n\r\n  /**\r\n   * Make a copy of the (active) blocks in this array.\r\n   * (The clone does NOT get excess capacity)\r\n   */\r\n  public clone(): GrowableBlockedArray {\r\n    const newBlocks = new GrowableBlockedArray(this.numPerBlock, this.numBlocks, this._growthFactor);\r\n    newBlocks.copyData(this._data, this.numBlocks);\r\n    newBlocks._inUse = this.numBlocks;\r\n    return newBlocks;\r\n  }\r\n\r\n  /** computed property: length (in blocks, not doubles) */\r\n  public get length(): number { return this._inUse; }\r\n  /** computed property: length (in blocks, not doubles) */\r\n  public get numBlocks(): number { return this._inUse; }\r\n  /** property: number of data values per block */\r\n  public get numPerBlock(): number { return this._blockSize; }\r\n  /**\r\n   * Return a single value indexed within a block. Indices are unchecked.\r\n   * @param blockIndex index of block to read\r\n   * @param indexInBlock  offset within the block\r\n   */\r\n  public getWithinBlock(blockIndex: number, indexWithinBlock: number): number {\r\n    return this._data[blockIndex * this._blockSize + indexWithinBlock];\r\n  }\r\n  /** clear the block count to zero, but maintain the allocated memory */\r\n  public clear() { this._inUse = 0; }\r\n  /** Return the capacity in blocks (not doubles) */\r\n  public blockCapacity() {\r\n    return this._data.length / this._blockSize;\r\n  }\r\n  /** ensure capacity (in blocks, not doubles) */\r\n  public ensureBlockCapacity(blockCapacity: number, applyGrowthFactor: boolean = true) {\r\n    if (blockCapacity > this.blockCapacity()) {\r\n      if (applyGrowthFactor)\r\n        blockCapacity *= this._growthFactor;\r\n      const prevData = this._data;\r\n      this._data = new Float64Array(blockCapacity * this._blockSize);\r\n      this.copyData(prevData, this._inUse);\r\n      }\r\n  }\r\n  /** Add a new block of data.\r\n   * * If newData has fewer than numPerBlock entries, the remaining part of the new block is zeros.\r\n   * * If newData has more entries, only the first numPerBlock are taken.\r\n   */\r\n  public addBlock(newData: number[]) {\r\n    const k0 = this.newBlockIndex();\r\n    let numValue = newData.length;\r\n    if (numValue > this._blockSize)\r\n      numValue = this._blockSize;\r\n    for (let i = 0; i < numValue; i++)\r\n      this._data[k0 + i] = newData[i];\r\n  }\r\n  /**\r\n   * Return the starting index of a block of (zero-initialized) doubles at the end.\r\n   *\r\n   * * this.data is reallocated if needed to include the new block.\r\n   * * The inUse count is incremented to include the new block.\r\n   * * The returned block is an index to the Float64Array (not a block index)\r\n   */\r\n  protected newBlockIndex(): number {\r\n    const index = this._blockSize * this._inUse;\r\n    if ((index + 1) > this._data.length)\r\n      this.ensureBlockCapacity(1 + this._inUse);\r\n    this._inUse++;\r\n    for (let i = index; i < index + this._blockSize; i++)\r\n      this._data[i] = 0.0;\r\n    return index;\r\n  }\r\n  /** reduce the block count by one. */\r\n  public popBlock() {\r\n    if (this._inUse > 0)\r\n      this._inUse--;\r\n  }\r\n  /** convert a block index to the simple index to the underlying Float64Array. */\r\n  protected blockIndexToDoubleIndex(blockIndex: number) { return this._blockSize * blockIndex; }\r\n  /** Access a single double at offset within a block, with index checking and return undefined if indexing is invalid. */\r\n  public checkedComponent(blockIndex: number, componentIndex: number): number | undefined {\r\n    if (blockIndex >= this._inUse || blockIndex < 0 || componentIndex < 0 || componentIndex >= this._blockSize)\r\n      return undefined;\r\n    return this._data[this._blockSize * blockIndex + componentIndex];\r\n  }\r\n  /** Access a single double at offset within a block.  This has no index checking. */\r\n  public component(blockIndex: number, componentIndex: number): number {\r\n    return this._data[this._blockSize * blockIndex + componentIndex];\r\n  }\r\n  /** compare two blocks in simple lexical order.\r\n   * @param data data array\r\n   * @param blockSize number of items to compare\r\n   * @param ia raw index (not block index) of first block\r\n   * @param ib raw index (not block index) of second block\r\n   */\r\n  public static compareLexicalBlock(data: Float64Array, blockSize: number, ia: number, ib: number): number {\r\n    let ax = 0;\r\n    let bx = 0;\r\n    for (let i = 0; i < blockSize; i++) {\r\n      ax = data[ia + i];\r\n      bx = data[ib + i];\r\n      if (ax > bx) return 1;\r\n      if (ax < bx) return -1;\r\n    }\r\n    return ia - ib; // so original order is maintained among duplicates !!!!\r\n  }\r\n  /** Return an array of block indices sorted per compareLexicalBlock function */\r\n  public sortIndicesLexical(compareBlocks: BlockComparisonFunction = GrowableBlockedArray.compareLexicalBlock): Uint32Array {\r\n    const n = this._inUse;\r\n    // let numCompare = 0;\r\n    const result = new Uint32Array(n);\r\n    const data = this._data;\r\n    const blockSize = this._blockSize;\r\n    for (let i = 0; i < n; i++)result[i] = i;\r\n    result.sort(\r\n      (blockIndexA: number, blockIndexB: number) => {\r\n        // numCompare++;\r\n        return compareBlocks(data, blockSize, blockIndexA * blockSize, blockIndexB * blockSize);\r\n      });\r\n    // console.log (n, numCompare);\r\n    return result;\r\n  }\r\n  /** Return the distance (hypotenuse=sqrt(summed squares)) between indicated blocks */\r\n  public distanceBetweenBlocks(blockIndexA: number, blockIndexB: number): number {\r\n    let dd = 0.0;\r\n    let iA = this.blockIndexToDoubleIndex(blockIndexA);\r\n    let iB = this.blockIndexToDoubleIndex(blockIndexB);\r\n    let a = 0;\r\n    const data = this._data;\r\n    for (let i = 0; i < this._blockSize; i++) {\r\n      a = data[iA++] - data[iB++];\r\n      dd += a * a;\r\n    }\r\n    return Math.sqrt(dd);\r\n  }\r\n\r\n  /** Return the distance (hypotenuse=sqrt(summed squares)) between block entries `iBegin <= i < iEnd` of indicated blocks */\r\n  public distanceBetweenSubBlocks(blockIndexA: number, blockIndexB: number, iBegin: number, iEnd: number): number {\r\n    let dd = 0.0;\r\n    const iA = this.blockIndexToDoubleIndex(blockIndexA);\r\n    const iB = this.blockIndexToDoubleIndex(blockIndexB);\r\n    let a = 0;\r\n    const data = this._data;\r\n    for (let i = iBegin; i < iEnd; i++) {\r\n      a = data[iA + i] - data[iB + i];\r\n      dd += a * a;\r\n    }\r\n    return Math.sqrt(dd);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"GrowableBlockedArray.js","sourceRoot":"","sources":["../../../src/geometry3d/GrowableBlockedArray.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAIH;;;;GAIG;AACH,MAAa,oBAAoB;IAc/B;;;;;;;OAOG;IACH,YAAmB,SAAiB,EAAE,gBAAwB,CAAC,EAAE,YAAqB;QACpF,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,SAAS,CAAC,CAAC;QACzD,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,UAAU,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,aAAa,GAAG,CAAC,SAAS,KAAK,YAAY,IAAI,YAAY,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACO,QAAQ,CAAC,MAA+B,EAAE,WAAoB,EAAE,UAAmB;QAC3F,qDAAqD;QACrD,IAAI,QAAQ,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAC/B,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,CAAC,SAAS,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC3F,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM;gBACzB,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1B,IAAI,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBACxC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;YACzC,IAAI,OAAO,GAAG,IAAI,CAAC,WAAW,KAAK,CAAC;gBAClC,OAAO,IAAI,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC;SACzC;QACD,IAAI,OAAO,IAAI,CAAC;YACd,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,KAAK,MAAM,CAAC,MAAM;YAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;aAC9B,IAAI,MAAM,YAAY,YAAY;YACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;;YAEtD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,OAAO,EAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAC,CAAC;IAClF,CAAC;IAED;;;OAGG;IACI,KAAK;QACV,MAAM,SAAS,GAAG,IAAI,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QACjG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/C,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC;QAClC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,yDAAyD;IACzD,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACnD,yDAAyD;IACzD,IAAW,SAAS,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACtD,gDAAgD;IAChD,IAAW,WAAW,KAAa,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC5D;;;;OAIG;IACI,cAAc,CAAC,UAAkB,EAAE,gBAAwB;QAChE,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,gBAAgB,CAAC,CAAC;IACrE,CAAC;IACD,uEAAuE;IAChE,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACnC,kDAAkD;IAC3C,aAAa;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC;IAC7C,CAAC;IACD,+CAA+C;IACxC,mBAAmB,CAAC,aAAqB,EAAE,oBAA6B,IAAI;QACjF,IAAI,aAAa,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE;YACxC,IAAI,iBAAiB;gBACnB,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC;YACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;YAC/D,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;SACpC;IACL,CAAC;IACD;;;OAGG;IACI,QAAQ,CAAC,OAAiB;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QAChC,IAAI,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,IAAI,QAAQ,GAAG,IAAI,CAAC,UAAU;YAC5B,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;YAC/B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;OAMG;IACO,aAAa;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;YACjC,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE;YAClD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qCAAqC;IAC9B,QAAQ;QACb,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;IACD,gFAAgF;IACtE,uBAAuB,CAAC,UAAkB,IAAI,OAAO,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC;IAC9F,wHAAwH;IACjH,gBAAgB,CAAC,UAAkB,EAAE,cAAsB;QAChE,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,IAAI,UAAU,GAAG,CAAC,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,IAAI,IAAI,CAAC,UAAU;YACxG,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,GAAG,cAAc,CAAC,CAAC;IACnE,CAAC;IACD,oFAAoF;IAC7E,SAAS,CAAC,UAAkB,EAAE,cAAsB;QACzD,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,GAAG,cAAc,CAAC,CAAC;IACnE,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,mBAAmB,CAAC,IAAkB,EAAE,SAAiB,EAAE,EAAU,EAAE,EAAU;QAC7F,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YAClC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAClB,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAClB,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,CAAC,CAAC;YACtB,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,CAAC,CAAC,CAAC;SACxB;QACD,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,wDAAwD;IAC1E,CAAC;IACD,+EAA+E;IACxE,kBAAkB,CAAC,gBAAyC,CAAC,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,oBAAoB,CAAC,mBAAmB,CAAC,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;QAC/J,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,sBAAsB;QACtB,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CACT,CAAC,WAAmB,EAAE,WAAmB,EAAE,EAAE;YAC3C,gBAAgB;YAChB,OAAO,aAAa,CAAC,IAAI,EAAE,SAAS,EAAE,WAAW,GAAG,SAAS,EAAE,WAAW,GAAG,SAAS,CAAC,CAAC;QAC1F,CAAC,CAAC,CAAC;QACL,+BAA+B;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,qFAAqF;IAC9E,qBAAqB,CAAC,WAAmB,EAAE,WAAmB;QACnE,IAAI,EAAE,GAAG,GAAG,CAAC;QACb,IAAI,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;YACxC,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5B,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;SACb;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;IAED,2HAA2H;IACpH,wBAAwB,CAAC,WAAmB,EAAE,WAAmB,EAAE,MAAc,EAAE,IAAY;QACpG,IAAI,EAAE,GAAG,GAAG,CAAC;QACb,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACrD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YAClC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAChC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;SACb;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;CACF;AAhND,oDAgNC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module ArraysAndInterfaces\r\n */\r\n\r\nimport { BlockComparisonFunction } from \"./GrowableFloat64Array\";\r\n\r\n/**\r\n * Array of contiguous doubles, indexed by block number and index within block.\r\n * * This is essentially a rectangular matrix (two dimensional array), with each block being a row of the matrix.\r\n * @public\r\n */\r\nexport class GrowableBlockedArray {\r\n  /** underlying contiguous, oversized buffer. */\r\n  protected _data: Float64Array;\r\n  /** Number of blocks (matrix rows) in use. */\r\n  protected _inUse: number;\r\n  /** number of numbers per block in the array.\r\n   * * If viewing the array as a two dimensional array, this is the row size.\r\n   */\r\n  protected _blockSize: number;  // positive integer !!!\r\n  /**\r\n   * multiplier used by ensureBlockCapacity to expand requested reallocation size\r\n   */\r\n  protected _growthFactor: number;\r\n\r\n  /**\r\n   * Construct an array whose contents are in blocked (row-major) order, possibly with extra capacity.\r\n   * * Total capacity is `this._data.length`\r\n   * * Actual in-use count is `this._inUse * this._blockSize`\r\n   * @param blockSize number of entries in each block, i.e., row size\r\n   * @param initialBlocks initial capacity in blocks (default 8)\r\n   * @param growthFactor used by ensureBlockCapacity to expand requested reallocation size (default 1.5)\r\n   */\r\n  public constructor(blockSize: number, initialBlocks: number = 8, growthFactor?: number) {\r\n    this._data = new Float64Array(initialBlocks * blockSize);\r\n    this._inUse = 0;\r\n    this._blockSize = blockSize > 0 ? blockSize : 1;\r\n    this._growthFactor = (undefined !== growthFactor && growthFactor >= 1.0) ? growthFactor : 1.5;\r\n  }\r\n\r\n  /** Copy data from source array. Does not reallocate or change active block count.\r\n   * @param source array to copy from\r\n   * @param sourceCount copy the first sourceCount blocks; all blocks if undefined\r\n   * @param destOffset copy to instance array starting at this block index; zero if undefined\r\n   * @return count and offset of blocks copied\r\n   */\r\n  protected copyData(source: Float64Array | number[], sourceCount?: number, destOffset?: number): {count: number, offset: number} {\r\n    // validate inputs and convert from blocks to entries\r\n    let myOffset = (undefined !== destOffset) ? destOffset * this.numPerBlock : 0;\r\n    if (myOffset < 0)\r\n      myOffset = 0;\r\n    if (myOffset >= this._data.length)\r\n      return {count: 0, offset: 0};\r\n    let myCount = (undefined !== sourceCount) ? sourceCount * this.numPerBlock : source.length;\r\n    if (myCount > 0) {\r\n      if (myCount > source.length)\r\n        myCount = source.length;\r\n      if (myOffset + myCount > this._data.length)\r\n        myCount = this._data.length - myOffset;\r\n      if (myCount % this.numPerBlock !== 0)\r\n        myCount -= myCount % this.numPerBlock;\r\n    }\r\n    if (myCount <= 0)\r\n      return {count: 0, offset: 0};\r\n    if (myCount === source.length)\r\n      this._data.set(source, myOffset);\r\n    else if (source instanceof Float64Array)\r\n      this._data.set(source.subarray(0, myCount), myOffset);\r\n    else\r\n      this._data.set(source.slice(0, myCount), myOffset);\r\n    return {count: myCount / this.numPerBlock, offset: myOffset / this.numPerBlock};\r\n  }\r\n\r\n  /**\r\n   * Make a copy of the (active) blocks in this array.\r\n   * (The clone does NOT get excess capacity)\r\n   */\r\n  public clone(): GrowableBlockedArray {\r\n    const newBlocks = new GrowableBlockedArray(this.numPerBlock, this.numBlocks, this._growthFactor);\r\n    newBlocks.copyData(this._data, this.numBlocks);\r\n    newBlocks._inUse = this.numBlocks;\r\n    return newBlocks;\r\n  }\r\n\r\n  /** computed property: length (in blocks, not doubles) */\r\n  public get length(): number { return this._inUse; }\r\n  /** computed property: length (in blocks, not doubles) */\r\n  public get numBlocks(): number { return this._inUse; }\r\n  /** property: number of data values per block */\r\n  public get numPerBlock(): number { return this._blockSize; }\r\n  /**\r\n   * Return a single value indexed within a block. Indices are unchecked.\r\n   * @param blockIndex index of block to read\r\n   * @param indexInBlock  offset within the block\r\n   */\r\n  public getWithinBlock(blockIndex: number, indexWithinBlock: number): number {\r\n    return this._data[blockIndex * this._blockSize + indexWithinBlock];\r\n  }\r\n  /** clear the block count to zero, but maintain the allocated memory */\r\n  public clear() { this._inUse = 0; }\r\n  /** Return the capacity in blocks (not doubles) */\r\n  public blockCapacity() {\r\n    return this._data.length / this._blockSize;\r\n  }\r\n  /** ensure capacity (in blocks, not doubles) */\r\n  public ensureBlockCapacity(blockCapacity: number, applyGrowthFactor: boolean = true) {\r\n    if (blockCapacity > this.blockCapacity()) {\r\n      if (applyGrowthFactor)\r\n        blockCapacity *= this._growthFactor;\r\n      const prevData = this._data;\r\n      this._data = new Float64Array(blockCapacity * this._blockSize);\r\n      this.copyData(prevData, this._inUse);\r\n      }\r\n  }\r\n  /** Add a new block of data.\r\n   * * If newData has fewer than numPerBlock entries, the remaining part of the new block is zeros.\r\n   * * If newData has more entries, only the first numPerBlock are taken.\r\n   */\r\n  public addBlock(newData: number[]) {\r\n    const k0 = this.newBlockIndex();\r\n    let numValue = newData.length;\r\n    if (numValue > this._blockSize)\r\n      numValue = this._blockSize;\r\n    for (let i = 0; i < numValue; i++)\r\n      this._data[k0 + i] = newData[i];\r\n  }\r\n  /**\r\n   * Return the starting index of a block of (zero-initialized) doubles at the end.\r\n   *\r\n   * * this.data is reallocated if needed to include the new block.\r\n   * * The inUse count is incremented to include the new block.\r\n   * * The returned block is an index to the Float64Array (not a block index)\r\n   */\r\n  protected newBlockIndex(): number {\r\n    const index = this._blockSize * this._inUse;\r\n    if ((index + 1) > this._data.length)\r\n      this.ensureBlockCapacity(1 + this._inUse);\r\n    this._inUse++;\r\n    for (let i = index; i < index + this._blockSize; i++)\r\n      this._data[i] = 0.0;\r\n    return index;\r\n  }\r\n  /** reduce the block count by one. */\r\n  public popBlock() {\r\n    if (this._inUse > 0)\r\n      this._inUse--;\r\n  }\r\n  /** convert a block index to the simple index to the underlying Float64Array. */\r\n  protected blockIndexToDoubleIndex(blockIndex: number) { return this._blockSize * blockIndex; }\r\n  /** Access a single double at offset within a block, with index checking and return undefined if indexing is invalid. */\r\n  public checkedComponent(blockIndex: number, componentIndex: number): number | undefined {\r\n    if (blockIndex >= this._inUse || blockIndex < 0 || componentIndex < 0 || componentIndex >= this._blockSize)\r\n      return undefined;\r\n    return this._data[this._blockSize * blockIndex + componentIndex];\r\n  }\r\n  /** Access a single double at offset within a block.  This has no index checking. */\r\n  public component(blockIndex: number, componentIndex: number): number {\r\n    return this._data[this._blockSize * blockIndex + componentIndex];\r\n  }\r\n  /** compare two blocks in simple lexical order.\r\n   * @param data data array\r\n   * @param blockSize number of items to compare\r\n   * @param ia raw index (not block index) of first block\r\n   * @param ib raw index (not block index) of second block\r\n   */\r\n  public static compareLexicalBlock(data: Float64Array, blockSize: number, ia: number, ib: number): number {\r\n    let ax = 0;\r\n    let bx = 0;\r\n    for (let i = 0; i < blockSize; i++) {\r\n      ax = data[ia + i];\r\n      bx = data[ib + i];\r\n      if (ax > bx) return 1;\r\n      if (ax < bx) return -1;\r\n    }\r\n    return ia - ib; // so original order is maintained among duplicates !!!!\r\n  }\r\n  /** Return an array of block indices sorted per compareLexicalBlock function */\r\n  public sortIndicesLexical(compareBlocks: BlockComparisonFunction = (dataArray, size, iA, iB) => GrowableBlockedArray.compareLexicalBlock(dataArray, size, iA, iB)): Uint32Array {\r\n    const n = this._inUse;\r\n    // let numCompare = 0;\r\n    const result = new Uint32Array(n);\r\n    const data = this._data;\r\n    const blockSize = this._blockSize;\r\n    for (let i = 0; i < n; i++)result[i] = i;\r\n    result.sort(\r\n      (blockIndexA: number, blockIndexB: number) => {\r\n        // numCompare++;\r\n        return compareBlocks(data, blockSize, blockIndexA * blockSize, blockIndexB * blockSize);\r\n      });\r\n    // console.log (n, numCompare);\r\n    return result;\r\n  }\r\n  /** Return the distance (hypotenuse=sqrt(summed squares)) between indicated blocks */\r\n  public distanceBetweenBlocks(blockIndexA: number, blockIndexB: number): number {\r\n    let dd = 0.0;\r\n    let iA = this.blockIndexToDoubleIndex(blockIndexA);\r\n    let iB = this.blockIndexToDoubleIndex(blockIndexB);\r\n    let a = 0;\r\n    const data = this._data;\r\n    for (let i = 0; i < this._blockSize; i++) {\r\n      a = data[iA++] - data[iB++];\r\n      dd += a * a;\r\n    }\r\n    return Math.sqrt(dd);\r\n  }\r\n\r\n  /** Return the distance (hypotenuse=sqrt(summed squares)) between block entries `iBegin <= i < iEnd` of indicated blocks */\r\n  public distanceBetweenSubBlocks(blockIndexA: number, blockIndexB: number, iBegin: number, iEnd: number): number {\r\n    let dd = 0.0;\r\n    const iA = this.blockIndexToDoubleIndex(blockIndexA);\r\n    const iB = this.blockIndexToDoubleIndex(blockIndexB);\r\n    let a = 0;\r\n    const data = this._data;\r\n    for (let i = iBegin; i < iEnd; i++) {\r\n      a = data[iA + i] - data[iB + i];\r\n      dd += a * a;\r\n    }\r\n    return Math.sqrt(dd);\r\n  }\r\n}\r\n"]}

package/lib/cjs/geometry3d/GrowableFloat64Array.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"GrowableFloat64Array.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/GrowableFloat64Array.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH;;;GAGG;AACH,MAAM,MAAM,4BAA4B,GAAG,oBAAoB,GAAG,SAAS,CAAC;AAC5E;;;GAGG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,MAAM,CAAC;AACxH;;;;;;;;GAQG;AACH,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,KAAK,CAAe;IAC5B,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,aAAa,CAAS;IAE9B;;;OAGG;gBACS,eAAe,GAAE,MAAU,EAAE,YAAY,CAAC,EAAE,MAAM;IAM9D;;;;;OAKG;IACH,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAC;IAwB/H;;;OAGG;WACW,MAAM,CAAC,QAAQ,EAAE,YAAY,GAAG,MAAM,EAAE,GAAG,oBAAoB;IAM7E;;;;;OAKG;WACW,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,MAAM;IAG7C;;;OAGG;IACI,KAAK,CAAC,sBAAsB,GAAE,OAAe,GAAG,oBAAoB;IAM3E;;;OAGG;IACH,IAAW,MAAM,WAEhB;IACD;;;;OAIG;IACI,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAIvD;;;;OAIG;IACI,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;IAGhC;;;;OAIG;IACI,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;IAMhC;;;OAGG;IACI,IAAI,CAAC,MAAM,EAAE,MAAM;IAK1B;;;OAGG;IACI,SAAS,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,EAAE;IAK9C,uEAAuE;IAChE,aAAa,CAAC,aAAa,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM;IAO7D,uFAAuF;IAChF,KAAK;IAGZ;;;OAGG;IACI,QAAQ;IAGf;;;;;OAKG;IACI,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,iBAAiB,GAAE,OAAc;IAS5E;;;;;OAKG;IACI,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU;IASrD;;;;OAIG;IACI,GAAG;IAOV,4CAA4C;IACrC,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAG9C,sDAAsD;IAC/C,KAAK;IAGZ,oDAAoD;IAC7C,IAAI;IAGX,2BAA2B;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAI5C;;;;OAIG;IACI,IAAI,CAAC,aAAa,GAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,MAAqC;IAapF;;;;;OAKG;IACI,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;IAa9C;;;OAGG;IACI,0BAA0B,CAAC,SAAS,GAAE,MAAY;CAmB1D"}
+{"version":3,"file":"GrowableFloat64Array.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/GrowableFloat64Array.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH;;;GAGG;AACH,MAAM,MAAM,4BAA4B,GAAG,oBAAoB,GAAG,SAAS,CAAC;AAC5E;;;GAGG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,MAAM,CAAC;AACxH;;;;;;;;GAQG;AACH,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,KAAK,CAAe;IAC5B,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,aAAa,CAAS;IAE9B;;;OAGG;gBACS,eAAe,GAAE,MAAU,EAAE,YAAY,CAAC,EAAE,MAAM;IAM9D;;;;;OAKG;IACH,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAC;IAwB/H;;;OAGG;WACW,MAAM,CAAC,QAAQ,EAAE,YAAY,GAAG,MAAM,EAAE,GAAG,oBAAoB;IAM7E;;;;;OAKG;WACW,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,MAAM;IAG7C;;;OAGG;IACI,KAAK,CAAC,sBAAsB,GAAE,OAAe,GAAG,oBAAoB;IAM3E;;;OAGG;IACH,IAAW,MAAM,WAEhB;IACD;;;;OAIG;IACI,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAIvD;;;;OAIG;IACI,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;IAGhC;;;;OAIG;IACI,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;IAMhC;;;OAGG;IACI,IAAI,CAAC,MAAM,EAAE,MAAM;IAK1B;;;OAGG;IACI,SAAS,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,EAAE;IAK9C,uEAAuE;IAChE,aAAa,CAAC,aAAa,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM;IAO7D,uFAAuF;IAChF,KAAK;IAGZ;;;OAGG;IACI,QAAQ;IAGf;;;;;OAKG;IACI,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,iBAAiB,GAAE,OAAc;IAS5E;;;;;OAKG;IACI,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU;IASrD;;;;OAIG;IACI,GAAG;IAOV,4CAA4C;IACrC,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAG9C,sDAAsD;IAC/C,KAAK;IAGZ,oDAAoD;IAC7C,IAAI;IAGX,2BAA2B;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAI5C;;;;OAIG;IACI,IAAI,CAAC,aAAa,GAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,MAAqD;IAapG;;;;;OAKG;IACI,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;IAa9C;;;OAGG;IACI,0BAA0B,CAAC,SAAS,GAAE,MAAY;CAmB1D"}

package/lib/cjs/geometry3d/GrowableFloat64Array.js

@@ -215,7 +215,7 @@ class GrowableFloat64Array {
      * * Uses insertion sort -- fine for small arrays (less than 30), slow for larger arrays
      * @param compareMethod comparison method
      */
-    sort(compareMethod = GrowableFloat64Array.compare) {
+    sort(compareMethod = (a, b) => GrowableFloat64Array.compare(a, b)) {
         for (let i = 0; i < this._inUse; i++) {
             for (let j = i + 1; j < this._inUse; j++) {
                 const tempI = this._data[i];

package/lib/cjs/geometry3d/GrowableFloat64Array.js.map

@@ -1 +1 @@
-{"version":3,"file":"GrowableFloat64Array.js","sourceRoot":"","sources":["../../../src/geometry3d/GrowableFloat64Array.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAgB/F;;;;;;;;GAQG;AACH,MAAa,oBAAoB;IAK/B;;;OAGG;IACH,YAAY,kBAA0B,CAAC,EAAE,YAAqB;QAC5D,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,eAAe,CAAC,CAAC;QAC/C,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,aAAa,GAAG,CAAC,SAAS,KAAK,YAAY,IAAI,YAAY,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACO,QAAQ,CAAC,MAA+B,EAAE,WAAoB,EAAE,UAAmB;QAC3F,IAAI,QAAQ,GAAG,UAAU,IAAI,CAAC,CAAC;QAC/B,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAC/B,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,WAAW,IAAI,MAAM,CAAC,MAAM,CAAC;QAC3C,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM;gBACzB,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1B,IAAI,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBACxC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;SAC1C;QACD,IAAI,OAAO,IAAI,CAAC;YACd,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,KAAK,MAAM,CAAC,MAAM;YAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;aAC9B,IAAI,MAAM,YAAY,YAAY;YACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;;YAEtD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,OAAO,EAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,QAAiC;QACpD,MAAM,GAAG,GAAG,IAAI,oBAAoB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtD,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACvB,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC7B,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,OAAO,CAAC,CAAM,EAAE,CAAM;QAClC,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,KAAK,CAAC,yBAAkC,KAAK;QAClD,MAAM,GAAG,GAAG,IAAI,oBAAoB,CAAC,sBAAsB,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7F,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;OAGG;IACH,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD;;;;OAIG;IACI,mBAAmB,CAAC,KAAa,EAAE,KAAa;QACrD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,CAAS,EAAE,CAAS;QAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD;;;;OAIG;IACI,IAAI,CAAC,CAAS,EAAE,CAAS;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC;IAED;;;OAGG;IACI,IAAI,CAAC,MAAc;QACxB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;QACjC,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,SAAS,CAAC,IAA6B;QAC5C,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;IAC7B,CAAC;IACD,uEAAuE;IAChE,aAAa,CAAC,aAAqB,EAAE,SAAiB;QAC3D,IAAI,aAAa,IAAI,CAAC,IAAI,aAAa,GAAG,IAAI,CAAC,MAAM,IAAI,SAAS,GAAG,CAAC,IAAI,aAAa,GAAG,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE;YAClH,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;YAC7C,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,GAAG,SAAS,CAAC,CAAC;YAC7E,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC;SAC1B;IACH,CAAC;IACD,uFAAuF;IAChF,KAAK;QACV,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,QAAQ;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IACD;;;;;OAKG;IACI,cAAc,CAAC,WAAmB,EAAE,oBAA6B,IAAI;QAC1E,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE;YACjC,IAAI,iBAAiB;gBACnB,WAAW,IAAI,IAAI,CAAC,aAAa,CAAC;YACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,CAAC;YAC3C,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;SACtC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,SAAiB,EAAE,WAAmB,CAAC;QACnD,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM;YAC3C,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;aACrB,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE;YAChC,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACvC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;SACzB;IACH,CAAC;IACD;;;;OAIG;IACI,GAAG;QACR,gGAAgG;QAChG,0GAA0G;QAC1G,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;YACnB,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;IACH,CAAC;IACD,4CAA4C;IACrC,gBAAgB,CAAC,KAAa;QACnC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACD,sDAAsD;IAC/C,KAAK;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,oDAAoD;IAC7C,IAAI;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC;IACD,2BAA2B;IACpB,QAAQ,CAAC,KAAa,EAAE,KAAa;QAC1C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,gBAA4C,oBAAoB,CAAC,OAAO;QAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE;oBACnC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;oBACtB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;iBACvB;aACF;SACF;IACH,CAAC;IAED;;;;;OAKG;IACI,kBAAkB,CAAC,CAAS,EAAE,CAAS;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;gBAClB,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC;SACzB;QACD,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACI,0BAA0B,CAAC,YAAoB,GAAG;QACvD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC;YACT,OAAO;QAET,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE;gBAC/B,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;gBACxB,CAAC,GAAG,CAAC,CAAC;aACP;SACF;QACD,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;CAEF;AAzQD,oDAyQC","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 ArraysAndInterfaces\r\n */\r\n\r\n/**\r\n * Type for a OptionalGrowableFloat64Array or undefined.\r\n * @public\r\n */\r\nexport type OptionalGrowableFloat64Array = GrowableFloat64Array | undefined;\r\n/**\r\n * Signature for a function which does lexical comparison of `blockSize` consecutive values as 2 starting indices.\r\n * @public\r\n */\r\nexport type BlockComparisonFunction = (data: Float64Array, blockSize: number, index0: number, index1: number) => number;\r\n/**\r\n * A `GrowableFloat64Array` is Float64Array accompanied by a count of how many of the array's entries are considered in use.\r\n * * In C++ terms, this is like an std::vector\r\n * * As entries are added to the array, the buffer is reallocated as needed to accommodate.\r\n * * The reallocations leave unused space to accept further additional entries without reallocation.\r\n * * The `length` property returns the number of entries in use.\r\n * * the `capacity` property returns the (usually larger) length of the (over-allocated) Float64Array.\r\n * @public\r\n */\r\nexport class GrowableFloat64Array {\r\n  private _data: Float64Array;\r\n  private _inUse: number;\r\n  private _growthFactor: number;\r\n\r\n  /** Construct a GrowableFloat64Array.\r\n   * @param initialCapacity initial capacity (default 8)\r\n   * @param growthFactor used by ensureCapacity to expand requested reallocation size (default 1.5)\r\n   */\r\n  constructor(initialCapacity: number = 8, growthFactor?: number) {\r\n    this._data = new Float64Array(initialCapacity);\r\n    this._inUse = 0;\r\n    this._growthFactor = (undefined !== growthFactor && growthFactor >= 1.0) ? growthFactor : 1.5;\r\n  }\r\n\r\n  /** Copy data from source array. Does not reallocate or change active entry count.\r\n   * @param source array to copy from\r\n   * @param sourceCount copy the first sourceCount entries; all entries if undefined\r\n   * @param destOffset copy to instance array starting at this index; zero if undefined\r\n   * @return count and offset of entries copied\r\n   */\r\n  protected copyData(source: Float64Array | number[], sourceCount?: number, destOffset?: number): {count: number, offset: number} {\r\n    let myOffset = destOffset ?? 0;\r\n    if (myOffset < 0)\r\n      myOffset = 0;\r\n    if (myOffset >= this._data.length)\r\n      return {count: 0, offset: 0};\r\n    let myCount = sourceCount ?? source.length;\r\n    if (myCount > 0) {\r\n      if (myCount > source.length)\r\n        myCount = source.length;\r\n      if (myOffset + myCount > this._data.length)\r\n        myCount = this._data.length - myOffset;\r\n    }\r\n    if (myCount <= 0)\r\n      return {count: 0, offset: 0};\r\n    if (myCount === source.length)\r\n      this._data.set(source, myOffset);\r\n    else if (source instanceof Float64Array)\r\n      this._data.set(source.subarray(0, myCount), myOffset);\r\n    else\r\n      this._data.set(source.slice(0, myCount), myOffset);\r\n    return {count: myCount, offset: myOffset};\r\n  }\r\n\r\n  /**\r\n   * Create a GrowableFloat64Array with given contents.\r\n   * @param contents data to copy into the array\r\n   */\r\n  public static create(contents: Float64Array | number[]): GrowableFloat64Array {\r\n    const out = new GrowableFloat64Array(contents.length);\r\n    out.copyData(contents);\r\n    out._inUse = contents.length;\r\n    return out;\r\n  }\r\n  /** sort-compatible comparison.\r\n   * * Returns `(a-b)` which is\r\n   *   * negative if `a<b`\r\n   *   * zero if `a === b` (with exact equality)\r\n   *   * positive if `a>b`\r\n   */\r\n  public static compare(a: any, b: any): number {\r\n    return a - b;\r\n  }\r\n  /** Return a new array with\r\n   * * All active entries copied from this instance\r\n   * * optionally trimmed capacity to the active length or replicate the capacity and unused space.\r\n   */\r\n  public clone(maintainExcessCapacity: boolean = false): GrowableFloat64Array {\r\n    const out = new GrowableFloat64Array(maintainExcessCapacity ? this.capacity() : this._inUse);\r\n    out.copyData(this._data, this._inUse);\r\n    out._inUse = this._inUse;\r\n    return out;\r\n  }\r\n  /**\r\n   * Returns the number of entries in use.\r\n   * * Note that this is typically smaller than the length of the length of the supporting `Float64Array`\r\n   */\r\n  public get length() {\r\n    return this._inUse;\r\n  }\r\n  /**\r\n   * Set the value at specified index.\r\n   * @param index index of entry to set\r\n   * @param value value to set\r\n   */\r\n  public setAtUncheckedIndex(index: number, value: number) {\r\n    this._data[index] = value;\r\n  }\r\n\r\n  /**\r\n   * Move the value at index i to index j.\r\n   * @param i source index\r\n   * @param j destination index.\r\n   */\r\n  public move(i: number, j: number) {\r\n    this._data[j] = this._data[i];\r\n  }\r\n  /**\r\n   * swap the values at indices i and j\r\n   * @param i first index\r\n   * @param j second index\r\n   */\r\n  public swap(i: number, j: number) {\r\n    const a = this._data[i];\r\n    this._data[i] = this._data[j];\r\n    this._data[j] = a;\r\n  }\r\n\r\n  /**\r\n   * append a single value to the array.\r\n   * @param toPush value to append to the active array.\r\n   */\r\n  public push(toPush: number) {\r\n    this.ensureCapacity(this._inUse + 1);\r\n    this._data[this._inUse] = toPush;\r\n    this._inUse++;\r\n  }\r\n  /**\r\n   * Push each value from an array.\r\n   * @param data array of values to push\r\n   */\r\n  public pushArray(data: Float64Array | number[]) {\r\n    this.ensureCapacity(this._inUse + data.length);\r\n    this.copyData(data, data.length, this._inUse);\r\n    this._inUse += data.length;\r\n  }\r\n  /** Push `numToCopy` consecutive values starting at `copyFromIndex`. */\r\n  public pushBlockCopy(copyFromIndex: number, numToCopy: number) {\r\n    if (copyFromIndex >= 0 && copyFromIndex < this._inUse && numToCopy > 0 && copyFromIndex + numToCopy <= this._inUse) {\r\n      this.ensureCapacity(this._inUse + numToCopy);\r\n      this._data.copyWithin(this._inUse, copyFromIndex, copyFromIndex + numToCopy);\r\n      this._inUse += numToCopy;\r\n    }\r\n  }\r\n  /** Clear the array to 0 length.  The underlying memory remains allocated for reuse. */\r\n  public clear() {\r\n    this._inUse = 0;\r\n  }\r\n  /**\r\n   * Returns the number of entries in the supporting Float64Array buffer.\r\n   * * This number can be larger than the `length` property.\r\n   */\r\n  public capacity() {\r\n    return this._data.length;\r\n  }\r\n  /**\r\n   * * If the capacity (Float64Array length) is less than or equal to the requested newCapacity, do nothing.\r\n   * * If the requested newCapacity is larger than the existing capacity, reallocate to larger capacity, and copy existing values.\r\n   * @param newCapacity size of new array\r\n   * @param applyGrowthFactor whether to apply the growth factor to newCapacity when reallocating\r\n   */\r\n  public ensureCapacity(newCapacity: number, applyGrowthFactor: boolean = true) {\r\n    if (newCapacity > this.capacity()) {\r\n      if (applyGrowthFactor)\r\n        newCapacity *= this._growthFactor;\r\n      const prevData = this._data;\r\n      this._data = new Float64Array(newCapacity);\r\n      this.copyData(prevData, this._inUse);\r\n    }\r\n  }\r\n  /**\r\n   * * If newLength is less than current length, just reset current length to newLength, effectively trimming active entries but preserving original capacity.\r\n   * * If newLength is greater than current length, reallocate to (exactly) newLength, copy existing entries, and pad with padValue up to newLength.\r\n   * @param newLength new data count\r\n   * @param padValue value to use for padding if the length increases.\r\n   */\r\n  public resize(newLength: number, padValue: number = 0) {\r\n    if (newLength >= 0 && newLength < this._inUse)\r\n      this._inUse = newLength;\r\n    else if (newLength > this._inUse) {\r\n      this.ensureCapacity(newLength, false);\r\n      this._data.fill(padValue, this._inUse);\r\n      this._inUse = newLength;\r\n    }\r\n  }\r\n  /**\r\n   * * Reduce the length by one.\r\n   * * Note that there is no method return value -- use `back` to get that value before `pop()`\r\n   * * (As with std::vector, separating the `pop` from the value access eliminates error testing from `pop` call)\r\n   */\r\n  public pop() {\r\n    // Could technically access outside of array, if filled and then reduced using pop (similar to C\r\n    // and accessing out of bounds), but with adjusted inUse counter, that data will eventually be overwritten\r\n    if (this._inUse > 0) {\r\n      this._inUse--;\r\n    }\r\n  }\r\n  /** Access by index, without bounds check */\r\n  public atUncheckedIndex(index: number): number {\r\n    return this._data[index];\r\n  }\r\n  /** Access the 0-index member, without bounds check */\r\n  public front() {\r\n    return this._data[0];\r\n  }\r\n  /** Access the final member, without bounds check */\r\n  public back() {\r\n    return this._data[this._inUse - 1];\r\n  }\r\n  /** set a value by index */\r\n  public reassign(index: number, value: number) {\r\n    this._data[index] = value;\r\n  }\r\n\r\n  /**\r\n   * * Sort the array entries.\r\n   * * Uses insertion sort -- fine for small arrays (less than 30), slow for larger arrays\r\n   * @param compareMethod comparison method\r\n   */\r\n  public sort(compareMethod: (a: any, b: any) => number = GrowableFloat64Array.compare) {\r\n    for (let i = 0; i < this._inUse; i++) {\r\n      for (let j = i + 1; j < this._inUse; j++) {\r\n        const tempI = this._data[i];\r\n        const tempJ = this._data[j];\r\n        if (compareMethod(tempI, tempJ) > 0) {\r\n          this._data[i] = tempJ;\r\n          this._data[j] = tempI;\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * * compress out values not within the [a,b] interval.\r\n   * * Note that if a is greater than b all values are rejected.\r\n   * @param a low value for accepted interval\r\n   * @param b high value for accepted interval\r\n   */\r\n  public restrictToInterval(a: number, b: number) {\r\n    const data = this._data;\r\n    const n = data.length;\r\n    let numAccept = 0;\r\n    let q = 0;\r\n    for (let i = 0; i < n; i++) {\r\n      q = data[i];\r\n      if (q >= a && q <= b)\r\n        data[numAccept++] = q;\r\n    }\r\n    this._inUse = numAccept;\r\n  }\r\n\r\n  /**\r\n   * * compress out multiple copies of values.\r\n   * * this is done in the current order of the array.\r\n   */\r\n  public compressAdjacentDuplicates(tolerance: number = 0.0) {\r\n    const data = this._data;\r\n    const n = this._inUse;\r\n    if (n === 0)\r\n      return;\r\n\r\n    let numAccepted = 1;\r\n    let a = data[0];\r\n    let b;\r\n    for (let i = 1; i < n; i++) {\r\n      b = data[i];\r\n      if (Math.abs(b - a) > tolerance) {\r\n        data[numAccepted++] = b;\r\n        a = b;\r\n      }\r\n    }\r\n    this._inUse = numAccepted;\r\n  }\r\n\r\n}\r\n"]}
+{"version":3,"file":"GrowableFloat64Array.js","sourceRoot":"","sources":["../../../src/geometry3d/GrowableFloat64Array.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAgB/F;;;;;;;;GAQG;AACH,MAAa,oBAAoB;IAK/B;;;OAGG;IACH,YAAY,kBAA0B,CAAC,EAAE,YAAqB;QAC5D,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,eAAe,CAAC,CAAC;QAC/C,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,aAAa,GAAG,CAAC,SAAS,KAAK,YAAY,IAAI,YAAY,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACO,QAAQ,CAAC,MAA+B,EAAE,WAAoB,EAAE,UAAmB;QAC3F,IAAI,QAAQ,GAAG,UAAU,IAAI,CAAC,CAAC;QAC/B,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAC/B,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,WAAW,IAAI,MAAM,CAAC,MAAM,CAAC;QAC3C,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM;gBACzB,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1B,IAAI,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBACxC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;SAC1C;QACD,IAAI,OAAO,IAAI,CAAC;YACd,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,KAAK,MAAM,CAAC,MAAM;YAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;aAC9B,IAAI,MAAM,YAAY,YAAY;YACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;;YAEtD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,OAAO,EAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,QAAiC;QACpD,MAAM,GAAG,GAAG,IAAI,oBAAoB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtD,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACvB,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC7B,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,OAAO,CAAC,CAAM,EAAE,CAAM;QAClC,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,KAAK,CAAC,yBAAkC,KAAK;QAClD,MAAM,GAAG,GAAG,IAAI,oBAAoB,CAAC,sBAAsB,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7F,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;OAGG;IACH,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD;;;;OAIG;IACI,mBAAmB,CAAC,KAAa,EAAE,KAAa;QACrD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,CAAS,EAAE,CAAS;QAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD;;;;OAIG;IACI,IAAI,CAAC,CAAS,EAAE,CAAS;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC;IAED;;;OAGG;IACI,IAAI,CAAC,MAAc;QACxB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;QACjC,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,SAAS,CAAC,IAA6B;QAC5C,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;IAC7B,CAAC;IACD,uEAAuE;IAChE,aAAa,CAAC,aAAqB,EAAE,SAAiB;QAC3D,IAAI,aAAa,IAAI,CAAC,IAAI,aAAa,GAAG,IAAI,CAAC,MAAM,IAAI,SAAS,GAAG,CAAC,IAAI,aAAa,GAAG,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE;YAClH,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;YAC7C,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,GAAG,SAAS,CAAC,CAAC;YAC7E,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC;SAC1B;IACH,CAAC;IACD,uFAAuF;IAChF,KAAK;QACV,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,QAAQ;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IACD;;;;;OAKG;IACI,cAAc,CAAC,WAAmB,EAAE,oBAA6B,IAAI;QAC1E,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE;YACjC,IAAI,iBAAiB;gBACnB,WAAW,IAAI,IAAI,CAAC,aAAa,CAAC;YACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,CAAC;YAC3C,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;SACtC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,SAAiB,EAAE,WAAmB,CAAC;QACnD,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM;YAC3C,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;aACrB,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE;YAChC,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACvC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;SACzB;IACH,CAAC;IACD;;;;OAIG;IACI,GAAG;QACR,gGAAgG;QAChG,0GAA0G;QAC1G,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;YACnB,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;IACH,CAAC;IACD,4CAA4C;IACrC,gBAAgB,CAAC,KAAa;QACnC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACD,sDAAsD;IAC/C,KAAK;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,oDAAoD;IAC7C,IAAI;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC;IACD,2BAA2B;IACpB,QAAQ,CAAC,KAAa,EAAE,KAAa;QAC1C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,gBAA4C,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;QAClG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE;oBACnC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;oBACtB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;iBACvB;aACF;SACF;IACH,CAAC;IAED;;;;;OAKG;IACI,kBAAkB,CAAC,CAAS,EAAE,CAAS;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;gBAClB,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC;SACzB;QACD,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACI,0BAA0B,CAAC,YAAoB,GAAG;QACvD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC;YACT,OAAO;QAET,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE;gBAC/B,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;gBACxB,CAAC,GAAG,CAAC,CAAC;aACP;SACF;QACD,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;CAEF;AAzQD,oDAyQC","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 ArraysAndInterfaces\r\n */\r\n\r\n/**\r\n * Type for a OptionalGrowableFloat64Array or undefined.\r\n * @public\r\n */\r\nexport type OptionalGrowableFloat64Array = GrowableFloat64Array | undefined;\r\n/**\r\n * Signature for a function which does lexical comparison of `blockSize` consecutive values as 2 starting indices.\r\n * @public\r\n */\r\nexport type BlockComparisonFunction = (data: Float64Array, blockSize: number, index0: number, index1: number) => number;\r\n/**\r\n * A `GrowableFloat64Array` is Float64Array accompanied by a count of how many of the array's entries are considered in use.\r\n * * In C++ terms, this is like an std::vector\r\n * * As entries are added to the array, the buffer is reallocated as needed to accommodate.\r\n * * The reallocations leave unused space to accept further additional entries without reallocation.\r\n * * The `length` property returns the number of entries in use.\r\n * * the `capacity` property returns the (usually larger) length of the (over-allocated) Float64Array.\r\n * @public\r\n */\r\nexport class GrowableFloat64Array {\r\n  private _data: Float64Array;\r\n  private _inUse: number;\r\n  private _growthFactor: number;\r\n\r\n  /** Construct a GrowableFloat64Array.\r\n   * @param initialCapacity initial capacity (default 8)\r\n   * @param growthFactor used by ensureCapacity to expand requested reallocation size (default 1.5)\r\n   */\r\n  constructor(initialCapacity: number = 8, growthFactor?: number) {\r\n    this._data = new Float64Array(initialCapacity);\r\n    this._inUse = 0;\r\n    this._growthFactor = (undefined !== growthFactor && growthFactor >= 1.0) ? growthFactor : 1.5;\r\n  }\r\n\r\n  /** Copy data from source array. Does not reallocate or change active entry count.\r\n   * @param source array to copy from\r\n   * @param sourceCount copy the first sourceCount entries; all entries if undefined\r\n   * @param destOffset copy to instance array starting at this index; zero if undefined\r\n   * @return count and offset of entries copied\r\n   */\r\n  protected copyData(source: Float64Array | number[], sourceCount?: number, destOffset?: number): {count: number, offset: number} {\r\n    let myOffset = destOffset ?? 0;\r\n    if (myOffset < 0)\r\n      myOffset = 0;\r\n    if (myOffset >= this._data.length)\r\n      return {count: 0, offset: 0};\r\n    let myCount = sourceCount ?? source.length;\r\n    if (myCount > 0) {\r\n      if (myCount > source.length)\r\n        myCount = source.length;\r\n      if (myOffset + myCount > this._data.length)\r\n        myCount = this._data.length - myOffset;\r\n    }\r\n    if (myCount <= 0)\r\n      return {count: 0, offset: 0};\r\n    if (myCount === source.length)\r\n      this._data.set(source, myOffset);\r\n    else if (source instanceof Float64Array)\r\n      this._data.set(source.subarray(0, myCount), myOffset);\r\n    else\r\n      this._data.set(source.slice(0, myCount), myOffset);\r\n    return {count: myCount, offset: myOffset};\r\n  }\r\n\r\n  /**\r\n   * Create a GrowableFloat64Array with given contents.\r\n   * @param contents data to copy into the array\r\n   */\r\n  public static create(contents: Float64Array | number[]): GrowableFloat64Array {\r\n    const out = new GrowableFloat64Array(contents.length);\r\n    out.copyData(contents);\r\n    out._inUse = contents.length;\r\n    return out;\r\n  }\r\n  /** sort-compatible comparison.\r\n   * * Returns `(a-b)` which is\r\n   *   * negative if `a<b`\r\n   *   * zero if `a === b` (with exact equality)\r\n   *   * positive if `a>b`\r\n   */\r\n  public static compare(a: any, b: any): number {\r\n    return a - b;\r\n  }\r\n  /** Return a new array with\r\n   * * All active entries copied from this instance\r\n   * * optionally trimmed capacity to the active length or replicate the capacity and unused space.\r\n   */\r\n  public clone(maintainExcessCapacity: boolean = false): GrowableFloat64Array {\r\n    const out = new GrowableFloat64Array(maintainExcessCapacity ? this.capacity() : this._inUse);\r\n    out.copyData(this._data, this._inUse);\r\n    out._inUse = this._inUse;\r\n    return out;\r\n  }\r\n  /**\r\n   * Returns the number of entries in use.\r\n   * * Note that this is typically smaller than the length of the length of the supporting `Float64Array`\r\n   */\r\n  public get length() {\r\n    return this._inUse;\r\n  }\r\n  /**\r\n   * Set the value at specified index.\r\n   * @param index index of entry to set\r\n   * @param value value to set\r\n   */\r\n  public setAtUncheckedIndex(index: number, value: number) {\r\n    this._data[index] = value;\r\n  }\r\n\r\n  /**\r\n   * Move the value at index i to index j.\r\n   * @param i source index\r\n   * @param j destination index.\r\n   */\r\n  public move(i: number, j: number) {\r\n    this._data[j] = this._data[i];\r\n  }\r\n  /**\r\n   * swap the values at indices i and j\r\n   * @param i first index\r\n   * @param j second index\r\n   */\r\n  public swap(i: number, j: number) {\r\n    const a = this._data[i];\r\n    this._data[i] = this._data[j];\r\n    this._data[j] = a;\r\n  }\r\n\r\n  /**\r\n   * append a single value to the array.\r\n   * @param toPush value to append to the active array.\r\n   */\r\n  public push(toPush: number) {\r\n    this.ensureCapacity(this._inUse + 1);\r\n    this._data[this._inUse] = toPush;\r\n    this._inUse++;\r\n  }\r\n  /**\r\n   * Push each value from an array.\r\n   * @param data array of values to push\r\n   */\r\n  public pushArray(data: Float64Array | number[]) {\r\n    this.ensureCapacity(this._inUse + data.length);\r\n    this.copyData(data, data.length, this._inUse);\r\n    this._inUse += data.length;\r\n  }\r\n  /** Push `numToCopy` consecutive values starting at `copyFromIndex`. */\r\n  public pushBlockCopy(copyFromIndex: number, numToCopy: number) {\r\n    if (copyFromIndex >= 0 && copyFromIndex < this._inUse && numToCopy > 0 && copyFromIndex + numToCopy <= this._inUse) {\r\n      this.ensureCapacity(this._inUse + numToCopy);\r\n      this._data.copyWithin(this._inUse, copyFromIndex, copyFromIndex + numToCopy);\r\n      this._inUse += numToCopy;\r\n    }\r\n  }\r\n  /** Clear the array to 0 length.  The underlying memory remains allocated for reuse. */\r\n  public clear() {\r\n    this._inUse = 0;\r\n  }\r\n  /**\r\n   * Returns the number of entries in the supporting Float64Array buffer.\r\n   * * This number can be larger than the `length` property.\r\n   */\r\n  public capacity() {\r\n    return this._data.length;\r\n  }\r\n  /**\r\n   * * If the capacity (Float64Array length) is less than or equal to the requested newCapacity, do nothing.\r\n   * * If the requested newCapacity is larger than the existing capacity, reallocate to larger capacity, and copy existing values.\r\n   * @param newCapacity size of new array\r\n   * @param applyGrowthFactor whether to apply the growth factor to newCapacity when reallocating\r\n   */\r\n  public ensureCapacity(newCapacity: number, applyGrowthFactor: boolean = true) {\r\n    if (newCapacity > this.capacity()) {\r\n      if (applyGrowthFactor)\r\n        newCapacity *= this._growthFactor;\r\n      const prevData = this._data;\r\n      this._data = new Float64Array(newCapacity);\r\n      this.copyData(prevData, this._inUse);\r\n    }\r\n  }\r\n  /**\r\n   * * If newLength is less than current length, just reset current length to newLength, effectively trimming active entries but preserving original capacity.\r\n   * * If newLength is greater than current length, reallocate to (exactly) newLength, copy existing entries, and pad with padValue up to newLength.\r\n   * @param newLength new data count\r\n   * @param padValue value to use for padding if the length increases.\r\n   */\r\n  public resize(newLength: number, padValue: number = 0) {\r\n    if (newLength >= 0 && newLength < this._inUse)\r\n      this._inUse = newLength;\r\n    else if (newLength > this._inUse) {\r\n      this.ensureCapacity(newLength, false);\r\n      this._data.fill(padValue, this._inUse);\r\n      this._inUse = newLength;\r\n    }\r\n  }\r\n  /**\r\n   * * Reduce the length by one.\r\n   * * Note that there is no method return value -- use `back` to get that value before `pop()`\r\n   * * (As with std::vector, separating the `pop` from the value access eliminates error testing from `pop` call)\r\n   */\r\n  public pop() {\r\n    // Could technically access outside of array, if filled and then reduced using pop (similar to C\r\n    // and accessing out of bounds), but with adjusted inUse counter, that data will eventually be overwritten\r\n    if (this._inUse > 0) {\r\n      this._inUse--;\r\n    }\r\n  }\r\n  /** Access by index, without bounds check */\r\n  public atUncheckedIndex(index: number): number {\r\n    return this._data[index];\r\n  }\r\n  /** Access the 0-index member, without bounds check */\r\n  public front() {\r\n    return this._data[0];\r\n  }\r\n  /** Access the final member, without bounds check */\r\n  public back() {\r\n    return this._data[this._inUse - 1];\r\n  }\r\n  /** set a value by index */\r\n  public reassign(index: number, value: number) {\r\n    this._data[index] = value;\r\n  }\r\n\r\n  /**\r\n   * * Sort the array entries.\r\n   * * Uses insertion sort -- fine for small arrays (less than 30), slow for larger arrays\r\n   * @param compareMethod comparison method\r\n   */\r\n  public sort(compareMethod: (a: any, b: any) => number = (a, b) => GrowableFloat64Array.compare(a, b)) {\r\n    for (let i = 0; i < this._inUse; i++) {\r\n      for (let j = i + 1; j < this._inUse; j++) {\r\n        const tempI = this._data[i];\r\n        const tempJ = this._data[j];\r\n        if (compareMethod(tempI, tempJ) > 0) {\r\n          this._data[i] = tempJ;\r\n          this._data[j] = tempI;\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * * compress out values not within the [a,b] interval.\r\n   * * Note that if a is greater than b all values are rejected.\r\n   * @param a low value for accepted interval\r\n   * @param b high value for accepted interval\r\n   */\r\n  public restrictToInterval(a: number, b: number) {\r\n    const data = this._data;\r\n    const n = data.length;\r\n    let numAccept = 0;\r\n    let q = 0;\r\n    for (let i = 0; i < n; i++) {\r\n      q = data[i];\r\n      if (q >= a && q <= b)\r\n        data[numAccept++] = q;\r\n    }\r\n    this._inUse = numAccept;\r\n  }\r\n\r\n  /**\r\n   * * compress out multiple copies of values.\r\n   * * this is done in the current order of the array.\r\n   */\r\n  public compressAdjacentDuplicates(tolerance: number = 0.0) {\r\n    const data = this._data;\r\n    const n = this._inUse;\r\n    if (n === 0)\r\n      return;\r\n\r\n    let numAccepted = 1;\r\n    let a = data[0];\r\n    let b;\r\n    for (let i = 1; i < n; i++) {\r\n      b = data[i];\r\n      if (Math.abs(b - a) > tolerance) {\r\n        data[numAccepted++] = b;\r\n        a = b;\r\n      }\r\n    }\r\n    this._inUse = numAccepted;\r\n  }\r\n\r\n}\r\n"]}

package/lib/cjs/geometry3d/Matrix3d.d.ts

@@ -688,6 +688,24 @@ export declare class Matrix3d implements BeJSONFunctions {
      * * Visualization can be found at itwinjs.org/sandbox/SaeedTorabi/DirectionalScale
      */
     static createDirectionalScale(direction: Vector3d, scale: number, result?: Matrix3d): Matrix3d;
+    /**
+     * Create a matrix which sweeps a vector along `sweepVector` until it hits the plane through the origin with the given normal.
+     * * To sweep an arbitrary vector U0 along direction W to the vector U1 in the plane through the origin with normal N:
+     *   *   `U1 = U0 + W * alpha`
+     *   *   `U1 DOT N = (U0 + W * alpha) DOT N = 0`
+     *   *   `U0 DOT N = - alpha * W DOT N`
+     *   *   `alpha = - U0 DOT N / W DOT N`
+     * * Insert the alpha definition in U1:
+     *   *   `U1 = U0 -  W * N DOT U0 / W DOT N`
+     * * Write vector dot expression N DOT U0 as a matrix product (^T indicates transpose):
+     *   *   `U1 = U0 -  W * N^T * U0 / W DOT N`
+     * * Note W * N^T is an outer product, i.e. a 3x3 matrix. By associativity of matrix multiplication:
+     *   *   `U1 = (I - W * N^T / W DOT N) * U0`
+     * * and the matrix to do the sweep for any vector in place of U0 is `I - W * N^T / W DOT N`.
+     * @param sweepVector sweep direction
+     * @param planeNormal normal to the target plane
+     */
+    static createFlattenAlongVectorToPlane(sweepVector: Vector3d, planeNormal: Vector3d): Matrix3d | undefined;
     /**
     * Multiply `matrix * point`, treating the point as a column vector on the right.
     * ```