formulab 0.1.0

package/dist/logistics/pickTime.d.ts

@@ -0,0 +1,17 @@
+import type { PickTimeInput, PickTimeResult } from './types.js';
+/**
+ * Calculate warehouse pick time per order
+ *
+ * Pick time is a key metric for warehouse productivity. It includes:
+ * - Travel time: walking between pick locations
+ * - Search time: locating items at the pick face
+ * - Pick time: physically retrieving items
+ * - Documentation time: scanning, confirming, paperwork
+ *
+ * Batch picking can reduce travel time by combining multiple orders.
+ *
+ * @param input - Pick time parameters
+ * @returns Pick time breakdown and productivity metrics
+ */
+export declare function pickTime(input: PickTimeInput): PickTimeResult;
+//# sourceMappingURL=pickTime.d.ts.map

package/dist/logistics/pickTime.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pickTime.d.ts","sourceRoot":"","sources":["../../src/logistics/pickTime.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAEhE;;;;;;;;;;;;;GAaG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,aAAa,GAAG,cAAc,CAqE7D"}

package/dist/logistics/pickTime.js

@@ -0,0 +1,70 @@
+import { roundTo } from '../utils.js';
+/**
+ * Calculate warehouse pick time per order
+ *
+ * Pick time is a key metric for warehouse productivity. It includes:
+ * - Travel time: walking between pick locations
+ * - Search time: locating items at the pick face
+ * - Pick time: physically retrieving items
+ * - Documentation time: scanning, confirming, paperwork
+ *
+ * Batch picking can reduce travel time by combining multiple orders.
+ *
+ * @param input - Pick time parameters
+ * @returns Pick time breakdown and productivity metrics
+ */
+export function pickTime(input) {
+    const { mode, distance, speed, itemsPerOrder, searchTimePerItem, pickTimePerItem, documentationTime, batchSize = 1, } = input;
+    // Handle zero/invalid inputs
+    if (speed <= 0 || itemsPerOrder <= 0) {
+        return {
+            travelTime: 0,
+            searchTime: 0,
+            pickTime: 0,
+            documentationTime: 0,
+            totalTime: 0,
+            totalTimeMinutes: 0,
+            ordersPerHour: 0,
+        };
+    }
+    // Calculate base times
+    // Travel time = distance / speed, convert to seconds (speed is per minute)
+    const baseTravelTime = (distance / speed) * 60;
+    // Search and pick times scale with items
+    const baseSearchTime = itemsPerOrder * searchTimePerItem;
+    const basePickTime = itemsPerOrder * pickTimePerItem;
+    let travelTime;
+    let searchTime;
+    let pick;
+    let docTime;
+    if (mode === 'batch' && batchSize > 1) {
+        // Batch picking: share travel time across orders in batch
+        // Assume travel time is shared but search/pick is per order
+        // Documentation is per order
+        travelTime = baseTravelTime / batchSize;
+        searchTime = baseSearchTime; // Per order
+        pick = basePickTime; // Per order
+        docTime = documentationTime; // Per order
+    }
+    else {
+        // Single order picking
+        travelTime = baseTravelTime;
+        searchTime = baseSearchTime;
+        pick = basePickTime;
+        docTime = documentationTime;
+    }
+    const totalTime = travelTime + searchTime + pick + docTime;
+    const totalTimeMinutes = totalTime / 60;
+    // Orders per hour calculation
+    const ordersPerHour = totalTime > 0 ? 3600 / totalTime : 0;
+    return {
+        travelTime: roundTo(travelTime, 1),
+        searchTime: roundTo(searchTime, 1),
+        pickTime: roundTo(pick, 1),
+        documentationTime: roundTo(docTime, 1),
+        totalTime: roundTo(totalTime, 1),
+        totalTimeMinutes: roundTo(totalTimeMinutes, 2),
+        ordersPerHour: roundTo(ordersPerHour, 1),
+    };
+}
+//# sourceMappingURL=pickTime.js.map

package/dist/logistics/pickTime.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pickTime.js","sourceRoot":"","sources":["../../src/logistics/pickTime.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAGtC;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAoB;IAC3C,MAAM,EACJ,IAAI,EACJ,QAAQ,EACR,KAAK,EACL,aAAa,EACb,iBAAiB,EACjB,eAAe,EACf,iBAAiB,EACjB,SAAS,GAAG,CAAC,GACd,GAAG,KAAK,CAAC;IAEV,6BAA6B;IAC7B,IAAI,KAAK,IAAI,CAAC,IAAI,aAAa,IAAI,CAAC,EAAE,CAAC;QACrC,OAAO;YACL,UAAU,EAAE,CAAC;YACb,UAAU,EAAE,CAAC;YACb,QAAQ,EAAE,CAAC;YACX,iBAAiB,EAAE,CAAC;YACpB,SAAS,EAAE,CAAC;YACZ,gBAAgB,EAAE,CAAC;YACnB,aAAa,EAAE,CAAC;SACjB,CAAC;IACJ,CAAC;IAED,uBAAuB;IACvB,2EAA2E;IAC3E,MAAM,cAAc,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;IAE/C,yCAAyC;IACzC,MAAM,cAAc,GAAG,aAAa,GAAG,iBAAiB,CAAC;IACzD,MAAM,YAAY,GAAG,aAAa,GAAG,eAAe,CAAC;IAErD,IAAI,UAAkB,CAAC;IACvB,IAAI,UAAkB,CAAC;IACvB,IAAI,IAAY,CAAC;IACjB,IAAI,OAAe,CAAC;IAEpB,IAAI,IAAI,KAAK,OAAO,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QACtC,0DAA0D;QAC1D,4DAA4D;QAC5D,6BAA6B;QAC7B,UAAU,GAAG,cAAc,GAAG,SAAS,CAAC;QACxC,UAAU,GAAG,cAAc,CAAC,CAAC,YAAY;QACzC,IAAI,GAAG,YAAY,CAAC,CAAC,YAAY;QACjC,OAAO,GAAG,iBAAiB,CAAC,CAAC,YAAY;IAC3C,CAAC;SAAM,CAAC;QACN,uBAAuB;QACvB,UAAU,GAAG,cAAc,CAAC;QAC5B,UAAU,GAAG,cAAc,CAAC;QAC5B,IAAI,GAAG,YAAY,CAAC;QACpB,OAAO,GAAG,iBAAiB,CAAC;IAC9B,CAAC;IAED,MAAM,SAAS,GAAG,UAAU,GAAG,UAAU,GAAG,IAAI,GAAG,OAAO,CAAC;IAC3D,MAAM,gBAAgB,GAAG,SAAS,GAAG,EAAE,CAAC;IAExC,8BAA8B;IAC9B,MAAM,aAAa,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3D,OAAO;QACL,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;QAClC,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;QAClC,QAAQ,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;QAC1B,iBAAiB,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;QACtC,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;QAChC,gBAAgB,EAAE,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAAC;QAC9C,aAAa,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;KACzC,CAAC;AACJ,CAAC"}

package/dist/logistics/safetyStock.d.ts

@@ -0,0 +1,24 @@
+import type { SafetyStockInput, SafetyStockResult } from './types.js';
+/**
+ * Calculate Safety Stock and Reorder Point
+ *
+ * Safety Stock provides a buffer against variability in demand and lead time.
+ *
+ * Formula:
+ *   σ_DDLT = sqrt(L × σ_d² + d² × σ_L²)
+ *   Safety Stock = z × σ_DDLT
+ *   ROP = (d × L) + Safety Stock
+ *
+ * Where:
+ *   d = average daily demand
+ *   σ_d = standard deviation of daily demand
+ *   L = average lead time (days)
+ *   σ_L = standard deviation of lead time
+ *   z = z-score for desired service level
+ *   σ_DDLT = standard deviation of demand during lead time
+ *
+ * @param input - Demand and lead time parameters with service level
+ * @returns Safety stock, reorder point, and related metrics
+ */
+export declare function safetyStock(input: SafetyStockInput): SafetyStockResult;
+//# sourceMappingURL=safetyStock.d.ts.map

package/dist/logistics/safetyStock.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"safetyStock.d.ts","sourceRoot":"","sources":["../../src/logistics/safetyStock.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AA6DtE;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,gBAAgB,GAAG,iBAAiB,CA2BtE"}

package/dist/logistics/safetyStock.js

@@ -0,0 +1,99 @@
+import { roundTo } from '../utils.js';
+/**
+ * Approximate inverse of the standard normal CDF (quantile function)
+ * Using Abramowitz & Stegun 26.2.23 rational approximation
+ *
+ * @param p - Probability (0 < p < 1)
+ * @returns z-score (standard normal quantile)
+ */
+function normSInv(p) {
+    // Coefficients for the rational approximation
+    const a1 = -3.969683028665376e+01;
+    const a2 = 2.209460984245205e+02;
+    const a3 = -2.759285104469687e+02;
+    const a4 = 1.383577518672690e+02;
+    const a5 = -3.066479806614716e+01;
+    const a6 = 2.506628277459239e+00;
+    const b1 = -5.447609879822406e+01;
+    const b2 = 1.615858368580409e+02;
+    const b3 = -1.556989798598866e+02;
+    const b4 = 6.680131188771972e+01;
+    const b5 = -1.328068155288572e+01;
+    const c1 = -7.784894002430293e-03;
+    const c2 = -3.223964580411365e-01;
+    const c3 = -2.400758277161838e+00;
+    const c4 = -2.549732539343734e+00;
+    const c5 = 4.374664141464968e+00;
+    const c6 = 2.938163982698783e+00;
+    const d1 = 7.784695709041462e-03;
+    const d2 = 3.224671290700398e-01;
+    const d3 = 2.445134137142996e+00;
+    const d4 = 3.754408661907416e+00;
+    // Define break-points
+    const pLow = 0.02425;
+    const pHigh = 1 - pLow;
+    let q, r;
+    if (p < pLow) {
+        // Rational approximation for lower region
+        q = Math.sqrt(-2 * Math.log(p));
+        return (((((c1 * q + c2) * q + c3) * q + c4) * q + c5) * q + c6) /
+            ((((d1 * q + d2) * q + d3) * q + d4) * q + 1);
+    }
+    else if (p <= pHigh) {
+        // Rational approximation for central region
+        q = p - 0.5;
+        r = q * q;
+        return (((((a1 * r + a2) * r + a3) * r + a4) * r + a5) * r + a6) * q /
+            (((((b1 * r + b2) * r + b3) * r + b4) * r + b5) * r + 1);
+    }
+    else {
+        // Rational approximation for upper region
+        q = Math.sqrt(-2 * Math.log(1 - p));
+        return -(((((c1 * q + c2) * q + c3) * q + c4) * q + c5) * q + c6) /
+            ((((d1 * q + d2) * q + d3) * q + d4) * q + 1);
+    }
+}
+/**
+ * Calculate Safety Stock and Reorder Point
+ *
+ * Safety Stock provides a buffer against variability in demand and lead time.
+ *
+ * Formula:
+ *   σ_DDLT = sqrt(L × σ_d² + d² × σ_L²)
+ *   Safety Stock = z × σ_DDLT
+ *   ROP = (d × L) + Safety Stock
+ *
+ * Where:
+ *   d = average daily demand
+ *   σ_d = standard deviation of daily demand
+ *   L = average lead time (days)
+ *   σ_L = standard deviation of lead time
+ *   z = z-score for desired service level
+ *   σ_DDLT = standard deviation of demand during lead time
+ *
+ * @param input - Demand and lead time parameters with service level
+ * @returns Safety stock, reorder point, and related metrics
+ */
+export function safetyStock(input) {
+    const { avgDemand, demandStdDev, avgLeadTime, leadTimeStdDev, serviceLevel } = input;
+    // Calculate z-score for the desired service level
+    const zScore = normSInv(serviceLevel);
+    // Average demand during lead time
+    const demandDuringLeadTime = avgDemand * avgLeadTime;
+    // Standard deviation of demand during lead time (DDLT)
+    // σ_DDLT = sqrt(L × σ_d² + d² × σ_L²)
+    const varianceDemand = avgLeadTime * (demandStdDev ** 2);
+    const varianceLeadTime = (avgDemand ** 2) * (leadTimeStdDev ** 2);
+    const stdDevDDLT = Math.sqrt(varianceDemand + varianceLeadTime);
+    // Safety Stock = z × σ_DDLT
+    const safetyStockValue = zScore * stdDevDDLT;
+    // Reorder Point = Average DDLT + Safety Stock
+    const reorderPoint = demandDuringLeadTime + safetyStockValue;
+    return {
+        zScore: roundTo(zScore, 6),
+        safetyStock: roundTo(safetyStockValue, 0),
+        reorderPoint: roundTo(reorderPoint, 0),
+        demandDuringLeadTime: roundTo(demandDuringLeadTime, 0),
+    };
+}
+//# sourceMappingURL=safetyStock.js.map

package/dist/logistics/safetyStock.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"safetyStock.js","sourceRoot":"","sources":["../../src/logistics/safetyStock.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAGtC;;;;;;GAMG;AACH,SAAS,QAAQ,CAAC,CAAS;IACzB,8CAA8C;IAC9C,MAAM,EAAE,GAAG,CAAC,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAI,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAG,CAAC,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAI,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAG,CAAC,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAI,qBAAqB,CAAC;IAElC,MAAM,EAAE,GAAG,CAAC,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAI,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAG,CAAC,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAI,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAG,CAAC,qBAAqB,CAAC;IAElC,MAAM,EAAE,GAAG,CAAC,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAG,CAAC,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAG,CAAC,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAG,CAAC,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAI,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAI,qBAAqB,CAAC;IAElC,MAAM,EAAE,GAAI,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAI,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAI,qBAAqB,CAAC;IAClC,MAAM,EAAE,GAAI,qBAAqB,CAAC;IAElC,sBAAsB;IACtB,MAAM,IAAI,GAAG,OAAO,CAAC;IACrB,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC;IAEvB,IAAI,CAAS,EAAE,CAAS,CAAC;IAEzB,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;QACb,0CAA0C;QAC1C,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;YACzD,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;SAAM,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,4CAA4C;QAC5C,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;QACZ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC;YAC7D,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAClE,CAAC;SAAM,CAAC;QACN,0CAA0C;QAC1C,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;YACzD,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,WAAW,CAAC,KAAuB;IACjD,MAAM,EAAE,SAAS,EAAE,YAAY,EAAE,WAAW,EAAE,cAAc,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC;IAErF,kDAAkD;IAClD,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;IAEtC,kCAAkC;IAClC,MAAM,oBAAoB,GAAG,SAAS,GAAG,WAAW,CAAC;IAErD,uDAAuD;IACvD,sCAAsC;IACtC,MAAM,cAAc,GAAG,WAAW,GAAG,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC;IACzD,MAAM,gBAAgB,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,cAAc,IAAI,CAAC,CAAC,CAAC;IAClE,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,GAAG,gBAAgB,CAAC,CAAC;IAEhE,4BAA4B;IAC5B,MAAM,gBAAgB,GAAG,MAAM,GAAG,UAAU,CAAC;IAE7C,8CAA8C;IAC9C,MAAM,YAAY,GAAG,oBAAoB,GAAG,gBAAgB,CAAC;IAE7D,OAAO;QACL,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAC1B,WAAW,EAAE,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAAC;QACzC,YAAY,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;QACtC,oBAAoB,EAAE,OAAO,CAAC,oBAAoB,EAAE,CAAC,CAAC;KACvD,CAAC;AACJ,CAAC"}

package/dist/logistics/shipping.d.ts

@@ -0,0 +1,16 @@
+import type { ShippingInput, ShippingResult } from './types.js';
+/**
+ * Calculate shipping cost estimate for different modes
+ *
+ * Supports multiple shipping modes:
+ * - Ocean FCL (Full Container Load): Fixed container rate
+ * - Ocean LCL (Less than Container Load): Per CBM or weight
+ * - Air Freight: Volumetric weight factor
+ * - Express Courier: Premium volumetric rates
+ * - Truck: Distance + weight based
+ *
+ * @param input - Shipment details
+ * @returns Cost estimate or null if invalid input
+ */
+export declare function shipping(input: ShippingInput): ShippingResult | null;
+//# sourceMappingURL=shipping.d.ts.map

package/dist/logistics/shipping.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shipping.d.ts","sourceRoot":"","sources":["../../src/logistics/shipping.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAEhE;;;;;;;;;;;;GAYG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,aAAa,GAAG,cAAc,GAAG,IAAI,CAsGpE"}

package/dist/logistics/shipping.js

@@ -0,0 +1,115 @@
+import { roundTo } from '../utils.js';
+/**
+ * Calculate shipping cost estimate for different modes
+ *
+ * Supports multiple shipping modes:
+ * - Ocean FCL (Full Container Load): Fixed container rate
+ * - Ocean LCL (Less than Container Load): Per CBM or weight
+ * - Air Freight: Volumetric weight factor
+ * - Express Courier: Premium volumetric rates
+ * - Truck: Distance + weight based
+ *
+ * @param input - Shipment details
+ * @returns Cost estimate or null if invalid input
+ */
+export function shipping(input) {
+    const { mode, weight, volume, distance } = input;
+    if (weight <= 0 || volume <= 0)
+        return null;
+    let volumetricWeight;
+    let estimatedCost;
+    let transitDays;
+    let notes;
+    switch (mode) {
+        case 'ocean_fcl': {
+            volumetricWeight = roundTo((volume * 1000) / 6, 2);
+            const base = 1500;
+            const extra = weight > 10000 ? (weight - 10000) * 0.5 : 0;
+            estimatedCost = roundTo(base + extra, 2);
+            transitDays = '20-40 days';
+            notes = 'Based on 20ft container. For 40ft, approximately double the base rate.';
+            break;
+        }
+        case 'ocean_lcl': {
+            volumetricWeight = roundTo((volume * 1000) / 6, 2);
+            const byCbm = volume * 50;
+            const byWeight = weight * 0.15;
+            estimatedCost = roundTo(Math.max(byCbm, byWeight, 100), 2);
+            transitDays = '25-45 days';
+            notes = 'Charged per CBM or per kg, whichever is higher. Minimum charge $100.';
+            break;
+        }
+        case 'air': {
+            volumetricWeight = roundTo(volume * 167, 2);
+            const chargeableWt = Math.max(weight, volumetricWeight);
+            estimatedCost = roundTo(chargeableWt * 3.5, 2);
+            transitDays = '3-7 days';
+            notes = 'Volumetric factor: 1 CBM = 167 kg. Rate: $3.50/kg chargeable weight.';
+            const result = {
+                mode: 'Air Freight',
+                chargeableWeight: roundTo(chargeableWt, 2),
+                volumetricWeight,
+                estimatedCost,
+                costPerKg: roundTo(estimatedCost / chargeableWt, 2),
+                transitDays,
+                notes,
+            };
+            return result;
+        }
+        case 'express': {
+            volumetricWeight = roundTo(volume * 200, 2);
+            const chargeableWt = Math.max(weight, volumetricWeight);
+            estimatedCost = roundTo(Math.max(chargeableWt * 8, 50), 2);
+            transitDays = '2-5 days';
+            notes = 'Volumetric factor: 1 CBM = 200 kg. Rate: $8/kg. Minimum charge $50.';
+            const result = {
+                mode: 'Express Courier',
+                chargeableWeight: roundTo(chargeableWt, 2),
+                volumetricWeight,
+                estimatedCost,
+                costPerKg: roundTo(estimatedCost / chargeableWt, 2),
+                transitDays,
+                notes,
+            };
+            return result;
+        }
+        case 'truck': {
+            if (distance == null || distance <= 0)
+                return null;
+            volumetricWeight = roundTo(volume * 333, 2);
+            const chargeableWt = Math.max(weight, volumetricWeight);
+            estimatedCost = roundTo(distance * 1.5 + weight * 0.02, 2);
+            const transitDaysNum = Math.max(1, Math.ceil(distance / 500));
+            transitDays = transitDaysNum === 1 ? '1 day' : `${transitDaysNum}-${transitDaysNum + 1} days`;
+            notes = `Rate: $1.50/km + $0.02/kg. Estimated ~${roundTo(distance / 500, 1)} driving days at 500 km/day.`;
+            const result = {
+                mode: 'Truck',
+                chargeableWeight: roundTo(chargeableWt, 2),
+                volumetricWeight,
+                estimatedCost,
+                costPerKg: roundTo(estimatedCost / chargeableWt, 2),
+                transitDays,
+                notes,
+            };
+            return result;
+        }
+        default:
+            return null;
+    }
+    // For ocean modes
+    const chargeableWeight = roundTo(Math.max(weight, volumetricWeight), 2);
+    const modeLabels = {
+        ocean_fcl: 'Ocean FCL (20ft)',
+        ocean_lcl: 'Ocean LCL',
+    };
+    return {
+        mode: modeLabels[mode] ?? mode,
+        chargeableWeight,
+        volumetricWeight,
+        estimatedCost,
+        costPerKg: roundTo(estimatedCost / chargeableWeight, 2),
+        transitDays,
+        notes,
+    };
+}
+//# sourceMappingURL=shipping.js.map

package/dist/logistics/shipping.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shipping.js","sourceRoot":"","sources":["../../src/logistics/shipping.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAGtC;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAoB;IAC3C,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAEjD,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAE5C,IAAI,gBAAwB,CAAC;IAC7B,IAAI,aAAqB,CAAC;IAC1B,IAAI,WAAmB,CAAC;IACxB,IAAI,KAAa,CAAC;IAElB,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,gBAAgB,GAAG,OAAO,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACnD,MAAM,IAAI,GAAG,IAAI,CAAC;YAClB,MAAM,KAAK,GAAG,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1D,aAAa,GAAG,OAAO,CAAC,IAAI,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,WAAW,GAAG,YAAY,CAAC;YAC3B,KAAK,GAAG,wEAAwE,CAAC;YACjF,MAAM;QACR,CAAC;QACD,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,gBAAgB,GAAG,OAAO,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACnD,MAAM,KAAK,GAAG,MAAM,GAAG,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,MAAM,GAAG,IAAI,CAAC;YAC/B,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3D,WAAW,GAAG,YAAY,CAAC;YAC3B,KAAK,GAAG,sEAAsE,CAAC;YAC/E,MAAM;QACR,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,gBAAgB,GAAG,OAAO,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;YAC5C,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;YACxD,aAAa,GAAG,OAAO,CAAC,YAAY,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;YAC/C,WAAW,GAAG,UAAU,CAAC;YACzB,KAAK,GAAG,sEAAsE,CAAC;YAC/E,MAAM,MAAM,GAAmB;gBAC7B,IAAI,EAAE,aAAa;gBACnB,gBAAgB,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;gBAC1C,gBAAgB;gBAChB,aAAa;gBACb,SAAS,EAAE,OAAO,CAAC,aAAa,GAAG,YAAY,EAAE,CAAC,CAAC;gBACnD,WAAW;gBACX,KAAK;aACN,CAAC;YACF,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,gBAAgB,GAAG,OAAO,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;YAC5C,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;YACxD,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3D,WAAW,GAAG,UAAU,CAAC;YACzB,KAAK,GAAG,qEAAqE,CAAC;YAC9E,MAAM,MAAM,GAAmB;gBAC7B,IAAI,EAAE,iBAAiB;gBACvB,gBAAgB,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;gBAC1C,gBAAgB;gBAChB,aAAa;gBACb,SAAS,EAAE,OAAO,CAAC,aAAa,GAAG,YAAY,EAAE,CAAC,CAAC;gBACnD,WAAW;gBACX,KAAK;aACN,CAAC;YACF,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,IAAI,QAAQ,IAAI,IAAI,IAAI,QAAQ,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YACnD,gBAAgB,GAAG,OAAO,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;YAC5C,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;YACxD,aAAa,GAAG,OAAO,CAAC,QAAQ,GAAG,GAAG,GAAG,MAAM,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC;YAC3D,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC;YAC9D,WAAW,GAAG,cAAc,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,cAAc,IAAI,cAAc,GAAG,CAAC,OAAO,CAAC;YAC9F,KAAK,GAAG,yCAAyC,OAAO,CAAC,QAAQ,GAAG,GAAG,EAAE,CAAC,CAAC,8BAA8B,CAAC;YAC1G,MAAM,MAAM,GAAmB;gBAC7B,IAAI,EAAE,OAAO;gBACb,gBAAgB,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;gBAC1C,gBAAgB;gBAChB,aAAa;gBACb,SAAS,EAAE,OAAO,CAAC,aAAa,GAAG,YAAY,EAAE,CAAC,CAAC;gBACnD,WAAW;gBACX,KAAK;aACN,CAAC;YACF,OAAO,MAAM,CAAC;QAChB,CAAC;QACD;YACE,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,kBAAkB;IAClB,MAAM,gBAAgB,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,gBAAgB,CAAC,EAAE,CAAC,CAAC,CAAC;IACxE,MAAM,UAAU,GAA2B;QACzC,SAAS,EAAE,kBAAkB;QAC7B,SAAS,EAAE,WAAW;KACvB,CAAC;IAEF,OAAO;QACL,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,IAAI;QAC9B,gBAAgB;QAChB,gBAAgB;QAChB,aAAa;QACb,SAAS,EAAE,OAAO,CAAC,aAAa,GAAG,gBAAgB,EAAE,CAAC,CAAC;QACvD,WAAW;QACX,KAAK;KACN,CAAC;AACJ,CAAC"}

package/dist/logistics/tsp.d.ts

@@ -0,0 +1,12 @@
+import type { TspInput, TspResult } from './types.js';
+/**
+ * Solve the Traveling Salesman Problem
+ *
+ * Uses nearest neighbor heuristic with 2-opt improvement.
+ * For small instances (<=10 nodes), also provides optimal solution via brute force.
+ *
+ * @param input - Array of nodes with x, y coordinates
+ * @returns Tour information and distances
+ */
+export declare function tsp(input: TspInput): TspResult | null;
+//# sourceMappingURL=tsp.d.ts.map

package/dist/logistics/tsp.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tsp.d.ts","sourceRoot":"","sources":["../../src/logistics/tsp.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAW,MAAM,YAAY,CAAC;AAyG/D;;;;;;;;GAQG;AACH,wBAAgB,GAAG,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,IAAI,CAoDrD"}

package/dist/logistics/tsp.js

@@ -0,0 +1,166 @@
+import { roundTo } from '../utils.js';
+/**
+ * Calculate Euclidean distance between two nodes
+ */
+function dist(a, b) {
+    return Math.sqrt((a.x - b.x) ** 2 + (a.y - b.y) ** 2);
+}
+/**
+ * Calculate total tour distance
+ */
+function tourDistance(nodes, tour) {
+    let d = 0;
+    for (let i = 0; i < tour.length; i++) {
+        d += dist(nodes[tour[i]], nodes[tour[(i + 1) % tour.length]]);
+    }
+    return d;
+}
+/**
+ * Nearest neighbor heuristic for TSP
+ */
+function nearestNeighbor(nodes, start) {
+    const n = nodes.length;
+    const visited = new Uint8Array(n);
+    const tour = [start];
+    visited[start] = 1;
+    for (let step = 1; step < n; step++) {
+        const current = tour[tour.length - 1];
+        let bestDist = Infinity;
+        let bestIdx = -1;
+        for (let j = 0; j < n; j++) {
+            if (!visited[j]) {
+                const d = dist(nodes[current], nodes[j]);
+                if (d < bestDist) {
+                    bestDist = d;
+                    bestIdx = j;
+                }
+            }
+        }
+        tour.push(bestIdx);
+        visited[bestIdx] = 1;
+    }
+    return tour;
+}
+/**
+ * 2-opt local improvement for TSP
+ */
+function twoOpt(nodes, tour) {
+    const n = tour.length;
+    const result = [...tour];
+    let improved = true;
+    while (improved) {
+        improved = false;
+        for (let i = 0; i < n - 1; i++) {
+            for (let j = i + 2; j < n; j++) {
+                if (i === 0 && j === n - 1)
+                    continue; // skip full reversal
+                const a = result[i], b = result[i + 1];
+                const c = result[j], d = result[(j + 1) % n];
+                const oldDist = dist(nodes[a], nodes[b]) + dist(nodes[c], nodes[d]);
+                const newDist = dist(nodes[a], nodes[c]) + dist(nodes[b], nodes[d]);
+                if (newDist < oldDist - 1e-10) {
+                    // reverse segment [i+1 .. j]
+                    let left = i + 1, right = j;
+                    while (left < right) {
+                        [result[left], result[right]] = [result[right], result[left]];
+                        left++;
+                        right--;
+                    }
+                    improved = true;
+                }
+            }
+        }
+    }
+    return result;
+}
+/**
+ * Brute force exact solution for small instances
+ */
+function bruteForce(nodes) {
+    if (nodes.length > 10)
+        return null;
+    const n = nodes.length;
+    const indices = Array.from({ length: n - 1 }, (_, i) => i + 1);
+    let bestDist = Infinity;
+    let bestTour = [];
+    // Generate all permutations of indices (nodes 1..n-1, starting from 0)
+    function permute(arr, l) {
+        if (l === arr.length) {
+            const tour = [0, ...arr];
+            const d = tourDistance(nodes, tour);
+            if (d < bestDist) {
+                bestDist = d;
+                bestTour = [...tour];
+            }
+            return;
+        }
+        for (let i = l; i < arr.length; i++) {
+            [arr[l], arr[i]] = [arr[i], arr[l]];
+            permute(arr, l + 1);
+            [arr[l], arr[i]] = [arr[i], arr[l]];
+        }
+    }
+    permute(indices, 0);
+    return { tour: bestTour, distance: bestDist };
+}
+/**
+ * Solve the Traveling Salesman Problem
+ *
+ * Uses nearest neighbor heuristic with 2-opt improvement.
+ * For small instances (<=10 nodes), also provides optimal solution via brute force.
+ *
+ * @param input - Array of nodes with x, y coordinates
+ * @returns Tour information and distances
+ */
+export function tsp(input) {
+    const { nodes } = input;
+    if (nodes.length < 2) {
+        if (nodes.length === 1)
+            return {
+                nnTour: [0], nnDistance: 0, optimizedTour: [0], optimizedDistance: 0,
+                improvementPercent: 0,
+            };
+        return null;
+    }
+    if (nodes.length === 2) {
+        return {
+            nnTour: [0, 1], nnDistance: roundTo(2 * dist(nodes[0], nodes[1]), 2),
+            optimizedTour: [0, 1], optimizedDistance: roundTo(2 * dist(nodes[0], nodes[1]), 2),
+            improvementPercent: 0,
+        };
+    }
+    // Try all starting points for NN, keep best
+    let bestNNTour = [];
+    let bestNNDist = Infinity;
+    for (let s = 0; s < nodes.length; s++) {
+        const tour = nearestNeighbor(nodes, s);
+        const d = tourDistance(nodes, tour);
+        if (d < bestNNDist) {
+            bestNNDist = d;
+            bestNNTour = tour;
+        }
+    }
+    // 2-opt improvement
+    const optimizedTour = twoOpt(nodes, bestNNTour);
+    const optimizedDistance = tourDistance(nodes, optimizedTour);
+    const improvementPercent = bestNNDist > 0
+        ? roundTo(((bestNNDist - optimizedDistance) / bestNNDist) * 100, 2)
+        : 0;
+    const result = {
+        nnTour: bestNNTour,
+        nnDistance: roundTo(bestNNDist, 2),
+        optimizedTour,
+        optimizedDistance: roundTo(optimizedDistance, 2),
+        improvementPercent,
+    };
+    // Brute force for small instances
+    const bf = bruteForce(nodes);
+    if (bf) {
+        result.optimalDistance = roundTo(bf.distance, 2);
+        result.optimalityGap = result.optimizedDistance > 0
+            ? roundTo(((optimizedDistance - bf.distance) / bf.distance) * 100, 2)
+            : 0;
+    }
+    return result;
+}
+//# sourceMappingURL=tsp.js.map

package/dist/logistics/tsp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tsp.js","sourceRoot":"","sources":["../../src/logistics/tsp.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAGtC;;GAEG;AACH,SAAS,IAAI,CAAC,CAAU,EAAE,CAAU;IAClC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxD,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,KAAgB,EAAE,IAAc;IACpD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,KAAgB,EAAE,KAAa;IACtD,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,IAAI,GAAa,CAAC,KAAK,CAAC,CAAC;IAC/B,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAEnB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtC,IAAI,QAAQ,GAAG,QAAQ,CAAC;QACxB,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC;oBAAC,QAAQ,GAAG,CAAC,CAAC;oBAAC,OAAO,GAAG,CAAC,CAAC;gBAAC,CAAC;YAClD,CAAC;QACH,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnB,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAS,MAAM,CAAC,KAAgB,EAAE,IAAc;IAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IACzB,IAAI,QAAQ,GAAG,IAAI,CAAC;IAEpB,OAAO,QAAQ,EAAE,CAAC;QAChB,QAAQ,GAAG,KAAK,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;oBAAE,SAAS,CAAC,qBAAqB;gBAC3D,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACvC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpE,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpE,IAAI,OAAO,GAAG,OAAO,GAAG,KAAK,EAAE,CAAC;oBAC9B,6BAA6B;oBAC7B,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;oBAC5B,OAAO,IAAI,GAAG,KAAK,EAAE,CAAC;wBACpB,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;wBAC9D,IAAI,EAAE,CAAC;wBAAC,KAAK,EAAE,CAAC;oBAClB,CAAC;oBACD,QAAQ,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CAAC,KAAgB;IAClC,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/D,IAAI,QAAQ,GAAG,QAAQ,CAAC;IACxB,IAAI,QAAQ,GAAa,EAAE,CAAC;IAE5B,uEAAuE;IACvE,SAAS,OAAO,CAAC,GAAa,EAAE,CAAS;QACvC,IAAI,CAAC,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC;YACrB,MAAM,IAAI,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;YACzB,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACpC,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC;gBAAC,QAAQ,GAAG,CAAC,CAAC;gBAAC,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;YAAC,CAAC;YACzD,OAAO;QACT,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACpC,OAAO,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACpB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACpB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,GAAG,CAAC,KAAe;IACjC,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;IACxB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;gBAC7B,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,CAAC;gBACpE,kBAAkB,EAAE,CAAC;aACtB,CAAC;QACF,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO;YACL,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,iBAAiB,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClF,kBAAkB,EAAE,CAAC;SACtB,CAAC;IACJ,CAAC;IAED,4CAA4C;IAC5C,IAAI,UAAU,GAAa,EAAE,CAAC;IAC9B,IAAI,UAAU,GAAG,QAAQ,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC;YAAC,UAAU,GAAG,CAAC,CAAC;YAAC,UAAU,GAAG,IAAI,CAAC;QAAC,CAAC;IAC5D,CAAC;IAED,oBAAoB;IACpB,MAAM,aAAa,GAAG,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IAChD,MAAM,iBAAiB,GAAG,YAAY,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;IAE7D,MAAM,kBAAkB,GAAG,UAAU,GAAG,CAAC;QACvC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,GAAG,iBAAiB,CAAC,GAAG,UAAU,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC,CAAC;IAEN,MAAM,MAAM,GAAc;QACxB,MAAM,EAAE,UAAU;QAClB,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;QAClC,aAAa;QACb,iBAAiB,EAAE,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAAC;QAChD,kBAAkB;KACnB,CAAC;IAEF,kCAAkC;IAClC,MAAM,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC7B,IAAI,EAAE,EAAE,CAAC;QACP,MAAM,CAAC,eAAe,GAAG,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,iBAAiB,GAAG,CAAC;YACjD,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;YACrE,CAAC,CAAC,CAAC,CAAC;IACR,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}