dxf-json 0.0.10 → 0.0.16

package/dist/utils/functional.js

@@ -1,111 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.groupPairs = exports.findLast = exports.separate = exports.reverseIterator = exports.subIterator = exports.argmin = exports.adjacentPairs = void 0;
-function* adjacentPairs(itr, n, isClosed) {
-    const first = new Array(n - 1);
-    const buffer = new Array(n);
-    let count = 0;
-    for (const value of itr) {
-        pull(buffer, value);
-        if (++count >= n) {
-            yield [...buffer];
-        }
-        else if (count < n) {
-            first[count - 1] = value;
-        }
-    }
-    if (count >= n && isClosed) {
-        for (const value of first) {
-            pull(buffer, value);
-            yield [...buffer];
-        }
-    }
-}
-exports.adjacentPairs = adjacentPairs;
-function pull(values, newValue) {
-    for (let i = 0; i < values.length - 1; ++i) {
-        values[i] = values[i + 1];
-    }
-    values[values.length - 1] = newValue;
-}
-function argmin(itr, evaluator) {
-    let score = Infinity;
-    let target = null;
-    let index = -1;
-    let count = 0;
-    for (const value of itr) {
-        const newScore = evaluator(value);
-        if (score > newScore) {
-            score = newScore;
-            target = value;
-            index = count;
-        }
-        ++count;
-    }
-    return { target, score, index };
-}
-exports.argmin = argmin;
-function* subIterator(array, start, end) {
-    for (let i = start; i <= end; ++i) {
-        yield array[i];
-    }
-}
-exports.subIterator = subIterator;
-function* reverseIterator(array) {
-    for (let i = array.length - 1; i >= 0; --i) {
-        yield array[i];
-    }
-}
-exports.reverseIterator = reverseIterator;
-function separate(predicate, itr) {
-    const truthy = [];
-    const falsy = [];
-    for (const value of itr) {
-        if (predicate(value)) {
-            truthy.push(value);
-        }
-        else {
-            falsy.push(value);
-        }
-    }
-    return [truthy, falsy];
-}
-exports.separate = separate;
-function findLast(predicate, isIncremental, // true일 경우, predicate가 실패하는 즉시 종료
-itr) {
-    let lastSatisfyingIndex = -1;
-    let lastSatisfying = undefined;
-    let index = 0;
-    for (const value of itr) {
-        if (predicate(value)) {
-            lastSatisfyingIndex = index;
-            lastSatisfying = value;
-        }
-        else if (isIncremental) {
-            break;
-        }
-        index += 1;
-    }
-    return [lastSatisfying, lastSatisfyingIndex];
-}
-exports.findLast = findLast;
-/**
- * size개씩 자른 것을 생성한다. 만약 마지막에 size개가 안되면 그냥 되는대로 준다.
- * @param size
- * @param iterable
- */
-function* groupPairs(size, iterable) {
-    let pairs = [];
-    for (const value of iterable) {
-        pairs.push(value);
-        if (pairs.length >= size) {
-            yield pairs;
-            pairs = [];
-        }
-    }
-    if (pairs.length) {
-        yield pairs;
-    }
-}
-exports.groupPairs = groupPairs;
-//# sourceMappingURL=functional.js.map

package/dist/utils/functional.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"functional.js","sourceRoot":"","sources":["../../src/utils/functional.ts"],"names":[],"mappings":";;;AAAA,QAAe,CAAC,CAAC,aAAa,CAC1B,GAAgB,EAChB,CAAS,EACT,QAAkB;IAElB,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAQ,CAAC;IACtC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAQ,CAAC;IACnC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAEpB,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;QACtB,CAAC;aAAM,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACnB,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAC7B,CAAC;IACL,CAAC;IACD,IAAI,KAAK,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YACxB,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;QACtB,CAAC;IACL,CAAC;AACL,CAAC;AAvBD,sCAuBC;AAED,SAAS,IAAI,CAAI,MAAW,EAAE,QAAW;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QACzC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;AACzC,CAAC;AAED,SAAgB,MAAM,CAAI,GAAgB,EAAE,SAA+B;IACvE,IAAI,KAAK,GAAG,QAAQ,CAAC;IACrB,IAAI,MAAM,GAAM,IAAS,CAAC;IAC1B,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;QAElC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;YACnB,KAAK,GAAG,QAAQ,CAAC;YACjB,MAAM,GAAG,KAAK,CAAC;YACf,KAAK,GAAG,KAAK,CAAC;QAClB,CAAC;QAED,EAAE,KAAK,CAAC;IACZ,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACpC,CAAC;AAnBD,wBAmBC;AAED,QAAe,CAAC,CAAC,WAAW,CAAI,KAAU,EAAE,KAAa,EAAE,GAAW;IAClE,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC;QAChC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;AACL,CAAC;AAJD,kCAIC;AAED,QAAe,CAAC,CAAC,eAAe,CAAI,KAAU;IAC1C,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QACzC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;AACL,CAAC;AAJD,0CAIC;AAED,SAAgB,QAAQ,CACpB,SAAgC,EAChC,GAAgB;IAEhB,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,MAAM,KAAK,GAAQ,EAAE,CAAC;IAEtB,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC;QACtB,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;aAAM,CAAC;YACJ,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;IACL,CAAC;IAED,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAC3B,CAAC;AAhBD,4BAgBC;AAED,SAAgB,QAAQ,CACpB,SAAgC,EAChC,aAAsB,EAAE,kCAAkC;AAC1D,GAAgB;IAEhB,IAAI,mBAAmB,GAAG,CAAC,CAAC,CAAC;IAC7B,IAAI,cAAc,GAAkB,SAAS,CAAC;IAC9C,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC;QACtB,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;YACnB,mBAAmB,GAAG,KAAK,CAAC;YAC5B,cAAc,GAAG,KAAK,CAAC;QAC3B,CAAC;aAAM,IAAI,aAAa,EAAE,CAAC;YACvB,MAAM;QACV,CAAC;QACD,KAAK,IAAI,CAAC,CAAC;IACf,CAAC;IAED,OAAO,CAAC,cAAc,EAAE,mBAAmB,CAAC,CAAC;AACjD,CAAC;AApBD,4BAoBC;AAED;;;;GAIG;AACH,QAAe,CAAC,CAAC,UAAU,CAAI,IAAY,EAAE,QAAqB;IAC9D,IAAI,KAAK,GAAQ,EAAE,CAAC;IACpB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAElB,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,CAAC;YACZ,KAAK,GAAG,EAAE,CAAC;QACf,CAAC;IACL,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACf,MAAM,KAAK,CAAC;IAChB,CAAC;AACL,CAAC;AAbD,gCAaC"}

package/dist/utils/graph.d.ts

@@ -1,19 +0,0 @@
-export interface Edge<E> {
-    index: number;
-    values: E[];
-}
-/**
- * 정수로 표현하는 무향 비단순 그래프
- * 두 정점 사이에 간선이 여러 개 존재할 수 있음
- * 인접 리스트를 사용
- * 간선에 값을 할당할 수 있음
- */
-export declare class UndirectedMultiGraph<T> {
-    vertices: Set<number>;
-    edges: Edge<T>[][];
-    addEdge(u: number, v: number, value: T): void;
-    getDegree(v: number): number;
-    getEdgeCount(u: number, v: number): number;
-    getNeighbors(u: number): Generator<Edge<T>, void, undefined>;
-    private connectDirected;
-}

package/dist/utils/graph.js

@@ -1,47 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.UndirectedMultiGraph = void 0;
-/**
- * 정수로 표현하는 무향 비단순 그래프
- * 두 정점 사이에 간선이 여러 개 존재할 수 있음
- * 인접 리스트를 사용
- * 간선에 값을 할당할 수 있음
- */
-class UndirectedMultiGraph {
-    constructor() {
-        this.vertices = new Set();
-        this.edges = [];
-    }
-    addEdge(u, v, value) {
-        this.vertices.add(u);
-        this.vertices.add(v);
-        this.connectDirected(u, v, value);
-        this.connectDirected(v, u, value);
-    }
-    getDegree(v) {
-        return this.edges[v].reduce((acc, neighbor) => neighbor.values.length + acc, 0);
-    }
-    getEdgeCount(u, v) {
-        var _a, _b, _c;
-        return ((_c = (_b = (_a = this.edges[u]) === null || _a === void 0 ? void 0 : _a.find(({ index }) => index === v)) === null || _b === void 0 ? void 0 : _b.values.length) !== null && _c !== void 0 ? _c : 0);
-    }
-    *getNeighbors(u) {
-        var _a;
-        if ((_a = this.edges[u]) === null || _a === void 0 ? void 0 : _a.length) {
-            yield* this.edges[u][Symbol.iterator]();
-        }
-    }
-    connectDirected(u, v, value) {
-        var _a;
-        var _b;
-        (_a = (_b = this.edges)[u]) !== null && _a !== void 0 ? _a : (_b[u] = []);
-        let neighbor = this.edges[u].find(({ index }) => index === v);
-        if (!neighbor) {
-            neighbor = { index: v, values: [] };
-            this.edges[u].push(neighbor);
-        }
-        neighbor.values.push(value);
-    }
-}
-exports.UndirectedMultiGraph = UndirectedMultiGraph;
-//# sourceMappingURL=graph.js.map

package/dist/utils/graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/utils/graph.ts"],"names":[],"mappings":";;;AAMA;;;;;GAKG;AACH,MAAa,oBAAoB;IAAjC;QACI,aAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QAC7B,UAAK,GAAG,EAAiB,CAAC;IAsC9B,CAAC;IApCG,OAAO,CAAC,CAAS,EAAE,CAAS,EAAE,KAAQ;QAClC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,SAAS,CAAC,CAAS;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CACvB,CAAC,GAAG,EAAE,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,GAAG,GAAG,EAC/C,CAAC,CACJ,CAAC;IACN,CAAC;IAED,YAAY,CAAC,CAAS,EAAE,CAAS;;QAC7B,OAAO,CACH,MAAA,MAAA,MAAA,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,0CAAE,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC,0CAAE,MAAM,CAAC,MAAM,mCAAI,CAAC,CACtE,CAAC;IACN,CAAC;IAED,CAAC,YAAY,CAAC,CAAS;;QACnB,IAAI,MAAA,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,0CAAE,MAAM,EAAE,CAAC;YACxB,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC5C,CAAC;IACL,CAAC;IAEO,eAAe,CAAC,CAAS,EAAE,CAAS,EAAE,KAAQ;;;QAClD,YAAA,IAAI,CAAC,KAAK,EAAC,CAAC,wCAAD,CAAC,IAAM,EAAE,EAAC;QAErB,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,QAAQ,EAAE,CAAC;YACZ,QAAQ,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACjC,CAAC;QACD,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;CACJ;AAxCD,oDAwCC"}

package/dist/utils/index.d.ts

@@ -1,30 +0,0 @@
-export * from './binarySearch';
-export * from './disjointSet';
-export * from './graph';
-export * from './functional';
-export * from './flooding';
-export * from './triangle';
-export * from './queue';
-import { Vector2, Vector3 } from 'three';
-import type { Bound, Point2D, Point3D } from '../types';
-export declare function pointToVector2(point: Point3D | Point2D): Vector2;
-export declare function pointToVector3(point: Point3D | Point2D): Vector3;
-export declare function swapVector(v1: Vector2, v2: Vector2): void;
-export declare function classify<T>(iterable: Iterable<T>, keySelector: (value: T) => string | undefined): Record<string, T[]>;
-export declare function updateBounds(v: Point2D, bounds?: Bound): Bound;
-export declare function getBoundBox(vertices: Iterable<Point2D>): {
-    minX: number;
-    maxX: number;
-    minY: number;
-    maxY: number;
-};
-/**
- * 정수 생성기
- *
- * @param start Inclusive
- * @param end Exclusive
- * @param increment Default = 1
- */
-export declare function generateIntegers(start: number, end?: number, increment?: number): Generator<number, void, unknown>;
-export declare function swap<T>(list: T[], i1: number, i2: number): void;
-export declare function pushIfNotEqual(v: Vector2, vertices: Vector2[]): void;

package/dist/utils/index.js

@@ -1,106 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.pushIfNotEqual = exports.swap = exports.generateIntegers = exports.getBoundBox = exports.updateBounds = exports.classify = exports.swapVector = exports.pointToVector3 = exports.pointToVector2 = void 0;
-__exportStar(require("./binarySearch"), exports);
-__exportStar(require("./disjointSet"), exports);
-__exportStar(require("./graph"), exports);
-__exportStar(require("./functional"), exports);
-__exportStar(require("./flooding"), exports);
-__exportStar(require("./triangle"), exports);
-__exportStar(require("./queue"), exports);
-const core_1 = require("@fxts/core");
-const three_1 = require("three");
-function pointToVector2(point) {
-    return new three_1.Vector2(point.x, point.y);
-}
-exports.pointToVector2 = pointToVector2;
-function pointToVector3(point) {
-    var _a;
-    return new three_1.Vector3(point.x, point.y, (_a = point.z) !== null && _a !== void 0 ? _a : 0);
-}
-exports.pointToVector3 = pointToVector3;
-function swapVector(v1, v2) {
-    let temp = v1.x;
-    v1.x = v2.x;
-    v2.x = temp;
-    temp = v1.y;
-    v1.y = v2.y;
-    v2.y = temp;
-}
-exports.swapVector = swapVector;
-function classify(iterable, keySelector) {
-    var _a;
-    const result = {};
-    for (const value of iterable) {
-        const key = keySelector(value);
-        if (key != null) {
-            (_a = result[key]) !== null && _a !== void 0 ? _a : (result[key] = []);
-            result[key].push(value);
-        }
-    }
-    return result;
-}
-exports.classify = classify;
-function updateBounds(v, bounds) {
-    bounds !== null && bounds !== void 0 ? bounds : (bounds = { minX: v.x, maxX: v.x, minY: v.y, maxY: v.y });
-    bounds.minX = Math.min(bounds.minX, v.x);
-    bounds.maxX = Math.max(bounds.maxX, v.x);
-    bounds.minY = Math.min(bounds.minY, v.y);
-    bounds.maxY = Math.max(bounds.maxY, v.y);
-    return bounds;
-}
-exports.updateBounds = updateBounds;
-function getBoundBox(vertices) {
-    return (0, core_1.reduce)((bound, v) => updateBounds(v, bound), {
-        minX: Infinity,
-        maxX: -Infinity,
-        minY: Infinity,
-        maxY: -Infinity,
-    }, vertices);
-}
-exports.getBoundBox = getBoundBox;
-/**
- * 정수 생성기
- *
- * @param start Inclusive
- * @param end Exclusive
- * @param increment Default = 1
- */
-function* generateIntegers(start, end = Infinity, increment = 1) {
-    for (let n = start; n !== end; n += increment) {
-        yield n;
-    }
-}
-exports.generateIntegers = generateIntegers;
-function swap(list, i1, i2) {
-    const temp = list[i1];
-    list[i1] = list[i2];
-    list[i2] = temp;
-}
-exports.swap = swap;
-function pushIfNotEqual(v, vertices) {
-    if (!vertices.length) {
-        vertices.push(v);
-        return;
-    }
-    const u = vertices.at(-1);
-    if (v.x !== u.x || v.y !== u.y) {
-        vertices.push(v);
-    }
-}
-exports.pushIfNotEqual = pushIfNotEqual;
-//# sourceMappingURL=index.js.map

package/dist/utils/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/utils/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,iDAA+B;AAC/B,gDAA8B;AAC9B,0CAAwB;AACxB,+CAA6B;AAC7B,6CAA2B;AAC3B,6CAA2B;AAC3B,0CAAwB;AAExB,qCAAoC;AACpC,iCAAyC;AAGzC,SAAgB,cAAc,CAAC,KAAwB;IACnD,OAAO,IAAI,eAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAFD,wCAEC;AAED,SAAgB,cAAc,CAAC,KAAwB;;IACnD,OAAO,IAAI,eAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,MAAC,KAAiB,CAAC,CAAC,mCAAI,CAAC,CAAC,CAAC;AACpE,CAAC;AAFD,wCAEC;AAED,SAAgB,UAAU,CAAC,EAAW,EAAE,EAAW;IAC/C,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;IAChB,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACZ,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;IACZ,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;IACZ,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACZ,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;AAChB,CAAC;AAPD,gCAOC;AAED,SAAgB,QAAQ,CACpB,QAAqB,EACrB,WAA6C;;IAE7C,MAAM,MAAM,GAAwB,EAAE,CAAC;IACvC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QAE/B,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;YACd,MAAA,MAAM,CAAC,GAAG,qCAAV,MAAM,CAAC,GAAG,IAAM,EAAE,EAAC;YACnB,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAdD,4BAcC;AAED,SAAgB,YAAY,CAAC,CAAU,EAAE,MAAc;IACnD,MAAM,aAAN,MAAM,cAAN,MAAM,IAAN,MAAM,GAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAC;IAC1D,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC;AAClB,CAAC;AAPD,oCAOC;AAED,SAAgB,WAAW,CAAC,QAA2B;IACnD,OAAO,IAAA,aAAM,EACT,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,EACpC;QACI,IAAI,EAAE,QAAQ;QACd,IAAI,EAAE,CAAC,QAAQ;QACf,IAAI,EAAE,QAAQ;QACd,IAAI,EAAE,CAAC,QAAQ;KAClB,EACD,QAAQ,CACX,CAAC;AACN,CAAC;AAXD,kCAWC;AAED;;;;;;GAMG;AACH,QAAe,CAAC,CAAC,gBAAgB,CAC7B,KAAa,EACb,MAAc,QAAQ,EACtB,YAAoB,CAAC;IAErB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;QAC5C,MAAM,CAAC,CAAC;IACZ,CAAC;AACL,CAAC;AARD,4CAQC;AAED,SAAgB,IAAI,CAAI,IAAS,EAAE,EAAU,EAAE,EAAU;IACrD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;IACtB,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;IACpB,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;AACpB,CAAC;AAJD,oBAIC;AAED,SAAgB,cAAc,CAAC,CAAU,EAAE,QAAmB;IAC1D,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;QACnB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,OAAO;IACX,CAAC;IAED,MAAM,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;IAE3B,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;AACL,CAAC;AAXD,wCAWC"}

package/dist/utils/queue.d.ts

@@ -1,19 +0,0 @@
-export declare class Queue<T> implements Iterable<T> {
-    readonly growthRate: number;
-    private data;
-    private head;
-    private tail;
-    private _size;
-    constructor(growthRate?: number);
-    private grow;
-    push(el: T): T;
-    pop(): T | undefined;
-    front(): T | undefined;
-    size(): number;
-    [Symbol.iterator](): IterableIterator<T>;
-    isNotEmpty(): this is NonEmptyQueue<T>;
-}
-interface NonEmptyQueue<T> extends Queue<T> {
-    pop(): T;
-}
-export {};

package/dist/utils/queue.js

@@ -1,71 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Queue = void 0;
-class Queue {
-    constructor(growthRate = 2) {
-        this.growthRate = growthRate;
-        this.data = new Array(4);
-        this.head = 0;
-        this.tail = 0;
-        this._size = 0;
-    }
-    grow() {
-        const length = this.data.length;
-        this.data = this.data
-            .slice(this.head, length)
-            .concat(this.data.slice(0, this.head))
-            .concat(new Array(Math.max(1, Math.floor(length * this.growthRate))));
-        this.head = 0;
-        this.tail = length;
-    }
-    push(el) {
-        this.data[this.tail] = el;
-        this.tail = (this.tail + 1) % this.data.length;
-        if (this.tail === this.head) {
-            this.grow();
-        }
-        this._size += 1;
-        return el;
-    }
-    pop() {
-        if (this._size <= 0)
-            return undefined;
-        const result = this.data[this.head];
-        this.head = (this.head + 1) % this.data.length;
-        this._size -= 1;
-        return result;
-    }
-    front() {
-        if (this._size <= 0)
-            return undefined;
-        return this.data[this.head];
-    }
-    size() {
-        return this._size;
-    }
-    [Symbol.iterator]() {
-        const data = [...this.data];
-        const tail = this.tail;
-        let currentIndex = this.head;
-        return {
-            next() {
-                if (currentIndex === tail)
-                    return { value: undefined, done: true };
-                const oldIndex = currentIndex;
-                currentIndex = (currentIndex + 1) % data.length;
-                return {
-                    value: data[oldIndex],
-                    done: false,
-                };
-            },
-            [Symbol.iterator]() {
-                return this;
-            },
-        };
-    }
-    isNotEmpty() {
-        return this._size > 0;
-    }
-}
-exports.Queue = Queue;
-//# sourceMappingURL=queue.js.map

package/dist/utils/queue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"queue.js","sourceRoot":"","sources":["../../src/utils/queue.ts"],"names":[],"mappings":";;;AAAA,MAAa,KAAK;IAMd,YAA4B,aAAqB,CAAC;QAAtB,eAAU,GAAV,UAAU,CAAY;QAL1C,SAAI,GAAQ,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QACzB,SAAI,GAAW,CAAC,CAAC;QACjB,SAAI,GAAW,CAAC,CAAC;QACjB,UAAK,GAAW,CAAC,CAAC;IAE2B,CAAC;IAE9C,IAAI;QACR,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAChC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;aAChB,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC;aACxB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;aACrC,MAAM,CACH,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAC/D,CAAC;QACN,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;IACvB,CAAC;IAEM,IAAI,CAAC,EAAK;QACb,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QAC1B,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC/C,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,EAAE,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAChB,OAAO,EAAE,CAAC;IACd,CAAC;IAEM,GAAG;QACN,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC/C,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAChB,OAAO,MAAM,CAAC;IAClB,CAAC;IAEM,KAAK;QACR,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC;QACtC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAEM,IAAI;QACP,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACpB,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC;QAE7B,OAAO;YACH,IAAI;gBACA,IAAI,YAAY,KAAK,IAAI;oBACrB,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;gBAC5C,MAAM,QAAQ,GAAG,YAAY,CAAC;gBAC9B,YAAY,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;gBAChD,OAAO;oBACH,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC;oBACrB,IAAI,EAAE,KAAK;iBACd,CAAC;YACN,CAAC;YACD,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACb,OAAO,IAAI,CAAC;YAChB,CAAC;SACJ,CAAC;IACN,CAAC;IAEM,UAAU;QACb,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IAC1B,CAAC;CACJ;AAxED,sBAwEC"}

package/dist/utils/triangle.d.ts

@@ -1,2 +0,0 @@
-import { Vector2 } from 'three';
-export declare function createTriangle(position: Vector2, angle: number, width: number, height: number): Vector2[];

package/dist/utils/triangle.js

@@ -1,19 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createTriangle = void 0;
-const three_1 = require("three");
-const ZeroVector = new three_1.Vector2();
-// 끝점을 position을 가리키도록 설정
-function createTriangle(position, angle, width, height) {
-    return [
-        position.clone(),
-        position
-            .clone()
-            .add(new three_1.Vector2(-width, height / 2).rotateAround(ZeroVector, angle)),
-        position
-            .clone()
-            .add(new three_1.Vector2(-width, -height / 2).rotateAround(ZeroVector, angle)),
-    ];
-}
-exports.createTriangle = createTriangle;
-//# sourceMappingURL=triangle.js.map

package/dist/utils/triangle.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"triangle.js","sourceRoot":"","sources":["../../src/utils/triangle.ts"],"names":[],"mappings":";;;AAAA,iCAAgC;AAEhC,MAAM,UAAU,GAAG,IAAI,eAAO,EAAE,CAAC;AAEjC,yBAAyB;AACzB,SAAgB,cAAc,CAC1B,QAAiB,EACjB,KAAa,EACb,KAAa,EACb,MAAc;IAEd,OAAO;QACH,QAAQ,CAAC,KAAK,EAAE;QAChB,QAAQ;aACH,KAAK,EAAE;aACP,GAAG,CACA,IAAI,eAAO,CAAC,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAClE;QACL,QAAQ;aACH,KAAK,EAAE;aACP,GAAG,CACA,IAAI,eAAO,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,YAAY,CACzC,UAAU,EACV,KAAK,CACR,CACJ;KACR,CAAC;AACN,CAAC;AAtBD,wCAsBC"}