StackGenVis: Alignment of Data, Algorithms, and Models for Stacking Ensemble Learning Using Performance Metrics https://doi.org/10.1109/TVCG.2020.3030352
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
StackGenVis/frontend/node_modules/interval-tree-1d/package.json

66 lines
1.7 KiB

{
"_from": "interval-tree-1d@^1.0.1",
"_id": "interval-tree-1d@1.0.3",
"_inBundle": false,
"_integrity": "sha1-j9veArayx9verWNry+2OCHENhcE=",
"_location": "/interval-tree-1d",
"_phantomChildren": {},
"_requested": {
"type": "range",
"registry": true,
"raw": "interval-tree-1d@^1.0.1",
"name": "interval-tree-1d",
"escapedName": "interval-tree-1d",
"rawSpec": "^1.0.1",
"saveSpec": null,
"fetchSpec": "^1.0.1"
},
"_requiredBy": [
"/point-in-big-polygon"
],
"_resolved": "https://registry.npmjs.org/interval-tree-1d/-/interval-tree-1d-1.0.3.tgz",
"_shasum": "8fdbde02b6b2c7dbdead636bcbed8e08710d85c1",
"_spec": "interval-tree-1d@^1.0.1",
"_where": "/Users/anchaa/Documents/Research/iStacking_code/istacking/frontend/node_modules/point-in-big-polygon",
"author": {
"name": "Mikola Lysenko"
},
"bugs": {
"url": "https://github.com/mikolalysenko/interval-tree-1d/issues"
},
"bundleDependencies": false,
"dependencies": {
"binary-search-bounds": "^1.0.0"
},
"deprecated": false,
"description": "1D interval tree data structure",
"devDependencies": {
"covert": "^1.0.1",
"tape": "^3.5.0"
},
"directories": {
"test": "test"
},
"homepage": "https://github.com/mikolalysenko/interval-tree-1d#readme",
"keywords": [
"point",
"location",
"interval",
"range",
"query",
"search",
"overlap"
],
"license": "MIT",
"main": "interval-tree.js",
"name": "interval-tree-1d",
"repository": {
"type": "git",
"url": "git://github.com/mikolalysenko/interval-tree-1d.git"
},
"scripts": {
"coverage": "covert test/test.js",
"test": "tape test/test.js"
},
"version": "1.0.3"
}