@osmix/shared 0.0.6 → 0.0.7

package/dist/relation-kind.js

@@ -0,0 +1,375 @@
+/**
+ * Relation kind detection and geometry building.
+ *
+ * Determines the semantic type of OSM relations (area, line, point, logic, super)
+ * based on their type tag and member structure. Also provides utilities for
+ * building geometries from relation members.
+ *
+ * @module
+ */
+/**
+ * Get the semantic kind of a relation based on its type tag.
+ * Based on [OSM relation documentation](https://wiki.openstreetmap.org/wiki/Relation):
+ * - Areas: multipolygon, boundary, site
+ * - Lines: route, waterway, multilinestring, canal
+ * - Points: multipoint
+ * - Logic: restriction, route_master, network, collection
+ * - [Super: relations that contain other relations](https://wiki.openstreetmap.org/wiki/Super-relation)
+ */
+export function getRelationKind(relation) {
+    const typeTag = relation.tags?.["type"];
+    if (!typeTag || typeof typeTag !== "string") {
+        // If no type tag, check if it has relation members (super-relation)
+        if (relation.members.some((m) => m.type === "relation")) {
+            return "super";
+        }
+        // Default to logic for untyped relations
+        return "logic";
+    }
+    const normalizedType = typeTag.toLowerCase();
+    // Area relations
+    if (normalizedType === "multipolygon" ||
+        normalizedType === "boundary" ||
+        normalizedType === "site") {
+        return "area";
+    }
+    // Line relations
+    if (normalizedType === "route" ||
+        normalizedType === "waterway" ||
+        normalizedType === "multilinestring" ||
+        normalizedType === "canal") {
+        return "line";
+    }
+    // Point relations
+    if (normalizedType === "multipoint") {
+        return "point";
+    }
+    // Check for super-relation (has relation members)
+    if (relation.members.some((m) => m.type === "relation")) {
+        return "super";
+    }
+    // Default to logic for other types (restriction, route_master, network, collection, etc.)
+    return "logic";
+}
+/**
+ * Get metadata about a relation kind.
+ */
+export function getRelationKindMetadata(relation) {
+    const kind = getRelationKind(relation);
+    switch (kind) {
+        case "area":
+            return {
+                kind: "area",
+                expectedRoles: ["outer", "inner"],
+                orderMatters: false,
+                description: "Area relation (multipolygon, boundary, site)",
+            };
+        case "line":
+            return {
+                kind: "line",
+                expectedRoles: undefined, // Routes can have various roles
+                orderMatters: true,
+                description: "Line relation (route, waterway, multilinestring)",
+            };
+        case "point":
+            return {
+                kind: "point",
+                expectedRoles: undefined,
+                orderMatters: false,
+                description: "Point relation (multipoint)",
+            };
+        case "super":
+            return {
+                kind: "super",
+                expectedRoles: undefined,
+                orderMatters: false,
+                description: "Super-relation (contains other relations)",
+            };
+        case "logic":
+            return {
+                kind: "logic",
+                expectedRoles: undefined,
+                orderMatters: false,
+                description: "Logical relation (restriction, route_master, network, collection, etc.)",
+            };
+    }
+}
+/**
+ * Check if a relation is an area relation.
+ */
+export function isAreaRelation(relation) {
+    return getRelationKind(relation) === "area";
+}
+/**
+ * Check if a relation is a line relation.
+ */
+export function isLineRelation(relation) {
+    return getRelationKind(relation) === "line";
+}
+/**
+ * Check if a relation is a point relation.
+ */
+export function isPointRelation(relation) {
+    return getRelationKind(relation) === "point";
+}
+/**
+ * Check if a relation is a super-relation (contains other relations).
+ */
+export function isSuperRelation(relation) {
+    return getRelationKind(relation) === "super";
+}
+/**
+ * Check if a relation is a logical relation (non-geometric).
+ */
+export function isLogicRelation(relation) {
+    return getRelationKind(relation) === "logic";
+}
+/**
+ * Build MultiLineString geometry from a line relation by connecting way members.
+ * Orders way members using their refs and handles role-based reversal.
+ * Returns an array of LineString coordinates (each LineString is an array of LonLat).
+ */
+export function buildRelationLineStrings(relation, getWay, getNodeCoordinates) {
+    const lineStrings = [];
+    const wayMembers = relation.members.filter((m) => m.type === "way");
+    if (wayMembers.length === 0)
+        return lineStrings;
+    // Group ways by role if roles are used
+    const roleGroups = new Map();
+    for (const member of wayMembers) {
+        const role = member.role?.toLowerCase() ?? "";
+        if (!roleGroups.has(role)) {
+            roleGroups.set(role, []);
+        }
+        roleGroups.get(role).push(member);
+    }
+    // If no roles or single role group, process all ways together
+    const groupsToProcess = roleGroups.size === 1 || !relation.members.some((m) => m.role)
+        ? [wayMembers]
+        : Array.from(roleGroups.values());
+    for (const group of groupsToProcess) {
+        // Try to connect ways into continuous linestrings
+        const connected = connectWaysToLineStrings(group, getWay, getNodeCoordinates);
+        lineStrings.push(...connected);
+    }
+    return lineStrings;
+}
+/**
+ * Connect ways that share endpoints to form continuous LineStrings.
+ * Returns an array of LineStrings (each is an array of LonLat coordinates).
+ */
+function connectWaysToLineStrings(wayMembers, getWay, getNodeCoordinates) {
+    if (wayMembers.length === 0)
+        return [];
+    const lineStrings = [];
+    const used = new Set();
+    const wayMap = new Map();
+    // Build map of way ID to way
+    for (const member of wayMembers) {
+        const way = getWay(member.ref);
+        if (way) {
+            wayMap.set(member.ref, way);
+        }
+    }
+    // Build linestrings by connecting ways
+    for (const member of wayMembers) {
+        if (used.has(member.ref))
+            continue;
+        const startWay = wayMap.get(member.ref);
+        if (!startWay || startWay.refs.length < 2)
+            continue;
+        const coords = [];
+        const currentWay = startWay;
+        used.add(member.ref);
+        // Get coordinates for the starting way
+        for (const nodeId of currentWay.refs) {
+            const coord = getNodeCoordinates(nodeId);
+            if (coord)
+                coords.push(coord);
+        }
+        // Try to extend forward
+        while (true) {
+            let found = false;
+            const lastCoord = coords[coords.length - 1];
+            if (!lastCoord)
+                break;
+            for (const nextMember of wayMembers) {
+                if (used.has(nextMember.ref))
+                    continue;
+                const nextWay = wayMap.get(nextMember.ref);
+                if (!nextWay || nextWay.refs.length < 2)
+                    continue;
+                const nextStart = getNodeCoordinates(nextWay.refs[0]);
+                const nextEnd = getNodeCoordinates(nextWay.refs[nextWay.refs.length - 1]);
+                if (!nextStart || !nextEnd)
+                    continue;
+                // Check if next way connects to current end
+                if (lastCoord[0] === nextStart[0] && lastCoord[1] === nextStart[1]) {
+                    // Connect normally
+                    for (let i = 1; i < nextWay.refs.length; i++) {
+                        const nodeId = nextWay.refs[i];
+                        if (nodeId === undefined)
+                            continue;
+                        const coord = getNodeCoordinates(nodeId);
+                        if (coord)
+                            coords.push(coord);
+                    }
+                    used.add(nextMember.ref);
+                    found = true;
+                    break;
+                }
+                if (lastCoord[0] === nextEnd[0] && lastCoord[1] === nextEnd[1]) {
+                    // Need to reverse next way
+                    for (let i = nextWay.refs.length - 2; i >= 0; i--) {
+                        const nodeId = nextWay.refs[i];
+                        if (nodeId === undefined)
+                            continue;
+                        const coord = getNodeCoordinates(nodeId);
+                        if (coord)
+                            coords.push(coord);
+                    }
+                    used.add(nextMember.ref);
+                    found = true;
+                    break;
+                }
+            }
+            if (!found)
+                break;
+        }
+        // Try to extend backward
+        while (true) {
+            let found = false;
+            const firstCoord = coords[0];
+            if (!firstCoord)
+                break;
+            for (const prevMember of wayMembers) {
+                if (used.has(prevMember.ref))
+                    continue;
+                const prevWay = wayMap.get(prevMember.ref);
+                if (!prevWay || prevWay.refs.length < 2)
+                    continue;
+                const prevStart = getNodeCoordinates(prevWay.refs[0]);
+                const prevEnd = getNodeCoordinates(prevWay.refs[prevWay.refs.length - 1]);
+                if (!prevStart || !prevEnd)
+                    continue;
+                // Check if prev way connects to current start
+                if (firstCoord[0] === prevEnd[0] && firstCoord[1] === prevEnd[1]) {
+                    // Connect normally (prepend)
+                    const newCoords = [];
+                    for (let i = 0; i < prevWay.refs.length - 1; i++) {
+                        const nodeId = prevWay.refs[i];
+                        if (nodeId === undefined)
+                            continue;
+                        const coord = getNodeCoordinates(nodeId);
+                        if (coord)
+                            newCoords.push(coord);
+                    }
+                    coords.unshift(...newCoords);
+                    used.add(prevMember.ref);
+                    found = true;
+                    break;
+                }
+                if (firstCoord[0] === prevStart[0] && firstCoord[1] === prevStart[1]) {
+                    // Need to reverse prev way (prepend reversed)
+                    const newCoords = [];
+                    for (let i = prevWay.refs.length - 1; i > 0; i--) {
+                        const nodeId = prevWay.refs[i];
+                        if (nodeId === undefined)
+                            continue;
+                        const coord = getNodeCoordinates(nodeId);
+                        if (coord)
+                            newCoords.push(coord);
+                    }
+                    coords.unshift(...newCoords);
+                    used.add(prevMember.ref);
+                    found = true;
+                    break;
+                }
+            }
+            if (!found)
+                break;
+        }
+        if (coords.length >= 2) {
+            lineStrings.push(coords);
+        }
+    }
+    return lineStrings;
+}
+/**
+ * Collect point coordinates from a point relation.
+ * Returns an array of LonLat coordinates from node members.
+ */
+export function collectRelationPoints(relation, getNodeCoordinates) {
+    const points = [];
+    for (const member of relation.members) {
+        if (member.type === "node") {
+            const coord = getNodeCoordinates(member.ref);
+            if (coord) {
+                points.push(coord);
+            }
+        }
+    }
+    return points;
+}
+/**
+ * Resolve nested relation members, flattening the hierarchy with cycle detection.
+ * Returns all nodes, ways, and relations that are members (directly or indirectly).
+ * @param relation - The relation to resolve
+ * @param getRelation - Function to get a relation by ID
+ * @param maxDepth - Maximum recursion depth (default: 10)
+ * @param visited - Set of relation IDs already visited (for cycle detection)
+ */
+export function resolveRelationMembers(relation, getRelation, maxDepth = 10, visited = new Set()) {
+    const nodes = new Set();
+    const ways = new Set();
+    const relations = new Set();
+    // Cycle detection or max depth reached
+    if (visited.has(relation.id) || maxDepth <= 0) {
+        return { nodes: [], ways: [], relations: [] };
+    }
+    visited.add(relation.id);
+    for (const member of relation.members) {
+        if (member.type === "node") {
+            if (!nodes.has(member.ref)) {
+                nodes.add(member.ref);
+            }
+        }
+        else if (member.type === "way") {
+            if (!ways.has(member.ref)) {
+                ways.add(member.ref);
+            }
+        }
+        else if (member.type === "relation") {
+            if (!relations.has(member.ref)) {
+                relations.add(member.ref);
+                // Recursively resolve nested relation
+                const nestedRelation = getRelation(member.ref);
+                if (nestedRelation) {
+                    const nested = resolveRelationMembers(nestedRelation, getRelation, maxDepth - 1, visited);
+                    // Merge nested results
+                    for (const nodeId of nested.nodes) {
+                        if (!nodes.has(nodeId)) {
+                            nodes.add(nodeId);
+                        }
+                    }
+                    for (const wayId of nested.ways) {
+                        if (!ways.has(wayId)) {
+                            ways.add(wayId);
+                        }
+                    }
+                    for (const relId of nested.relations) {
+                        if (!relations.has(relId)) {
+                            relations.add(relId);
+                        }
+                    }
+                }
+            }
+        }
+    }
+    return {
+        nodes: Array.from(nodes),
+        ways: Array.from(ways),
+        relations: Array.from(relations),
+    };
+}
+//# sourceMappingURL=relation-kind.js.map

package/dist/relation-kind.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation-kind.js","sourceRoot":"","sources":["../src/relation-kind.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAWH;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAAC,QAAqB;IACpD,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,CAAA;IACvC,IAAI,CAAC,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;QAC7C,oEAAoE;QACpE,IAAI,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,EAAE,CAAC;YACzD,OAAO,OAAO,CAAA;QACf,CAAC;QACD,yCAAyC;QACzC,OAAO,OAAO,CAAA;IACf,CAAC;IAED,MAAM,cAAc,GAAG,OAAO,CAAC,WAAW,EAAE,CAAA;IAE5C,iBAAiB;IACjB,IACC,cAAc,KAAK,cAAc;QACjC,cAAc,KAAK,UAAU;QAC7B,cAAc,KAAK,MAAM,EACxB,CAAC;QACF,OAAO,MAAM,CAAA;IACd,CAAC;IAED,iBAAiB;IACjB,IACC,cAAc,KAAK,OAAO;QAC1B,cAAc,KAAK,UAAU;QAC7B,cAAc,KAAK,iBAAiB;QACpC,cAAc,KAAK,OAAO,EACzB,CAAC;QACF,OAAO,MAAM,CAAA;IACd,CAAC;IAED,kBAAkB;IAClB,IAAI,cAAc,KAAK,YAAY,EAAE,CAAC;QACrC,OAAO,OAAO,CAAA;IACf,CAAC;IAED,kDAAkD;IAClD,IAAI,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,EAAE,CAAC;QACzD,OAAO,OAAO,CAAA;IACf,CAAC;IAED,0FAA0F;IAC1F,OAAO,OAAO,CAAA;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,uBAAuB,CACtC,QAAqB;IAErB,MAAM,IAAI,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAA;IAEtC,QAAQ,IAAI,EAAE,CAAC;QACd,KAAK,MAAM;YACV,OAAO;gBACN,IAAI,EAAE,MAAM;gBACZ,aAAa,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC;gBACjC,YAAY,EAAE,KAAK;gBACnB,WAAW,EAAE,8CAA8C;aAC3D,CAAA;QACF,KAAK,MAAM;YACV,OAAO;gBACN,IAAI,EAAE,MAAM;gBACZ,aAAa,EAAE,SAAS,EAAE,gCAAgC;gBAC1D,YAAY,EAAE,IAAI;gBAClB,WAAW,EAAE,kDAAkD;aAC/D,CAAA;QACF,KAAK,OAAO;YACX,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,aAAa,EAAE,SAAS;gBACxB,YAAY,EAAE,KAAK;gBACnB,WAAW,EAAE,6BAA6B;aAC1C,CAAA;QACF,KAAK,OAAO;YACX,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,aAAa,EAAE,SAAS;gBACxB,YAAY,EAAE,KAAK;gBACnB,WAAW,EAAE,2CAA2C;aACxD,CAAA;QACF,KAAK,OAAO;YACX,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,aAAa,EAAE,SAAS;gBACxB,YAAY,EAAE,KAAK;gBACnB,WAAW,EACV,yEAAyE;aAC1E,CAAA;IACH,CAAC;AACF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,QAAqB;IACnD,OAAO,eAAe,CAAC,QAAQ,CAAC,KAAK,MAAM,CAAA;AAC5C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,QAAqB;IACnD,OAAO,eAAe,CAAC,QAAQ,CAAC,KAAK,MAAM,CAAA;AAC5C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,QAAqB;IACpD,OAAO,eAAe,CAAC,QAAQ,CAAC,KAAK,OAAO,CAAA;AAC7C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,QAAqB;IACpD,OAAO,eAAe,CAAC,QAAQ,CAAC,KAAK,OAAO,CAAA;AAC7C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,QAAqB;IACpD,OAAO,eAAe,CAAC,QAAQ,CAAC,KAAK,OAAO,CAAA;AAC7C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,wBAAwB,CACvC,QAAqB,EACrB,MAAwC,EACxC,kBAA0D;IAE1D,MAAM,WAAW,GAAe,EAAE,CAAA;IAClC,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAA;IAEnE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,WAAW,CAAA;IAE/C,uCAAuC;IACvC,MAAM,UAAU,GAAG,IAAI,GAAG,EAA+B,CAAA;IACzD,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAA;QAC7C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QACzB,CAAC;QACD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACnC,CAAC;IAED,8DAA8D;IAC9D,MAAM,eAAe,GACpB,UAAU,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QAC7D,CAAC,CAAC,CAAC,UAAU,CAAC;QACd,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAA;IAEnC,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACrC,kDAAkD;QAClD,MAAM,SAAS,GAAG,wBAAwB,CACzC,KAAK,EACL,MAAM,EACN,kBAAkB,CAClB,CAAA;QACD,WAAW,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAA;IAC/B,CAAC;IAED,OAAO,WAAW,CAAA;AACnB,CAAC;AAED;;;GAGG;AACH,SAAS,wBAAwB,CAChC,UAA+B,EAC/B,MAAwC,EACxC,kBAA0D;IAE1D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAA;IAEtC,MAAM,WAAW,GAAe,EAAE,CAAA;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;IAExC,6BAA6B;IAC7B,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAC9B,IAAI,GAAG,EAAE,CAAC;YACT,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QAC5B,CAAC;IACF,CAAC;IAED,uCAAuC;IACvC,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,SAAQ;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACvC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,SAAQ;QAEnD,MAAM,MAAM,GAAa,EAAE,CAAA;QAC3B,MAAM,UAAU,GAAG,QAAQ,CAAA;QAC3B,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAEpB,uCAAuC;QACvC,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAA;YACxC,IAAI,KAAK;gBAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAC9B,CAAC;QAED,wBAAwB;QACxB,OAAO,IAAI,EAAE,CAAC;YACb,IAAI,KAAK,GAAG,KAAK,CAAA;YACjB,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YAC3C,IAAI,CAAC,SAAS;gBAAE,MAAK;YAErB,KAAK,MAAM,UAAU,IAAI,UAAU,EAAE,CAAC;gBACrC,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC;oBAAE,SAAQ;gBACtC,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;gBAC1C,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;oBAAE,SAAQ;gBAEjD,MAAM,SAAS,GAAG,kBAAkB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAA;gBACtD,MAAM,OAAO,GAAG,kBAAkB,CACjC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CACtC,CAAA;gBAED,IAAI,CAAC,SAAS,IAAI,CAAC,OAAO;oBAAE,SAAQ;gBAEpC,4CAA4C;gBAC5C,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;oBACpE,mBAAmB;oBACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC9C,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;wBAC9B,IAAI,MAAM,KAAK,SAAS;4BAAE,SAAQ;wBAClC,MAAM,KAAK,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAA;wBACxC,IAAI,KAAK;4BAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;oBAC9B,CAAC;oBACD,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;oBACxB,KAAK,GAAG,IAAI,CAAA;oBACZ,MAAK;gBACN,CAAC;gBACD,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChE,2BAA2B;oBAC3B,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBACnD,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;wBAC9B,IAAI,MAAM,KAAK,SAAS;4BAAE,SAAQ;wBAClC,MAAM,KAAK,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAA;wBACxC,IAAI,KAAK;4BAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;oBAC9B,CAAC;oBACD,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;oBACxB,KAAK,GAAG,IAAI,CAAA;oBACZ,MAAK;gBACN,CAAC;YACF,CAAC;YAED,IAAI,CAAC,KAAK;gBAAE,MAAK;QAClB,CAAC;QAED,yBAAyB;QACzB,OAAO,IAAI,EAAE,CAAC;YACb,IAAI,KAAK,GAAG,KAAK,CAAA;YACjB,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;YAC5B,IAAI,CAAC,UAAU;gBAAE,MAAK;YAEtB,KAAK,MAAM,UAAU,IAAI,UAAU,EAAE,CAAC;gBACrC,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC;oBAAE,SAAQ;gBACtC,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;gBAC1C,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;oBAAE,SAAQ;gBAEjD,MAAM,SAAS,GAAG,kBAAkB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAA;gBACtD,MAAM,OAAO,GAAG,kBAAkB,CACjC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CACtC,CAAA;gBAED,IAAI,CAAC,SAAS,IAAI,CAAC,OAAO;oBAAE,SAAQ;gBAEpC,8CAA8C;gBAC9C,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClE,6BAA6B;oBAC7B,MAAM,SAAS,GAAa,EAAE,CAAA;oBAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAClD,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;wBAC9B,IAAI,MAAM,KAAK,SAAS;4BAAE,SAAQ;wBAClC,MAAM,KAAK,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAA;wBACxC,IAAI,KAAK;4BAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;oBACjC,CAAC;oBACD,MAAM,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC,CAAA;oBAC5B,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;oBACxB,KAAK,GAAG,IAAI,CAAA;oBACZ,MAAK;gBACN,CAAC;gBACD,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;oBACtE,8CAA8C;oBAC9C,MAAM,SAAS,GAAa,EAAE,CAAA;oBAC9B,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAClD,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;wBAC9B,IAAI,MAAM,KAAK,SAAS;4BAAE,SAAQ;wBAClC,MAAM,KAAK,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAA;wBACxC,IAAI,KAAK;4BAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;oBACjC,CAAC;oBACD,MAAM,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC,CAAA;oBAC5B,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;oBACxB,KAAK,GAAG,IAAI,CAAA;oBACZ,MAAK;gBACN,CAAC;YACF,CAAC;YAED,IAAI,CAAC,KAAK;gBAAE,MAAK;QAClB,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACxB,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACzB,CAAC;IACF,CAAC;IAED,OAAO,WAAW,CAAA;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACpC,QAAqB,EACrB,kBAA0D;IAE1D,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,kBAAkB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAC5C,IAAI,KAAK,EAAE,CAAC;gBACX,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACnB,CAAC;QACF,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAA;AACd,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CACrC,QAAqB,EACrB,WAAuD,EACvD,QAAQ,GAAG,EAAE,EACb,UAAU,IAAI,GAAG,EAAU;IAM3B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAA;IAEnC,uCAAuC;IACvC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;QAC/C,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAA;IAC9C,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;IAExB,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5B,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACtB,CAAC;QACF,CAAC;aAAM,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACrB,CAAC;QACF,CAAC;aAAM,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACvC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBAChC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;gBAEzB,sCAAsC;gBACtC,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;gBAC9C,IAAI,cAAc,EAAE,CAAC;oBACpB,MAAM,MAAM,GAAG,sBAAsB,CACpC,cAAc,EACd,WAAW,EACX,QAAQ,GAAG,CAAC,EACZ,OAAO,CACP,CAAA;oBACD,uBAAuB;oBACvB,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;wBACnC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;4BACxB,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;wBAClB,CAAC;oBACF,CAAC;oBACD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;wBACjC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;4BACtB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;wBAChB,CAAC;oBACF,CAAC;oBACD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;wBACtC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;4BAC3B,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;wBACrB,CAAC;oBACF,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO;QACN,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;QACtB,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;KAChC,CAAA;AACF,CAAC"}

package/dist/relation-multipolygon.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Multipolygon relation building utilities.
+ *
+ * Implements the OSM multipolygon relation specification to construct
+ * polygon geometries from way members. Handles outer/inner roles,
+ * way connection, and ring closure.
+ *
+ * @see https://wiki.openstreetmap.org/wiki/Relation:multipolygon
+ *
+ * @module
+ */
+import type { LonLat, OsmRelation, OsmRelationMember, OsmWay } from "./types";
+/**
+ * Get way members from a relation, grouped by role (outer/inner).
+ */
+export declare function getWayMembersByRole(relation: OsmRelation): {
+    outer: OsmRelationMember[];
+    inner: OsmRelationMember[];
+};
+/**
+ * Connect ways that share endpoints to form a continuous ring.
+ * Returns an array of rings (each ring is an array of way IDs in order).
+ *
+ * This function handles:
+ * - Ways that are reversed (end matches end, or start matches start).
+ * - Closed ways (single ways that form a ring).
+ * - Disconnected chains (multiple independent rings).
+ */
+export declare function connectWaysToRings(wayMembers: OsmWay[]): OsmWay[][];
+/**
+ * Build polygon rings from way members of a relation.
+ * Returns an array where each element is an array of coordinate rings (outer + inner).
+ *
+ * Based on OSM multipolygon relation specification:
+ * https://wiki.openstreetmap.org/wiki/Relation:multipolygon
+ *
+ * This implementation connects way members into closed rings, and then groups them
+ * into polygons. Currently, it associates all inner rings with every outer ring
+ * found in the relation, which is a simplification. A robust implementation would
+ * use point-in-polygon checks to strictly nest holes inside their parent outer ring.
+ */
+export declare function buildRelationRings(relation: OsmRelation, getWay: (wayId: number) => OsmWay | null, getNodeCoordinates: (nodeId: number) => LonLat | undefined): LonLat[][][];
+//# sourceMappingURL=relation-multipolygon.d.ts.map

package/dist/relation-multipolygon.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation-multipolygon.d.ts","sourceRoot":"","sources":["../src/relation-multipolygon.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,EAAE,MAAM,SAAS,CAAA;AAE7E;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,WAAW,GAAG;IAC3D,KAAK,EAAE,iBAAiB,EAAE,CAAA;IAC1B,KAAK,EAAE,iBAAiB,EAAE,CAAA;CAC1B,CAeA;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,CAwGnE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CACjC,QAAQ,EAAE,WAAW,EACrB,MAAM,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG,IAAI,EACxC,kBAAkB,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,GACxD,MAAM,EAAE,EAAE,EAAE,CAwDd"}

package/dist/relation-multipolygon.js

@@ -0,0 +1,195 @@
+/**
+ * Multipolygon relation building utilities.
+ *
+ * Implements the OSM multipolygon relation specification to construct
+ * polygon geometries from way members. Handles outer/inner roles,
+ * way connection, and ring closure.
+ *
+ * @see https://wiki.openstreetmap.org/wiki/Relation:multipolygon
+ *
+ * @module
+ */
+/**
+ * Get way members from a relation, grouped by role (outer/inner).
+ */
+export function getWayMembersByRole(relation) {
+    const outer = [];
+    const inner = [];
+    for (const member of relation.members) {
+        if (member.type !== "way")
+            continue;
+        const role = member.role?.toLowerCase() ?? "";
+        if (role === "outer") {
+            outer.push(member);
+        }
+        else if (role === "inner") {
+            inner.push(member);
+        }
+    }
+    return { outer, inner };
+}
+/**
+ * Connect ways that share endpoints to form a continuous ring.
+ * Returns an array of rings (each ring is an array of way IDs in order).
+ *
+ * This function handles:
+ * - Ways that are reversed (end matches end, or start matches start).
+ * - Closed ways (single ways that form a ring).
+ * - Disconnected chains (multiple independent rings).
+ */
+export function connectWaysToRings(wayMembers) {
+    if (wayMembers.length === 0)
+        return [];
+    const rings = [];
+    const used = new Set();
+    const wayMap = new Map();
+    // Build map of way ID to member
+    for (const member of wayMembers) {
+        wayMap.set(member.id, member);
+    }
+    // Helper to reverse a way's refs
+    const reverseWay = (way) => ({
+        ...way,
+        refs: [...way.refs].reverse(),
+    });
+    // Build rings by connecting ways
+    for (const startWay of wayMembers) {
+        if (used.has(startWay.id))
+            continue;
+        if (startWay.refs.length < 2)
+            throw Error("Way has less than 2 refs");
+        const ring = [startWay];
+        used.add(startWay.id);
+        let currentStart = startWay.refs[0];
+        let currentEnd = startWay.refs[startWay.refs.length - 1];
+        // Try to extend the ring forward
+        while (true) {
+            let found = false;
+            for (const nextWay of wayMembers) {
+                if (used.has(nextWay.id))
+                    continue;
+                if (nextWay.refs.length < 2)
+                    throw Error("Way has less than 2 refs");
+                const nextStart = nextWay.refs[0];
+                const nextEnd = nextWay.refs[nextWay.refs.length - 1];
+                // Check if next way connects to current end
+                if (currentEnd === nextStart) {
+                    ring.push(nextWay);
+                    used.add(nextWay.id);
+                    currentEnd = nextEnd;
+                    found = true;
+                    break;
+                }
+                if (currentEnd === nextEnd) {
+                    // Need to reverse next way
+                    ring.push(reverseWay(nextWay));
+                    used.add(nextWay.id);
+                    currentEnd = nextStart;
+                    found = true;
+                    break;
+                }
+            }
+            if (!found)
+                break;
+        }
+        // Try to extend the ring backward
+        currentStart = startWay.refs[0];
+        currentEnd = startWay.refs[startWay.refs.length - 1];
+        while (true) {
+            let found = false;
+            for (const nextWay of wayMembers) {
+                if (used.has(nextWay.id))
+                    continue;
+                if (nextWay.refs.length < 2)
+                    throw Error("Way has less than 2 refs");
+                const nextStart = nextWay.refs[0];
+                const nextEnd = nextWay.refs[nextWay.refs.length - 1];
+                // Check if next way connects to current start
+                if (currentStart === nextEnd) {
+                    ring.unshift(nextWay);
+                    used.add(nextWay.id);
+                    currentStart = nextStart;
+                    found = true;
+                    break;
+                }
+                if (currentStart === nextStart) {
+                    // Need to reverse next way
+                    ring.unshift(reverseWay(nextWay));
+                    used.add(nextWay.id);
+                    currentStart = nextEnd;
+                    found = true;
+                    break;
+                }
+            }
+            if (!found)
+                break;
+        }
+        // Only add ring if it's closed (first and last node are the same)
+        if (ring.length > 0) {
+            const firstWay = ring[0];
+            const lastWay = ring[ring.length - 1];
+            if (firstWay?.refs[0] === lastWay?.refs[lastWay.refs.length - 1]) {
+                rings.push(ring);
+            }
+        }
+    }
+    return rings;
+}
+/**
+ * Build polygon rings from way members of a relation.
+ * Returns an array where each element is an array of coordinate rings (outer + inner).
+ *
+ * Based on OSM multipolygon relation specification:
+ * https://wiki.openstreetmap.org/wiki/Relation:multipolygon
+ *
+ * This implementation connects way members into closed rings, and then groups them
+ * into polygons. Currently, it associates all inner rings with every outer ring
+ * found in the relation, which is a simplification. A robust implementation would
+ * use point-in-polygon checks to strictly nest holes inside their parent outer ring.
+ */
+export function buildRelationRings(relation, getWay, getNodeCoordinates) {
+    const { outer, inner } = getWayMembersByRole(relation);
+    // Connect outer ways into rings
+    const outerRings = connectWaysToRings(outer.map((m) => getWay(m.ref)).filter((w) => w !== null));
+    // Connect inner ways into rings
+    const innerRings = connectWaysToRings(inner.map((m) => getWay(m.ref)).filter((w) => w !== null));
+    const wayRingToCoords = (ring) => {
+        const coords = [];
+        for (const way of ring) {
+            for (const nodeId of way.refs) {
+                const coord = getNodeCoordinates(nodeId);
+                if (coord)
+                    coords.push(coord);
+            }
+        }
+        // Ensure ring is closed
+        if (coords.length > 0) {
+            const first = coords[0];
+            const last = coords[coords.length - 1];
+            if (first && last && (first[0] !== last[0] || first[1] !== last[1])) {
+                coords.push([first[0], first[1]]);
+            }
+        }
+        return coords;
+    };
+    // Convert way rings to coordinate rings
+    const coordinateRings = [];
+    for (const outerRing of outerRings) {
+        const outerCoordinates = wayRingToCoords(outerRing);
+        if (outerCoordinates.length >= 3) {
+            // Find inner rings that belong to this outer ring
+            const innerCoordinates = [];
+            for (const innerRing of innerRings) {
+                const innerCoords = wayRingToCoords(innerRing);
+                if (innerCoords.length >= 3) {
+                    // TODO: do proper point-in-polygon test with https://github.com/rowanwins/point-in-polygon-hao
+                    innerCoordinates.push(innerCoords);
+                }
+            }
+            // Create polygon: [outer ring, ...inner rings]
+            coordinateRings.push([outerCoordinates, ...innerCoordinates]);
+        }
+    }
+    return coordinateRings;
+}
+//# sourceMappingURL=relation-multipolygon.js.map

package/dist/relation-multipolygon.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation-multipolygon.js","sourceRoot":"","sources":["../src/relation-multipolygon.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,QAAqB;IAIxD,MAAM,KAAK,GAAwB,EAAE,CAAA;IACrC,MAAM,KAAK,GAAwB,EAAE,CAAA;IAErC,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK;YAAE,SAAQ;QACnC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAA;QAC7C,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACnB,CAAC;aAAM,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACnB,CAAC;IACF,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;AACxB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAAC,UAAoB;IACtD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAA;IAEtC,MAAM,KAAK,GAAe,EAAE,CAAA;IAC5B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;IAExC,gCAAgC;IAChC,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAA;IAC9B,CAAC;IAED,iCAAiC;IACjC,MAAM,UAAU,GAAG,CAAC,GAAW,EAAU,EAAE,CAAC,CAAC;QAC5C,GAAG,GAAG;QACN,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE;KAC7B,CAAC,CAAA;IAEF,iCAAiC;IACjC,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAE,SAAQ;QACnC,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,MAAM,KAAK,CAAC,0BAA0B,CAAC,CAAA;QAErE,MAAM,IAAI,GAAa,CAAC,QAAQ,CAAC,CAAA;QACjC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;QAErB,IAAI,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAE,CAAA;QACpC,IAAI,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAA;QAEzD,iCAAiC;QACjC,OAAO,IAAI,EAAE,CAAC;YACb,IAAI,KAAK,GAAG,KAAK,CAAA;YACjB,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;gBAClC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBAAE,SAAQ;gBAClC,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM,KAAK,CAAC,0BAA0B,CAAC,CAAA;gBACpE,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAE,CAAA;gBAClC,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAA;gBAEtD,4CAA4C;gBAC5C,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;oBAC9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;oBAClB,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;oBACpB,UAAU,GAAG,OAAO,CAAA;oBACpB,KAAK,GAAG,IAAI,CAAA;oBACZ,MAAK;gBACN,CAAC;gBACD,IAAI,UAAU,KAAK,OAAO,EAAE,CAAC;oBAC5B,2BAA2B;oBAC3B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAA;oBAC9B,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;oBACpB,UAAU,GAAG,SAAS,CAAA;oBACtB,KAAK,GAAG,IAAI,CAAA;oBACZ,MAAK;gBACN,CAAC;YACF,CAAC;YAED,IAAI,CAAC,KAAK;gBAAE,MAAK;QAClB,CAAC;QAED,kCAAkC;QAClC,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAE,CAAA;QAChC,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAA;QAErD,OAAO,IAAI,EAAE,CAAC;YACb,IAAI,KAAK,GAAG,KAAK,CAAA;YACjB,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;gBAClC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBAAE,SAAQ;gBAClC,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM,KAAK,CAAC,0BAA0B,CAAC,CAAA;gBAEpE,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAE,CAAA;gBAClC,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAA;gBAEtD,8CAA8C;gBAC9C,IAAI,YAAY,KAAK,OAAO,EAAE,CAAC;oBAC9B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;oBACrB,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;oBACpB,YAAY,GAAG,SAAS,CAAA;oBACxB,KAAK,GAAG,IAAI,CAAA;oBACZ,MAAK;gBACN,CAAC;gBACD,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;oBAChC,2BAA2B;oBAC3B,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAA;oBACjC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;oBACpB,YAAY,GAAG,OAAO,CAAA;oBACtB,KAAK,GAAG,IAAI,CAAA;oBACZ,MAAK;gBACN,CAAC;YACF,CAAC;YAED,IAAI,CAAC,KAAK;gBAAE,MAAK;QAClB,CAAC;QAED,kEAAkE;QAClE,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;YACxB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YACrC,IAAI,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;gBAClE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACjB,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,KAAK,CAAA;AACb,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,kBAAkB,CACjC,QAAqB,EACrB,MAAwC,EACxC,kBAA0D;IAE1D,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,mBAAmB,CAAC,QAAQ,CAAC,CAAA;IAEtD,gCAAgC;IAChC,MAAM,UAAU,GAAG,kBAAkB,CACpC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CACzD,CAAA;IACD,gCAAgC;IAChC,MAAM,UAAU,GAAG,kBAAkB,CACpC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CACzD,CAAA;IAED,MAAM,eAAe,GAAG,CAAC,IAAc,EAAY,EAAE;QACpD,MAAM,MAAM,GAAa,EAAE,CAAA;QAC3B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACxB,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;gBAC/B,MAAM,KAAK,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAA;gBACxC,IAAI,KAAK;oBAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC9B,CAAC;QACF,CAAC;QAED,wBAAwB;QACxB,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YACtC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrE,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAClC,CAAC;QACF,CAAC;QACD,OAAO,MAAM,CAAA;IACd,CAAC,CAAA;IAED,wCAAwC;IACxC,MAAM,eAAe,GAAiB,EAAE,CAAA;IAExC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACpC,MAAM,gBAAgB,GAAa,eAAe,CAAC,SAAS,CAAC,CAAA;QAE7D,IAAI,gBAAgB,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAClC,kDAAkD;YAClD,MAAM,gBAAgB,GAAe,EAAE,CAAA;YACvC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;gBACpC,MAAM,WAAW,GAAa,eAAe,CAAC,SAAS,CAAC,CAAA;gBAExD,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;oBAC7B,+FAA+F;oBAC/F,gBAAgB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;gBACnC,CAAC;YACF,CAAC;YAED,+CAA+C;YAC/C,eAAe,CAAC,IAAI,CAAC,CAAC,gBAAgB,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAA;QAC9D,CAAC;IACF,CAAC;IAED,OAAO,eAAe,CAAA;AACvB,CAAC"}

package/dist/src/color.d.ts

@@ -0,0 +1,4 @@
+import type { Rgba } from "./types";
+export declare function normalizeHexColor(value: string | number | null | undefined): string | undefined;
+export declare function hexColorToRgba(value: string | number | null | undefined): Rgba | undefined;
+//# sourceMappingURL=color.d.ts.map

package/dist/src/color.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"color.d.ts","sourceRoot":"","sources":["../../src/color.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,SAAS,CAAA;AAInC,wBAAgB,iBAAiB,CAChC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,GAAG,SAAS,GACvC,MAAM,GAAG,SAAS,CAiBpB;AAED,wBAAgB,cAAc,CAC7B,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,GAAG,SAAS,GACvC,IAAI,GAAG,SAAS,CASlB"}