@dra2020/baseclient 1.0.17 → 1.0.20

package/dist/baseclient.js

@@ -1278,9 +1278,23 @@ var __importStar = (this && this.__importStar) || function (mod) {
     return result;
 };
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.geoIntersect = exports.geoIntersectOptions = exports.GeoMultiCollection = exports.geoMapEqual = exports.geoEqual = exports.geoTopoToCollection = exports.geoCollectionToTopo = exports.geoMapToCollection = exports.geoCollectionToMap = void 0;
+exports.geoIntersect = exports.geoIntersectOptions = exports.GeoMultiCollection = exports.geoMapEqual = exports.geoEqual = exports.geoTopoToCollection = exports.geoCollectionToTopo = exports.geoMapToCollection = exports.geoCollectionToMap = exports.geoEnsureID = void 0;
 const Util = __importStar(__webpack_require__(/*! ../util/all */ "./lib/util/all.ts"));
 const Poly = __importStar(__webpack_require__(/*! ../poly/all */ "./lib/poly/all.ts"));
+function geoEnsureID(col) {
+    let prop;
+    const props = ['id', 'GEOID', 'GEOID10', 'GEOID20', 'GEOID30'];
+    if (col && col.features && col.features.length > 0) {
+        let f = col.features[0];
+        if (f.properties.id !== undefined)
+            return;
+        props.forEach(p => { if (prop === undefined && f.properties[p] !== undefined)
+            prop = p; });
+        if (prop)
+            col.features.forEach(f => { f.properties.id = f.properties[prop]; });
+    }
+}
+exports.geoEnsureID = geoEnsureID;
 function geoCollectionToMap(col) {
     if (col == null)
         return null;
@@ -4573,6 +4587,7 @@ __exportStar(__webpack_require__(/*! ./polyround */ "./lib/poly/polyround.ts"),
 __exportStar(__webpack_require__(/*! ./topo */ "./lib/poly/topo.ts"), exports);
 __exportStar(__webpack_require__(/*! ./selfintersect */ "./lib/poly/selfintersect.ts"), exports);
 __exportStar(__webpack_require__(/*! ./shamos */ "./lib/poly/shamos.ts"), exports);
+__exportStar(__webpack_require__(/*! ./pointinpoly */ "./lib/poly/pointinpoly.ts"), exports);
 
 
 /***/ }),
@@ -5654,6 +5669,66 @@ export function minimumBoundingRectangle(poly: any): any
 */
 
 
+/***/ }),
+
+/***/ "./lib/poly/pointinpoly.ts":
+/*!*********************************!*\
+  !*** ./lib/poly/pointinpoly.ts ***!
+  \*********************************/
+/***/ (function(__unused_webpack_module, exports, __webpack_require__) {
+
+
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+    __setModuleDefault(result, mod);
+    return result;
+};
+Object.defineProperty(exports, "__esModule", ({ value: true }));
+exports.polyContainsPoint = void 0;
+const PP = __importStar(__webpack_require__(/*! ./polypack */ "./lib/poly/polypack.ts"));
+function polyContainsPoint(poly, x, y) {
+    let pp = PP.polyPack(poly);
+    if (pp == null)
+        return false;
+    let bFound = false;
+    let bInside = false;
+    PP.polyPackEachRing(pp, (b, iPoly, iRing, iOffset, nPoints) => {
+        if (bFound)
+            return;
+        let inside = false;
+        let iEnd = iOffset + (nPoints - 1) * 2;
+        for (let i = iOffset, j = iEnd; i < iEnd; j = i, i += 2) {
+            let xi = b[i], yi = b[i + 1];
+            let xj = b[j], yj = b[j + 1];
+            let intersect = ((yi > y) !== (yj > y))
+                && (x < (xj - xi) * (y - yi) / (yj - yi) + xi);
+            if (intersect)
+                inside = !inside;
+        }
+        if (inside) {
+            bFound = iRing > 0; // if inside a hole, don't need to process further
+            bInside = iRing == 0; // not inside if inside a hole
+        }
+    });
+    return bInside;
+}
+exports.polyContainsPoint = polyContainsPoint;
+
+
 /***/ }),
 
 /***/ "./lib/poly/poly.ts":
@@ -8751,21 +8826,31 @@ __exportStar(__webpack_require__(/*! ./bintrie */ "./lib/util/bintrie.ts"), expo
 /*!*****************************!*\
   !*** ./lib/util/bintrie.ts ***!
   \*****************************/
-/***/ ((__unused_webpack_module, exports) => {
+/***/ (function(__unused_webpack_module, exports, __webpack_require__) {
 
 
-//
-// Packed format Trie for mapping string to string
-//  Assumptions:
-//      1. Lots of duplicate prefix strings in keys (so branching in trie happens late).
-//      2. Lots of duplicate prefix strings in values.
-//      3. Lots of keys with duplicate prefix map to the same string value.
-//  Especially good for something like our blockmapping.json file since both the keys (blockIDs)
-//  and values (precinct IDs) have a ton of redundancy and ~250 avg keys (blockID) map to same
-//  precinctID.
-//  The packed structure is just read directly into memory and walked in packed format.
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+    __setModuleDefault(result, mod);
+    return result;
+};
 Object.defineProperty(exports, "__esModule", ({ value: true }));
 exports.BinTrieBuilder = exports.BinTrie = exports.u82s = exports.s2u8 = void 0;
+const U = __importStar(__webpack_require__(/*! ./util */ "./lib/util/util.ts"));
 /*
 -- For Node
 import * as u from 'util';
@@ -8977,9 +9062,11 @@ class BinTrie {
     }
 }
 exports.BinTrie = BinTrie;
+let DefaultOptions = { dedup: true };
 class BinTrieBuilder {
-    constructor(coder) {
+    constructor(coder, options) {
         this.coder = coder;
+        this.options = U.shallowAssignImmutable(DefaultOptions, options);
     }
     // Building
     nodeCount(node) {
@@ -9128,8 +9215,8 @@ class BinTrieBuilder {
             this.u8[k] = u8[j];
     }
     // Building
-    static fromMap(coder, o) {
-        let btb = new BinTrieBuilder(coder);
+    static fromMap(coder, o, options) {
+        let btb = new BinTrieBuilder(coder, options);
         btb.vtb = ValueTableBuilder.fromStrings(coder, Object.values(o));
         btb.vt = ValueTable.fromBuffer(coder, btb.vtb.ab, 0, btb.vtb.ab.byteLength);
         let keys = Object.keys(o);
@@ -9144,7 +9231,8 @@ class BinTrieBuilder {
             }
         });
         // dedup (collapse branches pointing to same value)
-        btb.dedup(btb.root);
+        if (btb.options.dedup)
+            btb.dedup(btb.root);
         // validate
         keys.forEach(k => {
             if (good && btb.getUnpacked(k) !== o[k]) {