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.
Angelos Chatzimparmpas
e069030893
|
3 years ago | |
|---|---|---|
| .. | ||
| node_modules/binary-search-bounds | 3 years ago | |
| test | 3 years ago | |
| .npmignore | 3 years ago | |
| .travis.yml | 3 years ago | |
| LICENSE | 3 years ago | |
| README.md | 3 years ago | |
| interval-tree.js | 3 years ago | |
| package.json | 3 years ago | |
README.md
interval-tree-1d
A simple 1D interval tree. Supports O(log(n)) amortized updates and O(log(n)) queries.
Example
var createIntervalTree = require("interval-tree-1d")
//Create some random list of intervals
var intervals = [ [1, 2], [-1, 0], [0.5, 1], [-10, 10] ]
//Build tree
var tree = createIntervalTree(intervals)
//Find all intervals containing query point 0.7
console.log("querying point:", 0.7)
tree.queryPoint(0.7, function(interval) {
console.log(interval)
})
API
var createIntervalTree = require("interval-tree-1d")
Constructor
var tree = createIntervalTree(intervals)
Constructs an interval tree given a list of intervals
Properties
tree.count
Returns the number of items in the tree
tree.intervals
Returns a list of all the intervals in the tree
tree.insert(interval)
Adds an interval to the tree
tree.remove(interval)
Removes an interval from the tree
tree.queryPoint(p, visit(interval))
Visits all intervals containing the point p
tree.queryInterval(lo, hi, visit(interval))
Returns all intervals which intersect the interval [lo, hi]
Credits
(c) 2013-2015 Mikola Lysenko. MIT License