quickvo-sdk-js 0.4.3 → 0.4.4

package/dist/index.js

@@ -6125,28 +6125,28 @@ var Deflate_1$1 = Deflate$1, deflate_2 = deflate$1, deflateRaw_1$1 = deflateRaw$
 };
 const BAD$1 = 16209, TYPE$1 = 16191;
 var inffast = function _(q, k) {
-  let D, $, I, e, u, N, A, U, L, P, Z, F, W, J, z, V, X, Y, et, at, tt, ct, ot, nt;
-  const rt = q.state;
-  D = q.next_in, ot = q.input, $ = D + (q.avail_in - 5), I = q.next_out, nt = q.output, e = I - (k - q.avail_out), u = I + (q.avail_out - 257), N = rt.dmax, A = rt.wsize, U = rt.whave, L = rt.wnext, P = rt.window, Z = rt.hold, F = rt.bits, W = rt.lencode, J = rt.distcode, z = (1 << rt.lenbits) - 1, V = (1 << rt.distbits) - 1;
+  let D, $, I, e, u, N, A, U, L, P, Z, F, W, J, z, V, X, Y, et, at, tt, ct, rt, nt;
+  const ot = q.state;
+  D = q.next_in, rt = q.input, $ = D + (q.avail_in - 5), I = q.next_out, nt = q.output, e = I - (k - q.avail_out), u = I + (q.avail_out - 257), N = ot.dmax, A = ot.wsize, U = ot.whave, L = ot.wnext, P = ot.window, Z = ot.hold, F = ot.bits, W = ot.lencode, J = ot.distcode, z = (1 << ot.lenbits) - 1, V = (1 << ot.distbits) - 1;
   t:
     do {
-      F < 15 && (Z += ot[D++] << F, F += 8, Z += ot[D++] << F, F += 8), X = W[Z & z];
+      F < 15 && (Z += rt[D++] << F, F += 8, Z += rt[D++] << F, F += 8), X = W[Z & z];
       e:
         for (; ; ) {
           if (Y = X >>> 24, Z >>>= Y, F -= Y, Y = X >>> 16 & 255, Y === 0)
             nt[I++] = X & 65535;
           else if (Y & 16) {
-            et = X & 65535, Y &= 15, Y && (F < Y && (Z += ot[D++] << F, F += 8), et += Z & (1 << Y) - 1, Z >>>= Y, F -= Y), F < 15 && (Z += ot[D++] << F, F += 8, Z += ot[D++] << F, F += 8), X = J[Z & V];
+            et = X & 65535, Y &= 15, Y && (F < Y && (Z += rt[D++] << F, F += 8), et += Z & (1 << Y) - 1, Z >>>= Y, F -= Y), F < 15 && (Z += rt[D++] << F, F += 8, Z += rt[D++] << F, F += 8), X = J[Z & V];
             i:
               for (; ; ) {
                 if (Y = X >>> 24, Z >>>= Y, F -= Y, Y = X >>> 16 & 255, Y & 16) {
-                  if (at = X & 65535, Y &= 15, F < Y && (Z += ot[D++] << F, F += 8, F < Y && (Z += ot[D++] << F, F += 8)), at += Z & (1 << Y) - 1, at > N) {
-                    q.msg = "invalid distance too far back", rt.mode = BAD$1;
+                  if (at = X & 65535, Y &= 15, F < Y && (Z += rt[D++] << F, F += 8, F < Y && (Z += rt[D++] << F, F += 8)), at += Z & (1 << Y) - 1, at > N) {
+                    q.msg = "invalid distance too far back", ot.mode = BAD$1;
                     break t;
                   }
                   if (Z >>>= Y, F -= Y, Y = I - e, at > Y) {
-                    if (Y = at - Y, Y > U && rt.sane) {
-                      q.msg = "invalid distance too far back", rt.mode = BAD$1;
+                    if (Y = at - Y, Y > U && ot.sane) {
+                      q.msg = "invalid distance too far back", ot.mode = BAD$1;
                       break t;
                     }
                     if (tt = 0, ct = P, L === 0) {
@@ -6192,7 +6192,7 @@ var inffast = function _(q, k) {
                   X = J[(X & 65535) + (Z & (1 << Y) - 1)];
                   continue i;
                 } else {
-                  q.msg = "invalid distance code", rt.mode = BAD$1;
+                  q.msg = "invalid distance code", ot.mode = BAD$1;
                   break t;
                 }
                 break;
@@ -6201,16 +6201,16 @@ var inffast = function _(q, k) {
             X = W[(X & 65535) + (Z & (1 << Y) - 1)];
             continue e;
           } else if (Y & 32) {
-            rt.mode = TYPE$1;
+            ot.mode = TYPE$1;
             break t;
           } else {
-            q.msg = "invalid literal/length code", rt.mode = BAD$1;
+            q.msg = "invalid literal/length code", ot.mode = BAD$1;
             break t;
           }
           break;
         }
     } while (D < $ && I < u);
-  et = F >> 3, D -= et, F -= et << 3, Z &= (1 << F) - 1, q.next_in = D, q.next_out = I, q.avail_in = D < $ ? 5 + ($ - D) : 5 - (D - $), q.avail_out = I < u ? 257 + (u - I) : 257 - (I - u), rt.hold = Z, rt.bits = F;
+  et = F >> 3, D -= et, F -= et << 3, Z &= (1 << F) - 1, q.next_in = D, q.next_out = I, q.avail_in = D < $ ? 5 + ($ - D) : 5 - (D - $), q.avail_out = I < u ? 257 + (u - I) : 257 - (I - u), ot.hold = Z, ot.bits = F;
 };
 const MAXBITS = 15, ENOUGH_LENS$1 = 852, ENOUGH_DISTS$1 = 592, CODES$1 = 0, LENS$1 = 1, DISTS$1 = 2, lbase = new Uint16Array([
   /* Length codes 257..285 base */
@@ -6348,8 +6348,8 @@ const MAXBITS = 15, ENOUGH_LENS$1 = 852, ENOUGH_DISTS$1 = 592, CODES$1 = 0, LENS
   64
 ]), inflate_table = (_, q, k, D, $, I, e, u) => {
   const N = u.bits;
-  let A = 0, U = 0, L = 0, P = 0, Z = 0, F = 0, W = 0, J = 0, z = 0, V = 0, X, Y, et, at, tt, ct = null, ot;
-  const nt = new Uint16Array(MAXBITS + 1), rt = new Uint16Array(MAXBITS + 1);
+  let A = 0, U = 0, L = 0, P = 0, Z = 0, F = 0, W = 0, J = 0, z = 0, V = 0, X, Y, et, at, tt, ct = null, rt;
+  const nt = new Uint16Array(MAXBITS + 1), ot = new Uint16Array(MAXBITS + 1);
   let vt = null, Kt, It, Rt;
   for (A = 0; A <= MAXBITS; A++)
     nt[A] = 0;
@@ -6366,14 +6366,14 @@ const MAXBITS = 15, ENOUGH_LENS$1 = 852, ENOUGH_DISTS$1 = 592, CODES$1 = 0, LENS
       return -1;
   if (J > 0 && (_ === CODES$1 || P !== 1))
     return -1;
-  for (rt[1] = 0, A = 1; A < MAXBITS; A++)
-    rt[A + 1] = rt[A] + nt[A];
+  for (ot[1] = 0, A = 1; A < MAXBITS; A++)
+    ot[A + 1] = ot[A] + nt[A];
   for (U = 0; U < D; U++)
-    q[k + U] !== 0 && (e[rt[q[k + U]]++] = U);
-  if (_ === CODES$1 ? (ct = vt = e, ot = 20) : _ === LENS$1 ? (ct = lbase, vt = lext, ot = 257) : (ct = dbase, vt = dext, ot = 0), V = 0, U = 0, A = L, tt = I, F = Z, W = 0, et = -1, z = 1 << Z, at = z - 1, _ === LENS$1 && z > ENOUGH_LENS$1 || _ === DISTS$1 && z > ENOUGH_DISTS$1)
+    q[k + U] !== 0 && (e[ot[q[k + U]]++] = U);
+  if (_ === CODES$1 ? (ct = vt = e, rt = 20) : _ === LENS$1 ? (ct = lbase, vt = lext, rt = 257) : (ct = dbase, vt = dext, rt = 0), V = 0, U = 0, A = L, tt = I, F = Z, W = 0, et = -1, z = 1 << Z, at = z - 1, _ === LENS$1 && z > ENOUGH_LENS$1 || _ === DISTS$1 && z > ENOUGH_DISTS$1)
     return 1;
   for (; ; ) {
-    Kt = A - W, e[U] + 1 < ot ? (It = 0, Rt = e[U]) : e[U] >= ot ? (It = vt[e[U] - ot], Rt = ct[e[U] - ot]) : (It = 96, Rt = 0), X = 1 << A - W, Y = 1 << F, L = Y;
+    Kt = A - W, e[U] + 1 < rt ? (It = 0, Rt = e[U]) : e[U] >= rt ? (It = vt[e[U] - rt], Rt = ct[e[U] - rt]) : (It = 96, Rt = 0), X = 1 << A - W, Y = 1 << F, L = Y;
     do
       Y -= X, $[tt + (V >> W) + Y] = Kt << 24 | It << 16 | Rt | 0;
     while (Y !== 0);
@@ -6464,8 +6464,8 @@ const fixedtables = (_) => {
   return I.window === null && (I.wsize = 1 << I.wbits, I.wnext = 0, I.whave = 0, I.window = new Uint8Array(I.wsize)), D >= I.wsize ? (I.window.set(q.subarray(k - I.wsize, k), 0), I.wnext = 0, I.whave = I.wsize) : ($ = I.wsize - I.wnext, $ > D && ($ = D), I.window.set(q.subarray(k - D, k - D + $), I.wnext), D -= $, D ? (I.window.set(q.subarray(k - D, k), 0), I.wnext = D, I.whave = I.wsize) : (I.wnext += $, I.wnext === I.wsize && (I.wnext = 0), I.whave < I.wsize && (I.whave += $))), 0;
 }, inflate$2 = (_, q) => {
   let k, D, $, I, e, u, N, A, U, L, P, Z, F, W, J = 0, z, V, X, Y, et, at, tt, ct;
-  const ot = new Uint8Array(4);
-  let nt, rt;
+  const rt = new Uint8Array(4);
+  let nt, ot;
   const vt = (
     /* permutation of code lengths */
     new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15])
@@ -6487,7 +6487,7 @@ const fixedtables = (_) => {
             u--, A += D[I++] << U, U += 8;
           }
           if (k.wrap & 2 && A === 35615) {
-            k.wbits === 0 && (k.wbits = 15), k.check = 0, ot[0] = A & 255, ot[1] = A >>> 8 & 255, k.check = crc32_1(k.check, ot, 2, 0), A = 0, U = 0, k.mode = FLAGS;
+            k.wbits === 0 && (k.wbits = 15), k.check = 0, rt[0] = A & 255, rt[1] = A >>> 8 & 255, k.check = crc32_1(k.check, rt, 2, 0), A = 0, U = 0, k.mode = FLAGS;
             break;
           }
           if (k.head && (k.head.done = !1), !(k.wrap & 1) || /* check if zlib header allowed */
@@ -6519,7 +6519,7 @@ const fixedtables = (_) => {
             _.msg = "unknown header flags set", k.mode = BAD;
             break;
           }
-          k.head && (k.head.text = A >> 8 & 1), k.flags & 512 && k.wrap & 4 && (ot[0] = A & 255, ot[1] = A >>> 8 & 255, k.check = crc32_1(k.check, ot, 2, 0)), A = 0, U = 0, k.mode = TIME;
+          k.head && (k.head.text = A >> 8 & 1), k.flags & 512 && k.wrap & 4 && (rt[0] = A & 255, rt[1] = A >>> 8 & 255, k.check = crc32_1(k.check, rt, 2, 0)), A = 0, U = 0, k.mode = TIME;
         /* falls through */
         case TIME:
           for (; U < 32; ) {
@@ -6527,7 +6527,7 @@ const fixedtables = (_) => {
               break t;
             u--, A += D[I++] << U, U += 8;
           }
-          k.head && (k.head.time = A), k.flags & 512 && k.wrap & 4 && (ot[0] = A & 255, ot[1] = A >>> 8 & 255, ot[2] = A >>> 16 & 255, ot[3] = A >>> 24 & 255, k.check = crc32_1(k.check, ot, 4, 0)), A = 0, U = 0, k.mode = OS;
+          k.head && (k.head.time = A), k.flags & 512 && k.wrap & 4 && (rt[0] = A & 255, rt[1] = A >>> 8 & 255, rt[2] = A >>> 16 & 255, rt[3] = A >>> 24 & 255, k.check = crc32_1(k.check, rt, 4, 0)), A = 0, U = 0, k.mode = OS;
         /* falls through */
         case OS:
           for (; U < 16; ) {
@@ -6535,7 +6535,7 @@ const fixedtables = (_) => {
               break t;
             u--, A += D[I++] << U, U += 8;
           }
-          k.head && (k.head.xflags = A & 255, k.head.os = A >> 8), k.flags & 512 && k.wrap & 4 && (ot[0] = A & 255, ot[1] = A >>> 8 & 255, k.check = crc32_1(k.check, ot, 2, 0)), A = 0, U = 0, k.mode = EXLEN;
+          k.head && (k.head.xflags = A & 255, k.head.os = A >> 8), k.flags & 512 && k.wrap & 4 && (rt[0] = A & 255, rt[1] = A >>> 8 & 255, k.check = crc32_1(k.check, rt, 2, 0)), A = 0, U = 0, k.mode = EXLEN;
         /* falls through */
         case EXLEN:
           if (k.flags & 1024) {
@@ -6544,7 +6544,7 @@ const fixedtables = (_) => {
                 break t;
               u--, A += D[I++] << U, U += 8;
             }
-            k.length = A, k.head && (k.head.extra_len = A), k.flags & 512 && k.wrap & 4 && (ot[0] = A & 255, ot[1] = A >>> 8 & 255, k.check = crc32_1(k.check, ot, 2, 0)), A = 0, U = 0;
+            k.length = A, k.head && (k.head.extra_len = A), k.flags & 512 && k.wrap & 4 && (rt[0] = A & 255, rt[1] = A >>> 8 & 255, k.check = crc32_1(k.check, rt, 2, 0)), A = 0, U = 0;
           } else k.head && (k.head.extra = null);
           k.mode = EXTRA;
         /* falls through */
@@ -6713,7 +6713,7 @@ const fixedtables = (_) => {
               A >>>= z, U -= z, k.lens[k.have++] = X;
             else {
               if (X === 16) {
-                for (rt = z + 2; U < rt; ) {
+                for (ot = z + 2; U < ot; ) {
                   if (u === 0)
                     break t;
                   u--, A += D[I++] << U, U += 8;
@@ -6724,14 +6724,14 @@ const fixedtables = (_) => {
                 }
                 tt = k.lens[k.have - 1], Z = 3 + (A & 3), A >>>= 2, U -= 2;
               } else if (X === 17) {
-                for (rt = z + 3; U < rt; ) {
+                for (ot = z + 3; U < ot; ) {
                   if (u === 0)
                     break t;
                   u--, A += D[I++] << U, U += 8;
                 }
                 A >>>= z, U -= z, tt = 0, Z = 3 + (A & 7), A >>>= 3, U -= 3;
               } else {
-                for (rt = z + 7; U < rt; ) {
+                for (ot = z + 7; U < ot; ) {
                   if (u === 0)
                     break t;
                   u--, A += D[I++] << U, U += 8;
@@ -6800,7 +6800,7 @@ const fixedtables = (_) => {
         /* falls through */
         case LENEXT:
           if (k.extra) {
-            for (rt = k.extra; U < rt; ) {
+            for (ot = k.extra; U < ot; ) {
               if (u === 0)
                 break t;
               u--, A += D[I++] << U, U += 8;
@@ -6831,7 +6831,7 @@ const fixedtables = (_) => {
         /* falls through */
         case DISTEXT:
           if (k.extra) {
-            for (rt = k.extra; U < rt; ) {
+            for (ot = k.extra; U < ot; ) {
               if (u === 0)
                 break t;
               u--, A += D[I++] << U, U += 8;
@@ -7430,7 +7430,7 @@ class RoomBase {
     // 是否禁止通知
     H(this, "isEarly", !1);
     // 是否提前建连
-    H(this, "taskQueue", new K(["createWs", "createSession", "ice", "createTrack", "subscribe", "closeTrack", "publish"]));
+    H(this, "taskQueue", new K(["createWs", "createSession", "ice", "joinRoom", "createTrack", "subscribe", "closeTrack", "publish"]));
     // 条件队列
     H(this, "roomState", "ready");
     // 房间状态
@@ -7450,7 +7450,7 @@ class RoomBase {
       screenSharing_audio: ""
     });
     H(this, "initAsyncQueue", () => {
-      this.taskQueue.clear(), this.taskQueue.setCondition("createTrack", !0), this.taskQueue.setCondition("closeTrack", !0), this.taskQueue.setCondition("subscribe", !0), this.taskQueue.setCondition("publish", !0);
+      this.taskQueue.clear(), this.taskQueue.setCondition("joinRoom", !0), this.taskQueue.setCondition("createTrack", !0), this.taskQueue.setCondition("closeTrack", !0), this.taskQueue.setCondition("subscribe", !0), this.taskQueue.setCondition("publish", !0);
     });
     /**
      * 获取房间信息
@@ -8414,23 +8414,23 @@ class RoomPeer extends RoomUsers {
         }
         this.reports = I;
         for (const et of this.reports) {
-          const { bytesReceived: at, bytesSent: tt, packetsSent: ct, packetsLost: ot, jitter: nt, roundTripTime: rt } = et;
-          at && (e = at), tt && (u = tt), ct && (U += ct), ot && (L += ot), rt && P.push((rt * 100).toFixed(2)), nt && Z.push(nt.toFixed(2));
+          const { bytesReceived: at, bytesSent: tt, packetsSent: ct, packetsLost: rt, jitter: nt, roundTripTime: ot } = et;
+          at && (e = at), tt && (u = tt), ct && (U += ct), rt && (L += rt), ot && P.push((ot * 100).toFixed(2)), nt && Z.push(nt.toFixed(2));
         }
         Z.sort().reverse(), P.sort().reverse();
         const F = U - N, W = L - A, J = F === 0 ? "0.00" : (W / F).toFixed(2), [z = "0"] = P, [V = "0"] = Z, X = { inboundBytes: e, outboundBytes: u, lostRate: J, roundTripTime: z, jitter: V };
         this.peerNetwork = X;
         const Y = (et, at, tt) => {
-          const ct = Number(et), ot = Number(at), nt = Number(tt);
-          let rt = "0";
-          return ct < 0.03 && ot < 100 && nt < 0.05 ? rt = "5" : ct < 0.06 && ot < 160 && nt < 0.1 ? rt = "4" : ct < 0.1 && ot < 250 && nt < 0.15 ? rt = "3" : ct < 0.15 && ot < 400 && nt < 0.2 ? rt = "2" : rt = "1", Number(rt);
+          const ct = Number(et), rt = Number(at), nt = Number(tt);
+          let ot = "0";
+          return ct < 0.03 && rt < 100 && nt < 0.05 ? ot = "5" : ct < 0.06 && rt < 160 && nt < 0.1 ? ot = "4" : ct < 0.1 && rt < 250 && nt < 0.15 ? ot = "3" : ct < 0.15 && rt < 400 && nt < 0.2 ? ot = "2" : ot = "1", Number(ot);
         };
         {
-          const et = Y(J, z, V), at = await this.getCaller(), { network: tt } = at, ct = { egress: et, ingress: et }, ot = JSON.stringify(tt) !== JSON.stringify(ct);
-          if (await this.updateUserNetwork(this.options.userId, ct), ot) {
+          const et = Y(J, z, V), at = await this.getCaller(), { network: tt } = at, ct = { egress: et, ingress: et }, rt = JSON.stringify(tt) !== JSON.stringify(ct);
+          if (await this.updateUserNetwork(this.options.userId, ct), rt) {
             this.emitNotifyUpdateUsers();
-            const { userId: nt, roomId: rt } = this.options;
-            this.cwsIns.sendMessage({ event: "networkQualityChange", data: { ...ct, userId: nt, roomId: rt } }, !1);
+            const { userId: nt, roomId: ot } = this.options;
+            this.cwsIns.sendMessage({ event: "networkQualityChange", data: { ...ct, userId: nt, roomId: ot } }, !1);
           }
         }
       } catch (k) {
@@ -8459,7 +8459,6 @@ class RoomCalls extends RoomPeer {
     super();
     // sdk服务版本
     H(this, "sdk_service_version", "1.0.5");
-    // createWsResolves = []
     /**
      * 设置本地流
      * @param mediaType MediaType
@@ -8512,15 +8511,16 @@ class RoomCalls extends RoomPeer {
      * @example quickvo.joinRoom({ userId: '', roomId: '', sdkToken: '', callType: '1' , newPublishAutoSubscribe: true })
      * @returns Promise<boolean>
      */
-    H(this, "joinRoom", async (k) => new Promise((D, $) => {
-      this.setOptions(k), this.clearUsers(), this.createWs();
+    H(this, "joinRoom", async (k) => (this.setOptions(k), await this.createWs(), new Promise((D, $) => {
+      this.clearUsers();
       let I = "";
       const e = async () => {
-        this.taskQueue.clear([I]), await this.emitNotifyUpdateUsers();
+        console.log("\x1B[38;2;0;151;255m%c%s\x1B[0m", "color:#0097ff;", "------->Breathe: taskKey", I), this.taskQueue.clear([I]), await this.emitNotifyUpdateUsers();
         const N = await this.getUsers();
-        D(N);
+        this.taskQueue.setCondition("joinRoom", !0), D(N);
       }, u = async () => {
         try {
+          this.taskQueue.setCondition("joinRoom", !1);
           const { roomId: N, userId: A, callType: U } = this.options;
           this.cwsIns.sendMessage({
             event: this.isEarly ? "joinRoomEx" : "joinRoom",
@@ -8533,11 +8533,11 @@ class RoomCalls extends RoomPeer {
             this.createSession(), await this.updateUsers(J), e();
           });
         } catch (N) {
-          $(`加入房间失败: ${N.message || N || "服务器繁忙"}`);
+          this.taskQueue.setCondition("joinRoom", !0), $(`加入房间失败: ${N.message || N || "服务器繁忙"}`);
         }
       };
-      I = this.taskQueue.addTask(u, ["createWs"], { describe: "joinRoom", strict: !0 });
-    }));
+      I = this.taskQueue.addTask(u, ["createWs", "joinRoom"], { describe: "joinRoom", strict: !0 });
+    })));
     /**
      * 退出房间
      * @example quickvo.quitRoom()