@osmix/shared 0.0.1 → 0.0.6

package/dist/src/utils.js

@@ -0,0 +1,70 @@
+/**
+ * General OSM entity utilities.
+ *
+ * Provides type guards, equality checks, and type detection for OSM entities.
+ * Uses deep equality checking for tags, info, and entity-specific properties.
+ *
+ * @module
+ */
+import { dequal } from "dequal/lite";
+/**
+ * Check if two entities have equal tags and info.
+ */
+function isTagsAndInfoEqual(a, b) {
+    return dequal(a.tags, b.tags) && dequal(a.info, b.info);
+}
+/** Type guard: check if entity is a Node. */
+export function isNode(entity) {
+    return "lon" in entity && "lat" in entity;
+}
+/** Check if two nodes are equal (position, tags, and info). */
+export function isNodeEqual(a, b) {
+    return a.lat === b.lat && a.lon === b.lon && isTagsAndInfoEqual(a, b);
+}
+/** Type guard: check if entity is a Way. */
+export function isWay(entity) {
+    return "refs" in entity;
+}
+/** Type guard: check if entity is a Relation. */
+export function isRelation(entity) {
+    return "members" in entity;
+}
+/** Check if two ways are equal (refs, tags, and info). */
+export function isWayEqual(a, b) {
+    return dequal(a.refs, b.refs) && isTagsAndInfoEqual(a, b);
+}
+/** Check if two relations are equal (members, tags, and info). */
+export function isRelationEqual(a, b) {
+    return dequal(a.members, b.members) && isTagsAndInfoEqual(a, b);
+}
+/** Check if two entities have equal properties (type-aware comparison). */
+export function entityPropertiesEqual(a, b) {
+    if (!dequal(a.tags, b.tags))
+        return false;
+    if (!dequal(a.info, b.info))
+        return false;
+    if (isNode(a) && isNode(b))
+        return isNodeEqual(a, b);
+    if (isWay(a) && isWay(b))
+        return isWayEqual(a, b);
+    if (isRelation(a) && isRelation(b))
+        return isRelationEqual(a, b);
+    return false;
+}
+/** Get the entity type ("node", "way", or "relation") for an entity. */
+export function getEntityType(entity) {
+    if (isNode(entity))
+        return "node";
+    if (isWay(entity))
+        return "way";
+    if (isRelation(entity))
+        return "relation";
+    throw Error("Unknown entity type");
+}
+/**
+ * Check if a relation is a multipolygon relation.
+ */
+export function isMultipolygonRelation(relation) {
+    return relation.tags?.["type"] === "multipolygon";
+}
+//# sourceMappingURL=utils.js.map

package/dist/src/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../src/utils.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAA;AASpC;;GAEG;AACH,SAAS,kBAAkB,CAAC,CAAY,EAAE,CAAY;IACrD,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAA;AACxD,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,MAAM,CAAC,MAAiB;IACvC,OAAO,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,MAAM,CAAA;AAC1C,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,WAAW,CAAC,CAAU,EAAE,CAAU;IACjD,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AACtE,CAAC;AAED,4CAA4C;AAC5C,MAAM,UAAU,KAAK,CAAC,MAAiB;IACtC,OAAO,MAAM,IAAI,MAAM,CAAA;AACxB,CAAC;AAED,iDAAiD;AACjD,MAAM,UAAU,UAAU,CAAC,MAAiB;IAC3C,OAAO,SAAS,IAAI,MAAM,CAAA;AAC3B,CAAC;AAED,0DAA0D;AAC1D,MAAM,UAAU,UAAU,CAAC,CAAS,EAAE,CAAS;IAC9C,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAC1D,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,eAAe,CAAC,CAAc,EAAE,CAAc;IAC7D,OAAO,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAChE,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,qBAAqB,CAAC,CAAY,EAAE,CAAY;IAC/D,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAA;IACzC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAA;IACzC,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC;QAAE,OAAO,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;QAAE,OAAO,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACjD,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC;QAAE,OAAO,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAChE,OAAO,KAAK,CAAA;AACb,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,aAAa,CAAC,MAAiB;IAC9C,IAAI,MAAM,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAA;IACjC,IAAI,KAAK,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAA;IAC/B,IAAI,UAAU,CAAC,MAAM,CAAC;QAAE,OAAO,UAAU,CAAA;IACzC,MAAM,KAAK,CAAC,qBAAqB,CAAC,CAAA;AACnC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,QAAqB;IAC3D,OAAO,QAAQ,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,KAAK,cAAc,CAAA;AAClD,CAAC"}

package/dist/src/way-is-area.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Area detection for OSM ways.
+ *
+ * Implements the OSM wiki heuristics for determining whether a closed way
+ * should be rendered as an area (polygon) or a closed linear feature.
+ *
+ * @see https://wiki.openstreetmap.org/wiki/Key:area
+ * @see https://wiki.openstreetmap.org/wiki/Overpass_turbo/Polygon_Features
+ *
+ * @module
+ */
+import type { OsmWay } from "./types";
+/**
+ * Determine if a way is an area based on its tags and nodes.
+ *
+ * This function implements the logic described in the OSM wiki:
+ * https://wiki.openstreetmap.org/wiki/Key:area
+ * https://wiki.openstreetmap.org/wiki/Overpass_turbo/Polygon_Features
+ *
+ * @param way - The way to check.
+ * @returns `true` if the way is an area, `false` otherwise.
+ */
+export declare function wayIsArea(way?: OsmWay): boolean;
+//# sourceMappingURL=way-is-area.d.ts.map

package/dist/src/way-is-area.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"way-is-area.d.ts","sourceRoot":"","sources":["../../src/way-is-area.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,SAAS,CAAA;AAqDrC;;;;;;;;;GASG;AACH,wBAAgB,SAAS,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO,CA+B/C"}

package/dist/src/way-is-area.js

@@ -0,0 +1,104 @@
+/**
+ * Area detection for OSM ways.
+ *
+ * Implements the OSM wiki heuristics for determining whether a closed way
+ * should be rendered as an area (polygon) or a closed linear feature.
+ *
+ * @see https://wiki.openstreetmap.org/wiki/Key:area
+ * @see https://wiki.openstreetmap.org/wiki/Overpass_turbo/Polygon_Features
+ *
+ * @module
+ */
+/**
+ * Tags that imply an area unless their value is exactly "no"
+ */
+const IMPLIED_ANY_VALUE_BUT_NO = new Set([
+    "amenity",
+    "boundary",
+    "building",
+    "building:part",
+    "craft",
+    // 	"golf", Seeing a lot of golf=cartpath which is not an area
+    "historic",
+    "indoor",
+    "landuse",
+    "leisure",
+    "military",
+    "office",
+    "place",
+    "public_transport",
+    "ruins",
+    "shop",
+    "tourism",
+]);
+/**
+ * Tags that imply an area only for these specific values
+ */
+const INCLUDED_VALUE_TAGS = {
+    barrier: new Set([
+        "city_wall",
+        "ditch",
+        "hedge",
+        "retaining_wall",
+        "wall",
+        "spikes",
+    ]),
+    highway: new Set(["services", "rest_area", "escape", "elevator"]),
+    power: new Set(["plant", "substation", "generator", "transformer"]),
+    railway: new Set(["station", "turntable", "roundhouse", "platform"]),
+    waterway: new Set(["riverbank", "dock", "boatyard", "dam"]),
+};
+/**
+ * Tags that imply an area unless the value is in this exclusion list
+ */
+const EXCLUDED_VALUE_TAGS = {
+    aeroway: new Set(["no", "taxiway"]),
+    "area:highway": new Set(["no"]),
+    man_made: new Set(["no", "cutline", "embankment", "pipeline"]),
+    natural: new Set(["no", "coastline", "cliff", "ridge", "arete", "tree_row"]),
+};
+/**
+ * Determine if a way is an area based on its tags and nodes.
+ *
+ * This function implements the logic described in the OSM wiki:
+ * https://wiki.openstreetmap.org/wiki/Key:area
+ * https://wiki.openstreetmap.org/wiki/Overpass_turbo/Polygon_Features
+ *
+ * @param way - The way to check.
+ * @returns `true` if the way is an area, `false` otherwise.
+ */
+export function wayIsArea(way) {
+    if (!way)
+        return false;
+    const { refs, tags } = way;
+    if (refs.length < 3)
+        return false;
+    if (refs[0] !== refs[refs.length - 1])
+        return false;
+    // End refs are equal, no tags, assume it is an area.
+    if (!tags || Object.keys(tags).length === 0)
+        return true;
+    // Explicit override
+    if ("area" in tags)
+        return tags["area"] !== "no";
+    // Tags that count if value is NOT "no"
+    for (const key of IMPLIED_ANY_VALUE_BUT_NO) {
+        const v = tags[key];
+        if (v && v !== "no")
+            return true;
+    }
+    // Tags that are area only for INCLUDED values
+    for (const [key, included] of Object.entries(INCLUDED_VALUE_TAGS)) {
+        const v = tags[key];
+        if (v && included.has(`${v}`))
+            return true;
+    }
+    // Tags that are area unless value is excluded
+    for (const [key, excluded] of Object.entries(EXCLUDED_VALUE_TAGS)) {
+        const v = tags[key];
+        if (v && !excluded.has(`${v}`))
+            return true;
+    }
+    return false;
+}
+//# sourceMappingURL=way-is-area.js.map

package/dist/src/way-is-area.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"way-is-area.js","sourceRoot":"","sources":["../../src/way-is-area.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH;;GAEG;AACH,MAAM,wBAAwB,GAAG,IAAI,GAAG,CAAC;IACxC,SAAS;IACT,UAAU;IACV,UAAU;IACV,eAAe;IACf,OAAO;IACP,8DAA8D;IAC9D,UAAU;IACV,QAAQ;IACR,SAAS;IACT,SAAS;IACT,UAAU;IACV,QAAQ;IACR,OAAO;IACP,kBAAkB;IAClB,OAAO;IACP,MAAM;IACN,SAAS;CACT,CAAC,CAAA;AAEF;;GAEG;AACH,MAAM,mBAAmB,GAAG;IAC3B,OAAO,EAAE,IAAI,GAAG,CAAC;QAChB,WAAW;QACX,OAAO;QACP,OAAO;QACP,gBAAgB;QAChB,MAAM;QACN,QAAQ;KACR,CAAC;IACF,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;IACjE,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;IACnE,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,WAAW,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;IACpE,QAAQ,EAAE,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;CAClD,CAAA;AAEV;;GAEG;AACH,MAAM,mBAAmB,GAAG;IAC3B,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACnC,cAAc,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/B,QAAQ,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;IAC9D,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;CACnE,CAAA;AAEV;;;;;;;;;GASG;AACH,MAAM,UAAU,SAAS,CAAC,GAAY;IACrC,IAAI,CAAC,GAAG;QAAE,OAAO,KAAK,CAAA;IACtB,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,GAAG,CAAA;IAC1B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAA;IACjC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAAE,OAAO,KAAK,CAAA;IAEnD,qDAAqD;IACrD,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAExD,oBAAoB;IACpB,IAAI,MAAM,IAAI,IAAI;QAAE,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAA;IAEhD,uCAAuC;IACvC,KAAK,MAAM,GAAG,IAAI,wBAAwB,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;QACnB,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAA;IACjC,CAAC;IAED,8CAA8C;IAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,mBAAmB,CAAC,EAAE,CAAC;QACnE,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;QACnB,IAAI,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,IAAI,CAAA;IAC3C,CAAC;IAED,8CAA8C;IAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,mBAAmB,CAAC,EAAE,CAAC;QACnE,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;QACnB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,IAAI,CAAA;IAC5C,CAAC;IAED,OAAO,KAAK,CAAA;AACb,CAAC"}

package/dist/src/zigzag.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Zigzag encoding/decoding for protobuf-style varints.
+ *
+ * Zigzag encoding converts signed integers to unsigned by interleaving
+ * negative and positive values: 0, -1, 1, -2, 2, ... This allows efficient
+ * varint encoding of small negative numbers.
+ *
+ * @module
+ */
+/**
+ * Zigzag encode a number using arithmetic operations.
+ * This supports the full safe integer range (up to Number.MAX_SAFE_INTEGER).
+ * Formula: n < 0 ? -2*n - 1 : 2*n
+ *
+ * Used for encoding IDs in vector tiles to convert negative IDs to positive numbers
+ * for unsigned varint encoding.
+ */
+export declare function zigzag(num: number): number;
+/**
+ * Zigzag encode using bitwise operations (for geometry deltas only).
+ * This is faster but limited to 32-bit signed integers.
+ * Used for small coordinate deltas in geometry encoding.
+ */
+export declare function zigzag32(num: number): number;
+/**
+ * Decode zigzag-encoded number back to original value.
+ * Zigzag encoding is used to convert negative IDs to positive numbers for unsigned varint
+ * encoding in vector tiles. Uses arithmetic-based decoding to support the full safe integer range.
+ *
+ * Formula: (encoded & 1) === 1 ? -(encoded + 1) / 2 : encoded / 2
+ */
+export declare function decodeZigzag(encoded: number): number;
+//# sourceMappingURL=zigzag.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"zigzag.d.ts","sourceRoot":"","sources":["../../src/zigzag.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH;;;;;;;GAOG;AACH,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAE1C;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAE5C;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAGpD"}

package/dist/src/zigzag.js

@@ -0,0 +1,40 @@
+/**
+ * Zigzag encoding/decoding for protobuf-style varints.
+ *
+ * Zigzag encoding converts signed integers to unsigned by interleaving
+ * negative and positive values: 0, -1, 1, -2, 2, ... This allows efficient
+ * varint encoding of small negative numbers.
+ *
+ * @module
+ */
+/**
+ * Zigzag encode a number using arithmetic operations.
+ * This supports the full safe integer range (up to Number.MAX_SAFE_INTEGER).
+ * Formula: n < 0 ? -2*n - 1 : 2*n
+ *
+ * Used for encoding IDs in vector tiles to convert negative IDs to positive numbers
+ * for unsigned varint encoding.
+ */
+export function zigzag(num) {
+    return num < 0 ? -2 * num - 1 : 2 * num;
+}
+/**
+ * Zigzag encode using bitwise operations (for geometry deltas only).
+ * This is faster but limited to 32-bit signed integers.
+ * Used for small coordinate deltas in geometry encoding.
+ */
+export function zigzag32(num) {
+    return (num << 1) ^ (num >> 31);
+}
+/**
+ * Decode zigzag-encoded number back to original value.
+ * Zigzag encoding is used to convert negative IDs to positive numbers for unsigned varint
+ * encoding in vector tiles. Uses arithmetic-based decoding to support the full safe integer range.
+ *
+ * Formula: (encoded & 1) === 1 ? -(encoded + 1) / 2 : encoded / 2
+ */
+export function decodeZigzag(encoded) {
+    // Check if encoded is odd (negative) using bitwise, then use arithmetic
+    return (encoded & 1) === 1 ? -(encoded + 1) / 2 : encoded / 2;
+}
+//# sourceMappingURL=zigzag.js.map

package/dist/src/zigzag.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"zigzag.js","sourceRoot":"","sources":["../../src/zigzag.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH;;;;;;;GAOG;AACH,MAAM,UAAU,MAAM,CAAC,GAAW;IACjC,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;AACxC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAW;IACnC,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,CAAA;AAChC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,OAAe;IAC3C,wEAAwE;IACxE,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAA;AAC9D,CAAC"}

package/dist/test/haversine-distance.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=haversine-distance.test.d.ts.map

package/dist/test/haversine-distance.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"haversine-distance.test.d.ts","sourceRoot":"","sources":["../../test/haversine-distance.test.ts"],"names":[],"mappings":""}

package/dist/test/haversine-distance.test.js

@@ -0,0 +1,8 @@
+import { expect, test } from "bun:test";
+import { haversineDistance } from "../src/haversine-distance";
+test("haversineDistance", () => {
+    const p1 = [-75.343, 39.984];
+    const p2 = [-75.534, 39.123];
+    expect(haversineDistance(p1, p2)).toBeCloseTo(97129.2211, 3);
+});
+//# sourceMappingURL=haversine-distance.test.js.map

package/dist/test/haversine-distance.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"haversine-distance.test.js","sourceRoot":"","sources":["../../test/haversine-distance.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,UAAU,CAAA;AACvC,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAA;AAE7D,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE;IAC9B,MAAM,EAAE,GAAqB,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC9C,MAAM,EAAE,GAAqB,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC9C,MAAM,CAAC,iBAAiB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,UAAU,EAAE,CAAC,CAAC,CAAA;AAC7D,CAAC,CAAC,CAAA"}

package/dist/test/relation-kind.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=relation-kind.test.d.ts.map

package/dist/test/relation-kind.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation-kind.test.d.ts","sourceRoot":"","sources":["../../test/relation-kind.test.ts"],"names":[],"mappings":""}