| 1 | {
|
| 2 | "name": "point-in-polygon",
|
| 3 | "description": "determine if a point is inside a polygon with a ray intersection counting algorithm",
|
| 4 | "version": "1.0.2",
|
| 5 | "repository": {
|
| 6 | "type": "git",
|
| 7 | "url": "git://github.com/substack/point-in-polygon.git"
|
| 8 | },
|
| 9 | "main": "index.js",
|
| 10 | "keywords": [
|
| 11 | "point",
|
| 12 | "polygon",
|
| 13 | "inside"
|
| 14 | ],
|
| 15 | "directories": {
|
| 16 | "lib": ".",
|
| 17 | "example": "example",
|
| 18 | "test": "test"
|
| 19 | },
|
| 20 | "scripts": {
|
| 21 | "test": "tape test/*.js"
|
| 22 | },
|
| 23 | "devDependencies": {
|
| 24 | "tape": "^4.0.0"
|
| 25 | },
|
| 26 | "license": "MIT",
|
| 27 | "author": {
|
| 28 | "name": "James Halliday",
|
| 29 | "email": "mail@substack.net",
|
| 30 | "url": "http://substack.net"
|
| 31 | }
|
| 32 | }
|