@fecp/mobile 1.0.79 → 1.1.1

package/es/node_modules/.pnpm/zrender@5.6.1/node_modules/zrender/lib/core/matrix.mjs

@@ -0,0 +1,112 @@
+function create() {
+  return [1, 0, 0, 1, 0, 0];
+}
+function identity(out) {
+  out[0] = 1;
+  out[1] = 0;
+  out[2] = 0;
+  out[3] = 1;
+  out[4] = 0;
+  out[5] = 0;
+  return out;
+}
+function copy(out, m) {
+  out[0] = m[0];
+  out[1] = m[1];
+  out[2] = m[2];
+  out[3] = m[3];
+  out[4] = m[4];
+  out[5] = m[5];
+  return out;
+}
+function mul(out, m1, m2) {
+  var out0 = m1[0] * m2[0] + m1[2] * m2[1];
+  var out1 = m1[1] * m2[0] + m1[3] * m2[1];
+  var out2 = m1[0] * m2[2] + m1[2] * m2[3];
+  var out3 = m1[1] * m2[2] + m1[3] * m2[3];
+  var out4 = m1[0] * m2[4] + m1[2] * m2[5] + m1[4];
+  var out5 = m1[1] * m2[4] + m1[3] * m2[5] + m1[5];
+  out[0] = out0;
+  out[1] = out1;
+  out[2] = out2;
+  out[3] = out3;
+  out[4] = out4;
+  out[5] = out5;
+  return out;
+}
+function translate(out, a, v) {
+  out[0] = a[0];
+  out[1] = a[1];
+  out[2] = a[2];
+  out[3] = a[3];
+  out[4] = a[4] + v[0];
+  out[5] = a[5] + v[1];
+  return out;
+}
+function rotate(out, a, rad, pivot) {
+  if (pivot === void 0) {
+    pivot = [0, 0];
+  }
+  var aa = a[0];
+  var ac = a[2];
+  var atx = a[4];
+  var ab = a[1];
+  var ad = a[3];
+  var aty = a[5];
+  var st = Math.sin(rad);
+  var ct = Math.cos(rad);
+  out[0] = aa * ct + ab * st;
+  out[1] = -aa * st + ab * ct;
+  out[2] = ac * ct + ad * st;
+  out[3] = -ac * st + ct * ad;
+  out[4] = ct * (atx - pivot[0]) + st * (aty - pivot[1]) + pivot[0];
+  out[5] = ct * (aty - pivot[1]) - st * (atx - pivot[0]) + pivot[1];
+  return out;
+}
+function scale(out, a, v) {
+  var vx = v[0];
+  var vy = v[1];
+  out[0] = a[0] * vx;
+  out[1] = a[1] * vy;
+  out[2] = a[2] * vx;
+  out[3] = a[3] * vy;
+  out[4] = a[4] * vx;
+  out[5] = a[5] * vy;
+  return out;
+}
+function invert(out, a) {
+  var aa = a[0];
+  var ac = a[2];
+  var atx = a[4];
+  var ab = a[1];
+  var ad = a[3];
+  var aty = a[5];
+  var det = aa * ad - ab * ac;
+  if (!det) {
+    return null;
+  }
+  det = 1 / det;
+  out[0] = ad * det;
+  out[1] = -ab * det;
+  out[2] = -ac * det;
+  out[3] = aa * det;
+  out[4] = (ac * aty - ad * atx) * det;
+  out[5] = (ab * atx - aa * aty) * det;
+  return out;
+}
+function clone(a) {
+  var b = create();
+  copy(b, a);
+  return b;
+}
+export {
+  clone,
+  copy,
+  create,
+  identity,
+  invert,
+  mul,
+  rotate,
+  scale,
+  translate
+};

package/es/node_modules/.pnpm/zrender@5.6.1/node_modules/zrender/lib/core/platform.mjs

@@ -0,0 +1,77 @@
+var DEFAULT_FONT_SIZE = 12;
+var DEFAULT_FONT_FAMILY = "sans-serif";
+var DEFAULT_FONT = DEFAULT_FONT_SIZE + "px " + DEFAULT_FONT_FAMILY;
+var OFFSET = 20;
+var SCALE = 100;
+var defaultWidthMapStr = "007LLmW'55;N0500LLLLLLLLLL00NNNLzWW\\\\WQb\\0FWLg\\bWb\\WQ\\WrWWQ000CL5LLFLL0LL**F*gLLLL5F0LF\\FFF5.5N";
+function getTextWidthMap(mapStr) {
+  var map = {};
+  if (typeof JSON === "undefined") {
+    return map;
+  }
+  for (var i = 0; i < mapStr.length; i++) {
+    var char = String.fromCharCode(i + 32);
+    var size = (mapStr.charCodeAt(i) - OFFSET) / SCALE;
+    map[char] = size;
+  }
+  return map;
+}
+var DEFAULT_TEXT_WIDTH_MAP = getTextWidthMap(defaultWidthMapStr);
+var platformApi = {
+  createCanvas: function() {
+    return typeof document !== "undefined" && document.createElement("canvas");
+  },
+  measureText: /* @__PURE__ */ function() {
+    var _ctx;
+    var _cachedFont;
+    return function(text, font) {
+      if (!_ctx) {
+        var canvas = platformApi.createCanvas();
+        _ctx = canvas && canvas.getContext("2d");
+      }
+      if (_ctx) {
+        if (_cachedFont !== font) {
+          _cachedFont = _ctx.font = font || DEFAULT_FONT;
+        }
+        return _ctx.measureText(text);
+      } else {
+        text = text || "";
+        font = font || DEFAULT_FONT;
+        var res = /((?:\d+)?\.?\d*)px/.exec(font);
+        var fontSize = res && +res[1] || DEFAULT_FONT_SIZE;
+        var width = 0;
+        if (font.indexOf("mono") >= 0) {
+          width = fontSize * text.length;
+        } else {
+          for (var i = 0; i < text.length; i++) {
+            var preCalcWidth = DEFAULT_TEXT_WIDTH_MAP[text[i]];
+            width += preCalcWidth == null ? fontSize : preCalcWidth * fontSize;
+          }
+        }
+        return { width };
+      }
+    };
+  }(),
+  loadImage: function(src, onload, onerror) {
+    var image = new Image();
+    image.onload = onload;
+    image.onerror = onerror;
+    image.src = src;
+    return image;
+  }
+};
+function setPlatformAPI(newPlatformApis) {
+  for (var key in platformApi) {
+    if (newPlatformApis[key]) {
+      platformApi[key] = newPlatformApis[key];
+    }
+  }
+}
+export {
+  DEFAULT_FONT,
+  DEFAULT_FONT_FAMILY,
+  DEFAULT_FONT_SIZE,
+  DEFAULT_TEXT_WIDTH_MAP,
+  platformApi,
+  setPlatformAPI
+};

package/es/node_modules/.pnpm/zrender@5.6.1/node_modules/zrender/lib/core/timsort.mjs

@@ -0,0 +1,510 @@
+var DEFAULT_MIN_MERGE = 32;
+var DEFAULT_MIN_GALLOPING = 7;
+function minRunLength(n) {
+  var r = 0;
+  while (n >= DEFAULT_MIN_MERGE) {
+    r |= n & 1;
+    n >>= 1;
+  }
+  return n + r;
+}
+function makeAscendingRun(array, lo, hi, compare) {
+  var runHi = lo + 1;
+  if (runHi === hi) {
+    return 1;
+  }
+  if (compare(array[runHi++], array[lo]) < 0) {
+    while (runHi < hi && compare(array[runHi], array[runHi - 1]) < 0) {
+      runHi++;
+    }
+    reverseRun(array, lo, runHi);
+  } else {
+    while (runHi < hi && compare(array[runHi], array[runHi - 1]) >= 0) {
+      runHi++;
+    }
+  }
+  return runHi - lo;
+}
+function reverseRun(array, lo, hi) {
+  hi--;
+  while (lo < hi) {
+    var t = array[lo];
+    array[lo++] = array[hi];
+    array[hi--] = t;
+  }
+}
+function binaryInsertionSort(array, lo, hi, start, compare) {
+  if (start === lo) {
+    start++;
+  }
+  for (; start < hi; start++) {
+    var pivot = array[start];
+    var left = lo;
+    var right = start;
+    var mid;
+    while (left < right) {
+      mid = left + right >>> 1;
+      if (compare(pivot, array[mid]) < 0) {
+        right = mid;
+      } else {
+        left = mid + 1;
+      }
+    }
+    var n = start - left;
+    switch (n) {
+      case 3:
+        array[left + 3] = array[left + 2];
+      case 2:
+        array[left + 2] = array[left + 1];
+      case 1:
+        array[left + 1] = array[left];
+        break;
+      default:
+        while (n > 0) {
+          array[left + n] = array[left + n - 1];
+          n--;
+        }
+    }
+    array[left] = pivot;
+  }
+}
+function gallopLeft(value, array, start, length, hint, compare) {
+  var lastOffset = 0;
+  var maxOffset = 0;
+  var offset = 1;
+  if (compare(value, array[start + hint]) > 0) {
+    maxOffset = length - hint;
+    while (offset < maxOffset && compare(value, array[start + hint + offset]) > 0) {
+      lastOffset = offset;
+      offset = (offset << 1) + 1;
+      if (offset <= 0) {
+        offset = maxOffset;
+      }
+    }
+    if (offset > maxOffset) {
+      offset = maxOffset;
+    }
+    lastOffset += hint;
+    offset += hint;
+  } else {
+    maxOffset = hint + 1;
+    while (offset < maxOffset && compare(value, array[start + hint - offset]) <= 0) {
+      lastOffset = offset;
+      offset = (offset << 1) + 1;
+      if (offset <= 0) {
+        offset = maxOffset;
+      }
+    }
+    if (offset > maxOffset) {
+      offset = maxOffset;
+    }
+    var tmp = lastOffset;
+    lastOffset = hint - offset;
+    offset = hint - tmp;
+  }
+  lastOffset++;
+  while (lastOffset < offset) {
+    var m = lastOffset + (offset - lastOffset >>> 1);
+    if (compare(value, array[start + m]) > 0) {
+      lastOffset = m + 1;
+    } else {
+      offset = m;
+    }
+  }
+  return offset;
+}
+function gallopRight(value, array, start, length, hint, compare) {
+  var lastOffset = 0;
+  var maxOffset = 0;
+  var offset = 1;
+  if (compare(value, array[start + hint]) < 0) {
+    maxOffset = hint + 1;
+    while (offset < maxOffset && compare(value, array[start + hint - offset]) < 0) {
+      lastOffset = offset;
+      offset = (offset << 1) + 1;
+      if (offset <= 0) {
+        offset = maxOffset;
+      }
+    }
+    if (offset > maxOffset) {
+      offset = maxOffset;
+    }
+    var tmp = lastOffset;
+    lastOffset = hint - offset;
+    offset = hint - tmp;
+  } else {
+    maxOffset = length - hint;
+    while (offset < maxOffset && compare(value, array[start + hint + offset]) >= 0) {
+      lastOffset = offset;
+      offset = (offset << 1) + 1;
+      if (offset <= 0) {
+        offset = maxOffset;
+      }
+    }
+    if (offset > maxOffset) {
+      offset = maxOffset;
+    }
+    lastOffset += hint;
+    offset += hint;
+  }
+  lastOffset++;
+  while (lastOffset < offset) {
+    var m = lastOffset + (offset - lastOffset >>> 1);
+    if (compare(value, array[start + m]) < 0) {
+      offset = m;
+    } else {
+      lastOffset = m + 1;
+    }
+  }
+  return offset;
+}
+function TimSort(array, compare) {
+  var minGallop = DEFAULT_MIN_GALLOPING;
+  var runStart;
+  var runLength;
+  var stackSize = 0;
+  var tmp = [];
+  runStart = [];
+  runLength = [];
+  function pushRun(_runStart, _runLength) {
+    runStart[stackSize] = _runStart;
+    runLength[stackSize] = _runLength;
+    stackSize += 1;
+  }
+  function mergeRuns() {
+    while (stackSize > 1) {
+      var n = stackSize - 2;
+      if (n >= 1 && runLength[n - 1] <= runLength[n] + runLength[n + 1] || n >= 2 && runLength[n - 2] <= runLength[n] + runLength[n - 1]) {
+        if (runLength[n - 1] < runLength[n + 1]) {
+          n--;
+        }
+      } else if (runLength[n] > runLength[n + 1]) {
+        break;
+      }
+      mergeAt(n);
+    }
+  }
+  function forceMergeRuns() {
+    while (stackSize > 1) {
+      var n = stackSize - 2;
+      if (n > 0 && runLength[n - 1] < runLength[n + 1]) {
+        n--;
+      }
+      mergeAt(n);
+    }
+  }
+  function mergeAt(i) {
+    var start1 = runStart[i];
+    var length1 = runLength[i];
+    var start2 = runStart[i + 1];
+    var length2 = runLength[i + 1];
+    runLength[i] = length1 + length2;
+    if (i === stackSize - 3) {
+      runStart[i + 1] = runStart[i + 2];
+      runLength[i + 1] = runLength[i + 2];
+    }
+    stackSize--;
+    var k = gallopRight(array[start2], array, start1, length1, 0, compare);
+    start1 += k;
+    length1 -= k;
+    if (length1 === 0) {
+      return;
+    }
+    length2 = gallopLeft(array[start1 + length1 - 1], array, start2, length2, length2 - 1, compare);
+    if (length2 === 0) {
+      return;
+    }
+    if (length1 <= length2) {
+      mergeLow(start1, length1, start2, length2);
+    } else {
+      mergeHigh(start1, length1, start2, length2);
+    }
+  }
+  function mergeLow(start1, length1, start2, length2) {
+    var i = 0;
+    for (i = 0; i < length1; i++) {
+      tmp[i] = array[start1 + i];
+    }
+    var cursor1 = 0;
+    var cursor2 = start2;
+    var dest = start1;
+    array[dest++] = array[cursor2++];
+    if (--length2 === 0) {
+      for (i = 0; i < length1; i++) {
+        array[dest + i] = tmp[cursor1 + i];
+      }
+      return;
+    }
+    if (length1 === 1) {
+      for (i = 0; i < length2; i++) {
+        array[dest + i] = array[cursor2 + i];
+      }
+      array[dest + length2] = tmp[cursor1];
+      return;
+    }
+    var _minGallop = minGallop;
+    var count1;
+    var count2;
+    var exit;
+    while (1) {
+      count1 = 0;
+      count2 = 0;
+      exit = false;
+      do {
+        if (compare(array[cursor2], tmp[cursor1]) < 0) {
+          array[dest++] = array[cursor2++];
+          count2++;
+          count1 = 0;
+          if (--length2 === 0) {
+            exit = true;
+            break;
+          }
+        } else {
+          array[dest++] = tmp[cursor1++];
+          count1++;
+          count2 = 0;
+          if (--length1 === 1) {
+            exit = true;
+            break;
+          }
+        }
+      } while ((count1 | count2) < _minGallop);
+      if (exit) {
+        break;
+      }
+      do {
+        count1 = gallopRight(array[cursor2], tmp, cursor1, length1, 0, compare);
+        if (count1 !== 0) {
+          for (i = 0; i < count1; i++) {
+            array[dest + i] = tmp[cursor1 + i];
+          }
+          dest += count1;
+          cursor1 += count1;
+          length1 -= count1;
+          if (length1 <= 1) {
+            exit = true;
+            break;
+          }
+        }
+        array[dest++] = array[cursor2++];
+        if (--length2 === 0) {
+          exit = true;
+          break;
+        }
+        count2 = gallopLeft(tmp[cursor1], array, cursor2, length2, 0, compare);
+        if (count2 !== 0) {
+          for (i = 0; i < count2; i++) {
+            array[dest + i] = array[cursor2 + i];
+          }
+          dest += count2;
+          cursor2 += count2;
+          length2 -= count2;
+          if (length2 === 0) {
+            exit = true;
+            break;
+          }
+        }
+        array[dest++] = tmp[cursor1++];
+        if (--length1 === 1) {
+          exit = true;
+          break;
+        }
+        _minGallop--;
+      } while (count1 >= DEFAULT_MIN_GALLOPING || count2 >= DEFAULT_MIN_GALLOPING);
+      if (exit) {
+        break;
+      }
+      if (_minGallop < 0) {
+        _minGallop = 0;
+      }
+      _minGallop += 2;
+    }
+    minGallop = _minGallop;
+    minGallop < 1 && (minGallop = 1);
+    if (length1 === 1) {
+      for (i = 0; i < length2; i++) {
+        array[dest + i] = array[cursor2 + i];
+      }
+      array[dest + length2] = tmp[cursor1];
+    } else if (length1 === 0) {
+      throw new Error();
+    } else {
+      for (i = 0; i < length1; i++) {
+        array[dest + i] = tmp[cursor1 + i];
+      }
+    }
+  }
+  function mergeHigh(start1, length1, start2, length2) {
+    var i = 0;
+    for (i = 0; i < length2; i++) {
+      tmp[i] = array[start2 + i];
+    }
+    var cursor1 = start1 + length1 - 1;
+    var cursor2 = length2 - 1;
+    var dest = start2 + length2 - 1;
+    var customCursor = 0;
+    var customDest = 0;
+    array[dest--] = array[cursor1--];
+    if (--length1 === 0) {
+      customCursor = dest - (length2 - 1);
+      for (i = 0; i < length2; i++) {
+        array[customCursor + i] = tmp[i];
+      }
+      return;
+    }
+    if (length2 === 1) {
+      dest -= length1;
+      cursor1 -= length1;
+      customDest = dest + 1;
+      customCursor = cursor1 + 1;
+      for (i = length1 - 1; i >= 0; i--) {
+        array[customDest + i] = array[customCursor + i];
+      }
+      array[dest] = tmp[cursor2];
+      return;
+    }
+    var _minGallop = minGallop;
+    while (true) {
+      var count1 = 0;
+      var count2 = 0;
+      var exit = false;
+      do {
+        if (compare(tmp[cursor2], array[cursor1]) < 0) {
+          array[dest--] = array[cursor1--];
+          count1++;
+          count2 = 0;
+          if (--length1 === 0) {
+            exit = true;
+            break;
+          }
+        } else {
+          array[dest--] = tmp[cursor2--];
+          count2++;
+          count1 = 0;
+          if (--length2 === 1) {
+            exit = true;
+            break;
+          }
+        }
+      } while ((count1 | count2) < _minGallop);
+      if (exit) {
+        break;
+      }
+      do {
+        count1 = length1 - gallopRight(tmp[cursor2], array, start1, length1, length1 - 1, compare);
+        if (count1 !== 0) {
+          dest -= count1;
+          cursor1 -= count1;
+          length1 -= count1;
+          customDest = dest + 1;
+          customCursor = cursor1 + 1;
+          for (i = count1 - 1; i >= 0; i--) {
+            array[customDest + i] = array[customCursor + i];
+          }
+          if (length1 === 0) {
+            exit = true;
+            break;
+          }
+        }
+        array[dest--] = tmp[cursor2--];
+        if (--length2 === 1) {
+          exit = true;
+          break;
+        }
+        count2 = length2 - gallopLeft(array[cursor1], tmp, 0, length2, length2 - 1, compare);
+        if (count2 !== 0) {
+          dest -= count2;
+          cursor2 -= count2;
+          length2 -= count2;
+          customDest = dest + 1;
+          customCursor = cursor2 + 1;
+          for (i = 0; i < count2; i++) {
+            array[customDest + i] = tmp[customCursor + i];
+          }
+          if (length2 <= 1) {
+            exit = true;
+            break;
+          }
+        }
+        array[dest--] = array[cursor1--];
+        if (--length1 === 0) {
+          exit = true;
+          break;
+        }
+        _minGallop--;
+      } while (count1 >= DEFAULT_MIN_GALLOPING || count2 >= DEFAULT_MIN_GALLOPING);
+      if (exit) {
+        break;
+      }
+      if (_minGallop < 0) {
+        _minGallop = 0;
+      }
+      _minGallop += 2;
+    }
+    minGallop = _minGallop;
+    if (minGallop < 1) {
+      minGallop = 1;
+    }
+    if (length2 === 1) {
+      dest -= length1;
+      cursor1 -= length1;
+      customDest = dest + 1;
+      customCursor = cursor1 + 1;
+      for (i = length1 - 1; i >= 0; i--) {
+        array[customDest + i] = array[customCursor + i];
+      }
+      array[dest] = tmp[cursor2];
+    } else if (length2 === 0) {
+      throw new Error();
+    } else {
+      customCursor = dest - (length2 - 1);
+      for (i = 0; i < length2; i++) {
+        array[customCursor + i] = tmp[i];
+      }
+    }
+  }
+  return {
+    mergeRuns,
+    forceMergeRuns,
+    pushRun
+  };
+}
+function sort(array, compare, lo, hi) {
+  if (!lo) {
+    lo = 0;
+  }
+  if (!hi) {
+    hi = array.length;
+  }
+  var remaining = hi - lo;
+  if (remaining < 2) {
+    return;
+  }
+  var runLength = 0;
+  if (remaining < DEFAULT_MIN_MERGE) {
+    runLength = makeAscendingRun(array, lo, hi, compare);
+    binaryInsertionSort(array, lo, hi, lo + runLength, compare);
+    return;
+  }
+  var ts = TimSort(array, compare);
+  var minRun = minRunLength(remaining);
+  do {
+    runLength = makeAscendingRun(array, lo, hi, compare);
+    if (runLength < minRun) {
+      var force = remaining;
+      if (force > minRun) {
+        force = minRun;
+      }
+      binaryInsertionSort(array, lo, lo + force, lo + runLength, compare);
+      runLength = force;
+    }
+    ts.pushRun(lo, runLength);
+    ts.mergeRuns();
+    remaining -= runLength;
+    lo += runLength;
+  } while (remaining !== 0);
+  ts.forceMergeRuns();
+}
+export {
+  sort as default
+};