tg-map-vue3 3.4.6 → 3.4.7

package/dist/src/map/lat-lng.d.ts

@@ -74,6 +74,14 @@ export declare class LatLngBounds {
     ne: LatLng;
     static EMPTY: LatLngBounds;
     static isBetweenLng(minLng: number, maxLng: number, lng: number): boolean;
+    /**
+     * 从数组创建bounds
+     *
+     * 只有{@link positions}为空时, 才会返回`undefined`, 可以借助{@link Arrays.isNotEmpty}协助进行类型推断
+     */
+    static fromArray(positions: readonly []): undefined;
+    /** @see Arrays.isNotEmpty */
+    static fromArray(positions: readonly [LatLng, ...LatLng[]]): LatLngBounds;
     static fromArray(positions: readonly LatLng[]): LatLngBounds | undefined;
     static from(...positions: LatLng[]): LatLngBounds;
     static fromGoogle(bounds: google.maps.LatLngBounds, coord: CoordType): LatLngBounds;

package/dist/src/utils/arrays.d.ts

@@ -1,5 +1,5 @@
 /// <reference types="google.maps" />
-import type { AnyFunction, Constructor } from '../components';
+import { type AnyFunction, type Constructor } from '../components';
 export declare namespace Arrays {
     /**
      * 浅层比较
@@ -14,6 +14,11 @@ export declare namespace Arrays {
     function at<T>(arr: T[], index: number, value: T): void;
     /** 获取 指定位置的值 */
     function at<T>(arr: T[], index: number): T | undefined;
+    /**
+     * 判断并推断数组非空
+     * @see https://stackoverflow.com/questions/56006111/is-it-possible-to-define-a-non-empty-array-type-in-typescript
+     */
+    function isNotEmpty<T>(arr: T[]): arr is [T, ...T[]];
 }
 export declare namespace MVCArrays {
     function indexOf<T>(arr: google.maps.MVCArray<T>, item: T): number;

package/dist/tg-map.js

@@ -430,33 +430,37 @@ var Ve;
 })(Ve || (Ve = {}));
 var ae;
 ((i) => {
-  function t(a, h) {
-    return a.length === h.length && a.every((o, l) => o === h[l]);
+  function t(h, o) {
+    return h.length === o.length && h.every((l, d) => l === o[d]);
   }
   i.equals = t;
-  function e(a, h) {
-    const o = a.indexOf(h);
-    if (o !== -1)
-      return a.splice(o, 1)[0];
+  function e(h, o) {
+    const l = h.indexOf(o);
+    if (l !== -1)
+      return h.splice(l, 1)[0];
   }
   i.remove = e;
-  function r(a, h) {
-    for (const o of a)
-      if (o instanceof h)
-        return o;
+  function r(h, o) {
+    for (const l of h)
+      if (l instanceof o)
+        return l;
   }
   i.findByType = r;
-  function s(a, h) {
-    return a.includes(h);
+  function s(h, o) {
+    return h.includes(o);
   }
   i.includesTyped = s;
-  function n(a, h, o) {
-    const l = h >= 0 ? h : a.length + h;
-    if (o === void 0)
-      return a[l];
-    a[l] = o;
+  function n(h, o, l) {
+    const d = o >= 0 ? o : h.length + o;
+    if (l === void 0)
+      return h[d];
+    h[d] = l;
   }
   i.at = n;
+  function a(h) {
+    return h.length > 0;
+  }
+  i.isNotEmpty = a;
 })(ae || (ae = {}));
 var le;
 ((i) => {
@@ -5778,7 +5782,7 @@ const Gs = {
   getDestination: ns
 }, Zs = {
   install(i, t) {
-    qr(t), i.config.unwrapInjectedRef = !0;
+    qr(t);
     const e = i.config.optionMergeStrategies;
     e[be] = e[Me] = (r, s) => r ? [...new Set([].concat(r, s))] : Array.isArray(s) ? s : [s];
   }