Type JavaScript, then Shift-Enter. Ctrl-space for more options. Arrow ↑/↓ to switch modes.
pointInventory = {
//If I am going to ever implement this next time, accept hiddenPoint not mainPoint instead;
//intersections should be maintained internally, the only thing caller may interact with
//intersections is through recalcIntersection.
return {
points: new Map(),
intersections: new Map(),
__pointIdCounter: 1,
addPoint: function (point) {
const key = this.__keyGen(point);
if (this.points.has(key)) {
this.points.get(key)[1] += 1;
} else {
this.points.set(key, [point, 1]);
}
},
deletePoint: function (point) {
const key = this.__keyGen(point);
if (this.points.has(key)) {
const [point, count] = this.points.get(key);
if (count === 1) {
this.points.delete(key);
} else {
this.points.set(key, [point, count - 1]);
}
}
},
addPath: function (item, p) {
const processPath = (path) => {
path.segments.forEach((seg) => {
this.addPoint(seg.point);
});
mainKids(p).forEach((i) => this.__addIntersection(path, i));
};
if (item instanceof p.CompoundPath) {
item.children.forEach(processPath);
} else {
processPath(item);
}
},
deletePath: function (item, p, shouldRecalcIntersections = true) {
const processPath = (path) => {
path.segments.forEach((seg) => {
this.deletePoint(seg.point);
});
if (shouldRecalcIntersections) {
this.recalcIntersections(p);
}
};
if (item instanceof p.CompoundPath) {
item.children.forEach(processPath);
} else {
processPath(item);
}
},
// get method only return the point, no occurence.
get: function (point) {
return this.points.get(this.__keyGen(point))[0];
},
getClosest: function (point, p) {
// gridP is the cloest *canvasValue* of grid intersection point;
// do not confuse with the point expressed in grid scale
var gridP, gridDis, existP, existDis;
[gridP, gridDis] = closeToGrid(point, p);
[existP, existDis] = this.__closeToExistingPoint(point);
var f = gridDis * 1.5 < existDis ? [gridP, gridDis] : [existP, existDis];
return f[1] < 10 ? f[0] : null;
},
recalc: function (p) {
this.recalcPoints(p);
this.recalcIntersections(p);
},
recalcPoints: function (p) {
var paths = mainKids(p);
this.points = new Map();
for (let i = 0; i < paths.length; i++) {
this.addPath(paths[i], p);
}
},
recalcIntersections: function (p) {
var paths = mainKids(p);
this.intersections = new Map();
for (let i = 0; i < paths.length; i++) {
for (let j = i + 1; j < paths.length; j++) {
this.__addIntersection(paths[i], paths[j]);
}
}
},
__addPointToIntsec: function (point) {
const key = this.__keyGen(point);
this.intersections.set(key, point);
},
__keyGen: function (point) {
point.id = point.id ? point.id : this.__pointIdCounter++;
return point.id;
},
__closeToExistingPoint: function (canvPoint) {
var [minP1, dis1] = minPoint(canvPoint, this.points);
var [minP2, dis2] = minPoint(canvPoint, this.intersections);
return dis1 < dis2 ? [minP1, dis1] : [minP2, dis2];
},
__addIntersection(path1, path2) {
if (path1 !== path2) {
var intersections = path1.getIntersections(path2);
intersections.forEach((i) => this.__addPointToIntsec(i.point));
}
}
};
}
function closeToGrid(canvP, p) {
var gridP = gridPoint(canvP, canvasValues.gridScale, p);
var pointToSnap = new p.Point(Math.round(gridP.x), Math.round(gridP.y));
var canvDis = gridP.getDistance(pointToSnap) * canvasValues.gridScale;
return [canvasPoint(pointToSnap, canvasValues.gridScale, p), canvDis];
}
function minPoint(point, pointMap) {
var minPoint = null;
var minDis = 99999;
pointMap.forEach((val, key) => {
var val = Array.isArray(val) ? val[0] : val;
if (point.getDistance(val) < minDis) {
minDis = point.getDistance(val);
minPoint = val;
}
});
return [minPoint, minDis];
}
One platform to build and deploy the best data apps
Experiment and prototype by building visualizations in live JavaScript notebooks. Collaborate with your team and decide which concepts to build out.
Use Observable Framework to build data apps locally. Use data loaders to build in any language or library, including Python, SQL, and R.
Seamlessly deploy to Observable. Test before you ship, use automatic deploy-on-commit, and ensure your projects are always up-to-date.