-
Notifications
You must be signed in to change notification settings - Fork 25
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
* Adopt type=module follow changes in d3-format: * type=module * add exports * remove zip * license: ISC * update dependencies * remove Sublime project * update dependencies * update dependencies * Update README * cleaner imports * add eslint.json Co-authored-by: Mike Bostock <mbostock@gmail.com>
- Loading branch information
Showing
14 changed files
with
998 additions
and
858 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,18 @@ | ||
| { | ||
| "problemMatcher": [ | ||
| { | ||
| "owner": "eslint-compact", | ||
| "pattern": [ | ||
| { | ||
| "regexp": "^(.+):\\sline\\s(\\d+),\\scol\\s(\\d+),\\s(Error|Warning|Info)\\s-\\s(.+)\\s\\((.+)\\)$", | ||
| "file": 1, | ||
| "line": 2, | ||
| "column": 3, | ||
| "severity": 4, | ||
| "message": 5, | ||
| "code": 6 | ||
| } | ||
| ] | ||
| } | ||
| ] | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,30 @@ | ||
| # https://help.github.com/actions/language-and-framework-guides/using-nodejs-with-github-actions | ||
|
|
||
| name: Node.js CI | ||
|
|
||
| on: | ||
| push: | ||
| branches: [ main ] | ||
| pull_request: | ||
| branches: [ main ] | ||
|
|
||
| jobs: | ||
| build: | ||
|
|
||
| runs-on: ubuntu-latest | ||
|
|
||
| strategy: | ||
| matrix: | ||
| node-version: [14.x] | ||
|
|
||
| steps: | ||
| - uses: actions/checkout@v2 | ||
| - name: Use Node.js ${{ matrix.node-version }} | ||
| uses: actions/setup-node@v1 | ||
| with: | ||
| node-version: ${{ matrix.node-version }} | ||
| - run: yarn --frozen-lockfile | ||
| - run: | | ||
| echo ::add-matcher::.github/eslint.json | ||
| yarn run eslint src test --format=compact | ||
| - run: yarn test |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,27 +1,13 @@ | ||
| Copyright 2010-2016 Mike Bostock | ||
| All rights reserved. | ||
|
|
||
| Redistribution and use in source and binary forms, with or without modification, | ||
| are permitted provided that the following conditions are met: | ||
|
|
||
| * Redistributions of source code must retain the above copyright notice, this | ||
| list of conditions and the following disclaimer. | ||
|
|
||
| * Redistributions in binary form must reproduce the above copyright notice, | ||
| this list of conditions and the following disclaimer in the documentation | ||
| and/or other materials provided with the distribution. | ||
|
|
||
| * Neither the name of the author nor the names of contributors may be used to | ||
| endorse or promote products derived from this software without specific prior | ||
| written permission. | ||
|
|
||
| THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND | ||
| ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED | ||
| WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | ||
| DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR | ||
| ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | ||
| (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON | ||
| ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | ||
| (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | ||
| SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| Copyright 2010-2021 Mike Bostock | ||
|
|
||
| Permission to use, copy, modify, and/or distribute this software for any purpose | ||
| with or without fee is hereby granted, provided that the above copyright notice | ||
| and this permission notice appear in all copies. | ||
|
|
||
| THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH | ||
| REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND | ||
| FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, | ||
| INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS | ||
| OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER | ||
| TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF | ||
| THIS SOFTWARE. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,10 @@ | ||
| { | ||
| "extends": "eslint:recommended", | ||
| "parserOptions": { | ||
| "sourceType": "module", | ||
| "ecmaVersion": 8 | ||
| }, | ||
| "env": { | ||
| "mocha": true | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,37 +1,31 @@ | ||
| var tape = require("tape"), | ||
| polygon = require("../"); | ||
| import assert from "assert"; | ||
| import {polygonArea} from "../src/index.js"; | ||
|
|
||
| tape("polygonArea(polygon) returns the expected value for closed counterclockwise polygons", function(test) { | ||
| test.equal(polygon.polygonArea([[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]]), 1); | ||
| test.end(); | ||
| it("polygonArea(polygon) returns the expected value for closed counterclockwise polygons", () => { | ||
| assert.strictEqual(polygonArea([[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]]), 1); | ||
| }); | ||
|
|
||
| tape("polygonArea(polygon) returns the expected value for closed clockwise polygons", function(test) { | ||
| test.equal(polygon.polygonArea([[0, 0], [1, 0], [1, 1], [0, 1], [0, 0]]), -1); | ||
| test.equal(polygon.polygonArea([[1, 1], [3, 2], [2, 3], [1, 1]]), -1.5); | ||
| test.end(); | ||
| it("polygonArea(polygon) returns the expected value for closed clockwise polygons", () => { | ||
| assert.strictEqual(polygonArea([[0, 0], [1, 0], [1, 1], [0, 1], [0, 0]]), -1); | ||
| assert.strictEqual(polygonArea([[1, 1], [3, 2], [2, 3], [1, 1]]), -1.5); | ||
| }); | ||
|
|
||
| tape("polygonArea(polygon) returns the expected value for open counterclockwise polygons", function(test) { | ||
| test.equal(polygon.polygonArea([[0, 0], [0, 1], [1, 1], [1, 0]]), 1); | ||
| test.end(); | ||
| it("polygonArea(polygon) returns the expected value for open counterclockwise polygons", () => { | ||
| assert.strictEqual(polygonArea([[0, 0], [0, 1], [1, 1], [1, 0]]), 1); | ||
| }); | ||
|
|
||
| tape("polygonArea(polygon) returns the expected value for open clockwise polygons", function(test) { | ||
| test.equal(polygon.polygonArea([[0, 0], [1, 0], [1, 1], [0, 1]]), -1); | ||
| test.equal(polygon.polygonArea([[1, 1], [3, 2], [2, 3]]), -1.5); | ||
| test.end(); | ||
| it("polygonArea(polygon) returns the expected value for open clockwise polygons", () => { | ||
| assert.strictEqual(polygonArea([[0, 0], [1, 0], [1, 1], [0, 1]]), -1); | ||
| assert.strictEqual(polygonArea([[1, 1], [3, 2], [2, 3]]), -1.5); | ||
| }); | ||
|
|
||
| tape("polygonArea(polygon) returns the expected value for a very large polygon", function(test) { | ||
| var stop = 1e8, | ||
| step = 1e4, | ||
| points = [], | ||
| value; | ||
| for (value = 0; value < stop; value += step) points.push([0, value]); | ||
| for (value = 0; value < stop; value += step) points.push([value, stop]); | ||
| for (value = stop - step; value >= 0; value -= step) points.push([stop, value]); | ||
| for (value = stop - step; value >= 0; value -= step) points.push([value, 0]); | ||
| test.equal(polygon.polygonArea(points), 1e16 - 5e7); | ||
| test.end(); | ||
| it("polygonArea(polygon) returns the expected value for a very large polygon", () => { | ||
| const stop = 1e8; | ||
| const step = 1e4; | ||
| const points = []; | ||
| for (let value = 0; value < stop; value += step) points.push([0, value]); | ||
| for (let value = 0; value < stop; value += step) points.push([value, stop]); | ||
| for (let value = stop - step; value >= 0; value -= step) points.push([stop, value]); | ||
| for (let value = stop - step; value >= 0; value -= step) points.push([value, 0]); | ||
| assert.strictEqual(polygonArea(points), 1e16 - 5e7); | ||
| }); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,37 +1,31 @@ | ||
| var tape = require("tape"), | ||
| polygon = require("../"); | ||
| import assert from "assert"; | ||
| import {polygonCentroid} from "../src/index.js"; | ||
|
|
||
| tape("polygonCentroid(points) returns the expected value for closed counterclockwise polygons", function(test) { | ||
| test.deepEqual(polygon.polygonCentroid([[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]]), [.5, .5]); | ||
| test.end(); | ||
| it("polygonCentroid(points) returns the expected value for closed counterclockwise polygons", () => { | ||
| assert.deepStrictEqual(polygonCentroid([[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]]), [0.5, 0.5]); | ||
| }); | ||
|
|
||
| tape("polygonCentroid(points) returns the expected value for closed clockwise polygons", function(test) { | ||
| test.deepEqual(polygon.polygonCentroid([[0, 0], [1, 0], [1, 1], [0, 1], [0, 0]]), [.5, .5]); | ||
| test.deepEqual(polygon.polygonCentroid([[1, 1], [3, 2], [2, 3], [1, 1]]), [2, 2]); | ||
| test.end(); | ||
| it("polygonCentroid(points) returns the expected value for closed clockwise polygons", () => { | ||
| assert.deepStrictEqual(polygonCentroid([[0, 0], [1, 0], [1, 1], [0, 1], [0, 0]]), [0.5, 0.5]); | ||
| assert.deepStrictEqual(polygonCentroid([[1, 1], [3, 2], [2, 3], [1, 1]]), [2, 2]); | ||
| }); | ||
|
|
||
| tape("polygonCentroid(points) returns the expected value for open counterclockwise polygons", function(test) { | ||
| test.deepEqual(polygon.polygonCentroid([[0, 0], [0, 1], [1, 1], [1, 0]]), [.5, .5]); | ||
| test.end(); | ||
| it("polygonCentroid(points) returns the expected value for open counterclockwise polygons", () => { | ||
| assert.deepStrictEqual(polygonCentroid([[0, 0], [0, 1], [1, 1], [1, 0]]), [0.5, 0.5]); | ||
| }); | ||
|
|
||
| tape("polygonCentroid(points) returns the expected value for open counterclockwise polygons", function(test) { | ||
| test.deepEqual(polygon.polygonCentroid([[0, 0], [1, 0], [1, 1], [0, 1]]), [.5, .5]); | ||
| test.deepEqual(polygon.polygonCentroid([[1, 1], [3, 2], [2, 3]]), [2, 2]); | ||
| test.end(); | ||
| it("polygonCentroid(points) returns the expected value for open counterclockwise polygons", () => { | ||
| assert.deepStrictEqual(polygonCentroid([[0, 0], [1, 0], [1, 1], [0, 1]]), [0.5, 0.5]); | ||
| assert.deepStrictEqual(polygonCentroid([[1, 1], [3, 2], [2, 3]]), [2, 2]); | ||
| }); | ||
|
|
||
| tape("polygonCentroid(polygon) returns the expected value for a very large polygon", function(test) { | ||
| var stop = 1e8, | ||
| step = 1e4, | ||
| points = [], | ||
| value; | ||
| for (value = 0; value < stop; value += step) points.push([0, value]); | ||
| for (value = 0; value < stop; value += step) points.push([value, stop]); | ||
| for (value = stop - step; value >= 0; value -= step) points.push([stop, value]); | ||
| for (value = stop - step; value >= 0; value -= step) points.push([value, 0]); | ||
| test.deepEqual(polygon.polygonCentroid(points), [49999999.75000187, 49999999.75001216]); | ||
| test.end(); | ||
| it("polygonCentroid(polygon) returns the expected value for a very large polygon", () => { | ||
| const stop = 1e8; | ||
| const step = 1e4; | ||
| const points = []; | ||
| for (let value = 0; value < stop; value += step) points.push([0, value]); | ||
| for (let value = 0; value < stop; value += step) points.push([value, stop]); | ||
| for (let value = stop - step; value >= 0; value -= step) points.push([stop, value]); | ||
| for (let value = stop - step; value >= 0; value -= step) points.push([value, 0]); | ||
| assert.deepStrictEqual(polygonCentroid(points), [49999999.75000187, 49999999.75001216]); | ||
| }); |
Oops, something went wrong.