@quartic/bokehjs
Version:
Interactive, novel data visualization
54 lines (53 loc) • 2.11 kB
JavaScript
"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
var extend = function (child, parent) { for (var key in parent) {
if (hasProp.call(parent, key))
child[key] = parent[key];
} function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; }, hasProp = {}.hasOwnProperty;
var array_1 = require("core/util/array");
var interpolator_1 = require("./interpolator");
exports.LinearInterpolator = (function (superClass) {
extend(LinearInterpolator, superClass);
function LinearInterpolator() {
return LinearInterpolator.__super__.constructor.apply(this, arguments);
}
LinearInterpolator.prototype.compute = function (x) {
var descending, ind, ret, x1, x2, y1, y2;
this.sort(descending = false);
if (this.clip === true) {
if (x < this._x_sorted[0] || x > this._x_sorted[this._x_sorted.length - 1]) {
return null;
}
}
else {
if (x < this._x_sorted[0]) {
return this._y_sorted[0];
}
if (x > this._x_sorted[this._x_sorted.length - 1]) {
return this._y_sorted[this._y_sorted.length - 1];
}
}
if (x === this._x_sorted[0]) {
return this._y_sorted[0];
}
ind = array_1.findLastIndex(this._x_sorted, function (num) {
return num < x;
});
x1 = this._x_sorted[ind];
x2 = this._x_sorted[ind + 1];
y1 = this._y_sorted[ind];
y2 = this._y_sorted[ind + 1];
ret = y1 + (((x - x1) / (x2 - x1)) * (y2 - y1));
return ret;
};
LinearInterpolator.prototype.v_compute = function (xs) {
var i, idx, len, result, x;
result = new Float64Array(xs.length);
for (idx = i = 0, len = xs.length; i < len; idx = ++i) {
x = xs[idx];
result[idx] = this.compute(x);
}
return result;
};
return LinearInterpolator;
})(interpolator_1.Interpolator);