@osmix/core 0.1.3 → 0.1.6

package/dist/src/entities.js

@@ -1,159 +0,0 @@
-/**
- * Base class for OSM entity collections.
- *
- * Provides common ID and tag storage, streaming iteration, and sorted access.
- * Subclasses implement entity-specific storage and spatial indexing.
- *
- * @module
- */
-/**
- * Abstract base for typed entity collections.
- *
- * Lifecycle:
- * 1. **Ingest**: `addEntity()` (no lookups).
- * 2. **Finalize**: `buildIndex()`.
- * 3. **Query**: Lookups and iteration enabled.
- */
-export class Entities {
-    /** The type of entity stored in this collection ("node", "way", or "relation"). */
-    indexType;
-    /** ID storage and lookup */
-    ids;
-    /** Tag storage and search */
-    tags;
-    /** Whether buildIndex() has been called */
-    indexBuilt = false;
-    /**
-     * Create a new Entities collection.
-     * @param indexType - The entity type ("node", "way", or "relation").
-     * @param ids - The ID storage instance.
-     * @param tags - The tag storage instance.
-     */
-    constructor(indexType, ids, tags) {
-        this.indexType = indexType;
-        this.ids = ids;
-        this.tags = tags;
-    }
-    /**
-     * Get transferable objects for passing to another thread.
-     */
-    transferables() {
-        return {
-            ...this.ids.transferables(),
-            ...this.tags.transferables(),
-        };
-    }
-    /**
-     * Check if the index is built and ready for use.
-     */
-    isReady() {
-        return this.ids.isReady() && this.tags.isReady() && this.indexBuilt;
-    }
-    /** Number of entities in this collection. */
-    get size() {
-        return this.ids.size;
-    }
-    /**
-     * Finalize indexes.
-     * Must be called after adding entities and before querying.
-     */
-    buildIndex() {
-        if (this.indexBuilt)
-            return;
-        console.time(`${this.indexType}Index.buildIndex`);
-        this.ids.buildIndex();
-        this.tags.buildIndex();
-        this.buildEntityIndex();
-        this.indexBuilt = true;
-        console.timeEnd(`${this.indexType}Index.buildIndex`);
-    }
-    addEntity(id, tags, values) {
-        const entityIndex = this.ids.add(id);
-        if (Array.isArray(tags)) {
-            if (values === undefined)
-                throw Error("Values are required when tags is an array");
-            this.tags.addTagKeysAndValues(entityIndex, tags, values);
-        }
-        else {
-            this.tags.addTags(entityIndex, tags);
-        }
-        return entityIndex;
-    }
-    /**
-     * Get an entity by ID or index.
-     */
-    get(idOrIndex) {
-        const [index, id] = this.ids.idOrIndex(idOrIndex);
-        if (index === -1)
-            return null;
-        return this.getFullEntity(index, id, this.tags.getTags(index));
-    }
-    /**
-     * Get an entity by index.
-     */
-    getByIndex(index) {
-        return this.getFullEntity(index, this.ids.at(index), this.tags.getTags(index));
-    }
-    /**
-     * Get multiple entities by their indexes.
-     */
-    getEntitiesByIndex(indexes) {
-        const entities = [];
-        for (const index of indexes) {
-            const entity = this.getByIndex(index);
-            if (entity)
-                entities.push(entity);
-            else
-                throw Error(`Entity not found at index ${index}`);
-        }
-        return entities;
-    }
-    /**
-     * Iterate over all entities in the index.
-     */
-    *[Symbol.iterator]() {
-        for (let i = 0; i < this.size; i++) {
-            yield this.getFullEntity(i, this.ids.at(i), this.tags.getTags(i));
-        }
-    }
-    /**
-     * Get an entity by ID.
-     */
-    getById(id) {
-        const index = this.ids.getIndexFromId(id);
-        if (index !== -1)
-            return this.getFullEntity(index, id, this.tags.getTags(index));
-        return null;
-    }
-    /**
-     * Iterate over entities sorted by ID.
-     */
-    *sorted() {
-        for (const id of this.ids.sorted) {
-            const index = this.ids.getIndexFromId(id);
-            if (index === -1)
-                throw Error(`Entity not found at id ${id}`);
-            yield this.getFullEntity(index, id, this.tags.getTags(index));
-        }
-    }
-    /**
-     * Search for entities with a specific tag key and optional value.
-     */
-    search(key, val) {
-        const keyIndex = this.tags.find(key);
-        const entities = this.tags
-            .hasKey(keyIndex)
-            .map((index) => this.getByIndex(index));
-        if (val === undefined)
-            return entities;
-        return entities.filter((entity) => entity.tags?.[key] === val);
-    }
-    /**
-     * Update a ContentHasher with this entity collection's base data (IDs and tags).
-     * Subclasses should override to add entity-specific data.
-     */
-    updateHash(hasher) {
-        return this.ids.updateHash(this.tags.updateHash(hasher));
-    }
-}
-//# sourceMappingURL=entities.js.map

package/dist/src/entities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"entities.js","sourceRoot":"","sources":["../../src/entities.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAqBH;;;;;;;GAOG;AACH,MAAM,OAAgB,QAAQ;IAC7B,mFAAmF;IACnF,SAAS,CAAe;IACxB,4BAA4B;IAC5B,GAAG,CAAK;IACR,6BAA6B;IAC7B,IAAI,CAAM;IAEV,2CAA2C;IACjC,UAAU,GAAG,KAAK,CAAA;IAE5B;;;;;OAKG;IACH,YAAY,SAAwB,EAAE,GAAQ,EAAE,IAAU;QACzD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;QAC1B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAA;QACd,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;IACjB,CAAC;IAED;;OAEG;IACH,aAAa;QACZ,OAAO;YACN,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE;YAC3B,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE;SAC5B,CAAA;IACF,CAAC;IAED;;OAEG;IACH,OAAO;QACN,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,UAAU,CAAA;IACpE,CAAC;IAED,6CAA6C;IAC7C,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAA;IACrB,CAAC;IASD;;;OAGG;IACH,UAAU;QACT,IAAI,IAAI,CAAC,UAAU;YAAE,OAAM;QAC3B,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,kBAAkB,CAAC,CAAA;QACjD,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAA;QACrB,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAA;QACtB,IAAI,CAAC,gBAAgB,EAAE,CAAA;QACvB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAA;QACtB,OAAO,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,kBAAkB,CAAC,CAAA;IACrD,CAAC;IAyBD,SAAS,CAAC,EAAU,EAAE,IAAwB,EAAE,MAAiB;QAChE,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACpC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACzB,IAAI,MAAM,KAAK,SAAS;gBACvB,MAAM,KAAK,CAAC,2CAA2C,CAAC,CAAA;YACzD,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,WAAW,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;QACzD,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,CAAA;QACrC,CAAC;QACD,OAAO,WAAW,CAAA;IACnB,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,SAAoB;QACvB,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,CAAA;QACjD,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,OAAO,IAAI,CAAA;QAC7B,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAA;IAC/D,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,KAAa;QACvB,OAAO,IAAI,CAAC,aAAa,CACxB,KAAK,EACL,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,EAClB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CACxB,CAAA;IACF,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,OAAiB;QACnC,MAAM,QAAQ,GAAQ,EAAE,CAAA;QACxB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;YACrC,IAAI,MAAM;gBAAE,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;;gBAC5B,MAAM,KAAK,CAAC,6BAA6B,KAAK,EAAE,CAAC,CAAA;QACvD,CAAC;QACD,OAAO,QAAQ,CAAA;IAChB,CAAC;IAED;;OAEG;IACH,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QAClE,CAAC;IACF,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC,CAAA;QACzC,IAAI,KAAK,KAAK,CAAC,CAAC;YACf,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAA;QAC/D,OAAO,IAAI,CAAA;IACZ,CAAC;IAED;;OAEG;IACH,CAAC,MAAM;QACN,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC,CAAA;YACzC,IAAI,KAAK,KAAK,CAAC,CAAC;gBAAE,MAAM,KAAK,CAAC,0BAA0B,EAAE,EAAE,CAAC,CAAA;YAC7D,MAAM,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAA;QAC9D,CAAC;IACF,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,GAAW,EAAE,GAAY;QAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI;aACxB,MAAM,CAAC,QAAQ,CAAC;aAChB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAA;QACxC,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAA;QACtC,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAA;IAC/D,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,MAAqB;QAC/B,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAA;IACzD,CAAC;CACD"}

package/dist/src/ids.d.ts

@@ -1,119 +0,0 @@
-/**
- * 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";
-import type { ContentHasher } from "./utils";
-/**
- * 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;
-    /**
-     * Update a ContentHasher with the IDs data.
-     * Uses the sorted IDs for consistent hashing regardless of insertion order.
-     */
-    updateHash(hasher: ContentHasher): ContentHasher;
-}
-//# sourceMappingURL=ids.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"ids.d.ts","sourceRoot":"","sources":["../../src/ids.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAEN,KAAK,UAAU,EAEf,MAAM,gBAAgB,CAAA;AACvB,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,SAAS,CAAA;AAE5C;;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;IAUrC;;;OAGG;IACH,UAAU,CAAC,MAAM,EAAE,aAAa,GAAG,aAAa;CAGhD"}

package/dist/src/ids.js

@@ -1,243 +0,0 @@
-/**
- * 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
-        );
-    }
-    /**
-     * Update a ContentHasher with the IDs data.
-     * Uses the sorted IDs for consistent hashing regardless of insertion order.
-     */
-    updateHash(hasher) {
-        return hasher.update(this.idsSorted);
-    }
-}
-//# sourceMappingURL=ids.js.map

package/dist/src/ids.js.map

@@ -1 +0,0 @@
-{"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;AAQvB;;;;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;IAED;;;OAGG;IACH,UAAU,CAAC,MAAqB;QAC/B,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IACrC,CAAC;CACD"}

package/dist/src/index.d.ts

@@ -1,32 +0,0 @@
-/**
- * @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/src/index.d.ts.map

@@ -1 +0,0 @@
-{"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/src/index.js

@@ -1,35 +0,0 @@
-/**
- * @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/src/index.js.map

@@ -1 +0,0 @@
-{"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"}