@osmix/core 0.0.1 → 0.0.6

package/dist/core/src/ids.d.ts

@@ -0,0 +1,113 @@
+/**
+ * ID storage and lookup for OSM entities.
+ *
+ * Uses a two-level binary search (anchor array + block search) to map 64-bit OSM IDs
+ * to internal array indices. Balances memory usage with O(log n) lookup speed.
+ *
+ * @module
+ */
+import { type BufferType } from "./typed-arrays";
+/**
+ * Union type for looking up entities by either OSM ID or internal array index.
+ */
+export type IdOrIndex = {
+    id: number;
+} | {
+    index: number;
+};
+/**
+ * Serializable state for worker transfer.
+ */
+export interface IdsTransferables<T extends BufferType = BufferType> {
+    /** Entity IDs in insertion order. */
+    ids: T;
+    /** Sorted IDs for binary search (aliases `ids` if already sorted). */
+    sortedIds: T;
+    /** Maps sorted position → original insertion index. */
+    sortedIdPositionToIndex: T;
+    /** Anchor array: every BLOCK_SIZE-th sorted ID. */
+    anchors: T;
+    /** True if IDs were inserted in ascending order. */
+    idsAreSorted: boolean;
+}
+/**
+ * Efficiently store and lookup OSM entity IDs.
+ *
+ * Stores 64-bit IDs in a Float64Array and maintains a sorted index for O(log n) lookups.
+ * Max capacity: ~2^32 entities.
+ */
+export declare class Ids {
+    /** All IDs in insertion order */
+    private ids;
+    /** Whether buildIndex() has been called */
+    private indexBuilt;
+    /** True if IDs were added in ascending order (allows index optimization) */
+    private idsAreSorted;
+    /** Sorted view of IDs for binary search */
+    private idsSorted;
+    /** Maps position in sorted array → original insertion index */
+    private sortedIdPositionToIndex;
+    /** Anchor array for two-level binary search: every BLOCK_SIZE-th sorted ID */
+    private anchors;
+    /**
+     * Create a new Ids index.
+     * @param transferables - Optional serialized state to reconstruct from.
+     */
+    constructor(transferables?: IdsTransferables);
+    /** Number of IDs stored in this index. */
+    get size(): number;
+    /** Returns true if buildIndex() has been called and lookups are enabled. */
+    isReady(): boolean;
+    /** Returns true if IDs were inserted in ascending order. */
+    isSorted(): boolean;
+    /**
+     * Add an ID to the index.
+     * @param id - The OSM entity ID to add.
+     * @returns The internal array index where this ID was stored.
+     * @throws If the index has already been built.
+     */
+    add(id: number): number;
+    /**
+     * Get the ID at a specific internal index.
+     * @param index - The internal array index.
+     * @returns The OSM entity ID at that index.
+     */
+    at(index: number): number;
+    /**
+     * Check if an ID exists in this index.
+     * @param id - The OSM entity ID to check.
+     * @returns True if the ID exists in this index.
+     */
+    has(id: number): boolean;
+    /**
+     * Build the index of IDs to positions.
+     *
+     * If the IDs are not sorted, we need to sort them and build a new index.
+     * If the IDs are sorted, we can use the existing index.
+     */
+    buildIndex(): void;
+    /**
+     * Look up the internal array index for an OSM entity ID.
+     *
+     * @param id - The OSM entity ID to look up.
+     * @returns The internal array index, or -1 if not found.
+     * @throws If the index has not been built.
+     */
+    getIndexFromId(id: number): number;
+    /**
+     * Pass an ID or an index, get both.
+     */
+    idOrIndex(i: IdOrIndex): [index: number, id: number];
+    /** Returns the sorted array of IDs for iteration. */
+    get sorted(): Float64Array<ArrayBufferLike>;
+    /**
+     * Get transferable buffers for passing to another thread.
+     * @returns Serializable representation of this index.
+     */
+    transferables(): IdsTransferables;
+    /**
+     * Get the approximate memory requirements for a given number of IDs in bytes.
+     */
+    static getBytesRequired(count: number): number;
+}
+//# sourceMappingURL=ids.d.ts.map

package/dist/core/src/ids.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ids.d.ts","sourceRoot":"","sources":["../../../src/ids.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAEN,KAAK,UAAU,EAEf,MAAM,gBAAgB,CAAA;AAEvB;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,CAAA;AAS1D;;GAEG;AACH,MAAM,WAAW,gBAAgB,CAAC,CAAC,SAAS,UAAU,GAAG,UAAU;IAClE,qCAAqC;IACrC,GAAG,EAAE,CAAC,CAAA;IACN,sEAAsE;IACtE,SAAS,EAAE,CAAC,CAAA;IACZ,uDAAuD;IACvD,uBAAuB,EAAE,CAAC,CAAA;IAC1B,mDAAmD;IACnD,OAAO,EAAE,CAAC,CAAA;IACV,oDAAoD;IACpD,YAAY,EAAE,OAAO,CAAA;CACrB;AAED;;;;;GAKG;AACH,qBAAa,GAAG;IACf,iCAAiC;IACjC,OAAO,CAAC,GAAG,CAAmB;IAC9B,2CAA2C;IAC3C,OAAO,CAAC,UAAU,CAAQ;IAC1B,4EAA4E;IAC5E,OAAO,CAAC,YAAY,CAAO;IAC3B,2CAA2C;IAC3C,OAAO,CAAC,SAAS,CAAc;IAC/B,+DAA+D;IAC/D,OAAO,CAAC,uBAAuB,CAAa;IAC5C,8EAA8E;IAC9E,OAAO,CAAC,OAAO,CAAc;IAE7B;;;OAGG;gBACS,aAAa,CAAC,EAAE,gBAAgB;IAkB5C,0CAA0C;IAC1C,IAAI,IAAI,WAEP;IAED,4EAA4E;IAC5E,OAAO;IAIP,4DAA4D;IAC5D,QAAQ;IAIR;;;;;OAKG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAMvB;;;;OAIG;IACH,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAIzB;;;;OAIG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAIxB;;;;;OAKG;IACH,UAAU;IA6DV;;;;;;OAMG;IACH,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAqClC;;OAEG;IACH,SAAS,CAAC,CAAC,EAAE,SAAS,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,CAAC;IAKpD,qDAAqD;IACrD,IAAI,MAAM,kCAET;IAED;;;OAGG;IACH,aAAa,IAAI,gBAAgB;IAUjC;;OAEG;IACH,MAAM,CAAC,gBAAgB,CAAC,KAAK,EAAE,MAAM;CASrC"}

package/dist/core/src/ids.js

@@ -0,0 +1,236 @@
+/**
+ * ID storage and lookup for OSM entities.
+ *
+ * Uses a two-level binary search (anchor array + block search) to map 64-bit OSM IDs
+ * to internal array indices. Balances memory usage with O(log n) lookup speed.
+ *
+ * @module
+ */
+import { assertValue } from "@osmix/shared/assert";
+import { BufferConstructor, ResizeableTypedArray as RTA, } from "./typed-arrays";
+/**
+ * Number of IDs per anchor block for the two-level binary search.
+ * Smaller values increase anchor array size but speed up block-level search;
+ * larger values reduce anchor overhead but slow the final search.
+ */
+const BLOCK_SIZE = 256;
+/**
+ * Efficiently store and lookup OSM entity IDs.
+ *
+ * Stores 64-bit IDs in a Float64Array and maintains a sorted index for O(log n) lookups.
+ * Max capacity: ~2^32 entities.
+ */
+export class Ids {
+    /** All IDs in insertion order */
+    ids;
+    /** Whether buildIndex() has been called */
+    indexBuilt = false;
+    /** True if IDs were added in ascending order (allows index optimization) */
+    idsAreSorted = true;
+    /** Sorted view of IDs for binary search */
+    idsSorted;
+    /** Maps position in sorted array → original insertion index */
+    sortedIdPositionToIndex;
+    /** Anchor array for two-level binary search: every BLOCK_SIZE-th sorted ID */
+    anchors;
+    /**
+     * Create a new Ids index.
+     * @param transferables - Optional serialized state to reconstruct from.
+     */
+    constructor(transferables) {
+        if (transferables) {
+            this.ids = RTA.from(Float64Array, transferables.ids);
+            this.idsSorted = new Float64Array(transferables.sortedIds);
+            this.sortedIdPositionToIndex = new Uint32Array(transferables.sortedIdPositionToIndex);
+            this.anchors = new Float64Array(transferables.anchors);
+            this.idsAreSorted = transferables.idsAreSorted;
+            this.indexBuilt = true;
+        }
+        else {
+            this.ids = new RTA(Float64Array);
+            this.idsSorted = new Float64Array(new BufferConstructor(0));
+            this.sortedIdPositionToIndex = new Uint32Array(new BufferConstructor(0));
+            this.anchors = new Float64Array(new BufferConstructor(0));
+        }
+    }
+    /** Number of IDs stored in this index. */
+    get size() {
+        return this.ids.length;
+    }
+    /** Returns true if buildIndex() has been called and lookups are enabled. */
+    isReady() {
+        return this.indexBuilt;
+    }
+    /** Returns true if IDs were inserted in ascending order. */
+    isSorted() {
+        return this.idsAreSorted;
+    }
+    /**
+     * Add an ID to the index.
+     * @param id - The OSM entity ID to add.
+     * @returns The internal array index where this ID was stored.
+     * @throws If the index has already been built.
+     */
+    add(id) {
+        if (this.indexBuilt)
+            throw Error("ID index already built.");
+        if (this.ids.length > 0 && id < this.ids.at(-1))
+            this.idsAreSorted = false;
+        return this.ids.push(id);
+    }
+    /**
+     * Get the ID at a specific internal index.
+     * @param index - The internal array index.
+     * @returns The OSM entity ID at that index.
+     */
+    at(index) {
+        return this.ids.at(index);
+    }
+    /**
+     * Check if an ID exists in this index.
+     * @param id - The OSM entity ID to check.
+     * @returns True if the ID exists in this index.
+     */
+    has(id) {
+        return this.getIndexFromId(id) !== -1;
+    }
+    /**
+     * Build the index of IDs to positions.
+     *
+     * If the IDs are not sorted, we need to sort them and build a new index.
+     * If the IDs are sorted, we can use the existing index.
+     */
+    buildIndex() {
+        if (this.indexBuilt)
+            throw Error("ID index already build.");
+        this.ids.compact();
+        if (!this.idsAreSorted) {
+            console.warn("IDs were not sorted. Sorting now...");
+            // Build the sorted index
+            const idsBuffer = new BufferConstructor(this.size * Float64Array.BYTES_PER_ELEMENT);
+            const posBuffer = new BufferConstructor(this.size * Uint32Array.BYTES_PER_ELEMENT);
+            this.idsSorted = new Float64Array(idsBuffer);
+            this.sortedIdPositionToIndex = new Uint32Array(posBuffer);
+            // Fill and sort with positions.
+            for (let i = 0; i < this.size; i++) {
+                this.idsSorted[i] = this.ids.at(i);
+                this.sortedIdPositionToIndex[i] = i;
+            }
+            // Sort by id, carrying position; use native sort on chunks or a custom radix/merge for stability.
+            // For simplicity:
+            const tmp = Array.from({ length: this.size }, (_, i) => ({
+                id: this.idsSorted[i],
+                pos: this.sortedIdPositionToIndex[i],
+            }));
+            tmp.sort((a, b) => a.id - b.id);
+            tmp.forEach(({ id, pos }, i) => {
+                this.idsSorted[i] = id;
+                this.sortedIdPositionToIndex[i] = pos;
+            });
+        }
+        else {
+            // Point to the same array
+            this.idsSorted = this.ids.array;
+            // Create the sortedIdPositionToIndex array
+            const posBuffer = new BufferConstructor(this.size * Uint32Array.BYTES_PER_ELEMENT);
+            this.sortedIdPositionToIndex = new Uint32Array(posBuffer);
+            for (let i = 0; i < this.size; i++) {
+                this.sortedIdPositionToIndex[i] = i;
+            }
+        }
+        // Build anchors (every blockSize-th key)
+        const aLen = Math.ceil(this.size / BLOCK_SIZE);
+        const sab = new BufferConstructor(aLen * Float64Array.BYTES_PER_ELEMENT);
+        this.anchors = new Float64Array(sab, 0, aLen);
+        for (let j = 0; j < aLen; j++) {
+            const id = this.idsSorted[Math.min(j * BLOCK_SIZE, this.size - 1)];
+            assertValue(id, "ID is undefined");
+            this.anchors[j] = id;
+        }
+        this.indexBuilt = true;
+    }
+    /**
+     * Look up the internal array index for an OSM entity ID.
+     *
+     * @param id - The OSM entity ID to look up.
+     * @returns The internal array index, or -1 if not found.
+     * @throws If the index has not been built.
+     */
+    getIndexFromId(id) {
+        if (!this.indexBuilt)
+            throw Error("IdIndex not built.");
+        // binary search anchors
+        let lo = 0;
+        let hi = this.anchors.length - 1;
+        while (lo < hi) {
+            const mid = (lo + hi + 1) >>> 1;
+            const anchor = this.anchors[mid];
+            assertValue(anchor, "Anchor is undefined");
+            if (anchor <= id)
+                lo = mid;
+            else
+                hi = mid - 1;
+        }
+        const start = lo * BLOCK_SIZE;
+        const end = Math.min(start + BLOCK_SIZE, this.idsSorted.length);
+        // binary search within block
+        let l = start;
+        let r = end - 1;
+        while (l <= r) {
+            const m = (l + r) >>> 1;
+            const v = this.idsSorted[m];
+            assertValue(v, "Value is undefined");
+            if (v === id) {
+                if (this.idsAreSorted)
+                    return m;
+                const index = this.sortedIdPositionToIndex[m];
+                assertValue(index, "Position is undefined");
+                return index;
+            }
+            if (v < id)
+                l = m + 1;
+            else
+                r = m - 1;
+        }
+        // ID not found
+        return -1;
+    }
+    /**
+     * Pass an ID or an index, get both.
+     */
+    idOrIndex(i) {
+        if ("id" in i)
+            return [this.getIndexFromId(i.id), i.id];
+        return [i.index, this.at(i.index)];
+    }
+    /** Returns the sorted array of IDs for iteration. */
+    get sorted() {
+        return this.idsSorted;
+    }
+    /**
+     * Get transferable buffers for passing to another thread.
+     * @returns Serializable representation of this index.
+     */
+    transferables() {
+        return {
+            ids: this.ids.array.buffer,
+            sortedIds: this.idsSorted.buffer,
+            sortedIdPositionToIndex: this.sortedIdPositionToIndex.buffer,
+            anchors: this.anchors.buffer,
+            idsAreSorted: this.idsAreSorted,
+        };
+    }
+    /**
+     * Get the approximate memory requirements for a given number of IDs in bytes.
+     */
+    static getBytesRequired(count) {
+        if (count === 0)
+            return 0;
+        return (count * Float64Array.BYTES_PER_ELEMENT + // ids
+            count * Float64Array.BYTES_PER_ELEMENT + // sortedIds
+            count * Uint32Array.BYTES_PER_ELEMENT + // sortedIdPositionToIndex
+            Math.ceil(count / BLOCK_SIZE) * Float64Array.BYTES_PER_ELEMENT // anchors
+        );
+    }
+}
+//# sourceMappingURL=ids.js.map

package/dist/core/src/ids.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ids.js","sourceRoot":"","sources":["../../../src/ids.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAA;AAClD,OAAO,EACN,iBAAiB,EAEjB,oBAAoB,IAAI,GAAG,GAC3B,MAAM,gBAAgB,CAAA;AAOvB;;;;GAIG;AACH,MAAM,UAAU,GAAG,GAAG,CAAA;AAkBtB;;;;;GAKG;AACH,MAAM,OAAO,GAAG;IACf,iCAAiC;IACzB,GAAG,CAAmB;IAC9B,2CAA2C;IACnC,UAAU,GAAG,KAAK,CAAA;IAC1B,4EAA4E;IACpE,YAAY,GAAG,IAAI,CAAA;IAC3B,2CAA2C;IACnC,SAAS,CAAc;IAC/B,+DAA+D;IACvD,uBAAuB,CAAa;IAC5C,8EAA8E;IACtE,OAAO,CAAc;IAE7B;;;OAGG;IACH,YAAY,aAAgC;QAC3C,IAAI,aAAa,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,aAAa,CAAC,GAAG,CAAC,CAAA;YACpD,IAAI,CAAC,SAAS,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,SAAS,CAAC,CAAA;YAC1D,IAAI,CAAC,uBAAuB,GAAG,IAAI,WAAW,CAC7C,aAAa,CAAC,uBAAuB,CACrC,CAAA;YACD,IAAI,CAAC,OAAO,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;YACtD,IAAI,CAAC,YAAY,GAAG,aAAa,CAAC,YAAY,CAAA;YAC9C,IAAI,CAAC,UAAU,GAAG,IAAI,CAAA;QACvB,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAA;YAChC,IAAI,CAAC,SAAS,GAAG,IAAI,YAAY,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3D,IAAI,CAAC,uBAAuB,GAAG,IAAI,WAAW,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAA;YACxE,IAAI,CAAC,OAAO,GAAG,IAAI,YAAY,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAA;QAC1D,CAAC;IACF,CAAC;IAED,0CAA0C;IAC1C,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAA;IACvB,CAAC;IAED,4EAA4E;IAC5E,OAAO;QACN,OAAO,IAAI,CAAC,UAAU,CAAA;IACvB,CAAC;IAED,4DAA4D;IAC5D,QAAQ;QACP,OAAO,IAAI,CAAC,YAAY,CAAA;IACzB,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,EAAU;QACb,IAAI,IAAI,CAAC,UAAU;YAAE,MAAM,KAAK,CAAC,yBAAyB,CAAC,CAAA;QAC3D,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,YAAY,GAAG,KAAK,CAAA;QAC1E,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACzB,CAAC;IAED;;;;OAIG;IACH,EAAE,CAAC,KAAa;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;IAC1B,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,EAAU;QACb,OAAO,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;IACtC,CAAC;IAED;;;;;OAKG;IACH,UAAU;QACT,IAAI,IAAI,CAAC,UAAU;YAAE,MAAM,KAAK,CAAC,yBAAyB,CAAC,CAAA;QAC3D,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAA;QAClB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACxB,OAAO,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAA;YACnD,yBAAyB;YACzB,MAAM,SAAS,GAAG,IAAI,iBAAiB,CACtC,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC,iBAAiB,CAC1C,CAAA;YACD,MAAM,SAAS,GAAG,IAAI,iBAAiB,CACtC,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC,iBAAiB,CACzC,CAAA;YACD,IAAI,CAAC,SAAS,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAA;YAC5C,IAAI,CAAC,uBAAuB,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAA;YAEzD,gCAAgC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;gBAClC,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YACpC,CAAC;YAED,kGAAkG;YAClG,kBAAkB;YAClB,MAAM,GAAG,GAAkC,KAAK,CAAC,IAAI,CACpD,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,EACrB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBACV,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAW;gBAC/B,GAAG,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAW;aAC9C,CAAC,CACF,CAAA;YACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAA;YAC/B,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;gBAC9B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAA;gBACtB,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;YACtC,CAAC,CAAC,CAAA;QACH,CAAC;aAAM,CAAC;YACP,0BAA0B;YAC1B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAA;YAC/B,2CAA2C;YAC3C,MAAM,SAAS,GAAG,IAAI,iBAAiB,CACtC,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC,iBAAiB,CACzC,CAAA;YACD,IAAI,CAAC,uBAAuB,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAA;YACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YACpC,CAAC;QACF,CAAC;QAED,yCAAyC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,CAAA;QAC9C,MAAM,GAAG,GAAG,IAAI,iBAAiB,CAAC,IAAI,GAAG,YAAY,CAAC,iBAAiB,CAAC,CAAA;QACxE,IAAI,CAAC,OAAO,GAAG,IAAI,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;QAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAA;YAClE,WAAW,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAA;YAClC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,CAAA;QACrB,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,IAAI,CAAA;IACvB,CAAC;IAED;;;;;;OAMG;IACH,cAAc,CAAC,EAAU;QACxB,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,MAAM,KAAK,CAAC,oBAAoB,CAAC,CAAA;QAEvD,wBAAwB;QACxB,IAAI,EAAE,GAAG,CAAC,CAAA;QACV,IAAI,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;QAChC,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YAChB,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;YAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;YAChC,WAAW,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAA;YAC1C,IAAI,MAAM,IAAI,EAAE;gBAAE,EAAE,GAAG,GAAG,CAAA;;gBACrB,EAAE,GAAG,GAAG,GAAG,CAAC,CAAA;QAClB,CAAC;QACD,MAAM,KAAK,GAAG,EAAE,GAAG,UAAU,CAAA;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;QAE/D,6BAA6B;QAC7B,IAAI,CAAC,GAAG,KAAK,CAAA;QACb,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;QACf,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACf,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;YACvB,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;YAC3B,WAAW,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAA;YACpC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;gBACd,IAAI,IAAI,CAAC,YAAY;oBAAE,OAAO,CAAC,CAAA;gBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAA;gBAC7C,WAAW,CAAC,KAAK,EAAE,uBAAuB,CAAC,CAAA;gBAC3C,OAAO,KAAK,CAAA;YACb,CAAC;YACD,IAAI,CAAC,GAAG,EAAE;gBAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;;gBAChB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACf,CAAC;QAED,eAAe;QACf,OAAO,CAAC,CAAC,CAAA;IACV,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,CAAY;QACrB,IAAI,IAAI,IAAI,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAA;QACvD,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;IACnC,CAAC;IAED,qDAAqD;IACrD,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,SAAS,CAAA;IACtB,CAAC;IAED;;;OAGG;IACH,aAAa;QACZ,OAAO;YACN,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM;YAC1B,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM;YAChC,uBAAuB,EAAE,IAAI,CAAC,uBAAuB,CAAC,MAAM;YAC5D,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM;YAC5B,YAAY,EAAE,IAAI,CAAC,YAAY;SAC/B,CAAA;IACF,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,gBAAgB,CAAC,KAAa;QACpC,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,CAAC,CAAA;QACzB,OAAO,CACN,KAAK,GAAG,YAAY,CAAC,iBAAiB,GAAG,MAAM;YAC/C,KAAK,GAAG,YAAY,CAAC,iBAAiB,GAAG,YAAY;YACrD,KAAK,GAAG,WAAW,CAAC,iBAAiB,GAAG,0BAA0B;YAClE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,YAAY,CAAC,iBAAiB,CAAC,UAAU;SACzE,CAAA;IACF,CAAC;CACD"}

package/dist/core/src/index.d.ts

@@ -0,0 +1,32 @@
+/**
+ * @osmix/core - In-memory OSM entity storage with spatial indexing.
+ *
+ * Efficiently stores and queries OpenStreetMap entities (nodes, ways, relations).
+ *
+ * Features:
+ * - **Memory-efficient**: Uses typed arrays and Int32Array microdegrees.
+ * - **Spatial indexing**: KDBush (points) and Flatbush (bboxes) for fast geographic queries.
+ * - **Worker-ready**: Zero-copy transfer via `transferables()`.
+ * - **Tag indexing**: Fast reverse lookup by tag key.
+ *
+ * @example
+ * ```ts
+ * import { Osm } from "@osmix/core"
+ * const osm = new Osm({ id: "example" })
+ * osm.nodes.addNode({ id: 1, lon: -122.4, lat: 47.6, tags: { name: "Seattle" } })
+ * osm.buildIndexes()
+ * osm.buildSpatialIndexes()
+ * const nearby = osm.nodes.findIndexesWithinRadius(-122.4, 47.6, 10)
+ * ```
+ *
+ * @module @osmix/core
+ */
+export * from "./nodes";
+export * from "./osm";
+export * from "./relations";
+export * from "./stringtable";
+export * from "./tags";
+export { BufferConstructor, type BufferType } from "./typed-arrays";
+export * from "./utils";
+export * from "./ways";
+//# sourceMappingURL=index.d.ts.map

package/dist/core/src/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAMH,cAAc,SAAS,CAAA;AACvB,cAAc,OAAO,CAAA;AACrB,cAAc,aAAa,CAAA;AAC3B,cAAc,eAAe,CAAA;AAC7B,cAAc,QAAQ,CAAA;AACtB,OAAO,EAAE,iBAAiB,EAAE,KAAK,UAAU,EAAE,MAAM,gBAAgB,CAAA;AACnE,cAAc,SAAS,CAAA;AACvB,cAAc,QAAQ,CAAA"}

package/dist/core/src/index.js

@@ -0,0 +1,35 @@
+/**
+ * @osmix/core - In-memory OSM entity storage with spatial indexing.
+ *
+ * Efficiently stores and queries OpenStreetMap entities (nodes, ways, relations).
+ *
+ * Features:
+ * - **Memory-efficient**: Uses typed arrays and Int32Array microdegrees.
+ * - **Spatial indexing**: KDBush (points) and Flatbush (bboxes) for fast geographic queries.
+ * - **Worker-ready**: Zero-copy transfer via `transferables()`.
+ * - **Tag indexing**: Fast reverse lookup by tag key.
+ *
+ * @example
+ * ```ts
+ * import { Osm } from "@osmix/core"
+ * const osm = new Osm({ id: "example" })
+ * osm.nodes.addNode({ id: 1, lon: -122.4, lat: 47.6, tags: { name: "Seattle" } })
+ * osm.buildIndexes()
+ * osm.buildSpatialIndexes()
+ * const nearby = osm.nodes.findIndexesWithinRadius(-122.4, 47.6, 10)
+ * ```
+ *
+ * @module @osmix/core
+ */
+/// <reference path="./types/kdbush.d.ts" />
+/// <reference path="./types/geokdbush.d.ts" />
+/// <reference path="./types/geoflatbush.d.ts" />
+export * from "./nodes";
+export * from "./osm";
+export * from "./relations";
+export * from "./stringtable";
+export * from "./tags";
+export { BufferConstructor } from "./typed-arrays";
+export * from "./utils"; // TODO Move into shared?
+export * from "./ways";
+//# sourceMappingURL=index.js.map

package/dist/core/src/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,4CAA4C;AAC5C,+CAA+C;AAC/C,iDAAiD;AAEjD,cAAc,SAAS,CAAA;AACvB,cAAc,OAAO,CAAA;AACrB,cAAc,aAAa,CAAA;AAC3B,cAAc,eAAe,CAAA;AAC7B,cAAc,QAAQ,CAAA;AACtB,OAAO,EAAE,iBAAiB,EAAmB,MAAM,gBAAgB,CAAA;AACnE,cAAc,SAAS,CAAA,CAAC,yBAAyB;AACjD,cAAc,QAAQ,CAAA"}

package/dist/core/src/nodes.d.ts

@@ -0,0 +1,101 @@
+import type { OsmPbfBlock, OsmPbfDenseNodes } from "@osmix/pbf";
+import type { GeoBbox2D, OsmNode, OsmTags } from "@osmix/shared/types";
+import { Entities, type EntitiesTransferables } from "./entities";
+import { type IdOrIndex } from "./ids";
+import type StringTable from "./stringtable";
+import { type BufferType } from "./typed-arrays";
+export interface NodesTransferables<T extends BufferType = BufferType> extends EntitiesTransferables<T> {
+    lons: T;
+    lats: T;
+    bbox: GeoBbox2D;
+    /** Optional - can be rebuilt via buildSpatialIndex() */
+    spatialIndex?: T;
+}
+export interface AddNodeOptions {
+    filter?: (node: OsmNode) => boolean;
+}
+export declare class Nodes extends Entities<OsmNode> {
+    /**
+     * Coordinates are stored as integer microdegrees (Int32Array).
+     * Use OSM_COORD_SCALE (1e7) to convert between degrees and microdegrees.
+     */
+    private lons;
+    private lats;
+    private bbox;
+    private spatialIndex;
+    private spatialIndexBuilt;
+    /**
+     * Create a new Nodes index.
+     */
+    constructor(stringTable: StringTable, transferables?: NodesTransferables);
+    /**
+     * Add a single node to the index.
+     */
+    addNode(node: OsmNode): number;
+    /**
+     * Add dense nodes from a PBF block.
+     */
+    addDenseNodes(dense: OsmPbfDenseNodes, block: OsmPbfBlock, blockStringIndexMap: Uint32Array, filter?: (node: OsmNode) => boolean): number;
+    /**
+     * Compact the internal arrays to free up memory.
+     */
+    buildEntityIndex(): void;
+    /**
+     * Build the spatial index for nodes.
+     * Spatial index stores degrees (Float64Array) for geokdbush compatibility.
+     */
+    buildSpatialIndex(): void;
+    /**
+     * Check if the spatial index has been built.
+     */
+    hasSpatialIndex(): boolean;
+    /**
+     * Get the bounding box of all nodes.
+     */
+    getBbox(): GeoBbox2D;
+    /**
+     * Get the bounding box of a specific node.
+     */
+    getEntityBbox(i: IdOrIndex): GeoBbox2D;
+    /**
+     * Get the longitude and latitude of a specific node.
+     */
+    getNodeLonLat(i: IdOrIndex): [number, number];
+    /**
+     * Get the full node entity.
+     */
+    getFullEntity(index: number, id: number, tags?: OsmTags): OsmNode;
+    /**
+     * Find node indexes within a bounding box.
+     */
+    findIndexesWithinBbox(bbox: GeoBbox2D): number[];
+    /**
+     * Find node indexes within a radius of a point.
+     * Uses geokdbush for proper great-circle distance calculations.
+     * @param lon - Longitude in degrees.
+     * @param lat - Latitude in degrees.
+     * @param radiusKm - Radius in kilometers.
+     * @returns Array of node indexes within the radius.
+     */
+    findIndexesWithinRadius(lon: number, lat: number, radiusKm: number): number[];
+    /**
+     * Get nodes within a bounding box.
+     * @param bbox - The bounding box to search within.
+     * @param include - A function to filter nodes. If provided, only nodes for which the function returns true will be included.
+     * @returns An object containing the IDs and positions of the nodes within the bounding box.
+     */
+    withinBbox(bbox: GeoBbox2D, include?: (i: number) => boolean): {
+        ids: Float64Array;
+        positions: Float64Array;
+    };
+    /**
+     * Get transferable objects for passing to another thread.
+     * Only includes spatialIndex if it has been built.
+     */
+    transferables(): NodesTransferables;
+    /**
+     * Get the approximate memory requirements for a given number of nodes in bytes.
+     */
+    static getBytesRequired(count: number): number;
+}
+//# sourceMappingURL=nodes.d.ts.map

package/dist/core/src/nodes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodes.d.ts","sourceRoot":"","sources":["../../../src/nodes.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAA;AAG/D,OAAO,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAA;AAGtE,OAAO,EAAE,QAAQ,EAAE,KAAK,qBAAqB,EAAE,MAAM,YAAY,CAAA;AACjE,OAAO,EAAE,KAAK,SAAS,EAAO,MAAM,OAAO,CAAA;AAC3C,OAAO,KAAK,WAAW,MAAM,eAAe,CAAA;AAE5C,OAAO,EAEN,KAAK,UAAU,EAEf,MAAM,gBAAgB,CAAA;AAEvB,MAAM,WAAW,kBAAkB,CAAC,CAAC,SAAS,UAAU,GAAG,UAAU,CACpE,SAAQ,qBAAqB,CAAC,CAAC,CAAC;IAChC,IAAI,EAAE,CAAC,CAAA;IACP,IAAI,EAAE,CAAC,CAAA;IACP,IAAI,EAAE,SAAS,CAAA;IACf,wDAAwD;IACxD,YAAY,CAAC,EAAE,CAAC,CAAA;CAChB;AAED,MAAM,WAAW,cAAc;IAC9B,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,OAAO,KAAK,OAAO,CAAA;CACnC;AAED,qBAAa,KAAM,SAAQ,QAAQ,CAAC,OAAO,CAAC;IAC3C;;;OAGG;IACH,OAAO,CAAC,IAAI,CAAiB;IAC7B,OAAO,CAAC,IAAI,CAAiB;IAE7B,OAAO,CAAC,IAAI,CAUX;IAED,OAAO,CAAC,YAAY,CAKnB;IAED,OAAO,CAAC,iBAAiB,CAAQ;IAEjC;;OAEG;gBACS,WAAW,EAAE,WAAW,EAAE,aAAa,CAAC,EAAE,kBAAkB;IAyBxE;;OAEG;IACH,OAAO,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM;IAiB9B;;OAEG;IACH,aAAa,CACZ,KAAK,EAAE,gBAAgB,EACvB,KAAK,EAAE,WAAW,EAClB,mBAAmB,EAAE,WAAW,EAChC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,OAAO,KAAK,OAAO,GACjC,MAAM;IAqFT;;OAEG;IACH,gBAAgB;IAKhB;;;OAGG;IACH,iBAAiB;IAoBjB;;OAEG;IACH,eAAe,IAAI,OAAO;IAI1B;;OAEG;IACH,OAAO,IAAI,SAAS;IAIpB;;OAEG;IACH,aAAa,CAAC,CAAC,EAAE,SAAS,GAAG,SAAS;IAOtC;;OAEG;IACH,aAAa,CAAC,CAAC,EAAE,SAAS,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAQ7C;;OAEG;IACH,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO;IAkBjE;;OAEG;IACH,qBAAqB,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM,EAAE;IAKhD;;;;;;;OAOG;IACH,uBAAuB,CACtB,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EACX,QAAQ,EAAE,MAAM,GACd,MAAM,EAAE;IAWX;;;;;OAKG;IACH,UAAU,CACT,IAAI,EAAE,SAAS,EACf,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,GAC9B;QACF,GAAG,EAAE,YAAY,CAAA;QACjB,SAAS,EAAE,YAAY,CAAA;KACvB;IAyBD;;;OAGG;IACM,aAAa,IAAI,kBAAkB;IAc5C;;OAEG;IACH,MAAM,CAAC,gBAAgB,CAAC,KAAK,EAAE,MAAM;CAgBrC"}