@dra2020/dra-analytics 4.1.2 → 4.1.5

package/dist/dra-analytics.js

@@ -35,13 +35,23 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
 exports.Utils = exports.Types = exports.Splitting = exports.Rate = exports.Partisan = exports.Minority = exports.Graph = exports.Equal = exports.Compactness = void 0;
 const Compactness = __importStar(__webpack_require__(/*! ./compactness */ "./lib/all/compactness.ts"));
@@ -299,10 +309,28 @@ __exportStar(__webpack_require__(/*! ./kiwysi */ "./lib/compactness/kiwysi.ts"),
 // COMPACTNESS
 //
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.calcCompactness = exports.makeCompactnessScorecard = void 0;
+exports.excessivelyFragmented = excessivelyFragmented;
+exports.makeCompactnessScorecard = makeCompactnessScorecard;
+exports.calcCompactness = calcCompactness;
 const features_1 = __webpack_require__(/*! ./features */ "./lib/compactness/features.ts");
 const kiwysi_1 = __webpack_require__(/*! ./kiwysi */ "./lib/compactness/kiwysi.ts");
 const dra_ratings_1 = __webpack_require__(/*! ../rate/dra-ratings */ "./lib/rate/dra-ratings.ts");
+function excessivelyFragmented(shapes) {
+    const threshold = 20;
+    let fragments = 0;
+    for (let i = 0; i < shapes.features.length; i++) {
+        const f = shapes.features[i];
+        if (f.geometry.type == 'MultiPolygon') {
+            fragments += f.geometry.coordinates.length;
+        }
+    }
+    const avgFragmentation = fragments / shapes.features.length;
+    if (avgFragmentation > threshold) {
+        console.log(`Average fragmentation (${avgFragmentation}) exceeds threshold (${threshold}).`);
+        return true;
+    }
+    return false;
+}
 // Use this to get average Reock, Polsby-Popper, and KIWYSI compactness and by district for a set of shapes
 // This is used by DRA
 function makeCompactnessScorecard(shapes, bLog = false) {
@@ -312,11 +340,14 @@ function makeCompactnessScorecard(shapes, bLog = false) {
     let totReock = 0;
     let totPolsby = 0;
     let totKIWYSI = 0;
+    // 12-11-24: Skip featurization for KIWYSI compactness, when the districts in a map are too fragmented on average
+    const bKIWYSIFeatures = excessivelyFragmented(shapes) ? false : true;
     // For returning compactness by district to DRA
     // Note, these use the Cartesian (flat earth) measurements
     let byDistrict = [];
     for (let i = 0; i < shapes.features.length; i++) {
-        const features = (0, features_1.featureizePoly)(shapes.features[i], options);
+        const f = shapes.features[i];
+        const features = (0, features_1.featureizePoly)(f, options, { bKIWYSIFeatures: bKIWYSIFeatures });
         const reockFlat = features.reockFlat;
         const polsbyFlat = features.polsbyFlat;
         // Note: In order to compute the by-district compactness that DRA needs,
@@ -324,7 +355,7 @@ function makeCompactnessScorecard(shapes, bLog = false) {
         // like the overall compactness rating.
         const normalizedReock = (0, dra_ratings_1.rateReock)(reockFlat);
         const normalizedPolsby = (0, dra_ratings_1.ratePolsby)(polsbyFlat);
-        let kiwysiRank = (0, kiwysi_1.scoreFeatureSet)(features, pca);
+        let kiwysiRank = bKIWYSIFeatures ? (0, kiwysi_1.scoreFeatureSet)(features, pca) : 100;
         // Constrain values to the range [1–100]
         kiwysiRank = Math.min(Math.max(kiwysiRank, 1), 100);
         // Raw KIWYSI scores ("ranks") are 1–100 where smaller is better
@@ -344,18 +375,17 @@ function makeCompactnessScorecard(shapes, bLog = false) {
     }
     const avgReock = totReock / shapes.features.length;
     const avgPolsby = totPolsby / shapes.features.length;
-    const avgKWIWYSI = Math.round(totKIWYSI / shapes.features.length);
+    const avgKIWYSI = Math.round(totKIWYSI / shapes.features.length);
     const s = {
         avgReock: avgReock,
         avgPolsby: avgPolsby,
-        avgKWIWYSI: avgKWIWYSI,
-        byDistrict: byDistrict,
+        avgKIWYSI: avgKIWYSI,
+        byDistrict: byDistrict, // Legacy format
         details: {}, // None
         // score?: 
     };
     return s;
 }
-exports.makeCompactnessScorecard = makeCompactnessScorecard;
 // CLI
 // Calculate Reock & Polsby–Popper for a shape using the typical Cartesian (flat earth) calculations.
 // Also calculate the "know it when you see it" rank (smaller is better) that models human perceptions of compactness.
@@ -387,16 +417,15 @@ function calcCompactness(shapes) {
     }
     const avgReock = totReock / shapes.features.length;
     const avgPolsby = totPolsby / shapes.features.length;
-    const avgKWIWYSI = Math.round(totKIWYSI / shapes.features.length);
+    const avgKIWYSI = Math.round(totKIWYSI / shapes.features.length);
     const out = {
         avgReock: avgReock,
         avgPolsby: avgPolsby,
-        avgKWIWYSI: avgKWIWYSI,
+        avgKIWYSI: avgKIWYSI,
         byDistrict: byDistrict
     };
     return out;
 }
-exports.calcCompactness = calcCompactness;
 
 
 /***/ }),
@@ -414,7 +443,14 @@ exports.calcCompactness = calcCompactness;
 // Measures of compactness compare district shapes to various ideally compact
 // benchmarks, such as circles. All else equal, more compact districts are better.
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.featureizePoly = exports.calcSchwartzberg = exports.calcConvexHullFeature = exports.calcPolsbyPopper = exports.calcBoundingBox = exports.calcReock = exports.calcYSymmetry = exports.calcXSymmetry = void 0;
+exports.calcXSymmetry = calcXSymmetry;
+exports.calcYSymmetry = calcYSymmetry;
+exports.calcReock = calcReock;
+exports.calcBoundingBox = calcBoundingBox;
+exports.calcPolsbyPopper = calcPolsbyPopper;
+exports.calcConvexHullFeature = calcConvexHullFeature;
+exports.calcSchwartzberg = calcSchwartzberg;
+exports.featureizePoly = featureizePoly;
 const baseclient_1 = __webpack_require__(/*! @dra2020/baseclient */ "@dra2020/baseclient");
 // FEATURES (FOR AN ML MODEL)
 //
@@ -435,7 +471,6 @@ function calcXSymmetry(poly) {
     const sym_x = calcSymmetry(poly, reflectOverX(cx));
     return sym_x;
 }
-exports.calcXSymmetry = calcXSymmetry;
 // FEATURE 2: Y-SYMMETRY - The area of a district overlapping with its
 // reflection around a vertical line going through the centroid, divided by
 // the area of the district. Values range [1–2].
@@ -449,7 +484,6 @@ function calcYSymmetry(poly) {
     const sym_y = calcSymmetry(poly, reflectOverY(cy));
     return sym_y;
 }
-exports.calcYSymmetry = calcYSymmetry;
 function calcSymmetry(poly, transformFn) {
     const polyarrPoints = poly.geometry.coordinates;
     let transformedPoly = baseclient_1.Poly.polyTransform(poly, transformFn);
@@ -512,7 +546,6 @@ function reflectOverY(y0) {
 function calcReock(area, diameter) {
     return (4 * area) / (Math.PI * Math.pow(diameter, 2));
 }
-exports.calcReock = calcReock;
 // FEATURE 4: "BOUNDING-BOX" is shorthand here for the ratio of the area of the
 // district to the area of the minimum bounding box of the district. It's not a
 // simple bounding box.
@@ -522,7 +555,6 @@ function calcBoundingBox(poly) {
     const bboxArea = baseclient_1.Poly.polyArea(MBR);
     return polyArea / bboxArea;
 }
-exports.calcBoundingBox = calcBoundingBox;
 // FEATURE 5: POLSBYPOPPER - Polsby-Popper is the primary measure of the indendentation
 // of district shapes, calculated as the “the ratio of the area of the district to 
 // the area of a circle whose circumference is equal to the perimeter of the district.”
@@ -541,7 +573,6 @@ exports.calcBoundingBox = calcBoundingBox;
 function calcPolsbyPopper(area, perimeter) {
     return (4 * Math.PI) * (area / Math.pow(perimeter, 2));
 }
-exports.calcPolsbyPopper = calcPolsbyPopper;
 // FEATURE 6: Hull(D) - Convex Hull is a secondary measure of the dispersion of
 // district shapes, calculated as “the ratio of the district area to the area of
 // the minimum convex bounding polygon(also known as a convex hull) enclosing the
@@ -555,7 +586,6 @@ exports.calcPolsbyPopper = calcPolsbyPopper;
 function calcConvexHullFeature(area, chArea) {
     return area / chArea;
 }
-exports.calcConvexHullFeature = calcConvexHullFeature;
 // FEATURE 7: SCHWARTZBERG - Schwartzberg is a secondary measure of the degree of
 // indentation of district shapes, calculated as “the ratio of the perimeter of the
 // district to the circumference of a circle whose area is equal to the area of the
@@ -585,9 +615,8 @@ exports.calcConvexHullFeature = calcConvexHullFeature;
 function calcSchwartzberg(area, perimeter) {
     return perimeter / ((2 * Math.PI) * Math.sqrt(area / Math.PI));
 }
-exports.calcSchwartzberg = calcSchwartzberg;
 // CALCULATE THE 7 COMPACTNESS "FEATURES" FOR A POLYGON FOR THE KIWYSI COMPACTNESS MODEL
-function featureizePoly(poly, options) {
+function featureizePoly(poly, options, { bKIWYSIFeatures = true } = {}) {
     if (options === undefined)
         options = baseclient_1.Poly.DefaultOptions;
     const area = baseclient_1.Poly.polyArea(poly);
@@ -599,21 +628,22 @@ function featureizePoly(poly, options) {
     const ch = baseclient_1.Poly.polyConvexHull(poly);
     const hullArea = baseclient_1.Poly.polyArea(ch);
     const result = {
+        // 12-10-24: Skip featurization for KIWYSI compactness, when MultiPolygons are too fragmented
         // For the "correct" geodesic calculations that the KIWYSI AI uses
-        sym_x: calcXSymmetry(poly),
-        sym_y: calcYSymmetry(poly),
-        reock: calcReock(area, diameter),
-        bbox: calcBoundingBox(poly),
-        polsby: calcPolsbyPopper(area, perimeter),
-        hull: calcConvexHullFeature(area, hullArea),
-        schwartzberg: calcSchwartzberg(area, perimeter),
+        sym_x: bKIWYSIFeatures ? calcXSymmetry(poly) : 0.0,
+        sym_y: bKIWYSIFeatures ? calcYSymmetry(poly) : 0.0,
+        reock: bKIWYSIFeatures ? calcReock(area, diameter) : 0.0,
+        bbox: bKIWYSIFeatures ? calcBoundingBox(poly) : 0.0,
+        polsby: bKIWYSIFeatures ? calcPolsbyPopper(area, perimeter) : 0.0,
+        hull: bKIWYSIFeatures ? calcConvexHullFeature(area, hullArea) : 0.0,
+        schwartzberg: bKIWYSIFeatures ? calcSchwartzberg(area, perimeter) : 0.0,
+        // But still do the basic calculations for Reock and Polsby-Popper
         // For the Cartesian (flat earth) calculations that are typically done
         reockFlat: calcReock(areaFlat, diameterFlat),
         polsbyFlat: calcPolsbyPopper(areaFlat, perimeterFlat)
     };
     return result;
 }
-exports.featureizePoly = featureizePoly;
 
 
 /***/ }),
@@ -644,15 +674,29 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.scoreFeatureSet = exports.calcKIWYSICompactness = exports.kiwysiScoreShapes = exports.kiwysiScoreShape = exports.kiwysiScoreShapeRAW = void 0;
+exports.kiwysiScoreShapeRAW = kiwysiScoreShapeRAW;
+exports.kiwysiScoreShape = kiwysiScoreShape;
+exports.kiwysiScoreShapes = kiwysiScoreShapes;
+exports.calcKIWYSICompactness = calcKIWYSICompactness;
+exports.scoreFeatureSet = scoreFeatureSet;
 const features_1 = __webpack_require__(/*! ./features */ "./lib/compactness/features.ts");
 const M = __importStar(__webpack_require__(/*! ./matrix */ "./lib/compactness/matrix.ts"));
 // For verifying replication w/ Aaron Kaufman & Gary King's results
@@ -664,14 +708,12 @@ function kiwysiScoreShapeRAW(poly, pca, options) {
     const score = scoreFeatureSet(features, pca);
     return score;
 }
-exports.kiwysiScoreShapeRAW = kiwysiScoreShapeRAW;
 // Note: These scores are still smaller is better (ranks)
 function kiwysiScoreShape(poly, pca, options) {
     const rawScore = kiwysiScoreShapeRAW(poly, pca, options);
     const rangedScore = Math.min(Math.max(rawScore, 1), 100);
     return rangedScore;
 }
-exports.kiwysiScoreShape = kiwysiScoreShape;
 // Use this to get KIWYSI compactness scores ("ranks") for a set of shapes
 function kiwysiScoreShapes(shapes, pca, options) {
     let scores = [];
@@ -681,7 +723,6 @@ function kiwysiScoreShapes(shapes, pca, options) {
     }
     return scores;
 }
-exports.kiwysiScoreShapes = kiwysiScoreShapes;
 // CLI
 // Use this to get KIWYSI compactness features and scores ("ranks") for a set of shapes
 // Note - These calculations use the geodesic (curved earth) model
@@ -709,14 +750,13 @@ function calcKIWYSICompactness(shapes) {
         };
         byDistrict.push(entry);
     }
-    const avgKWIWYSI = Math.round(totKIWYSI / shapes.features.length);
+    const avgKIWYSI = Math.round(totKIWYSI / shapes.features.length);
     const out = {
-        avgKWIWYSI: avgKWIWYSI,
+        avgKIWYSI: avgKIWYSI,
         byDistrict: byDistrict
     };
     return out;
 }
-exports.calcKIWYSICompactness = calcKIWYSICompactness;
 // KIWYSI SCORE THE FEATURES FROM A FEATURE-IZED SHAPE
 function scoreFeatureSet(features, pca) {
     if (pca == 0 /* T.PCAModel.Revised */)
@@ -724,16 +764,15 @@ function scoreFeatureSet(features, pca) {
     else
         return applyPCAModel_ORIGINAL(features);
 }
-exports.scoreFeatureSet = scoreFeatureSet;
 // Revised 01/25/21
 function applyPCAModel(features) {
     const model = [
-        3.0428861122,
-        4.5060390447,
-        -22.7768820155,
-        -24.1176096770,
-        -107.9434473497,
-        -67.1088897240,
+        3.0428861122, // sym_x
+        4.5060390447, // sym_y
+        -22.7768820155, // reock
+        -24.1176096770, // bbox
+        -107.9434473497, // polsby
+        -67.1088897240, // hull
         -1.2981693414 // schwartzberg
     ];
     const intercept = 145.6420811716;
@@ -753,12 +792,12 @@ function applyPCAModel(features) {
 // The original, INCORRECT, model
 function applyPCAModel_ORIGINAL(features) {
     const model = [
-        0.317566717356693,
-        0.32545234315137,
-        0.32799567316863,
-        0.411560782484889,
-        0.412187169816954,
-        0.420085928286392,
+        0.317566717356693, // sym_x
+        0.32545234315137, // sym_y
+        0.32799567316863, // reock
+        0.411560782484889, // bbox
+        0.412187169816954, // polsby
+        0.420085928286392, // hull
         0.412187169816954 // schwartzberg
     ];
     const v = [
@@ -789,12 +828,11 @@ function applyPCAModel_ORIGINAL(features) {
 // dotProduct - cloned from poly/matrix.ts, to avoid needing mathjs
 //
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.dotProduct = void 0;
+exports.dotProduct = dotProduct;
 function dotProduct(a, b) {
     protect((a.length > 0) && (a.length == b.length), "In dotProduct, the vectors aren't the same length. ");
     return a.map((value, i) => value * b[i]).reduce((acc, val) => acc + val, 0);
 }
-exports.dotProduct = dotProduct;
 ;
 function protect(condition, message) {
     if (!condition)
@@ -858,27 +896,37 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.makePopulationScorecard = exports.isRoughlyEqual = exports.calcPopulationDeviation = void 0;
+exports.calcPopulationDeviation = calcPopulationDeviation;
+exports.isRoughlyEqual = isRoughlyEqual;
+exports.makePopulationScorecard = makePopulationScorecard;
 const C = __importStar(__webpack_require__(/*! ../rate/dra-config */ "./lib/rate/dra-config.ts"));
 const U = __importStar(__webpack_require__(/*! ../utils/all */ "./lib/utils/all.ts"));
 // MMD - This is the same for SMD & MMD. It's the calculation of min, max, and target size that differs.
 function calcPopulationDeviation(max, min, targetSize) {
     return (max - min) / targetSize; // Don't trim the result here!
 }
-exports.calcPopulationDeviation = calcPopulationDeviation;
 function isRoughlyEqual(devation, bLegislative) {
     const threshold = C.popdevThreshold(bLegislative);
     return (devation <= threshold) ? true : false;
 }
-exports.isRoughlyEqual = isRoughlyEqual;
 // MMD
 // - Add optional # of reps per district. 
 // - Assume targetSize has been calculated correctly per # of reps not districts.
@@ -929,7 +977,6 @@ function makePopulationScorecard(totPopByDistrict, targetSize, bLegislative, rep
     };
     return s;
 }
-exports.makePopulationScorecard = makePopulationScorecard;
 
 
 /***/ }),
@@ -989,15 +1036,25 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.isConnected = void 0;
+exports.isConnected = isConnected;
 const G = __importStar(__webpack_require__(/*! ./utils */ "./lib/graph/utils.ts"));
 function isConnected(featureIDs, graph, bLog = false) {
     let visited = new Set();
@@ -1025,7 +1082,6 @@ function isConnected(featureIDs, graph, bLog = false) {
     }
     return bConnected;
 }
-exports.isConnected = isConnected;
 
 
 /***/ }),
@@ -1056,15 +1112,25 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.isEmbedded = void 0;
+exports.isEmbedded = isEmbedded;
 const U = __importStar(__webpack_require__(/*! ../utils/all */ "./lib/utils/all.ts"));
 const G = __importStar(__webpack_require__(/*! ./utils */ "./lib/graph/utils.ts"));
 //
@@ -1098,7 +1164,6 @@ function isEmbedded(districtID, featureIDs, plan, graph, bLog = false) {
     }
     return true;
 }
-exports.isEmbedded = isEmbedded;
 
 
 /***/ }),
@@ -1149,15 +1214,28 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.invertPlan = exports.isOutOfBounds = exports.neighbors = exports.getDistrict = void 0;
+exports.getDistrict = getDistrict;
+exports.neighbors = neighbors;
+exports.isOutOfBounds = isOutOfBounds;
+exports.invertPlan = invertPlan;
 const S = __importStar(__webpack_require__(/*! ./settings */ "./lib/graph/settings.ts"));
 const U = __importStar(__webpack_require__(/*! ../utils/all */ "./lib/utils/all.ts"));
 function getDistrict(geoID, plan) {
@@ -1165,7 +1243,6 @@ function getDistrict(geoID, plan) {
         return plan[geoID];
     return undefined;
 }
-exports.getDistrict = getDistrict;
 function neighbors(node, graph) {
     if (!U.keyExists(node, graph))
         return [];
@@ -1174,11 +1251,9 @@ function neighbors(node, graph) {
     const l = (n instanceof Array) ? n : Object.keys(n);
     return l;
 }
-exports.neighbors = neighbors;
 function isOutOfBounds(geoID) {
     return geoID == S.OUT_OF_BOUNDS;
 }
-exports.isOutOfBounds = isOutOfBounds;
 // NOTE - This is only used in the CLI and Jest tests
 // Invert a plan by geoID to sets of geoIDs by districtID
 function invertPlan(plan) {
@@ -1191,7 +1266,6 @@ function invertPlan(plan) {
     }
     return invertedPlan;
 }
-exports.invertPlan = invertPlan;
 
 
 /***/ }),
@@ -1251,15 +1325,29 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.calcProportionalDistricts = exports.estMinorityOpportunity = exports.calcDistrictsByDemo = exports.convertTableToArray = exports.makeMinorityScorecard = void 0;
+exports.makeMinorityScorecard = makeMinorityScorecard;
+exports.convertTableToArray = convertTableToArray;
+exports.calcDistrictsByDemo = calcDistrictsByDemo;
+exports.estMinorityOpportunity = estMinorityOpportunity;
+exports.calcProportionalDistricts = calcProportionalDistricts;
 const U = __importStar(__webpack_require__(/*! ../utils/all */ "./lib/utils/all.ts"));
 const C = __importStar(__webpack_require__(/*! ../rate/dra-config */ "./lib/rate/dra-config.ts"));
 const normalize_1 = __webpack_require__(/*! ../rate/normalize */ "./lib/rate/normalize.ts");
@@ -1319,7 +1407,6 @@ function makeMinorityScorecard(statewideDemos, demosByDistrict, bLog = false) {
     };
     return s;
 }
-exports.makeMinorityScorecard = makeMinorityScorecard;
 // HELPERS
 // Convert the 2D working array to a fixed table, so the rows & columns can be
 // addressed logically by name as opposed to using array indices.
@@ -1459,12 +1546,10 @@ function convertTableToArray(t) {
     const a = [minority, black, hispanic, pacific, asian, native];
     return a;
 }
-exports.convertTableToArray = convertTableToArray;
 function calcDistrictsByDemo(MfArray, N) {
     const districtsByDemo = MfArray.map(v => calcProportionalDistricts(v, N));
     return districtsByDemo;
 }
-exports.calcDistrictsByDemo = calcDistrictsByDemo;
 // NOTE - Shift minority proportions up, so 37% minority scores like 52% share,
 //   but use the uncompressed seat probability distribution. This makes a 37% 
 //   district have a ~70% chance of winning, and a 50% district have a >99% chance.
@@ -1487,7 +1572,6 @@ function estMinorityOpportunity(Mf, demo) {
     const oppty = (Mf < range[C.BEG]) ? 0.0 : Math.min((0, method_1.estSeatProbability)(_normalizer.wipNum, dist), 1.0);
     return oppty;
 }
-exports.estMinorityOpportunity = estMinorityOpportunity;
 // HELPERS
 function bucketVAPPct(Mf) {
     if (Mf < 0.35)
@@ -1511,7 +1595,6 @@ function calcProportionalDistricts(proportion, nDistricts) {
     const integral = Math.round(fractional + roundUp);
     return integral;
 }
-exports.calcProportionalDistricts = calcProportionalDistricts;
 /* Sources for majority-minority info:
  - https://en.wikipedia.org/wiki/List_of_majority-minority_United_States_congressional_districts
  - http://www.ncsl.org/Portals/1/Documents/Redistricting/Redistricting_2010.pdf
@@ -1531,7 +1614,7 @@ exports.calcProportionalDistricts = calcProportionalDistricts;
 // RACIALLY POLARIZED VOTING
 //
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.analyzeRacialVoting = void 0;
+exports.analyzeRacialVoting = analyzeRacialVoting;
 // Analyze the degree of racially polarized voting for a district
 function analyzeRacialVoting(dictPoints /* | undefined */, districtID, groups) {
     // 12-29-2020 - Moved these guards up into district-analytics
@@ -1554,7 +1637,6 @@ function analyzeRacialVoting(dictPoints /* | undefined */, districtID, groups) {
     };
     return result;
 }
-exports.analyzeRacialVoting = analyzeRacialVoting;
 // https://trentrichardson.com/compute-linear-regressions-in-javascript.html
 // https://www2.isye.gatech.edu/~yxie77/isye2028/lecture12.pdf
 function linearRegression(dictPoints) {
@@ -1649,15 +1731,26 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 var __exportStar = (this && this.__exportStar) || function(m, exports) {
     for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
 };
-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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.calcPartisanMetrics = exports.makePartisanScorecard = void 0;
+exports.makePartisanScorecard = makePartisanScorecard;
+exports.calcPartisanMetrics = calcPartisanMetrics;
 __exportStar(__webpack_require__(/*! ./erf */ "./lib/partisan/erf.ts"), exports);
 __exportStar(__webpack_require__(/*! ./method */ "./lib/partisan/method.ts"), exports);
 __exportStar(__webpack_require__(/*! ./bias */ "./lib/partisan/bias.ts"), exports);
@@ -1769,7 +1862,6 @@ function makePartisanScorecard(Vf, VfArray, bLog = false) {
     };
     return s;
 }
-exports.makePartisanScorecard = makePartisanScorecard;
 function calcPartisanMetrics(Vf, VfArray) {
     const s = makePartisanScorecard(Vf, VfArray);
     let out = all_1.Utils.deepCopy(s);
@@ -1777,7 +1869,6 @@ function calcPartisanMetrics(Vf, VfArray) {
     delete out.details;
     return out;
 }
-exports.calcPartisanMetrics = calcPartisanMetrics;
 
 
 /***/ }),
@@ -1808,15 +1899,57 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.rangeUnearnedSeats = exports.estLocalUnearnedSeats = exports.rangeDisproportionalityAlt = exports.estLocalDisproportionalityAlt = exports.rangeDisproportionality = exports.estLocalDisproportionality = exports.rangeAsymmetry = exports.estLocalAsymmetry = exports.calcGamma = exports.calcMinimalInverseResponsiveness = exports.calcBigR = exports.calcDisproportionality = exports.calcGlobalSymmetry = exports.calcLopsidedOutcomes = exports.calcDeclination = exports.radiansToDegrees = exports.isASweep = exports.keyRVpoints = exports.calcMeanMedianDifference = exports.calcEfficiencyGapPrime = exports.calcEfficiencyGap = exports.invertSVPoints = exports.inferGeometricSeatsBiasPoints = exports.estGeometricSeatsBias = exports.estVotesBias = exports.estSeatBias = exports.estPartisanBias = exports.calcTurnoutBias = exports.estUnearnedSeats = exports.calcDisproportionalityFromBest = exports.estSeatShare = exports.bestSeatShare = exports.bestSeats = void 0;
+exports.bestSeats = bestSeats;
+exports.bestSeatShare = bestSeatShare;
+exports.estSeatShare = estSeatShare;
+exports.calcDisproportionalityFromBest = calcDisproportionalityFromBest;
+exports.estUnearnedSeats = estUnearnedSeats;
+exports.calcTurnoutBias = calcTurnoutBias;
+exports.estPartisanBias = estPartisanBias;
+exports.estSeatBias = estSeatBias;
+exports.estVotesBias = estVotesBias;
+exports.estGeometricSeatsBias = estGeometricSeatsBias;
+exports.inferGeometricSeatsBiasPoints = inferGeometricSeatsBiasPoints;
+exports.invertSVPoints = invertSVPoints;
+exports.calcEfficiencyGap = calcEfficiencyGap;
+exports.calcEfficiencyGapPrime = calcEfficiencyGapPrime;
+exports.calcMeanMedianDifference = calcMeanMedianDifference;
+exports.keyRVpoints = keyRVpoints;
+exports.isASweep = isASweep;
+exports.radiansToDegrees = radiansToDegrees;
+exports.calcDeclination = calcDeclination;
+exports.calcLopsidedOutcomes = calcLopsidedOutcomes;
+exports.calcGlobalSymmetry = calcGlobalSymmetry;
+exports.calcDisproportionality = calcDisproportionality;
+exports.calcBigR = calcBigR;
+exports.calcMinimalInverseResponsiveness = calcMinimalInverseResponsiveness;
+exports.calcGamma = calcGamma;
+exports.estLocalAsymmetry = estLocalAsymmetry;
+exports.rangeAsymmetry = rangeAsymmetry;
+exports.estLocalDisproportionality = estLocalDisproportionality;
+exports.rangeDisproportionality = rangeDisproportionality;
+exports.estLocalDisproportionalityAlt = estLocalDisproportionalityAlt;
+exports.rangeDisproportionalityAlt = rangeDisproportionalityAlt;
+exports.estLocalUnearnedSeats = estLocalUnearnedSeats;
+exports.rangeUnearnedSeats = rangeUnearnedSeats;
 const U = __importStar(__webpack_require__(/*! ../utils/all */ "./lib/utils/all.ts"));
 const C = __importStar(__webpack_require__(/*! ../rate/dra-config */ "./lib/rate/dra-config.ts"));
 const method_1 = __webpack_require__(/*! ./method */ "./lib/partisan/method.ts");
@@ -1854,36 +1987,30 @@ const method_1 = __webpack_require__(/*! ./method */ "./lib/partisan/method.ts")
 function bestSeats(N, Vf) {
     return Math.round((N * Vf) - U.EPSILON);
 }
-exports.bestSeats = bestSeats;
 // ^S% - The corresponding Democratic seat share 
 function bestSeatShare(bestS, N) {
     return bestS / N;
 }
-exports.bestSeatShare = bestSeatShare;
 // S% - The estimated Democratic seat share fraction
 function estSeatShare(estS, N) {
     return estS / N;
 }
-exports.estSeatShare = estSeatShare;
 // B% - The deviation from proportionality calculated as ^S% — S%
 function calcDisproportionalityFromBest(estSf, bestSf) {
     return bestSf - estSf;
 }
-exports.calcDisproportionalityFromBest = calcDisproportionalityFromBest;
 // NOTE - Not used.
 // UE# - The estimated # of unearned seats
 // UE_# from http://bit.ly/2Fcuf4q
 function estUnearnedSeats(proportional, probable) {
     return proportional - probable;
 }
-exports.estUnearnedSeats = estUnearnedSeats;
 // ADVANCED/ALTERNATE METRICS FOR REFERENCE
 function calcTurnoutBias(statewide, VfArray) {
     const districtAvg = U.avgArray(VfArray);
     const turnoutBias = statewide - districtAvg;
     return turnoutBias;
 }
-exports.calcTurnoutBias = calcTurnoutBias;
 // PARTISAN BIAS - I'm using John Nagle's simple seat bias below, which is what
 //    PlanScore is doing:
 //
@@ -1901,7 +2028,6 @@ exports.calcTurnoutBias = calcTurnoutBias;
 function estPartisanBias(inferredSVpoints, nDistricts) {
     return estSeatBias(inferredSVpoints, nDistricts);
 }
-exports.estPartisanBias = estPartisanBias;
 // SEATS BIAS -- John Nagle's simple seat bias @ 50% (alpha), a fractional # of seats.
 function estSeatBias(inferredSVpoints, nDistricts) {
     const half = 0.5;
@@ -1919,7 +2045,6 @@ function estSeatBias(inferredSVpoints, nDistricts) {
     // const BsAlt = (nDistricts / 2.0) - dSeats;
     return Bs;
 }
-exports.estSeatBias = estSeatBias;
 // VOTES BIAS -- John Nagle's simple vote bias @ 50% (alpha2), a percentage.
 function estVotesBias(inferredSVpoints, nDistricts) {
     let extraVf = undefined;
@@ -1936,7 +2061,6 @@ function estVotesBias(inferredSVpoints, nDistricts) {
     }
     return extraVf;
 }
-exports.estVotesBias = estVotesBias;
 // GEOMETRIC SEATS BIAS (@ V = statewide vote share)
 function estGeometricSeatsBias(Vf, dSVpoints, rSVpoints) {
     let BsGf = undefined;
@@ -1952,7 +2076,6 @@ function estGeometricSeatsBias(Vf, dSVpoints, rSVpoints) {
     }
     return BsGf;
 }
-exports.estGeometricSeatsBias = estGeometricSeatsBias;
 // The actual formula
 function calcGeometricSeatsBias(sD, sR) {
     const BsGf = 0.5 * (sR - sD);
@@ -1968,7 +2091,6 @@ function inferGeometricSeatsBiasPoints(dSVpoints, rSVpoints) {
     }
     return bgsSVpoints;
 }
-exports.inferGeometricSeatsBiasPoints = inferGeometricSeatsBiasPoints;
 function invertSVPoints(inferredSVpoints) {
     let invertedSVpoints = [];
     for (let pt of inferredSVpoints) {
@@ -1983,7 +2105,6 @@ function invertSVPoints(inferredSVpoints) {
     });
     return invertedSVpoints;
 }
-exports.invertSVPoints = invertSVPoints;
 // EFFICIENCY GAP -- note the formulation used. Also, to accommodate turnout bias,
 //   we would need to have D & R votes, not just shares.
 function calcEfficiencyGap(Vf, Sf, shareType = 0 /* T.Party.Democratic */) {
@@ -2003,7 +2124,6 @@ function calcEfficiencyGap(Vf, Sf, shareType = 0 /* T.Party.Democratic */) {
     }
     return efficiencyGap;
 }
-exports.calcEfficiencyGap = calcEfficiencyGap;
 // For illustration purposes only
 // Assumes Democratic vote shares
 // Alternate specification with winner's bonus (R) heuristic built in:
@@ -2015,7 +2135,6 @@ function calcEfficiencyGapPrime(Vf, Sf, R) {
         EG = (2.0 * (Vf - 0.5)) - (Sf - 0.5);
     return EG;
 }
-exports.calcEfficiencyGapPrime = calcEfficiencyGapPrime;
 // MEAN–MEDIAN DIFFERENCE
 // 
 // From PlanScore.org: "The mean-median difference is a party’s median vote share
@@ -2043,7 +2162,6 @@ function calcMeanMedianDifference(VfArray, Vf) {
     // const difference: number = medianVf - meanVf;
     return difference;
 }
-exports.calcMeanMedianDifference = calcMeanMedianDifference;
 // HELPERS FOR DECLINATION & LOPSIDED OUTCOMES
 // Key r(v) points, defined in Fig. 16:
 // * VfArray are Democratic seat shares (by convention).
@@ -2070,18 +2188,15 @@ function keyRVpoints(VfArray) {
     };
     return keyPoints;
 }
-exports.keyRVpoints = keyRVpoints;
 function isASweep(Sf, nDistricts) {
     const oneDistrict = 1 / nDistricts;
     const bSweep = ((Sf > (1 - oneDistrict)) || (Sf < oneDistrict)) ? true : false;
     return bSweep;
 }
-exports.isASweep = isASweep;
 function radiansToDegrees(radians) {
     const degrees = radians * (180 / Math.PI);
     return degrees;
 }
-exports.radiansToDegrees = radiansToDegrees;
 // DECLINATION
 // 
 // Declination is calculated using the key r(v) points, defined in Fig. 16.
@@ -2106,7 +2221,6 @@ function calcDeclination(VfArray) {
     }
     return decl;
 }
-exports.calcDeclination = calcDeclination;
 // LOPSIDED OUTCOMES
 //
 // This is a measure of packing bias is:
@@ -2130,7 +2244,6 @@ function calcLopsidedOutcomes(VfArray) {
     }
     return LO;
 }
-exports.calcLopsidedOutcomes = calcLopsidedOutcomes;
 // GLOBAL SYMMETRY - Fig. 17 in Section 5.1
 //
 // * gSym is the area of asymmetry between the two curves.
@@ -2146,7 +2259,6 @@ function calcGlobalSymmetry(dSVpoints, rSVpoints, S50V) {
     gSym *= sign;
     return gSym / 100;
 }
-exports.calcGlobalSymmetry = calcGlobalSymmetry;
 // RAW DISPROPORTIONALITY
 //
 // PR = Sf – Vf     : Eq.C.1.1 on P. 42
@@ -2154,7 +2266,6 @@ function calcDisproportionality(Vf, Sf) {
     const disProp = calcProp(Vf, Sf);
     return disProp;
 }
-exports.calcDisproportionality = calcDisproportionality;
 // The actual formula
 function calcProp(Vf, Sf) {
     const prop = Vf - Sf;
@@ -2168,7 +2279,6 @@ function calcBigR(Vf, Sf) {
     }
     return bigR;
 }
-exports.calcBigR = calcBigR;
 // MINIMAL INVERSE RESPONSIVENESS
 //
 // zeta = (1 / r) - (1 / r_sub_max)     : Eq. 5.2.1
@@ -2184,7 +2294,6 @@ function calcMinimalInverseResponsiveness(Vf, r) {
     }
     return MIR;
 }
-exports.calcMinimalInverseResponsiveness = calcMinimalInverseResponsiveness;
 function isBalanced(Vf) {
     const [lower, upper] = C.competitiveRange();
     const bBalanced = ((Vf > upper) || (Vf < lower)) ? false : true;
@@ -2200,7 +2309,6 @@ function calcGamma(Vf, Sf, r) {
     const g = 0.5 + (r * (Vf - 0.5)) - Sf;
     return g;
 }
-exports.calcGamma = calcGamma;
 // EXPERIMENTAL
 const pctWidth = 5; // The size in % points of the 'local' window to bracket <V>
 // Average local asymmetry
@@ -2218,7 +2326,6 @@ function estLocalAsymmetry(Vf, dSVpoints, rSVpoints) {
         return undefined;
     }
 }
-exports.estLocalAsymmetry = estLocalAsymmetry;
 function rangeAsymmetry(dSVpoints, rSVpoints) {
     const ndPts = dSVpoints.length;
     const nrPts = rSVpoints.length;
@@ -2229,7 +2336,6 @@ function rangeAsymmetry(dSVpoints, rSVpoints) {
     }
     return tot / ndPts;
 }
-exports.rangeAsymmetry = rangeAsymmetry;
 // Average local disproportionality
 function estLocalDisproportionality(Vf, dSVpoints) {
     try {
@@ -2244,7 +2350,6 @@ function estLocalDisproportionality(Vf, dSVpoints) {
         return undefined;
     }
 }
-exports.estLocalDisproportionality = estLocalDisproportionality;
 function rangeDisproportionality(dSVpoints) {
     const ndPts = dSVpoints.length;
     let tot = 0.0;
@@ -2253,7 +2358,6 @@ function rangeDisproportionality(dSVpoints) {
     }
     return tot / ndPts;
 }
-exports.rangeDisproportionality = rangeDisproportionality;
 // Average local disproportionality from the best # of seats (closest to proportional)
 function estLocalDisproportionalityAlt(Vf, N, dSVpoints) {
     const dPts = svPointRange(Vf, dSVpoints);
@@ -2262,7 +2366,6 @@ function estLocalDisproportionalityAlt(Vf, N, dSVpoints) {
     const lPropAlt = rangeDisproportionalityAlt(N, dPts);
     return lPropAlt;
 }
-exports.estLocalDisproportionalityAlt = estLocalDisproportionalityAlt;
 // Dynamically calculate the best # seats, so this is a step function
 function rangeDisproportionalityAlt(N, dSVpoints) {
     const ndPts = dSVpoints.length;
@@ -2274,7 +2377,6 @@ function rangeDisproportionalityAlt(N, dSVpoints) {
     }
     return tot / ndPts;
 }
-exports.rangeDisproportionalityAlt = rangeDisproportionalityAlt;
 // Average local unearned seats from the best # of seats (closest to proportional)
 function estLocalUnearnedSeats(Vf, N, dSVpoints) {
     const dPts = svPointRange(Vf, dSVpoints);
@@ -2283,7 +2385,6 @@ function estLocalUnearnedSeats(Vf, N, dSVpoints) {
     const lUE = rangeUnearnedSeats(N, dPts);
     return lUE;
 }
-exports.estLocalUnearnedSeats = estLocalUnearnedSeats;
 function rangeUnearnedSeats(N, dSVpoints) {
     const ndPts = dSVpoints.length;
     let tot = 0.0;
@@ -2294,7 +2395,6 @@ function rangeUnearnedSeats(N, dSVpoints) {
     }
     return tot / ndPts;
 }
-exports.rangeUnearnedSeats = rangeUnearnedSeats;
 // Filter the full [0.25–0.75] range of S–V points down to the 'local' range.
 // Make sure that range is w/in the full range.
 function svPointRange(Vf, svPoints) {
@@ -2329,7 +2429,7 @@ const inRange = (pt, range) => { return (pt.v >= range[0]) && (pt.v <= range[1])
 // Approximate ERF - https://en.wikipedia.org/wiki/Error_function#Numerical_approximations
 //
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.approximateERF = void 0;
+exports.approximateERF = approximateERF;
 function approximateERF(x) {
     const n = Math.abs(x);
     const p = 0.3275911;
@@ -2342,7 +2442,6 @@ function approximateERF(x) {
     const erf = 1 - ((a1 * t) + (a2 * Math.pow(t, 2)) + (a3 * Math.pow(t, 3)) + (a4 * Math.pow(t, 4)) + (a5 * Math.pow(t, 5))) * Math.pow(Math.E, (-1 * Math.pow(n, 2)));
     return (x < 0) ? -erf : erf;
 }
-exports.approximateERF = approximateERF;
 /* To validate this, you need to import mathjs.erf into a Jest test file and run these:
 
 const {erf} = require('mathjs');
@@ -2402,15 +2501,35 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.fptpWin = exports.estFPTPSeats = exports.findBracketingUpperSf = exports.findBracketingLowerSf = exports.findBracketingUpperVf = exports.findBracketingLowerVf = exports.inferSVpoints = exports.avgSVError = exports.estDistrictResponsiveness = exports.estSeats = exports.estSeatProbability = void 0;
+exports.avgSVError = void 0;
+exports.estSeatProbability = estSeatProbability;
+exports.estSeats = estSeats;
+exports.estDistrictResponsiveness = estDistrictResponsiveness;
+exports.inferSVpoints = inferSVpoints;
+exports.findBracketingLowerVf = findBracketingLowerVf;
+exports.findBracketingUpperVf = findBracketingUpperVf;
+exports.findBracketingLowerSf = findBracketingLowerSf;
+exports.findBracketingUpperSf = findBracketingUpperSf;
+exports.estFPTPSeats = estFPTPSeats;
+exports.fptpWin = fptpWin;
 const erf_1 = __webpack_require__(/*! ./erf */ "./lib/partisan/erf.ts");
 const normalize_1 = __webpack_require__(/*! ../rate/normalize */ "./lib/rate/normalize.ts");
 const U = __importStar(__webpack_require__(/*! ../utils/all */ "./lib/utils/all.ts"));
@@ -2434,7 +2553,6 @@ function estSeatProbability(Vf, range) {
         return seatProbabilityFn(Vf);
     }
 }
-exports.estSeatProbability = estSeatProbability;
 // const {erf} = require('mathjs');
 // console.log("erf(0.2) =", erf(0.2));    // returns 0.22270258921047847
 // console.log("erf(-0.5) =", erf(-0.5));  // returns -0.5204998778130465
@@ -2448,13 +2566,11 @@ function estSeats(VfArray, range) {
     // Python: sum([est_seat_probability(vpi) for vpi in vpi_by_district])
     return U.sumArray(VfArray.map(v => estSeatProbability(v, range)));
 }
-exports.estSeats = estSeats;
 // Estimate the number of responsive districts [R(d)], given a set of Vf's
 function estDistrictResponsiveness(Vf) {
     // Python: 1 - 4 * (est_seat_probability(vpi) - 0.5)**2
     return 1.0 - 4.0 * Math.pow((estSeatProbability(Vf) - 0.5), 2);
 }
-exports.estDistrictResponsiveness = estDistrictResponsiveness;
 exports.avgSVError = 0.02;
 function inferSVpoints(Vf, VfArray, shift, range) {
     const nDistricts = VfArray.length;
@@ -2466,7 +2582,6 @@ function inferSVpoints(Vf, VfArray, shift, range) {
     }
     return SVpoints;
 }
-exports.inferSVpoints = inferSVpoints;
 function shiftDistricts(Vf, VfArray, shiftedVf, shift) {
     if (shift == 0 /* T.Shift.Proportional */)
         return shiftProportionally(Vf, VfArray, shiftedVf);
@@ -2524,7 +2639,6 @@ function findBracketingLowerVf(Vf, inferredSVpoints) {
     lowerPt = smallerPoints.slice(-1)[0];
     return lowerPt;
 }
-exports.findBracketingLowerVf = findBracketingLowerVf;
 // Find the S(V) point that brackets a Vf value on the upper end
 function findBracketingUpperVf(Vf, inferredSVpoints) {
     let upperPt = inferredSVpoints[-1];
@@ -2537,7 +2651,6 @@ function findBracketingUpperVf(Vf, inferredSVpoints) {
     }
     return upperPt;
 }
-exports.findBracketingUpperVf = findBracketingUpperVf;
 // The corresponding functions via the Sf y-axis (vs. Vf x-axis)
 // Find the S(V) point that brackets a Sf value on the lower end
 function findBracketingLowerSf(Sf, inferredSVpoints) {
@@ -2555,7 +2668,6 @@ function findBracketingLowerSf(Sf, inferredSVpoints) {
     lowerPt = smallerPoints.slice(-1)[0];
     return lowerPt;
 }
-exports.findBracketingLowerSf = findBracketingLowerSf;
 // Find the S(V) point that brackets a Sf value on the upper end
 function findBracketingUpperSf(Sf, inferredSVpoints) {
     let upperPt = inferredSVpoints[-1];
@@ -2568,20 +2680,17 @@ function findBracketingUpperSf(Sf, inferredSVpoints) {
     }
     return upperPt;
 }
-exports.findBracketingUpperSf = findBracketingUpperSf;
 // HELPERS
 // The estimated number of Democratic seats using first past the post
 function estFPTPSeats(VfArray) {
     // Python: sum([1.0 for vpi in vpi_by_district if (vpi > 0.5)])
     return U.sumArray(VfArray.map(v => fptpWin(v)));
 }
-exports.estFPTPSeats = estFPTPSeats;
 function fptpWin(demPct) {
     // Vote shares should be fractions in the range [0.0 – 1.0]
     //assert((demPct <= 1.0) && (demPct >= 0.0));
     return ((demPct > 0.5) ? 1 : 0);
 }
-exports.fptpWin = fptpWin;
 
 
 /***/ }),
@@ -2612,15 +2721,34 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.findMarginalDistricts = exports.estMarginalCompetitiveShare = exports.estMarginalCompetitiveDistricts = exports.estCompetitiveDistrictsShare = exports.estDistrictCompetitiveness = exports.estCompetitiveDistricts = exports.countCompetitiveDistricts = exports.estResponsiveDistrictsShare = exports.estResponsiveDistricts = exports.estResponsiveness = void 0;
+exports.estResponsiveness = estResponsiveness;
+exports.estResponsiveDistricts = estResponsiveDistricts;
+exports.estResponsiveDistrictsShare = estResponsiveDistrictsShare;
+exports.countCompetitiveDistricts = countCompetitiveDistricts;
+exports.estCompetitiveDistricts = estCompetitiveDistricts;
+exports.estDistrictCompetitiveness = estDistrictCompetitiveness;
+exports.estCompetitiveDistrictsShare = estCompetitiveDistrictsShare;
+exports.estMarginalCompetitiveDistricts = estMarginalCompetitiveDistricts;
+exports.estMarginalCompetitiveShare = estMarginalCompetitiveShare;
+exports.findMarginalDistricts = findMarginalDistricts;
 const normalize_1 = __webpack_require__(/*! ../rate/normalize */ "./lib/rate/normalize.ts");
 const U = __importStar(__webpack_require__(/*! ../utils/all */ "./lib/utils/all.ts"));
 const C = __importStar(__webpack_require__(/*! ../rate/dra-config */ "./lib/rate/dra-config.ts"));
@@ -2656,24 +2784,20 @@ function estResponsiveness(Vf, inferredSVpoints) {
     }
     return r;
 }
-exports.estResponsiveness = estResponsiveness;
 // rD -  Estimate the number of responsive districts, given a set of Vf's
 function estResponsiveDistricts(VfArray) {
     // Python: sum([est_district_responsiveness(vpi) for vpi in vpi_by_district])
     return U.sumArray(VfArray.map(v => (0, method_1.estDistrictResponsiveness)(v)));
 }
-exports.estResponsiveDistricts = estResponsiveDistricts;
 // rD% - The estimated # of responsive districts, as a fraction of N
 function estResponsiveDistrictsShare(rD, N) {
     return rD / N;
 }
-exports.estResponsiveDistrictsShare = estResponsiveDistrictsShare;
 // ESTIMATE COMPETITIVENESS (ENHANCED)
 // C - Count the # of competitive districts, defined as v in [45–55%]
 function countCompetitiveDistricts(VfArray) {
     return U.sumArray(VfArray.map(v => isCompetitive(v)));
 }
-exports.countCompetitiveDistricts = countCompetitiveDistricts;
 function isCompetitive(v) {
     return ((v >= C.competitiveRange()[C.BEG]) && (v <= C.competitiveRange()[C.END])) ? 1 : 0;
 }
@@ -2681,7 +2805,6 @@ function isCompetitive(v) {
 function estCompetitiveDistricts(VfArray, bCompress = false) {
     return U.sumArray(VfArray.map(v => estDistrictCompetitiveness(v, bCompress)));
 }
-exports.estCompetitiveDistricts = estCompetitiveDistricts;
 function estDistrictCompetitiveness(Vf, bCompress = false) {
     const _normalizer = new normalize_1.Normalizer(Vf);
     // The end points of the probability distribution
@@ -2695,12 +2818,10 @@ function estDistrictCompetitiveness(Vf, bCompress = false) {
     const dC = (0, method_1.estDistrictResponsiveness)(_normalizer.wipNum);
     return dC;
 }
-exports.estDistrictCompetitiveness = estDistrictCompetitiveness;
 // cD% - The estimated # of competitive districts, as a fraction of N
 function estCompetitiveDistrictsShare(cD, N) {
     return cD / N;
 }
-exports.estCompetitiveDistrictsShare = estCompetitiveDistrictsShare;
 // Md - The estimated # of "marginal" districts in and around the likely FPTP
 //   seats & the best seat split that are competitive.
 function estMarginalCompetitiveDistricts(Mrange, VfArray, bCompress = false) {
@@ -2713,7 +2834,6 @@ function estMarginalCompetitiveDistricts(Mrange, VfArray, bCompress = false) {
     const Md = U.sumArray(subsetVfArray.map((v) => estDistrictCompetitiveness(v, bCompress)));
     return Md;
 }
-exports.estMarginalCompetitiveDistricts = estMarginalCompetitiveDistricts;
 // Md% - The estimated competitiveness of the "marginal" districts in and around
 //   the likely FPTP seats & the best seat split as a fraction
 function estMarginalCompetitiveShare(Md, Mrange) {
@@ -2723,7 +2843,6 @@ function estMarginalCompetitiveShare(Md, Mrange) {
     const MdShare = estCompetitiveDistrictsShare(Md, maxId - minId + 1);
     return MdShare;
 }
-exports.estMarginalCompetitiveShare = estMarginalCompetitiveShare;
 function findMarginalDistricts(Vf, VfArray, N) {
     const bestS = (0, bias_1.bestSeats)(N, Vf);
     const fptpS = (0, method_1.estFPTPSeats)(VfArray);
@@ -2745,7 +2864,6 @@ function findMarginalDistricts(Vf, VfArray, N) {
     }
     return [minId, maxId];
 }
-exports.findMarginalDistricts = findMarginalDistricts;
 
 
 /***/ }),
@@ -2778,6 +2896,16 @@ __exportStar(__webpack_require__(/*! ./normalize */ "./lib/rate/normalize.ts"),
 __exportStar(__webpack_require__(/*! ./settings */ "./lib/rate/settings.ts"), exports);
 
 
+/***/ }),
+
+/***/ "./lib/rate/dra-config.json":
+/*!**********************************!*\
+  !*** ./lib/rate/dra-config.json ***!
+  \**********************************/
+/***/ ((module) => {
+
+module.exports = /*#__PURE__*/JSON.parse('{"partisan":{"bias":{"range":[0,0.2]},"competitiveness":{"range":[0,0.75],"distribution":[0.25,0.75],"simpleRange":[0.45,0.55],"weight":[0,20]},"bonus":2},"minority":{"range":[0.37,0.5],"distribution":[0.25,0.75],"shift":[0.15,0.5],"coalition":{"weight":0.5}},"compactness":{"reock":{"range":[0.25,0.5],"weight":50},"polsby":{"range":[0.1,0.5],"weight":50}},"splitting":{"county":{"range":[[1.26,1.68],[1.09,1.45]],"weight":50},"district":{"range":[[1.26,1.68],[1.09,1.45]],"weight":50}},"popdev":{"range":[[0.0075,0.002],[0.1,-1]]}}');
+
 /***/ }),
 
 /***/ "./lib/rate/dra-config.ts":
@@ -2794,7 +2922,27 @@ __exportStar(__webpack_require__(/*! ./settings */ "./lib/rate/settings.ts"), ex
 //   That is not implemented yet.
 //
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.popdevThreshold = exports.popdevRange = exports.districtSplittingRange = exports.districtSplittingWeight = exports.countySplittingRange = exports.countySplittingWeight = exports.polsbyRange = exports.polsbyWeight = exports.reockRange = exports.reockWeight = exports.coalitionDistrictWeight = exports.minorityShiftDilution = exports.minorityShift = exports.minorityOpportunityDistribution = exports.minorityOpportunityRange = exports.overallCompetitivenessRange = exports.competitiveDistribution = exports.competitiveRange = exports.winnerBonus = exports.biasRange = exports.END = exports.BEG = void 0;
+exports.END = exports.BEG = void 0;
+exports.biasRange = biasRange;
+exports.winnerBonus = winnerBonus;
+exports.competitiveRange = competitiveRange;
+exports.competitiveDistribution = competitiveDistribution;
+exports.overallCompetitivenessRange = overallCompetitivenessRange;
+exports.minorityOpportunityRange = minorityOpportunityRange;
+exports.minorityOpportunityDistribution = minorityOpportunityDistribution;
+exports.minorityShift = minorityShift;
+exports.minorityShiftDilution = minorityShiftDilution;
+exports.coalitionDistrictWeight = coalitionDistrictWeight;
+exports.reockWeight = reockWeight;
+exports.reockRange = reockRange;
+exports.polsbyWeight = polsbyWeight;
+exports.polsbyRange = polsbyRange;
+exports.countySplittingWeight = countySplittingWeight;
+exports.countySplittingRange = countySplittingRange;
+exports.districtSplittingWeight = districtSplittingWeight;
+exports.districtSplittingRange = districtSplittingRange;
+exports.popdevRange = popdevRange;
+exports.popdevThreshold = popdevThreshold;
 const config = __webpack_require__(/*! ./dra-config.json */ "./lib/rate/dra-config.json");
 exports.BEG = 0;
 exports.END = 1;
@@ -2803,23 +2951,19 @@ function biasRange(overridesJSON) {
     const range = config.partisan.bias.range;
     return range;
 }
-exports.biasRange = biasRange;
 function winnerBonus(overridesJSON) {
     const bonus = config.partisan.bonus;
     return bonus;
 }
-exports.winnerBonus = winnerBonus;
 // The simple user-facing range, i.e., 45–55%.
 function competitiveRange(overridesJSON) {
     const range = config.partisan.competitiveness.simpleRange;
     return range;
 }
-exports.competitiveRange = competitiveRange;
 function competitiveDistribution(overridesJSON) {
     const dist = config.partisan.competitiveness.distribution;
     return dist;
 }
-exports.competitiveDistribution = competitiveDistribution;
 // The more complex internal range for normalizing Cdf.
 // * 06/23/2020 - As part of relaxing the competitive range, I changed this max
 //   from 0.67 to 0.75.
@@ -2827,7 +2971,6 @@ function overallCompetitivenessRange(overridesJSON) {
     const range = config.partisan.competitiveness.range;
     return range;
 }
-exports.overallCompetitivenessRange = overallCompetitivenessRange;
 // export function marginalCompetitivenessRange(overridesJSON?: any): number[]
 // {
 //   const range = config.partisan.responsiveness.marginal.range;
@@ -2848,73 +2991,60 @@ function minorityOpportunityRange(overridesJSON) {
     const range = config.minority.range;
     return range;
 }
-exports.minorityOpportunityRange = minorityOpportunityRange;
 function minorityOpportunityDistribution(overridesJSON) {
     const dist = config.minority.distribution;
     return dist;
 }
-exports.minorityOpportunityDistribution = minorityOpportunityDistribution;
 // For Black VAP %
 function minorityShift(overridesJSON) {
     const BLACK = 0;
     const shift = config.minority.shift[BLACK];
     return shift;
 }
-exports.minorityShift = minorityShift;
 // Dilution for other demos
 function minorityShiftDilution(overridesJSON) {
     const DILUTION = 1;
     const shift = config.minority.shift[DILUTION];
     return shift;
 }
-exports.minorityShiftDilution = minorityShiftDilution;
 function coalitionDistrictWeight(overridesJSON) {
     const weight = config.minority.coalition.weight;
     return weight;
 }
-exports.coalitionDistrictWeight = coalitionDistrictWeight;
 // COMPACTNESS
 function reockWeight(overridesJSON) {
     const rW = config.compactness.reock.weight;
     return rW;
 }
-exports.reockWeight = reockWeight;
 function reockRange(overridesJSON) {
     const range = config.compactness.reock.range;
     return range;
 }
-exports.reockRange = reockRange;
 function polsbyWeight(overridesJSON) {
     const ppW = config.compactness.polsby.weight;
     return ppW;
 }
-exports.polsbyWeight = polsbyWeight;
 function polsbyRange(overridesJSON) {
     const range = config.compactness.polsby.range;
     return range;
 }
-exports.polsbyRange = polsbyRange;
 // SPLITTING
 function countySplittingWeight(overridesJSON) {
     const csW = config.splitting.county.weight;
     return csW;
 }
-exports.countySplittingWeight = countySplittingWeight;
 function countySplittingRange(d, overridesJSON) {
     const range = config.splitting.county.range[d];
     return range;
 }
-exports.countySplittingRange = countySplittingRange;
 function districtSplittingWeight(overridesJSON) {
     const dsW = config.splitting.district.weight;
     return dsW;
 }
-exports.districtSplittingWeight = districtSplittingWeight;
 function districtSplittingRange(d, overridesJSON) {
     const range = config.splitting.district.range[d];
     return range;
 }
-exports.districtSplittingRange = districtSplittingRange;
 // NOTE - Raw ranges, not inverted (i.e., smaller is better)
 // NOTE - This could be optimized to not calc LD values for CD's (or do it once)
 function popdevRange(bLegislative, overridesJSON) {
@@ -2928,13 +3058,11 @@ function popdevRange(bLegislative, overridesJSON) {
     // Invert the range, so bigger is better.
     return [worst, best];
 }
-exports.popdevRange = popdevRange;
 // NOTE - Raw threshold, not inverted (i.e., smaller is better)
 function popdevThreshold(bLegislative, overridesJSON) {
     const threshold = popdevRange(bLegislative)[exports.BEG];
     return threshold;
 }
-exports.popdevThreshold = popdevThreshold;
 
 
 /***/ }),
@@ -2965,15 +3093,47 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.adjustSplittingRating = exports.rateSplittingLegacy = exports.rateDistrictSplittingLegacy = exports.countySplitWorst = exports.countySplitBest = exports.rateCountySplittingLegacy = exports.rateSplitting = exports.rateDistrictSplitting = exports.rateCountySplitting = exports.bestTarget = exports.worstMultiplier = exports.minSplitting = exports.maxSplitting = exports.rateCompactness = exports.ratePolsby = exports.rateReock = exports.rateMinorityRepresentation = exports.rateCompetitiveness = exports.normalizePartisanBias = exports.ratePartisanBias = exports.isAntimajoritarian = exports.adjustDeviation = exports.extraBonus = exports.rateProportionality = exports.ratePopulationDeviation = void 0;
+exports.worstMultiplier = exports.minSplitting = exports.maxSplitting = void 0;
+exports.ratePopulationDeviation = ratePopulationDeviation;
+exports.rateProportionality = rateProportionality;
+exports.extraBonus = extraBonus;
+exports.adjustDeviation = adjustDeviation;
+exports.isAntimajoritarian = isAntimajoritarian;
+exports.ratePartisanBias = ratePartisanBias;
+exports.normalizePartisanBias = normalizePartisanBias;
+exports.rateCompetitiveness = rateCompetitiveness;
+exports.rateMinorityRepresentation = rateMinorityRepresentation;
+exports.rateReock = rateReock;
+exports.ratePolsby = ratePolsby;
+exports.rateCompactness = rateCompactness;
+exports.bestTarget = bestTarget;
+exports.rateCountySplitting = rateCountySplitting;
+exports.rateDistrictSplitting = rateDistrictSplitting;
+exports.rateSplitting = rateSplitting;
+exports.rateCountySplittingLegacy = rateCountySplittingLegacy;
+exports.countySplitBest = countySplitBest;
+exports.countySplitWorst = countySplitWorst;
+exports.rateDistrictSplittingLegacy = rateDistrictSplittingLegacy;
+exports.rateSplittingLegacy = rateSplittingLegacy;
+exports.adjustSplittingRating = adjustSplittingRating;
 const C = __importStar(__webpack_require__(/*! ./dra-config */ "./lib/rate/dra-config.ts"));
 const normalize_1 = __webpack_require__(/*! ../rate/normalize */ "./lib/rate/normalize.ts");
 const method_1 = __webpack_require__(/*! ../partisan/method */ "./lib/partisan/method.ts");
@@ -2990,7 +3150,6 @@ function ratePopulationDeviation(rawDeviation, bLegislative) {
     _normalizer.rescale();
     return _normalizer.normalizedNum;
 }
-exports.ratePopulationDeviation = ratePopulationDeviation;
 // RATE PROPORTIONALITY
 function rateProportionality(rawDisproportionality, Vf, Sf) {
     if (isAntimajoritarian(Vf, Sf)) {
@@ -3013,13 +3172,11 @@ function rateProportionality(rawDisproportionality, Vf, Sf) {
         return rating;
     }
 }
-exports.rateProportionality = rateProportionality;
 function extraBonus(Vf) {
     const over50Pct = (Vf > 0.5) ? (Vf - 0.5) : (0.5 - Vf);
     const okExtra = over50Pct * (C.winnerBonus() - 1.0);
     return okExtra; // No longer trimming the result here
 }
-exports.extraBonus = extraBonus;
 // Adjust deviation from proportionality to account for a winner's bonus
 // * If the bias is in the *same* direction as the statewide vote %, then
 //   discount the bias by the winner's bonus (extra).
@@ -3035,13 +3192,11 @@ function adjustDeviation(Vf, disproportionality, extra) {
     }
     return adjusted;
 }
-exports.adjustDeviation = adjustDeviation;
 function isAntimajoritarian(Vf, Sf) {
     const bDem = ((Vf < (0.5 - method_1.avgSVError)) && (Sf > 0.5)) ? true : false;
     const bRep = (((1 - Vf) < (0.5 - method_1.avgSVError)) && ((1 - Sf) > 0.5)) ? true : false;
     return bDem || bRep;
 }
-exports.isAntimajoritarian = isAntimajoritarian;
 // RATE Impact == "unearned seats" <<< DEPRECATED
 /*
 export function scoreImpact(rawUE: number, Vf: number, Sf: number, N: number): number
@@ -3083,14 +3238,12 @@ function ratePartisanBias(rawSeatsBias, rawVotesBias) {
     const partisanBiasRating = Math.round((seatsBiasRating + votesBiasRating) / 2);
     return partisanBiasRating;
 }
-exports.ratePartisanBias = ratePartisanBias;
 // NOTE - John Nagle specified this function vs. simple linear normalization
 function normalizePartisanBias(biasPct, pctAt50) {
     const b = pctAt50 / Math.log(1 / 2);
     const rating = 100 * Math.exp(-Math.abs(biasPct / b));
     return Math.round(rating);
 }
-exports.normalizePartisanBias = normalizePartisanBias;
 // RATE COMPETITIVENESS
 // Normalize overall competitiveness - Raw values are in the range [0.0–1.0]. 
 // But the practical max is more like 3/4's, so unitize that range to [0.0–1.0].
@@ -3105,7 +3258,6 @@ function rateCompetitiveness(rawCdf) {
     const rating = _normalizer.normalizedNum;
     return rating;
 }
-exports.rateCompetitiveness = rateCompetitiveness;
 // RATE MINORITY REPRESENTATION
 // NOTE - The probable # of opportunity & coalition districts can be *larger* than
 //   what would be a proportional # based on the statewide percentage, because of
@@ -3122,7 +3274,6 @@ function rateMinorityRepresentation(rawOd, pOd, rawCd, pCd) {
     const rating = Math.round(Math.min(opportunityScore + cDWeight * Math.max(coalitionScore - opportunityScore, 0), 100));
     return rating;
 }
-exports.rateMinorityRepresentation = rateMinorityRepresentation;
 // RATE COMPACTNESS
 function rateReock(rawValue) {
     const _normalizer = new normalize_1.Normalizer(rawValue);
@@ -3133,7 +3284,6 @@ function rateReock(rawValue) {
     _normalizer.rescale();
     return _normalizer.normalizedNum;
 }
-exports.rateReock = rateReock;
 function ratePolsby(rawValue) {
     const _normalizer = new normalize_1.Normalizer(rawValue);
     const worst = C.polsbyRange()[C.BEG];
@@ -3143,14 +3293,12 @@ function ratePolsby(rawValue) {
     _normalizer.rescale();
     return _normalizer.normalizedNum;
 }
-exports.ratePolsby = ratePolsby;
 function rateCompactness(rS, ppS) {
     const rW = C.reockWeight();
     const ppW = C.polsbyWeight();
     const rating = Math.round(((rS * rW) + (ppS * ppW)) / (rW + ppW));
     return rating;
 }
-exports.rateCompactness = rateCompactness;
 // RATE SPLITTING
 exports.maxSplitting = 1.20; // 90–10 => 95–5 splits
 exports.minSplitting = 1.00; // No splits still vs. 97–03 splits
@@ -3164,7 +3312,6 @@ function bestTarget(n, m) {
     const target = (w1 * exports.maxSplitting) + (w2 * exports.minSplitting);
     return target;
 }
-exports.bestTarget = bestTarget;
 // Rating county- & district-splitting are inverses of each other.
 // Sometimes counties >> districts; sometimes counties << districts.
 function rateCountySplitting(rawCountySplitting, nCounties, nDistricts) {
@@ -3182,7 +3329,6 @@ function rateCountySplitting(rawCountySplitting, nCounties, nDistricts) {
         rating = 100 - 1;
     return rating;
 }
-exports.rateCountySplitting = rateCountySplitting;
 function rateDistrictSplitting(rawDistrictSplitting, nCounties, nDistricts) {
     const _normalizer = new normalize_1.Normalizer(rawDistrictSplitting);
     // The practical ideal raw measurement depends on the # of counties & districts
@@ -3198,7 +3344,6 @@ function rateDistrictSplitting(rawDistrictSplitting, nCounties, nDistricts) {
         rating = 100 - 1;
     return rating;
 }
-exports.rateDistrictSplitting = rateDistrictSplitting;
 function rateSplitting(csS, dsS) {
     const csW = C.countySplittingWeight();
     const dsW = C.districtSplittingWeight();
@@ -3209,7 +3354,6 @@ function rateSplitting(csS, dsS) {
         rating = 100 - 1;
     return rating;
 }
-exports.rateSplitting = rateSplitting;
 // RATE SPLITTING - Legacy routines for original splitting ratings that didn't handle state legislative maps properly
 function rateCountySplittingLegacy(rawCountySplitting, nCounties, nDistricts, bLD = false) {
     const _normalizer = new normalize_1.Normalizer(rawCountySplitting);
@@ -3226,7 +3370,6 @@ function rateCountySplittingLegacy(rawCountySplitting, nCounties, nDistricts, bL
         rating = 100 - 1;
     return rating;
 }
-exports.rateCountySplittingLegacy = rateCountySplittingLegacy;
 function countySplitBest(nCounties, nDistricts, bLD = false) {
     const districtType = (bLD) ? 1 /* T.DistrictType.StateLegislative */ : 0 /* T.DistrictType.Congressional */;
     const practicalBest = C.countySplittingRange(districtType)[C.BEG];
@@ -3234,7 +3377,6 @@ function countySplitBest(nCounties, nDistricts, bLD = false) {
     const threshold = ((nAllowableSplits * practicalBest) + ((nCounties - nAllowableSplits) * 1.0)) / nCounties;
     return threshold;
 }
-exports.countySplitBest = countySplitBest;
 function countySplitWorst(avgBest, bLD = false) {
     const districtType = (bLD) ? 1 /* T.DistrictType.StateLegislative */ : 0 /* T.DistrictType.Congressional */;
     const singleBest = C.countySplittingRange(districtType)[C.BEG];
@@ -3243,7 +3385,6 @@ function countySplitWorst(avgBest, bLD = false) {
     const avgWorst = avgBest * (singleWorst / singleBest);
     return avgWorst;
 }
-exports.countySplitWorst = countySplitWorst;
 function rateDistrictSplittingLegacy(rawDistrictSplitting, bLD = false) {
     const districtType = (bLD) ? 1 /* T.DistrictType.StateLegislative */ : 0 /* T.DistrictType.Congressional */;
     const _normalizer = new normalize_1.Normalizer(rawDistrictSplitting);
@@ -3259,21 +3400,18 @@ function rateDistrictSplittingLegacy(rawDistrictSplitting, bLD = false) {
         rating = 100 - 1;
     return rating;
 }
-exports.rateDistrictSplittingLegacy = rateDistrictSplittingLegacy;
 function rateSplittingLegacy(csS, dsS) {
     const csW = C.countySplittingWeight();
     const dsW = C.districtSplittingWeight();
     const rating = Math.round(((csS * csW) + (dsS * dsW)) / (csW + dsW));
     return rating;
 }
-exports.rateSplittingLegacy = rateSplittingLegacy;
 function adjustSplittingRating(rating, rawCountySplitting, rawDistrictSplitting) {
     // 09-07-21 - Preserve max value (100) for only when no districts are split
     if ((rating == 100) && ((rawCountySplitting > 1.0) || (rawDistrictSplitting > 1.0)))
         rating = 100 - 1;
     return rating;
 }
-exports.adjustSplittingRating = adjustSplittingRating;
 // END
 
 
@@ -3305,13 +3443,23 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
 exports.Normalizer = void 0;
 const S = __importStar(__webpack_require__(/*! ./settings */ "./lib/rate/settings.ts"));
@@ -3463,15 +3611,27 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.calcCOISplitting = exports.effectiveSplits = exports.uncertaintyOfMembership = void 0;
+exports.uncertaintyOfMembership = uncertaintyOfMembership;
+exports.effectiveSplits = effectiveSplits;
+exports.calcCOISplitting = calcCOISplitting;
 const U = __importStar(__webpack_require__(/*! ./utils */ "./lib/splitting/utils.ts"));
 function uncertaintyOfMembership(splits) {
     // 07-29-21 -- Filter out 0% splits
@@ -3481,7 +3641,6 @@ function uncertaintyOfMembership(splits) {
         result = 0;
     return result;
 }
-exports.uncertaintyOfMembership = uncertaintyOfMembership;
 function effectiveSplits(splits) {
     // 07-29-21 -- Filter out 0% splits
     const intermediate = splits.filter(x => x > 0).map(x => Math.pow(x, 2));
@@ -3490,7 +3649,6 @@ function effectiveSplits(splits) {
         result = 0;
     return result;
 }
-exports.effectiveSplits = effectiveSplits;
 // CLI & OTHER USERS  
 function calcCOISplitting(communities) {
     let byCOI = [];
@@ -3509,7 +3667,6 @@ function calcCOISplitting(communities) {
     };
     return analysis;
 }
-exports.calcCOISplitting = calcCOISplitting;
 
 
 /***/ }),
@@ -3540,15 +3697,43 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.calcSplitting = exports.districtSplitting = exports.districtSplitScore = exports.countySplitting = exports.countySplitScore = exports.splitScore = exports.calcDistrictFractions = exports.calcCountyFractions = exports.calcDistrictWeights = exports.calcCountyWeights = exports.reduceDSplits = exports.reduceCSplits = exports.totalDistricts = exports.totalCounties = exports._calcDistrictSplitting = exports._calcDistrictSplittingReduced = exports._calcCountySplitting = exports._calcCountySplittingReduced = exports.makeSplittingScorecard = void 0;
+exports.makeSplittingScorecard = makeSplittingScorecard;
+exports._calcCountySplittingReduced = _calcCountySplittingReduced;
+exports._calcCountySplitting = _calcCountySplitting;
+exports._calcDistrictSplittingReduced = _calcDistrictSplittingReduced;
+exports._calcDistrictSplitting = _calcDistrictSplitting;
+exports.totalCounties = totalCounties;
+exports.totalDistricts = totalDistricts;
+exports.reduceCSplits = reduceCSplits;
+exports.reduceDSplits = reduceDSplits;
+exports.calcCountyWeights = calcCountyWeights;
+exports.calcDistrictWeights = calcDistrictWeights;
+exports.calcCountyFractions = calcCountyFractions;
+exports.calcDistrictFractions = calcDistrictFractions;
+exports.splitScore = splitScore;
+exports.countySplitScore = countySplitScore;
+exports.countySplitting = countySplitting;
+exports.districtSplitScore = districtSplitScore;
+exports.districtSplitting = districtSplitting;
+exports.calcSplitting = calcSplitting;
 const U = __importStar(__webpack_require__(/*! ../utils/all */ "./lib/utils/all.ts"));
 function makeSplittingScorecard(CxD, bLog = false) {
     const dT = totalDistricts(CxD);
@@ -3563,7 +3748,6 @@ function makeSplittingScorecard(CxD, bLog = false) {
     };
     return s;
 }
-exports.makeSplittingScorecard = makeSplittingScorecard;
 // CALCULATE ENHANCED SQRT ENTROPY METRIC -- INTERNAL FUNCTIONS
 function _calcCountySplittingReduced(CxD, districtTotals, countyTotals, bLD = false) {
     const rC = reduceCSplits(CxD, districtTotals);
@@ -3572,14 +3756,12 @@ function _calcCountySplittingReduced(CxD, districtTotals, countyTotals, bLD = fa
     const rawSqEnt_DC = countySplitting(f, w);
     return rawSqEnt_DC;
 }
-exports._calcCountySplittingReduced = _calcCountySplittingReduced;
 function _calcCountySplitting(CxD, countyTotals, bLog = false) {
     const f = calcCountyFractions(CxD, countyTotals);
     const w = calcCountyWeights(countyTotals);
     const SqEnt_DC = countySplitting(f, w, bLog);
     return SqEnt_DC;
 }
-exports._calcCountySplitting = _calcCountySplitting;
 function _calcDistrictSplittingReduced(CxD, districtTotals, countyTotals, bLD = false) {
     const rD = reduceDSplits(CxD, countyTotals);
     const g = calcDistrictFractions(rD, districtTotals);
@@ -3587,14 +3769,12 @@ function _calcDistrictSplittingReduced(CxD, districtTotals, countyTotals, bLD =
     const rawSqEnt_CD = districtSplitting(g, x);
     return rawSqEnt_CD;
 }
-exports._calcDistrictSplittingReduced = _calcDistrictSplittingReduced;
 function _calcDistrictSplitting(CxD, districtTotals, bLog = false) {
     const g = calcDistrictFractions(CxD, districtTotals);
     const x = calcDistrictWeights(districtTotals);
     const SqEnt_CD = districtSplitting(g, x, bLog);
     return SqEnt_CD;
 }
-exports._calcDistrictSplitting = _calcDistrictSplitting;
 // HELPERS
 function totalCounties(CxD) {
     const nC = CxD[0].length;
@@ -3607,7 +3787,6 @@ function totalCounties(CxD) {
     }
     return cT;
 }
-exports.totalCounties = totalCounties;
 function totalDistricts(CxD) {
     const nC = CxD[0].length;
     const nD = CxD.length;
@@ -3619,7 +3798,6 @@ function totalDistricts(CxD) {
     }
     return dT;
 }
-exports.totalDistricts = totalDistricts;
 // NOTE - The county-district splits and the county & district totals may all,
 //   in general, be fractional/decimal numbers as opposed to integers, due to
 //   dissaggregation & re-aggregation. Hence, comparisons need to approximate
@@ -3647,7 +3825,6 @@ function reduceCSplits(CxD, districtTotals) {
     }
     return CxDreducedC;
 }
-exports.reduceCSplits = reduceCSplits;
 // Consolidate *whole counties* (w/in one district) LEFT into the dummy county 0,
 //   district by district.
 function reduceDSplits(CxD, countyTotals) {
@@ -3670,7 +3847,6 @@ function reduceDSplits(CxD, countyTotals) {
     }
     return CxDreducedD;
 }
-exports.reduceDSplits = reduceDSplits;
 function calcCountyWeights(countyTotals) {
     let nC = countyTotals.length;
     let cTotal = U.sumArray(countyTotals);
@@ -3680,7 +3856,6 @@ function calcCountyWeights(countyTotals) {
     }
     return w;
 }
-exports.calcCountyWeights = calcCountyWeights;
 function calcDistrictWeights(districtTotals) {
     let nD = districtTotals.length;
     let dTotal = U.sumArray(districtTotals);
@@ -3690,7 +3865,6 @@ function calcDistrictWeights(districtTotals) {
     }
     return x;
 }
-exports.calcDistrictWeights = calcDistrictWeights;
 function calcCountyFractions(CxD, countyTotals) {
     let nD = CxD.length;
     let nC = CxD[0].length;
@@ -3707,7 +3881,6 @@ function calcCountyFractions(CxD, countyTotals) {
     }
     return f;
 }
-exports.calcCountyFractions = calcCountyFractions;
 function calcDistrictFractions(CxD, districtTotals) {
     let nD = CxD.length;
     let nC = CxD[0].length;
@@ -3724,7 +3897,6 @@ function calcDistrictFractions(CxD, districtTotals) {
     }
     return g;
 }
-exports.calcDistrictFractions = calcDistrictFractions;
 function splitScore(splits) {
     let e;
     if (splits.length > 0) {
@@ -3735,7 +3907,6 @@ function splitScore(splits) {
     }
     return e;
 }
-exports.splitScore = splitScore;
 // For all districts in a county, sum the split score.
 function countySplitScore(j, f, bLog = false) {
     const numD = f.length;
@@ -3746,7 +3917,6 @@ function countySplitScore(j, f, bLog = false) {
     const score = splitScore(splits);
     return score;
 }
-exports.countySplitScore = countySplitScore;
 // For all counties, sum the weighted county splits.
 function countySplitting(f, w, bLog = false) {
     const numC = f[0].length;
@@ -3759,7 +3929,6 @@ function countySplitting(f, w, bLog = false) {
     }
     return e;
 }
-exports.countySplitting = countySplitting;
 // For all counties in a district, sum the split score.
 function districtSplitScore(i, g, bLog = false) {
     const numC = g[0].length;
@@ -3770,7 +3939,6 @@ function districtSplitScore(i, g, bLog = false) {
     const score = splitScore(splits);
     return score;
 }
-exports.districtSplitScore = districtSplitScore;
 // For all districts, sum the weighted district splits.
 function districtSplitting(g, x, bLog = false) {
     const numD = g.length;
@@ -3783,7 +3951,6 @@ function districtSplitting(g, x, bLog = false) {
     }
     return e;
 }
-exports.districtSplitting = districtSplitting;
 // CLI & OTHER USERS
 function calcSplitting(CxD) {
     const dT = totalDistricts(CxD);
@@ -3796,7 +3963,6 @@ function calcSplitting(CxD) {
     };
     return out;
 }
-exports.calcSplitting = calcSplitting;
 
 
 /***/ }),
@@ -3809,11 +3975,10 @@ exports.calcSplitting = calcSplitting;
 
 
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.isMinusZero = void 0;
+exports.isMinusZero = isMinusZero;
 function isMinusZero(value) {
     return 1 / value === -Infinity;
 }
-exports.isMinusZero = isMinusZero;
 
 
 /***/ }),
@@ -3873,32 +4038,46 @@ var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (
 }) : 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;
-};
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.isObjectEmpty = exports.keyExists = exports.isArrayEmpty = exports.initArray = exports.medianArray = exports.maxArray = exports.minArray = exports.avgArray = exports.sumArray = void 0;
+exports.sumArray = sumArray;
+exports.avgArray = avgArray;
+exports.minArray = minArray;
+exports.maxArray = maxArray;
+exports.medianArray = medianArray;
+exports.initArray = initArray;
+exports.isArrayEmpty = isArrayEmpty;
+exports.keyExists = keyExists;
+exports.isObjectEmpty = isObjectEmpty;
 const U = __importStar(__webpack_require__(/*! ./general */ "./lib/utils/general.ts"));
 function sumArray(arr) {
     return arr.reduce((a, b) => a + b, 0);
 }
-exports.sumArray = sumArray;
 function avgArray(arr) {
     return (arr.reduce((a, b) => a + b, 0)) / arr.length;
 }
-exports.avgArray = avgArray;
 function minArray(arr) {
     return Math.min(...arr);
 }
-exports.minArray = minArray;
 function maxArray(arr) {
     return Math.max(...arr);
 }
-exports.maxArray = maxArray;
 // Modified from https://jsfiddle.net/Lucky500/3sy5au0c/
 // NOTE - Copy the array, because arr.sort() sorts in place!
 function medianArray(arr) {
@@ -3913,25 +4092,20 @@ function medianArray(arr) {
         return copyArr[half];
     return (copyArr[half - 1] + copyArr[half]) / 2.0;
 }
-exports.medianArray = medianArray;
 function initArray(n, value) {
     return Array.from(Array(n), () => value);
 }
-exports.initArray = initArray;
 function isArrayEmpty(a) {
     if (a === undefined || a.length == 0)
         return true;
     return false;
 }
-exports.isArrayEmpty = isArrayEmpty;
 function keyExists(k, o) {
     return k in o;
 }
-exports.keyExists = keyExists;
 function isObjectEmpty(o) {
     return Object.keys(o).length === 0;
 }
-exports.isObjectEmpty = isObjectEmpty;
 
 
 /***/ }),
@@ -3947,14 +4121,14 @@ exports.isObjectEmpty = isObjectEmpty;
 // GENERAL UTILITIES
 //
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-exports.deepCopy = exports.areRoughlyEqual = void 0;
+exports.areRoughlyEqual = areRoughlyEqual;
+exports.deepCopy = deepCopy;
 // Deal with decimal census "counts" due to disagg/re-agg
 function areRoughlyEqual(x, y, tolerance) {
     let delta = Math.abs(x - y);
     let result = (delta < tolerance) ? true : false;
     return result;
 }
-exports.areRoughlyEqual = areRoughlyEqual;
 function deepCopy(src) {
     if (Array.isArray(src)) {
         let dst = [];
@@ -3972,7 +4146,6 @@ function deepCopy(src) {
     else
         return src;
 }
-exports.deepCopy = deepCopy;
 
 
 /***/ }),
@@ -4006,16 +4179,6 @@ exports.EQUAL_TOLERANCE = exports.AVERAGE_BLOCK_SIZE / 2;
 
 module.exports = require("@dra2020/baseclient");
 
-/***/ }),
-
-/***/ "./lib/rate/dra-config.json":
-/*!**********************************!*\
-  !*** ./lib/rate/dra-config.json ***!
-  \**********************************/
-/***/ ((module) => {
-
-module.exports = JSON.parse('{"partisan":{"bias":{"range":[0,0.2]},"competitiveness":{"range":[0,0.75],"distribution":[0.25,0.75],"simpleRange":[0.45,0.55],"weight":[0,20]},"bonus":2},"minority":{"range":[0.37,0.5],"distribution":[0.25,0.75],"shift":[0.15,0.5],"coalition":{"weight":0.5}},"compactness":{"reock":{"range":[0.25,0.5],"weight":50},"polsby":{"range":[0.1,0.5],"weight":50}},"splitting":{"county":{"range":[[1.26,1.68],[1.09,1.45]],"weight":50},"district":{"range":[[1.26,1.68],[1.09,1.45]],"weight":50}},"popdev":{"range":[[0.0075,0.002],[0.1,-1]]}}');
-
 /***/ })
 
 /******/ 	});