ag-charts-community
Version:
Advanced Charting / Charts supporting Javascript / Typescript / React / Angular / Vue
105 lines • 3.12 kB
JavaScript
;
var __values = (this && this.__values) || function(o) {
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
if (m) return m.call(o);
if (o && typeof o.length === "number") return {
next: function () {
if (o && i >= o.length) o = void 0;
return { value: o && o[i++], done: !o };
}
};
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
};
Object.defineProperty(exports, "__esModule", { value: true });
// Custom `Array.find` implementation for legacy browsers.
function find(arr, predicate) {
for (var i = 0; i < arr.length; i++) {
var value = arr[i];
if (predicate(value, i, arr)) {
return value;
}
}
}
exports.find = find;
function findIndex(arr, predicate) {
for (var i = 0; i < arr.length; i++) {
if (predicate(arr[i], i, arr)) {
return i;
}
}
return -1;
}
exports.findIndex = findIndex;
function identity(value) {
return value;
}
function extent(values, predicate, map) {
var transform = map || identity;
var n = values.length;
var i = -1;
var value;
var min;
var max;
while (++i < n) { // Find the first value.
value = values[i];
if (predicate(value)) {
min = max = value;
while (++i < n) { // Compare the remaining values.
value = values[i];
if (predicate(value)) {
if (min > value) {
min = value;
}
if (max < value) {
max = value;
}
}
}
}
}
return min === undefined || max === undefined ? undefined : [transform(min), transform(max)];
}
exports.extent = extent;
/**
* finds the min and max using a process appropriate for stacked values. Ie,
* summing up the positive and negative numbers, and returning the totals of each
*/
function findMinMax(values) {
var e_1, _a;
var min = 0;
var max = 0;
try {
for (var values_1 = __values(values), values_1_1 = values_1.next(); !values_1_1.done; values_1_1 = values_1.next()) {
var value = values_1_1.value;
if (value < 0) {
min += value;
}
else {
max += value;
}
}
}
catch (e_1_1) { e_1 = { error: e_1_1 }; }
finally {
try {
if (values_1_1 && !values_1_1.done && (_a = values_1.return)) _a.call(values_1);
}
finally { if (e_1) throw e_1.error; }
}
return { min: min, max: max };
}
exports.findMinMax = findMinMax;
function copy(array, start, count) {
if (start === void 0) { start = 0; }
if (count === void 0) { count = array.length; }
var result = [];
var n = array.length;
if (n) {
for (var i = 0; i < count; i++) {
result.push(array[(start + i) % n]);
}
}
return result;
}
exports.copy = copy;
//# sourceMappingURL=array.js.map