m4-w-fast 1.0.11 → 1.0.12

package/dist/index.cjs

@@ -6517,6 +6517,163 @@ class readFileM4 {
         }
         return json;
     }
+    /**
+     * 获取挖孔等值面 他可以设置透明度
+     * @param breaks
+     */
+    getIsoBandsFastByMask(breaks) {
+        if (this.values.length === 0)
+            return { type: 'FeatureCollection', features: [] };
+        const localBreaks = (breaks && breaks.length) ? breaks : this.getBreaks();
+        if (!localBreaks.length)
+            return { type: 'FeatureCollection', features: [] };
+        const baseLng = this.minLng;
+        const baseLat = this.minLat;
+        const stepLng = this.gjLng;
+        const stepLat = this.gjLat;
+        // ring 有向面积（用于外环/内环判定）
+        const ringArea = (ring) => {
+            let a = 0;
+            for (let i = 0, n = ring.length; i < n; i++) {
+                const p1 = ring[i];
+                const p2 = ring[(i + 1) % n];
+                if (!p1 || !p2)
+                    continue;
+                a += p1[0] * p2[1] - p2[0] * p1[1];
+            }
+            return a / 2;
+        };
+        // 点在环内
+        const pointInRing = (pt, ring) => {
+            if (!pt)
+                return false;
+            const x = pt[0];
+            const y = pt[1];
+            let inside = false;
+            for (let i = 0, j = ring.length - 1; i < ring.length; j = i++) {
+                const xi = ring[i][0];
+                const yi = ring[i][1];
+                const xj = ring[j][0];
+                const yj = ring[j][1];
+                const intersect = ((yi > y) !== (yj > y)) && (x < (xj - xi) * (y - yi) / (yj - yi) + xi);
+                if (intersect)
+                    inside = !inside;
+            }
+            return inside;
+        };
+        // 栅格索引 -> 经纬度，且去重 + 闭合
+        const convertAndClean = (gridRing) => {
+            const out = [];
+            let prevX = null;
+            let prevY = null;
+            for (let k = 0; k < gridRing.length; k++) {
+                const pt = gridRing[k];
+                if (!pt)
+                    continue;
+                const x = pt[0];
+                const y = pt[1];
+                if (x == null || y == null || Number.isNaN(x) || Number.isNaN(y))
+                    continue;
+                const lng = baseLng + x * stepLng;
+                const lat = baseLat + y * stepLat;
+                if (prevX !== null && prevY !== null && prevX === lng && prevY === lat)
+                    continue;
+                out.push([lng, lat]);
+                prevX = lng;
+                prevY = lat;
+            }
+            if (!out.length)
+                return out;
+            const first = out[0];
+            const last = out[out.length - 1];
+            if (first[0] !== last[0] || first[1] !== last[1])
+                out.push([first[0], first[1]]);
+            return out;
+        };
+        const features = [];
+        const lastIndex = localBreaks.length - 1;
+        // 每层单独做二值 mask，天然互斥，无需布尔挖孔
+        for (let i = 0; i < localBreaks.length; i++) {
+            const lower = localBreaks[i];
+            const upper = (i < lastIndex) ? localBreaks[i + 1] : Infinity;
+            const mask = new Array(this.values.length);
+            let anyOne = false;
+            for (let k = 0; k < this.values.length; k++) {
+                const v = this.values[k];
+                const on = (v != null && v >= lower && v < upper) ? 1 : 0;
+                mask[k] = on;
+                if (on)
+                    anyOne = true;
+            }
+            if (!anyOne)
+                continue;
+            // 用 d3-contour 在二值场提取该层轮廓
+            const gen = contours().size([this.nx, this.ny]).thresholds([0.5]);
+            const allGeos = gen.contours ? gen.contours(mask) : gen(mask);
+            if (!allGeos || !allGeos.length)
+                continue;
+            for (const g of allGeos) {
+                const coordsGroups = g?.coordinates;
+                if (!coordsGroups)
+                    continue;
+                for (const polyOrRings of coordsGroups) {
+                    let rings = [];
+                    // 兼容 d3-contour 返回结构
+                    if (Array.isArray(polyOrRings) && polyOrRings.length > 0 && typeof polyOrRings[0][0] === 'number') {
+                        rings = [polyOrRings];
+                    }
+                    else if (Array.isArray(polyOrRings)) {
+                        rings = polyOrRings;
+                    }
+                    else {
+                        continue;
+                    }
+                    // 按面积从大到小，先外环后洞
+                    const ringsWithArea = rings
+                        .map(r => ({ ring: r, area: Math.abs(ringArea(r)) }))
+                        .sort((a, b) => b.area - a.area);
+                    const used = new Array(ringsWithArea.length).fill(false);
+                    for (let ri = 0; ri < ringsWithArea.length; ri++) {
+                        if (used[ri])
+                            continue;
+                        const outerGrid = ringsWithArea[ri].ring;
+                        used[ri] = true;
+                        const holesGrid = [];
+                        for (let hj = 0; hj < ringsWithArea.length; hj++) {
+                            if (used[hj])
+                                continue;
+                            const cand = ringsWithArea[hj].ring;
+                            const testPt = cand[0];
+                            if (testPt && pointInRing(testPt, outerGrid)) {
+                                holesGrid.push(cand);
+                                used[hj] = true;
+                            }
+                        }
+                        const outer = convertAndClean(outerGrid);
+                        if (outer.length < 4)
+                            continue;
+                        const holes = [];
+                        for (const h of holesGrid) {
+                            const hc = convertAndClean(h);
+                            if (hc.length >= 4)
+                                holes.push(hc);
+                        }
+                        features.push({
+                            type: 'Feature',
+                            properties: { z: lower },
+                            geometry: {
+                                type: 'Polygon',
+                                coordinates: [outer, ...holes]
+                            }
+                        });
+                    }
+                }
+            }
+        }
+        // 低->高，兼容你现有 getColorFast(level.indexOf(z))
+        features.sort((a, b) => Number(a.properties?.z ?? 0) - Number(b.properties?.z ?? 0));
+        return { type: 'FeatureCollection', features };
+    }
     // --------------------------------------------- 融合工具 ---------------------------------------------
     buildGridLineCanvas(options) {
         if (this.nx <= 0 || this.ny <= 0 || this.gjLng === 0 || this.gjLat === 0)

package/dist/index.js

@@ -1 +1 @@
-function a0_0x3e46(_0x13df8e,_0x52604b){var _0x4c06e7=a0_0x4c06();return a0_0x3e46=function(_0x3e46fc,_0x3d7a21){_0x3e46fc=_0x3e46fc-0x156;var _0x8395a2=_0x4c06e7[_0x3e46fc];return _0x8395a2;},a0_0x3e46(_0x13df8e,_0x52604b);}(function(_0x1d9e6d,_0x44b3e6){var _0x35a3ef=a0_0x3e46,_0x3db4db=_0x1d9e6d();while(!![]){try{var _0x1bb104=-parseInt(_0x35a3ef(0x15b))/0x1*(-parseInt(_0x35a3ef(0x15a))/0x2)+-parseInt(_0x35a3ef(0x15e))/0x3*(-parseInt(_0x35a3ef(0x159))/0x4)+-parseInt(_0x35a3ef(0x158))/0x5*(-parseInt(_0x35a3ef(0x15d))/0x6)+parseInt(_0x35a3ef(0x15c))/0x7*(-parseInt(_0x35a3ef(0x156))/0x8)+parseInt(_0x35a3ef(0x160))/0x9+parseInt(_0x35a3ef(0x15f))/0xa+-parseInt(_0x35a3ef(0x157))/0xb;if(_0x1bb104===_0x44b3e6)break;else _0x3db4db['push'](_0x3db4db['shift']());}catch(_0x185393){_0x3db4db['push'](_0x3db4db['shift']());}}}(a0_0x4c06,0x8410b));function a0_0x4c06(){var _0x1979b3=['371096aMazqL','146sOQIRg','2145CrDkUP','328587dwMxDc','36ODuafx','21HhnWoO','5826660oKIUcN','257013YADarG','160eZjTCx','6849733kUAJma','571030ZJFDPL'];a0_0x4c06=function(){return _0x1979b3;};return a0_0x4c06();}import a0_0x15f99a from'./readFile';export default a0_0x15f99a;
+function a0_0x117c(_0x1a92ae,_0x7eaf56){var _0x21f240=a0_0x21f2();return a0_0x117c=function(_0x117c50,_0x1069b1){_0x117c50=_0x117c50-0x12e;var _0x4d7d15=_0x21f240[_0x117c50];return _0x4d7d15;},a0_0x117c(_0x1a92ae,_0x7eaf56);}(function(_0x402a9d,_0x270621){var _0x5b1842=a0_0x117c,_0x950f09=_0x402a9d();while(!![]){try{var _0x3e15d4=parseInt(_0x5b1842(0x12e))/0x1+parseInt(_0x5b1842(0x12f))/0x2+-parseInt(_0x5b1842(0x134))/0x3+-parseInt(_0x5b1842(0x136))/0x4+parseInt(_0x5b1842(0x131))/0x5*(parseInt(_0x5b1842(0x133))/0x6)+parseInt(_0x5b1842(0x132))/0x7*(-parseInt(_0x5b1842(0x130))/0x8)+-parseInt(_0x5b1842(0x137))/0x9*(-parseInt(_0x5b1842(0x135))/0xa);if(_0x3e15d4===_0x270621)break;else _0x950f09['push'](_0x950f09['shift']());}catch(_0x1b6f39){_0x950f09['push'](_0x950f09['shift']());}}}(a0_0x21f2,0xb7c3f));import a0_0x2b5a1f from'./readFile';export default a0_0x2b5a1f;function a0_0x21f2(){var _0x466243=['406288GyEkQv','3411Mapibk','979834UWyApq','2448516zBACKg','38960mAzbLX','2533145GtbDYr','1673LAltqD','6Tmmbbh','4044558sEbDoJ','17300gDSMkf'];a0_0x21f2=function(){return _0x466243;};return a0_0x21f2();}

package/dist/index.mjs

@@ -6515,6 +6515,163 @@ class readFileM4 {
         }
         return json;
     }
+    /**
+     * 获取挖孔等值面 他可以设置透明度
+     * @param breaks
+     */
+    getIsoBandsFastByMask(breaks) {
+        if (this.values.length === 0)
+            return { type: 'FeatureCollection', features: [] };
+        const localBreaks = (breaks && breaks.length) ? breaks : this.getBreaks();
+        if (!localBreaks.length)
+            return { type: 'FeatureCollection', features: [] };
+        const baseLng = this.minLng;
+        const baseLat = this.minLat;
+        const stepLng = this.gjLng;
+        const stepLat = this.gjLat;
+        // ring 有向面积（用于外环/内环判定）
+        const ringArea = (ring) => {
+            let a = 0;
+            for (let i = 0, n = ring.length; i < n; i++) {
+                const p1 = ring[i];
+                const p2 = ring[(i + 1) % n];
+                if (!p1 || !p2)
+                    continue;
+                a += p1[0] * p2[1] - p2[0] * p1[1];
+            }
+            return a / 2;
+        };
+        // 点在环内
+        const pointInRing = (pt, ring) => {
+            if (!pt)
+                return false;
+            const x = pt[0];
+            const y = pt[1];
+            let inside = false;
+            for (let i = 0, j = ring.length - 1; i < ring.length; j = i++) {
+                const xi = ring[i][0];
+                const yi = ring[i][1];
+                const xj = ring[j][0];
+                const yj = ring[j][1];
+                const intersect = ((yi > y) !== (yj > y)) && (x < (xj - xi) * (y - yi) / (yj - yi) + xi);
+                if (intersect)
+                    inside = !inside;
+            }
+            return inside;
+        };
+        // 栅格索引 -> 经纬度，且去重 + 闭合
+        const convertAndClean = (gridRing) => {
+            const out = [];
+            let prevX = null;
+            let prevY = null;
+            for (let k = 0; k < gridRing.length; k++) {
+                const pt = gridRing[k];
+                if (!pt)
+                    continue;
+                const x = pt[0];
+                const y = pt[1];
+                if (x == null || y == null || Number.isNaN(x) || Number.isNaN(y))
+                    continue;
+                const lng = baseLng + x * stepLng;
+                const lat = baseLat + y * stepLat;
+                if (prevX !== null && prevY !== null && prevX === lng && prevY === lat)
+                    continue;
+                out.push([lng, lat]);
+                prevX = lng;
+                prevY = lat;
+            }
+            if (!out.length)
+                return out;
+            const first = out[0];
+            const last = out[out.length - 1];
+            if (first[0] !== last[0] || first[1] !== last[1])
+                out.push([first[0], first[1]]);
+            return out;
+        };
+        const features = [];
+        const lastIndex = localBreaks.length - 1;
+        // 每层单独做二值 mask，天然互斥，无需布尔挖孔
+        for (let i = 0; i < localBreaks.length; i++) {
+            const lower = localBreaks[i];
+            const upper = (i < lastIndex) ? localBreaks[i + 1] : Infinity;
+            const mask = new Array(this.values.length);
+            let anyOne = false;
+            for (let k = 0; k < this.values.length; k++) {
+                const v = this.values[k];
+                const on = (v != null && v >= lower && v < upper) ? 1 : 0;
+                mask[k] = on;
+                if (on)
+                    anyOne = true;
+            }
+            if (!anyOne)
+                continue;
+            // 用 d3-contour 在二值场提取该层轮廓
+            const gen = contours().size([this.nx, this.ny]).thresholds([0.5]);
+            const allGeos = gen.contours ? gen.contours(mask) : gen(mask);
+            if (!allGeos || !allGeos.length)
+                continue;
+            for (const g of allGeos) {
+                const coordsGroups = g?.coordinates;
+                if (!coordsGroups)
+                    continue;
+                for (const polyOrRings of coordsGroups) {
+                    let rings = [];
+                    // 兼容 d3-contour 返回结构
+                    if (Array.isArray(polyOrRings) && polyOrRings.length > 0 && typeof polyOrRings[0][0] === 'number') {
+                        rings = [polyOrRings];
+                    }
+                    else if (Array.isArray(polyOrRings)) {
+                        rings = polyOrRings;
+                    }
+                    else {
+                        continue;
+                    }
+                    // 按面积从大到小，先外环后洞
+                    const ringsWithArea = rings
+                        .map(r => ({ ring: r, area: Math.abs(ringArea(r)) }))
+                        .sort((a, b) => b.area - a.area);
+                    const used = new Array(ringsWithArea.length).fill(false);
+                    for (let ri = 0; ri < ringsWithArea.length; ri++) {
+                        if (used[ri])
+                            continue;
+                        const outerGrid = ringsWithArea[ri].ring;
+                        used[ri] = true;
+                        const holesGrid = [];
+                        for (let hj = 0; hj < ringsWithArea.length; hj++) {
+                            if (used[hj])
+                                continue;
+                            const cand = ringsWithArea[hj].ring;
+                            const testPt = cand[0];
+                            if (testPt && pointInRing(testPt, outerGrid)) {
+                                holesGrid.push(cand);
+                                used[hj] = true;
+                            }
+                        }
+                        const outer = convertAndClean(outerGrid);
+                        if (outer.length < 4)
+                            continue;
+                        const holes = [];
+                        for (const h of holesGrid) {
+                            const hc = convertAndClean(h);
+                            if (hc.length >= 4)
+                                holes.push(hc);
+                        }
+                        features.push({
+                            type: 'Feature',
+                            properties: { z: lower },
+                            geometry: {
+                                type: 'Polygon',
+                                coordinates: [outer, ...holes]
+                            }
+                        });
+                    }
+                }
+            }
+        }
+        // 低->高，兼容你现有 getColorFast(level.indexOf(z))
+        features.sort((a, b) => Number(a.properties?.z ?? 0) - Number(b.properties?.z ?? 0));
+        return { type: 'FeatureCollection', features };
+    }
     // --------------------------------------------- 融合工具 ---------------------------------------------
     buildGridLineCanvas(options) {
         if (this.nx <= 0 || this.ny <= 0 || this.gjLng === 0 || this.gjLat === 0)