vue2项目基础脚手架配置

/* eslint-disable */ // https://d3js.org v7.9.0 Copyright 2010-2023 Mike Bostock (function (global, factory) { typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) : typeof define === 'function' && define.amd ? define(['exports'], factory) : (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.d3 = global.d3 || {})); })(this, (function (exports) { 'use strict'; var version = "7.9.0"; function ascending$3(a, b) { return a == null || b == null ? NaN : a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN; } function descending$2(a, b) { return a == null || b == null ? NaN : b < a ? -1 : b > a ? 1 : b >= a ? 0 : NaN; } function bisector(f) { let compare1, compare2, delta; // If an accessor is specified, promote it to a comparator. In this case we // can test whether the search value is (self-) comparable. We can’t do this // for a comparator (except for specific, known comparators) because we can’t // tell if the comparator is symmetric, and an asymmetric comparator can’t be // used to test whether a single value is comparable. if (f.length !== 2) { compare1 = ascending$3; compare2 = (d, x) => ascending$3(f(d), x); delta = (d, x) => f(d) - x; } else { compare1 = f === ascending$3 || f === descending$2 ? f : zero$1; compare2 = f; delta = f; } function left(a, x, lo = 0, hi = a.length) { if (lo < hi) { if (compare1(x, x) !== 0) return hi; do { const mid = (lo + hi) >>> 1; if (compare2(a[mid], x) < 0) lo = mid + 1; else hi = mid; } while (lo < hi); } return lo; } function right(a, x, lo = 0, hi = a.length) { if (lo < hi) { if (compare1(x, x) !== 0) return hi; do { const mid = (lo + hi) >>> 1; if (compare2(a[mid], x) <= 0) lo = mid + 1; else hi = mid; } while (lo < hi); } return lo; } function center(a, x, lo = 0, hi = a.length) { const i = left(a, x, lo, hi - 1); return i > lo && delta(a[i - 1], x) > -delta(a[i], x) ? i - 1 : i; } return {left, center, right}; } function zero$1() { return 0; } function number$3(x) { return x === null ? NaN : +x; } function* numbers(values, valueof) { if (valueof === undefined) { for (let value of values) { if (value != null && (value = +value) >= value) { yield value; } } } else { let index = -1; for (let value of values) { if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) { yield value; } } } } const ascendingBisect = bisector(ascending$3); const bisectRight = ascendingBisect.right; const bisectLeft = ascendingBisect.left; const bisectCenter = bisector(number$3).center; var bisect = bisectRight; function blur(values, r) { if (!((r = +r) >= 0)) throw new RangeError("invalid r"); let length = values.length; if (!((length = Math.floor(length)) >= 0)) throw new RangeError("invalid length"); if (!length || !r) return values; const blur = blurf(r); const temp = values.slice(); blur(values, temp, 0, length, 1); blur(temp, values, 0, length, 1); blur(values, temp, 0, length, 1); return values; } const blur2 = Blur2(blurf); const blurImage = Blur2(blurfImage); function Blur2(blur) { return function(data, rx, ry = rx) { if (!((rx = +rx) >= 0)) throw new RangeError("invalid rx"); if (!((ry = +ry) >= 0)) throw new RangeError("invalid ry"); let {data: values, width, height} = data; if (!((width = Math.floor(width)) >= 0)) throw new RangeError("invalid width"); if (!((height = Math.floor(height !== undefined ? height : values.length / width)) >= 0)) throw new RangeError("invalid height"); if (!width || !height || (!rx && !ry)) return data; const blurx = rx && blur(rx); const blury = ry && blur(ry); const temp = values.slice(); if (blurx && blury) { blurh(blurx, temp, values, width, height); blurh(blurx, values, temp, width, height); blurh(blurx, temp, values, width, height); blurv(blury, values, temp, width, height); blurv(blury, temp, values, width, height); blurv(blury, values, temp, width, height); } else if (blurx) { blurh(blurx, values, temp, width, height); blurh(blurx, temp, values, width, height); blurh(blurx, values, temp, width, height); } else if (blury) { blurv(blury, values, temp, width, height); blurv(blury, temp, values, width, height); blurv(blury, values, temp, width, height); } return data; }; } function blurh(blur, T, S, w, h) { for (let y = 0, n = w * h; y < n;) { blur(T, S, y, y += w, 1); } } function blurv(blur, T, S, w, h) { for (let x = 0, n = w * h; x < w; ++x) { blur(T, S, x, x + n, w); } } function blurfImage(radius) { const blur = blurf(radius); return (T, S, start, stop, step) => { start <<= 2, stop <<= 2, step <<= 2; blur(T, S, start + 0, stop + 0, step); blur(T, S, start + 1, stop + 1, step); blur(T, S, start + 2, stop + 2, step); blur(T, S, start + 3, stop + 3, step); }; } // Given a target array T, a source array S, sets each value T[i] to the average // of {S[i - r], …, S[i], …, S[i + r]}, where r = ⌊radius⌋, start <= i < stop, // for each i, i + step, i + 2 * step, etc., and where S[j] is clamped between // S[start] (inclusive) and S[stop] (exclusive). If the given radius is not an // integer, S[i - r - 1] and S[i + r + 1] are added to the sum, each weighted // according to r - ⌊radius⌋. function blurf(radius) { const radius0 = Math.floor(radius); if (radius0 === radius) return bluri(radius); const t = radius - radius0; const w = 2 * radius + 1; return (T, S, start, stop, step) => { // stop must be aligned! if (!((stop -= step) >= start)) return; // inclusive stop let sum = radius0 * S[start]; const s0 = step * radius0; const s1 = s0 + step; for (let i = start, j = start + s0; i < j; i += step) { sum += S[Math.min(stop, i)]; } for (let i = start, j = stop; i <= j; i += step) { sum += S[Math.min(stop, i + s0)]; T[i] = (sum + t * (S[Math.max(start, i - s1)] + S[Math.min(stop, i + s1)])) / w; sum -= S[Math.max(start, i - s0)]; } }; } // Like blurf, but optimized for integer radius. function bluri(radius) { const w = 2 * radius + 1; return (T, S, start, stop, step) => { // stop must be aligned! if (!((stop -= step) >= start)) return; // inclusive stop let sum = radius * S[start]; const s = step * radius; for (let i = start, j = start + s; i < j; i += step) { sum += S[Math.min(stop, i)]; } for (let i = start, j = stop; i <= j; i += step) { sum += S[Math.min(stop, i + s)]; T[i] = sum / w; sum -= S[Math.max(start, i - s)]; } }; } function count$1(values, valueof) { let count = 0; if (valueof === undefined) { for (let value of values) { if (value != null && (value = +value) >= value) { ++count; } } } else { let index = -1; for (let value of values) { if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) { ++count; } } } return count; } function length$3(array) { return array.length | 0; } function empty$2(length) { return !(length > 0); } function arrayify(values) { return typeof values !== "object" || "length" in values ? values : Array.from(values); } function reducer(reduce) { return values => reduce(...values); } function cross$2(...values) { const reduce = typeof values[values.length - 1] === "function" && reducer(values.pop()); values = values.map(arrayify); const lengths = values.map(length$3); const j = values.length - 1; const index = new Array(j + 1).fill(0); const product = []; if (j < 0 || lengths.some(empty$2)) return product; while (true) { product.push(index.map((j, i