nodes2ts 3.0.0 → 4.0.0

package/package.json

@@ -1,12 +1,27 @@
 {
   "name": "nodes2ts",
-  "version": "3.0.0",
+  "version": "4.0.0",
   "description": "a Typescript porting of the great S2 Geometry library from Google ",
-  "main": "dist/export.js",
+  "type": "module",
+  "main": "./dist/export.cjs",
+  "module": "./dist/export.js",
+  "types": "./dist/export.d.ts",
+  "exports": {
+    ".": {
+      "import": {
+        "types": "./dist/export.d.ts",
+        "default": "./dist/export.js"
+      },
+      "require": {
+        "types": "./dist/export.d.cts",
+        "default": "./dist/export.cjs"
+      }
+    }
+  },
   "homepage": "https://github.com/vekexasia/nodes2-ts",
   "repository": {
     "type": "git",
-    "url": "https://github.com/vekexasia/nodes2-ts"
+    "url": "git+https://github.com/vekexasia/nodes2-ts.git"
   },
   "keywords": [
     "s2",
@@ -15,66 +30,30 @@
     "geohash"
   ],
   "scripts": {
-    "test": "cross-env NODE_ENV=test mocha",
-    "lint": "eslint .",
-    "wtest": "cross-env NODE_ENV=test nodemon -q -e ts --exec npm run test",
-    "cover": "cross-env NODE_ENV=test nyc npm t",
-    "prepublish": "shx rm -rf ./dist/ && npm run build",
-    "clean": "shx rm -rf ./dist",
-    "build": "tsc -d",
-    "//postinstall": "npm run prepublish"
+    "build": "tsup",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "test:coverage": "vitest run --coverage",
+    "lint": "eslint src test",
+    "clean": "rm -rf dist",
+    "prepublishOnly": "npm run clean && npm run build"
   },
-  "typings": "./dist/export.d.ts",
   "author": {
     "url": "http://www.andreabaccega.com/",
     "email": "vekexasia@gmail.com",
     "name": "Andrea Baccega"
   },
   "license": "MIT",
-  "dependencies": {
-    "long": "^4.0.0",
-    "math-float64-exponent": "^1.0.0"
+  "engines": {
+    "node": ">=20"
   },
   "devDependencies": {
-    "@types/chai": "4.3.1",
-    "@types/gulp": "4.0.9",
-    "@types/long": "^4.0.0",
-    "@types/mocha": "9.1.1",
-    "@types/sinon": "10.0.11",
-    "@typescript-eslint/eslint-plugin": "^5.28.0",
-    "@typescript-eslint/parser": "^5.28.0",
-    "chai": "4.3.6",
-    "cross-env": "^7.0.3",
-    "eslint": "^8.17.0",
-    "gulp": "4.0.2",
-    "gulp-spawn-mocha": "6.0.0",
-    "gulp-watch": "5.0.1",
-    "karma": "6.4.0",
-    "mocha": "10.0.0",
-    "nodemon": "2.0.16",
-    "nyc": "15.1.0",
-    "shx": "0.3.4",
-    "sinon": "14.0.0",
-    "ts-node": "10.8.1",
-    "typescript": "^4.7.3"
-  },
-  "nyc": {
-    "include": [
-      "src/*.ts",
-      "src/**/*.ts"
-    ],
-    "exclude": [
-      "typings"
-    ],
-    "extension": [
-      ".ts"
-    ],
-    "require": [
-      "ts-node/register"
-    ],
-    "reporter": [
-      "html"
-    ],
-    "all": false
+    "@eslint/js": "^10.0.1",
+    "@vitest/coverage-v8": "^4.0.18",
+    "eslint": "^10.0.3",
+    "tsup": "^8.5.1",
+    "typescript": "^5.9.3",
+    "typescript-eslint": "^8.57.0",
+    "vitest": "^4.0.18"
   }
 }

package/.eslintignore

@@ -1,3 +0,0 @@
-dist
-gulpfile.js
-test

package/.eslintrc.cjs

@@ -1,11 +0,0 @@
-module.exports = {
-  root: true,
-  parser: '@typescript-eslint/parser',
-  plugins: [
-    '@typescript-eslint',
-  ],
-  extends: [
-    'eslint:recommended',
-    'plugin:@typescript-eslint/recommended',
-  ],
-};

package/.github/workflows/lint.js.yml

@@ -1,22 +0,0 @@
-name: Lint CI
-
-on:
-  push:
-    branches: [ master ]
-  pull_request:
-    branches: [ master ]
-
-jobs:
-  build:
-    runs-on: ubuntu-latest
-    strategy:
-      matrix:
-        node-version: [16.x]
-    steps:
-      - uses: actions/checkout@v3
-      - name: Use Node.js ${{ matrix.node-version }}
-        uses: actions/setup-node@v3
-        with:
-          node-version: ${{ matrix.node-version }}
-      - run: yarn --frozen-lockfile
-      - run: yarn lint

package/.github/workflows/node.js.yml

@@ -1,22 +0,0 @@
-name: Node.js CI
-
-on:
-  push:
-    branches: [ master ]
-  pull_request:
-    branches: [ master ]
-
-jobs:
-  build:
-    runs-on: ubuntu-latest
-    strategy:
-      matrix:
-        node-version: [14.x, 16.x]
-    steps:
-      - uses: actions/checkout@v3
-      - name: Use Node.js ${{ matrix.node-version }}
-        uses: actions/setup-node@v3
-        with:
-          node-version: ${{ matrix.node-version }}
-      - run: yarn --frozen-lockfile
-      - run: yarn test

package/.mocharc.js

@@ -1,7 +0,0 @@
-module.exports = {
-  recursive: true,
-  bail: true,
-  require: 'ts-node/register',
-  extension: ['ts']
-}
-

package/dist/Interval.d.ts

@@ -1,24 +0,0 @@
-export declare abstract class Interval {
-    lo: number;
-    hi: number;
-    constructor(lo: number, hi: number);
-    /** Return true if the interval is empty, i.e. it contains no points. */
-    abstract isEmpty(): boolean;
-    /**
-     * Return the center of the interval. For empty intervals, the result is
-     * arbitrary.
-     */
-    abstract getCenter(): number;
-    /**
-     * Return the length of the interval. The length of an empty interval is
-     * negative.
-     */
-    abstract getLength(): number;
-    abstract contains(p: number): boolean;
-    abstract interiorContains(p: number): boolean;
-    toString(): string;
-    /**
-     * Return true if two intervals contains the same set of points.
-     */
-    equals(that: any): boolean;
-}

package/dist/Interval.js

@@ -1,23 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Interval = void 0;
-class Interval {
-    constructor(lo, hi) {
-        this.lo = lo;
-        this.hi = hi;
-    }
-    toString() {
-        return "[" + this.lo.toString() + ", " + this.hi.toString() + "]";
-    }
-    /**
-     * Return true if two intervals contains the same set of points.
-     */
-    equals(that) {
-        if (typeof (that) === typeof (this)) {
-            return this.lo == that.lo && this.hi == that.hi;
-        }
-        return false;
-    }
-}
-exports.Interval = Interval;
-//# sourceMappingURL=Interval.js.map

package/dist/Interval.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Interval.js","sourceRoot":"","sources":["../src/Interval.ts"],"names":[],"mappings":";;;AAAA,MAAsB,QAAQ;IAI5B,YAAY,EAAS,EAAE,EAAS;QAC9B,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IAsBO,QAAQ;QACd,OAAO,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,QAAQ,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAC;IACpE,CAAC;IAGD;;OAEG;IACI,MAAM,CAAC,IAAQ;QACpB,IAAI,OAAM,CAAC,IAAI,CAAC,KAAK,OAAM,CAAC,IAAI,CAAC,EAAE;YACjC,OAAO,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;SACjD;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CAGF;AA7CD,4BA6CC"}

package/dist/MutableInteger.d.ts

@@ -1,4 +0,0 @@
-export declare class MutableInteger {
-    val: number;
-    constructor(val: number);
-}

package/dist/MutableInteger.js

@@ -1,10 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MutableInteger = void 0;
-class MutableInteger {
-    constructor(val) {
-        this.val = val;
-    }
-}
-exports.MutableInteger = MutableInteger;
-//# sourceMappingURL=MutableInteger.js.map

package/dist/MutableInteger.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"MutableInteger.js","sourceRoot":"","sources":["../src/MutableInteger.ts"],"names":[],"mappings":";;;AAAA,MAAa,cAAc;IAEzB,YAAmB,GAAU;QAAV,QAAG,GAAH,GAAG,CAAO;IAC7B,CAAC;CACF;AAJD,wCAIC"}

package/dist/Platform.d.ts

@@ -1,15 +0,0 @@
-export declare class Platform {
-    static IEEEremainder(f1: number, f2: number): number;
-    /**
-     * If v is non-zero, return an integer {@code exp} such that
-     * {@code (0.5 <= |v|*2^(-exp) < 1)}. If v is zero, return 0.
-     *
-     * <p>Note that this arguably a bad definition of exponent because it makes
-     * {@code exp(9) == 4}. In decimal this would be like saying that the
-     * exponent of 1234 is 4, when in scientific 'exponent' notation 1234 is
-     * {@code 1.234 x 10^3}.
-     *
-     * TODO(dbeaumont): Replace this with "DoubleUtils.getExponent(v) - 1" ?
-     */
-    static getExponent(v: number): number;
-}

package/dist/Platform.js

@@ -1,53 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Platform = void 0;
-const exponent = require("math-float64-exponent");
-class Platform {
-    static IEEEremainder(f1, f2) {
-        // let r = f1 % f2;
-        // if (isNaN(r) || r == (f2) || r <= (Math.abs(f2) / 2)) {
-        //   return r;
-        // } else {
-        //   return (f1 >= (0) ? 1 : -1) * (r - f2);
-        // }
-        if (Number.isNaN(f1)) {
-            return f1;
-        }
-        if (Number.isNaN(f2)) {
-            return f2;
-        }
-        if ((f2 === Number.POSITIVE_INFINITY || f2 === Number.NEGATIVE_INFINITY) && Number.isFinite(f1)) {
-            return f1;
-        }
-        return f1 - (Math.round(f1 / f2) * f2);
-    }
-    /**
-     * If v is non-zero, return an integer {@code exp} such that
-     * {@code (0.5 <= |v|*2^(-exp) < 1)}. If v is zero, return 0.
-     *
-     * <p>Note that this arguably a bad definition of exponent because it makes
-     * {@code exp(9) == 4}. In decimal this would be like saying that the
-     * exponent of 1234 is 4, when in scientific 'exponent' notation 1234 is
-     * {@code 1.234 x 10^3}.
-     *
-     * TODO(dbeaumont): Replace this with "DoubleUtils.getExponent(v) - 1" ?
-     */
-    static getExponent(v) {
-        // if (v == 0) {
-        //   return 0;
-        // }
-        // // IT should always be ((int)log(2,v))+1;
-        // const start = Math.floor(Math.log(v)/Math.log(2));
-        // for(let i= start; i<start+10; i++) {
-        //   const curVal = Math.abs(v) * Math.pow(2,-i);
-        //   if (curVal >= 0.5 && curVal < 1 ) {
-        //     return i;
-        //   }
-        // }
-        // throw new Error('method not written yet');
-        // // return (int)((S2.EXPONENT_MASK & bits) >> S2.EXPONENT_SHIFT) - 1022;
-        return exponent(v);
-    }
-}
-exports.Platform = Platform;
-//# sourceMappingURL=Platform.js.map

package/dist/Platform.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Platform.js","sourceRoot":"","sources":["../src/Platform.ts"],"names":[],"mappings":";;;AAAA,kDAAmD;AACnD,MAAa,QAAQ;IACZ,MAAM,CAAC,aAAa,CAAC,EAAU,EAAE,EAAU;QAChD,mBAAmB;QAEnB,0DAA0D;QAC1D,cAAc;QACd,WAAW;QACX,4CAA4C;QAC5C,IAAI;QAEJ,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;YACpB,OAAO,EAAE,CAAC;SACX;QAED,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;YACpB,OAAO,EAAE,CAAA;SACV;QAED,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,iBAAiB,IAAI,EAAE,KAAK,MAAM,CAAC,iBAAiB,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE;YAC/F,OAAO,EAAE,CAAC;SACX;QAED,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;;;;;;;;;OAUG;IACI,MAAM,CAAC,WAAW,CAAC,CAAQ;QAChC,gBAAgB;QAChB,cAAc;QACd,IAAI;QACJ,4CAA4C;QAC5C,qDAAqD;QACrD,uCAAuC;QACvC,iDAAiD;QACjD,wCAAwC;QACxC,gBAAgB;QAChB,MAAM;QACN,IAAI;QACJ,6CAA6C;QAC7C,0EAA0E;QAC1E,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;CACF;AApDD,4BAoDC"}

package/dist/R1Interval.d.ts

@@ -1,76 +0,0 @@
-import { Interval } from "./Interval";
-/**
- * An R1Interval represents a closed interval on a unit circle (also known as a
- * 1-dimensional sphere). It is capable of representing the empty interval
- * (containing no points), the full interval (containing all points), and
- * zero-length intervals (containing a single point).
- *
- *  Points are represented by the angle they make with the positive x-axis in
- * the range [-Pi, Pi]. An interval is represented by its lower and upper bounds
- * (both inclusive, since the interval is closed). The lower bound may be
- * greater than the upper bound, in which case the interval is "inverted" (i.e.
- * it passes through the point (-1, 0)).
- *
- *  Note that the point (-1, 0) has two valid representations, Pi and -Pi. The
- * normalized representation of this point internally is Pi, so that endpoints
- * of normal intervals are in the range (-Pi, Pi]. However, we take advantage of
- * the point -Pi to construct two special intervals: the Full() interval is
- * [-Pi, Pi], and the Empty() interval is [Pi, -Pi].
- *
- */
-export declare class R1Interval extends Interval {
-    /** Return true if the interval is empty, i.e. it contains no points. */
-    isEmpty(): boolean;
-    getCenter(): number;
-    getLength(): number;
-    contains(p: number): boolean;
-    /** Return true if the interior of the interval contains the point 'p'. */
-    interiorContains(p: number): boolean;
-    /**
-     * Return true if the interval contains the given interval 'y'. Works for
-     * empty, full, and singleton intervals.
-     */
-    containsI(y: R1Interval): boolean;
-    interiorContainsI(y: R1Interval): boolean;
-    /**
-     * Return true if this interval intersects the given interval, i.e. if they
-     * have any points in common.
-     */
-    intersects(y: R1Interval): boolean;
-    /**
-     * Return true if the interior of this interval intersects any point of the
-     * given interval (including its boundary).
-     */
-    interiorIntersects(y: R1Interval): boolean;
-    /** Expand the interval so that it contains the given point "p". */
-    addPoint(p: number): R1Interval;
-    /**
-     * Return an interval that contains all points with a distance "radius" of a
-     * point in this interval. Note that the expansion of an empty interval is
-     * always empty.
-     */
-    expanded(radius: number): R1Interval;
-    /**
-     * Return the smallest interval that contains this interval and the given
-     * interval "y".
-     */
-    union(y: R1Interval): R1Interval;
-    /**
-     * Return the intersection of this interval with the given interval. Empty
-     * intervals do not need to be special-cased.
-     */
-    intersection(y: R1Interval): R1Interval;
-    /**
-     * Return true if the length of the symmetric difference between the two
-     * intervals is at most the given tolerance.
-     */
-    approxEquals(y: R1Interval, maxError?: number): boolean;
-    static empty(): R1Interval;
-    static fromPoint(p: number): R1Interval;
-    /**
-     * Convenience method to construct the minimal interval containing the two
-     * given points. This is equivalent to starting with an empty interval and
-     * calling AddPoint() twice, but it is more efficient.
-     */
-    static fromPointPair(p1: number, p2: number): R1Interval;
-}

package/dist/R1Interval.js

@@ -1,158 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.R1Interval = void 0;
-const Interval_1 = require("./Interval");
-/**
- * An R1Interval represents a closed interval on a unit circle (also known as a
- * 1-dimensional sphere). It is capable of representing the empty interval
- * (containing no points), the full interval (containing all points), and
- * zero-length intervals (containing a single point).
- *
- *  Points are represented by the angle they make with the positive x-axis in
- * the range [-Pi, Pi]. An interval is represented by its lower and upper bounds
- * (both inclusive, since the interval is closed). The lower bound may be
- * greater than the upper bound, in which case the interval is "inverted" (i.e.
- * it passes through the point (-1, 0)).
- *
- *  Note that the point (-1, 0) has two valid representations, Pi and -Pi. The
- * normalized representation of this point internally is Pi, so that endpoints
- * of normal intervals are in the range (-Pi, Pi]. However, we take advantage of
- * the point -Pi to construct two special intervals: the Full() interval is
- * [-Pi, Pi], and the Empty() interval is [Pi, -Pi].
- *
- */
-class R1Interval extends Interval_1.Interval {
-    /** Return true if the interval is empty, i.e. it contains no points. */
-    isEmpty() {
-        return this.lo > this.hi;
-    }
-    getCenter() {
-        return (this.lo + this.hi) / 2;
-    }
-    getLength() {
-        return this.hi - this.lo;
-    }
-    contains(p) {
-        return p >= this.lo && p <= this.hi;
-    }
-    /** Return true if the interior of the interval contains the point 'p'. */
-    interiorContains(p) {
-        return p > this.lo && p < this.hi;
-    }
-    /**
-     * Return true if the interval contains the given interval 'y'. Works for
-     * empty, full, and singleton intervals.
-     */
-    containsI(y) {
-        if (y.isEmpty()) {
-            return true;
-        }
-        return y.lo >= this.lo && y.hi <= this.hi;
-    }
-    interiorContainsI(y) {
-        if (y.isEmpty()) {
-            return true;
-        }
-        return y.lo > this.lo && y.hi < this.hi;
-    }
-    /**
-     * Return true if this interval intersects the given interval, i.e. if they
-     * have any points in common.
-     */
-    intersects(y) {
-        if (this.lo <= y.lo) {
-            return y.lo <= (this.hi) && y.lo <= (y.hi);
-        }
-        else {
-            return this.lo <= (y.hi) && this.lo <= (this.hi);
-        }
-    }
-    /**
-     * Return true if the interior of this interval intersects any point of the
-     * given interval (including its boundary).
-     */
-    interiorIntersects(y) {
-        return y.lo < (this.hi) && this.lo < (y.hi) && this.lo < (this.hi) && y.lo <= (y.hi);
-    }
-    /** Expand the interval so that it contains the given point "p". */
-    addPoint(p) {
-        if (this.isEmpty()) {
-            return R1Interval.fromPoint(p);
-        }
-        else if (p < (this.lo)) {
-            return new R1Interval(p, this.hi);
-        }
-        else if (p > (this.hi)) {
-            return new R1Interval(this.lo, p);
-        }
-        else {
-            return new R1Interval(this.lo, this.hi);
-        }
-    }
-    /**
-     * Return an interval that contains all points with a distance "radius" of a
-     * point in this interval. Note that the expansion of an empty interval is
-     * always empty.
-     */
-    expanded(radius) {
-        // assert (radius >= 0);
-        if (this.isEmpty()) {
-            return this;
-        }
-        return new R1Interval(this.lo - radius, this.hi + radius);
-    }
-    /**
-     * Return the smallest interval that contains this interval and the given
-     * interval "y".
-     */
-    union(y) {
-        if (this.isEmpty()) {
-            return y;
-        }
-        if (y.isEmpty()) {
-            return this;
-        }
-        return new R1Interval(Math.min(this.lo, y.lo), Math.max(this.hi, y.hi));
-    }
-    /**
-     * Return the intersection of this interval with the given interval. Empty
-     * intervals do not need to be special-cased.
-     */
-    intersection(y) {
-        return new R1Interval(Math.max(this.lo, y.lo), Math.min(this.hi, y.hi));
-    }
-    /**
-     * Return true if the length of the symmetric difference between the two
-     * intervals is at most the given tolerance.
-     */
-    approxEquals(y, maxError = 1e-15) {
-        if (this.isEmpty()) {
-            return y.getLength() <= (maxError);
-        }
-        if (y.isEmpty()) {
-            return this.getLength() <= (maxError);
-        }
-        return Math.abs(y.lo - (this.lo)) + Math.abs(y.hi - this.hi) <= (maxError);
-    }
-    static empty() {
-        return new R1Interval(1, 0);
-    }
-    static fromPoint(p) {
-        return new R1Interval(p, p);
-    }
-    /**
-     * Convenience method to construct the minimal interval containing the two
-     * given points. This is equivalent to starting with an empty interval and
-     * calling AddPoint() twice, but it is more efficient.
-     */
-    static fromPointPair(p1, p2) {
-        if (p1 <= (p2)) {
-            return new R1Interval(p1, p2);
-        }
-        else {
-            return new R1Interval(p2, p1);
-        }
-    }
-}
-exports.R1Interval = R1Interval;
-//# sourceMappingURL=R1Interval.js.map

package/dist/R1Interval.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"R1Interval.js","sourceRoot":"","sources":["../src/R1Interval.ts"],"names":[],"mappings":";;;AAAA,yCAAoC;AACpC;;;;;;;;;;;;;;;;;;GAkBG;AAEH,MAAa,UAAW,SAAQ,mBAAQ;IAEtC,wEAAwE;IACjE,OAAO;QACZ,OAAO,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;IAC3B,CAAC;IAEM,SAAS;QACd,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAC,CAAC,CAAC;IAC/B,CAAC;IAEM,SAAS;QACd,OAAO,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;IAC3B,CAAC;IAEM,QAAQ,CAAC,CAAQ;QACtB,OAAO,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;IAEtC,CAAC;IAED,0EAA0E;IACnE,gBAAgB,CAAC,CAAQ;QAC9B,OAAO,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IACpC,CAAC;IAED;;;OAGG;IACI,SAAS,CAAC,CAAY;QAC3B,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE;YACf,OAAO,IAAI,CAAC;SACb;QACD,OAAO,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;IAC5C,CAAC;IAGM,iBAAiB,CAAC,CAAY;QACnC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE;YACf,OAAO,IAAI,CAAC;SACb;QACD,OAAO,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACI,UAAU,CAAC,CAAY;QAC5B,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE;YACnB,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SAC5C;aAAM;YACL,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SAClD;IACH,CAAC;IAED;;;OAGG;IACI,kBAAkB,CAAC,CAAY;QACpC,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACvF,CAAC;IAED,mEAAmE;IAC5D,QAAQ,CAAC,CAAQ;QACtB,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;SAChC;aAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YACxB,OAAO,IAAI,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;SACnC;aAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YACxB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;SACnC;aAAM;YACL,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;SACzC;IACH,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,MAAa;QAC3B,wBAAwB;QACxB,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,IAAI,CAAC;SACb;QACD,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,EAAE,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,CAAC;IAC5D,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,CAAY;QACvB,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,CAAC,CAAC;SACV;QACD,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE;YACf,OAAO,IAAI,CAAC;SACb;QACD,OAAO,IAAI,UAAU,CACjB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EACvB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAC1B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACI,YAAY,CAAC,CAAY;QAC9B,OAAO,IAAI,UAAU,CACjB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EACvB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAC1B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACI,YAAY,CAAC,CAAY,EAAE,QAAQ,GAAC,KAAK;QAC9C,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;SACpC;QACD,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE;YACf,OAAO,IAAI,CAAC,SAAS,EAAE,IAAI,CAAE,QAAQ,CAAC,CAAC;SACxC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9E,CAAC;IAID,MAAM,CAAC,KAAK;QACV,OAAO,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC;IAGD,MAAM,CAAC,SAAS,CAAC,CAAQ;QACvB,OAAO,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,aAAa,CAAC,EAAS,EAAE,EAAS;QACvC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE;YACd,OAAO,IAAI,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;SAC/B;aAAM;YACL,OAAO,IAAI,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;SAC/B;IACH,CAAC;CACF;AA3JD,gCA2JC"}

package/dist/R2Vector.d.ts

@@ -1,34 +0,0 @@
-import { S2Point } from "./S2Point";
-/**
- * R2Vector represents a vector in the two-dimensional space. It defines the
- * basic geometrical operations for 2D vectors, e.g. cross product, addition,
- * norm, comparison etc.
- *
- */
-export declare class R2Vector {
-    private _x;
-    private _y;
-    constructor(_x: number, _y: number);
-    get x(): number;
-    get y(): number;
-    get(index: number): number;
-    static fromPointFace(p: S2Point, face: number): R2Vector;
-    static add(p1: R2Vector, p2: R2Vector): R2Vector;
-    static mul(p: R2Vector, m: number): R2Vector;
-    norm2(): number;
-    static dotProd(p1: R2Vector, p2: R2Vector): number;
-    dotProd(that: R2Vector): number;
-    crossProd(that: R2Vector): number;
-    lessThan(vb: R2Vector): boolean;
-    static fromSTVector(stVector: R2Vector): R2Vector;
-    static singleStTOUV(s: number): number;
-    static singleUVToST(u: number): number;
-    /**
-     * To be used only if this vector is representing uv.
-     * @param face
-     * @returns {S2Point}
-     */
-    toPoint(face: number): S2Point;
-    toSt(which: any): number;
-    toString(): string;
-}