quickvo-sdk-js 0.4.3 → 0.4.5
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index.js +63 -63
- package/dist/index.umd.cjs +1 -1
- package/dist/room/RoomBase.d.ts +1 -1
- package/package.json +1 -1
package/dist/index.js
CHANGED
|
@@ -4,7 +4,7 @@ var Qt = (_) => {
|
|
|
4
4
|
};
|
|
5
5
|
var Yt = (_, q, k) => q in _ ? Vt(_, q, { enumerable: !0, configurable: !0, writable: !0, value: k }) : _[q] = k;
|
|
6
6
|
var H = (_, q, k) => Yt(_, typeof q != "symbol" ? q + "" : q, k), Gt = (_, q, k) => q.has(_) || Qt("Cannot " + k);
|
|
7
|
-
var G = (_, q, k) => (Gt(_, q, "read from private field"), k ? k.call(_) : q.get(_)), st = (_, q, k) => q.has(_) ? Qt("Cannot add the same private member more than once") : q instanceof WeakSet ? q.add(_) : q.set(_, k),
|
|
7
|
+
var G = (_, q, k) => (Gt(_, q, "read from private field"), k ? k.call(_) : q.get(_)), st = (_, q, k) => q.has(_) ? Qt("Cannot add the same private member more than once") : q instanceof WeakSet ? q.add(_) : q.set(_, k), bt = (_, q, k, D) => (Gt(_, q, "write to private field"), D ? D.call(_, k) : q.set(_, k), k);
|
|
8
8
|
const v$1 = (_, q = []) => {
|
|
9
9
|
const k = { ..._ }, D = Object.keys(k);
|
|
10
10
|
for (const $ of D)
|
|
@@ -6125,28 +6125,28 @@ var Deflate_1$1 = Deflate$1, deflate_2 = deflate$1, deflateRaw_1$1 = deflateRaw$
|
|
|
6125
6125
|
};
|
|
6126
6126
|
const BAD$1 = 16209, TYPE$1 = 16191;
|
|
6127
6127
|
var inffast = function _(q, k) {
|
|
6128
|
-
let D, $, I, e, u, N, A, U, L, P, Z, F, W, J, z, V, X, Y, et, at, tt, ct,
|
|
6129
|
-
const
|
|
6130
|
-
D = q.next_in,
|
|
6128
|
+
let D, $, I, e, u, N, A, U, L, P, Z, F, W, J, z, V, X, Y, et, at, tt, ct, rt, nt;
|
|
6129
|
+
const ot = q.state;
|
|
6130
|
+
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;
|
|
6131
6131
|
t:
|
|
6132
6132
|
do {
|
|
6133
|
-
F < 15 && (Z +=
|
|
6133
|
+
F < 15 && (Z += rt[D++] << F, F += 8, Z += rt[D++] << F, F += 8), X = W[Z & z];
|
|
6134
6134
|
e:
|
|
6135
6135
|
for (; ; ) {
|
|
6136
6136
|
if (Y = X >>> 24, Z >>>= Y, F -= Y, Y = X >>> 16 & 255, Y === 0)
|
|
6137
6137
|
nt[I++] = X & 65535;
|
|
6138
6138
|
else if (Y & 16) {
|
|
6139
|
-
et = X & 65535, Y &= 15, Y && (F < Y && (Z +=
|
|
6139
|
+
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];
|
|
6140
6140
|
i:
|
|
6141
6141
|
for (; ; ) {
|
|
6142
6142
|
if (Y = X >>> 24, Z >>>= Y, F -= Y, Y = X >>> 16 & 255, Y & 16) {
|
|
6143
|
-
if (at = X & 65535, Y &= 15, F < Y && (Z +=
|
|
6144
|
-
q.msg = "invalid distance too far back",
|
|
6143
|
+
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) {
|
|
6144
|
+
q.msg = "invalid distance too far back", ot.mode = BAD$1;
|
|
6145
6145
|
break t;
|
|
6146
6146
|
}
|
|
6147
6147
|
if (Z >>>= Y, F -= Y, Y = I - e, at > Y) {
|
|
6148
|
-
if (Y = at - Y, Y > U &&
|
|
6149
|
-
q.msg = "invalid distance too far back",
|
|
6148
|
+
if (Y = at - Y, Y > U && ot.sane) {
|
|
6149
|
+
q.msg = "invalid distance too far back", ot.mode = BAD$1;
|
|
6150
6150
|
break t;
|
|
6151
6151
|
}
|
|
6152
6152
|
if (tt = 0, ct = P, L === 0) {
|
|
@@ -6192,7 +6192,7 @@ var inffast = function _(q, k) {
|
|
|
6192
6192
|
X = J[(X & 65535) + (Z & (1 << Y) - 1)];
|
|
6193
6193
|
continue i;
|
|
6194
6194
|
} else {
|
|
6195
|
-
q.msg = "invalid distance code",
|
|
6195
|
+
q.msg = "invalid distance code", ot.mode = BAD$1;
|
|
6196
6196
|
break t;
|
|
6197
6197
|
}
|
|
6198
6198
|
break;
|
|
@@ -6201,16 +6201,16 @@ var inffast = function _(q, k) {
|
|
|
6201
6201
|
X = W[(X & 65535) + (Z & (1 << Y) - 1)];
|
|
6202
6202
|
continue e;
|
|
6203
6203
|
} else if (Y & 32) {
|
|
6204
|
-
|
|
6204
|
+
ot.mode = TYPE$1;
|
|
6205
6205
|
break t;
|
|
6206
6206
|
} else {
|
|
6207
|
-
q.msg = "invalid literal/length code",
|
|
6207
|
+
q.msg = "invalid literal/length code", ot.mode = BAD$1;
|
|
6208
6208
|
break t;
|
|
6209
6209
|
}
|
|
6210
6210
|
break;
|
|
6211
6211
|
}
|
|
6212
6212
|
} while (D < $ && I < u);
|
|
6213
|
-
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),
|
|
6213
|
+
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;
|
|
6214
6214
|
};
|
|
6215
6215
|
const MAXBITS = 15, ENOUGH_LENS$1 = 852, ENOUGH_DISTS$1 = 592, CODES$1 = 0, LENS$1 = 1, DISTS$1 = 2, lbase = new Uint16Array([
|
|
6216
6216
|
/* Length codes 257..285 base */
|
|
@@ -6348,8 +6348,8 @@ const MAXBITS = 15, ENOUGH_LENS$1 = 852, ENOUGH_DISTS$1 = 592, CODES$1 = 0, LENS
|
|
|
6348
6348
|
64
|
|
6349
6349
|
]), inflate_table = (_, q, k, D, $, I, e, u) => {
|
|
6350
6350
|
const N = u.bits;
|
|
6351
|
-
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,
|
|
6352
|
-
const nt = new Uint16Array(MAXBITS + 1),
|
|
6351
|
+
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;
|
|
6352
|
+
const nt = new Uint16Array(MAXBITS + 1), ot = new Uint16Array(MAXBITS + 1);
|
|
6353
6353
|
let vt = null, Kt, It, Rt;
|
|
6354
6354
|
for (A = 0; A <= MAXBITS; A++)
|
|
6355
6355
|
nt[A] = 0;
|
|
@@ -6366,14 +6366,14 @@ const MAXBITS = 15, ENOUGH_LENS$1 = 852, ENOUGH_DISTS$1 = 592, CODES$1 = 0, LENS
|
|
|
6366
6366
|
return -1;
|
|
6367
6367
|
if (J > 0 && (_ === CODES$1 || P !== 1))
|
|
6368
6368
|
return -1;
|
|
6369
|
-
for (
|
|
6370
|
-
|
|
6369
|
+
for (ot[1] = 0, A = 1; A < MAXBITS; A++)
|
|
6370
|
+
ot[A + 1] = ot[A] + nt[A];
|
|
6371
6371
|
for (U = 0; U < D; U++)
|
|
6372
|
-
q[k + U] !== 0 && (e[
|
|
6373
|
-
if (_ === CODES$1 ? (ct = vt = e,
|
|
6372
|
+
q[k + U] !== 0 && (e[ot[q[k + U]]++] = U);
|
|
6373
|
+
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)
|
|
6374
6374
|
return 1;
|
|
6375
6375
|
for (; ; ) {
|
|
6376
|
-
Kt = A - W, e[U] + 1 <
|
|
6376
|
+
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;
|
|
6377
6377
|
do
|
|
6378
6378
|
Y -= X, $[tt + (V >> W) + Y] = Kt << 24 | It << 16 | Rt | 0;
|
|
6379
6379
|
while (Y !== 0);
|
|
@@ -6464,8 +6464,8 @@ const fixedtables = (_) => {
|
|
|
6464
6464
|
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;
|
|
6465
6465
|
}, inflate$2 = (_, q) => {
|
|
6466
6466
|
let k, D, $, I, e, u, N, A, U, L, P, Z, F, W, J = 0, z, V, X, Y, et, at, tt, ct;
|
|
6467
|
-
const
|
|
6468
|
-
let nt,
|
|
6467
|
+
const rt = new Uint8Array(4);
|
|
6468
|
+
let nt, ot;
|
|
6469
6469
|
const vt = (
|
|
6470
6470
|
/* permutation of code lengths */
|
|
6471
6471
|
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 = (_) => {
|
|
|
6487
6487
|
u--, A += D[I++] << U, U += 8;
|
|
6488
6488
|
}
|
|
6489
6489
|
if (k.wrap & 2 && A === 35615) {
|
|
6490
|
-
k.wbits === 0 && (k.wbits = 15), k.check = 0,
|
|
6490
|
+
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;
|
|
6491
6491
|
break;
|
|
6492
6492
|
}
|
|
6493
6493
|
if (k.head && (k.head.done = !1), !(k.wrap & 1) || /* check if zlib header allowed */
|
|
@@ -6519,7 +6519,7 @@ const fixedtables = (_) => {
|
|
|
6519
6519
|
_.msg = "unknown header flags set", k.mode = BAD;
|
|
6520
6520
|
break;
|
|
6521
6521
|
}
|
|
6522
|
-
k.head && (k.head.text = A >> 8 & 1), k.flags & 512 && k.wrap & 4 && (
|
|
6522
|
+
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;
|
|
6523
6523
|
/* falls through */
|
|
6524
6524
|
case TIME:
|
|
6525
6525
|
for (; U < 32; ) {
|
|
@@ -6527,7 +6527,7 @@ const fixedtables = (_) => {
|
|
|
6527
6527
|
break t;
|
|
6528
6528
|
u--, A += D[I++] << U, U += 8;
|
|
6529
6529
|
}
|
|
6530
|
-
k.head && (k.head.time = A), k.flags & 512 && k.wrap & 4 && (
|
|
6530
|
+
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;
|
|
6531
6531
|
/* falls through */
|
|
6532
6532
|
case OS:
|
|
6533
6533
|
for (; U < 16; ) {
|
|
@@ -6535,7 +6535,7 @@ const fixedtables = (_) => {
|
|
|
6535
6535
|
break t;
|
|
6536
6536
|
u--, A += D[I++] << U, U += 8;
|
|
6537
6537
|
}
|
|
6538
|
-
k.head && (k.head.xflags = A & 255, k.head.os = A >> 8), k.flags & 512 && k.wrap & 4 && (
|
|
6538
|
+
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;
|
|
6539
6539
|
/* falls through */
|
|
6540
6540
|
case EXLEN:
|
|
6541
6541
|
if (k.flags & 1024) {
|
|
@@ -6544,7 +6544,7 @@ const fixedtables = (_) => {
|
|
|
6544
6544
|
break t;
|
|
6545
6545
|
u--, A += D[I++] << U, U += 8;
|
|
6546
6546
|
}
|
|
6547
|
-
k.length = A, k.head && (k.head.extra_len = A), k.flags & 512 && k.wrap & 4 && (
|
|
6547
|
+
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;
|
|
6548
6548
|
} else k.head && (k.head.extra = null);
|
|
6549
6549
|
k.mode = EXTRA;
|
|
6550
6550
|
/* falls through */
|
|
@@ -6713,7 +6713,7 @@ const fixedtables = (_) => {
|
|
|
6713
6713
|
A >>>= z, U -= z, k.lens[k.have++] = X;
|
|
6714
6714
|
else {
|
|
6715
6715
|
if (X === 16) {
|
|
6716
|
-
for (
|
|
6716
|
+
for (ot = z + 2; U < ot; ) {
|
|
6717
6717
|
if (u === 0)
|
|
6718
6718
|
break t;
|
|
6719
6719
|
u--, A += D[I++] << U, U += 8;
|
|
@@ -6724,14 +6724,14 @@ const fixedtables = (_) => {
|
|
|
6724
6724
|
}
|
|
6725
6725
|
tt = k.lens[k.have - 1], Z = 3 + (A & 3), A >>>= 2, U -= 2;
|
|
6726
6726
|
} else if (X === 17) {
|
|
6727
|
-
for (
|
|
6727
|
+
for (ot = z + 3; U < ot; ) {
|
|
6728
6728
|
if (u === 0)
|
|
6729
6729
|
break t;
|
|
6730
6730
|
u--, A += D[I++] << U, U += 8;
|
|
6731
6731
|
}
|
|
6732
6732
|
A >>>= z, U -= z, tt = 0, Z = 3 + (A & 7), A >>>= 3, U -= 3;
|
|
6733
6733
|
} else {
|
|
6734
|
-
for (
|
|
6734
|
+
for (ot = z + 7; U < ot; ) {
|
|
6735
6735
|
if (u === 0)
|
|
6736
6736
|
break t;
|
|
6737
6737
|
u--, A += D[I++] << U, U += 8;
|
|
@@ -6800,7 +6800,7 @@ const fixedtables = (_) => {
|
|
|
6800
6800
|
/* falls through */
|
|
6801
6801
|
case LENEXT:
|
|
6802
6802
|
if (k.extra) {
|
|
6803
|
-
for (
|
|
6803
|
+
for (ot = k.extra; U < ot; ) {
|
|
6804
6804
|
if (u === 0)
|
|
6805
6805
|
break t;
|
|
6806
6806
|
u--, A += D[I++] << U, U += 8;
|
|
@@ -6831,7 +6831,7 @@ const fixedtables = (_) => {
|
|
|
6831
6831
|
/* falls through */
|
|
6832
6832
|
case DISTEXT:
|
|
6833
6833
|
if (k.extra) {
|
|
6834
|
-
for (
|
|
6834
|
+
for (ot = k.extra; U < ot; ) {
|
|
6835
6835
|
if (u === 0)
|
|
6836
6836
|
break t;
|
|
6837
6837
|
u--, A += D[I++] << U, U += 8;
|
|
@@ -7262,9 +7262,9 @@ class CallsWebSocket {
|
|
|
7262
7262
|
* @returns
|
|
7263
7263
|
*/
|
|
7264
7264
|
H(this, "connect", async (q = "") => new Promise(async (k) => {
|
|
7265
|
-
q &&
|
|
7265
|
+
q && bt(this, gt, q), G(this, yt) && (await G(this, yt).close(), this.state = "closed");
|
|
7266
7266
|
const D = `${G(this, lt).url}?s=${G(this, gt)}&t=${Date.now()}`;
|
|
7267
|
-
|
|
7267
|
+
bt(this, yt, new M({
|
|
7268
7268
|
...G(this, lt),
|
|
7269
7269
|
url: D,
|
|
7270
7270
|
binaryType: "arraybuffer",
|
|
@@ -7286,7 +7286,7 @@ class CallsWebSocket {
|
|
|
7286
7286
|
const { destructionTimer: $ } = G(this, ft)[D];
|
|
7287
7287
|
clearTimeout($);
|
|
7288
7288
|
}
|
|
7289
|
-
|
|
7289
|
+
bt(this, ft, {}), await ((k = G(this, yt)) == null ? void 0 : k.close()), bt(this, yt, void 0), this.state = "closed";
|
|
7290
7290
|
});
|
|
7291
7291
|
/**
|
|
7292
7292
|
* 发送消息
|
|
@@ -7338,7 +7338,7 @@ class CallsWebSocket {
|
|
|
7338
7338
|
*/
|
|
7339
7339
|
H(this, "removeNotify", (q = []) => {
|
|
7340
7340
|
if (q.length === 0)
|
|
7341
|
-
|
|
7341
|
+
bt(this, dt, {});
|
|
7342
7342
|
else {
|
|
7343
7343
|
const k = Object.keys(G(this, dt));
|
|
7344
7344
|
for (const D of k)
|
|
@@ -7346,7 +7346,7 @@ class CallsWebSocket {
|
|
|
7346
7346
|
}
|
|
7347
7347
|
G(this, lt).debug && console.log("\x1B[38;2;0;151;255m%c%s\x1B[0m", "color:#0097ff;", "------->quickvo: 移除广播事件", G(this, dt));
|
|
7348
7348
|
});
|
|
7349
|
-
|
|
7349
|
+
bt(this, lt, { ...G(this, lt), ...q });
|
|
7350
7350
|
}
|
|
7351
7351
|
}
|
|
7352
7352
|
yt = new WeakMap(), lt = new WeakMap(), gt = new WeakMap(), ft = new WeakMap(), dt = new WeakMap(), Et = new WeakMap(), xt = new WeakMap(), Nt = new WeakMap(), At = new WeakMap(), $t = new WeakMap(), qt = new WeakMap(), Dt = new WeakMap(), Ct = new WeakMap();
|
|
@@ -7430,7 +7430,7 @@ class RoomBase {
|
|
|
7430
7430
|
// 是否禁止通知
|
|
7431
7431
|
H(this, "isEarly", !1);
|
|
7432
7432
|
// 是否提前建连
|
|
7433
|
-
H(this, "taskQueue", new K(["createWs", "createSession", "ice", "createTrack", "subscribe", "closeTrack", "publish"]));
|
|
7433
|
+
H(this, "taskQueue", new K(["createWs", "createSession", "ice", "joinRoom", "createTrack", "subscribe", "closeTrack", "publish"]));
|
|
7434
7434
|
// 条件队列
|
|
7435
7435
|
H(this, "roomState", "ready");
|
|
7436
7436
|
// 房间状态
|
|
@@ -7450,7 +7450,7 @@ class RoomBase {
|
|
|
7450
7450
|
screenSharing_audio: ""
|
|
7451
7451
|
});
|
|
7452
7452
|
H(this, "initAsyncQueue", () => {
|
|
7453
|
-
this.taskQueue.clear(), this.taskQueue.setCondition("createTrack", !0), this.taskQueue.setCondition("closeTrack", !0), this.taskQueue.setCondition("subscribe", !0), this.taskQueue.setCondition("publish", !0);
|
|
7453
|
+
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);
|
|
7454
7454
|
});
|
|
7455
7455
|
/**
|
|
7456
7456
|
* 获取房间信息
|
|
@@ -7577,7 +7577,7 @@ const createMutedAudioStream = () => {
|
|
|
7577
7577
|
screenSharing_audio: createMutedAudioStream()
|
|
7578
7578
|
// 假音频流
|
|
7579
7579
|
};
|
|
7580
|
-
var _t,
|
|
7580
|
+
var _t, kt, ht, Tt, Ut, Mt, Pt, St, Bt;
|
|
7581
7581
|
class RoomMedias extends RoomBase {
|
|
7582
7582
|
// 假媒体流
|
|
7583
7583
|
constructor() {
|
|
@@ -7586,7 +7586,7 @@ class RoomMedias extends RoomBase {
|
|
|
7586
7586
|
// 可用媒体设备列表
|
|
7587
7587
|
st(this, _t, /* @__PURE__ */ new Map());
|
|
7588
7588
|
// 媒体流设备管理
|
|
7589
|
-
st(this,
|
|
7589
|
+
st(this, kt, /* @__PURE__ */ new Map());
|
|
7590
7590
|
// 媒体轨道参数管理
|
|
7591
7591
|
st(this, ht, /* @__PURE__ */ new Map());
|
|
7592
7592
|
// 媒体流上下文
|
|
@@ -7602,7 +7602,7 @@ class RoomMedias extends RoomBase {
|
|
|
7602
7602
|
* 初始化媒体参数
|
|
7603
7603
|
*/
|
|
7604
7604
|
st(this, Mt, () => {
|
|
7605
|
-
G(this,
|
|
7605
|
+
G(this, kt).set("microphoneCamera_audio", {}), G(this, kt).set("microphoneCamera_video", { width: { ideal: 1920 }, height: { ideal: 1080 }, frameRate: { min: 10, ideal: 30 } }), G(this, kt).set("screenSharing_video", { width: { ideal: 1920 }, height: { ideal: 1080 }, frameRate: { min: 10, ideal: 30 } }), G(this, kt).set("screenSharing_audio", {});
|
|
7606
7606
|
});
|
|
7607
7607
|
/**
|
|
7608
7608
|
* 初始化媒体设备类型
|
|
@@ -7710,13 +7710,13 @@ class RoomMedias extends RoomBase {
|
|
|
7710
7710
|
const k = G(this, ht).values();
|
|
7711
7711
|
for (const D of k)
|
|
7712
7712
|
D.stop();
|
|
7713
|
-
|
|
7713
|
+
bt(this, ht, /* @__PURE__ */ new Map());
|
|
7714
7714
|
});
|
|
7715
7715
|
/**
|
|
7716
7716
|
* 设置轨道媒体参数
|
|
7717
7717
|
*/
|
|
7718
7718
|
H(this, "setMediaTrackConstraints", async (k, D) => {
|
|
7719
|
-
G(this,
|
|
7719
|
+
G(this, kt).set(k, D);
|
|
7720
7720
|
const I = this.getUserStream(this.options.userId, k).getTracks();
|
|
7721
7721
|
if (I.length !== 0)
|
|
7722
7722
|
for (const e of I) {
|
|
@@ -7728,7 +7728,7 @@ class RoomMedias extends RoomBase {
|
|
|
7728
7728
|
* 初始化本地流
|
|
7729
7729
|
*/
|
|
7730
7730
|
H(this, "initLocalStream", async (k) => {
|
|
7731
|
-
const { userId: D } = this.options, $ = G(this,
|
|
7731
|
+
const { userId: D } = this.options, $ = G(this, kt).get(k);
|
|
7732
7732
|
switch (k) {
|
|
7733
7733
|
// 麦克风
|
|
7734
7734
|
case "microphoneCamera_audio":
|
|
@@ -7847,7 +7847,7 @@ class RoomMedias extends RoomBase {
|
|
|
7847
7847
|
G(this, Bt).call(this), G(this, Pt).call(this), G(this, Mt).call(this), G(this, Ut).call(this);
|
|
7848
7848
|
}
|
|
7849
7849
|
}
|
|
7850
|
-
_t = new WeakMap(),
|
|
7850
|
+
_t = new WeakMap(), kt = new WeakMap(), ht = new WeakMap(), Tt = new WeakMap(), Ut = new WeakMap(), Mt = new WeakMap(), Pt = new WeakMap(), St = new WeakMap(), Bt = new WeakMap();
|
|
7851
7851
|
class RoomUsers extends RoomMedias {
|
|
7852
7852
|
constructor() {
|
|
7853
7853
|
super();
|
|
@@ -8414,23 +8414,23 @@ class RoomPeer extends RoomUsers {
|
|
|
8414
8414
|
}
|
|
8415
8415
|
this.reports = I;
|
|
8416
8416
|
for (const et of this.reports) {
|
|
8417
|
-
const { bytesReceived: at, bytesSent: tt, packetsSent: ct, packetsLost:
|
|
8418
|
-
at && (e = at), tt && (u = tt), ct && (U += ct),
|
|
8417
|
+
const { bytesReceived: at, bytesSent: tt, packetsSent: ct, packetsLost: rt, jitter: nt, roundTripTime: ot } = et;
|
|
8418
|
+
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));
|
|
8419
8419
|
}
|
|
8420
8420
|
Z.sort().reverse(), P.sort().reverse();
|
|
8421
8421
|
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 };
|
|
8422
8422
|
this.peerNetwork = X;
|
|
8423
8423
|
const Y = (et, at, tt) => {
|
|
8424
|
-
const ct = Number(et),
|
|
8425
|
-
let
|
|
8426
|
-
return ct < 0.03 &&
|
|
8424
|
+
const ct = Number(et), rt = Number(at), nt = Number(tt);
|
|
8425
|
+
let ot = "0";
|
|
8426
|
+
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);
|
|
8427
8427
|
};
|
|
8428
8428
|
{
|
|
8429
|
-
const et = Y(J, z, V), at = await this.getCaller(), { network: tt } = at, ct = { egress: et, ingress: et },
|
|
8430
|
-
if (await this.updateUserNetwork(this.options.userId, ct),
|
|
8429
|
+
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);
|
|
8430
|
+
if (await this.updateUserNetwork(this.options.userId, ct), rt) {
|
|
8431
8431
|
this.emitNotifyUpdateUsers();
|
|
8432
|
-
const { userId: nt, roomId:
|
|
8433
|
-
this.cwsIns.sendMessage({ event: "networkQualityChange", data: { ...ct, userId: nt, roomId:
|
|
8432
|
+
const { userId: nt, roomId: ot } = this.options;
|
|
8433
|
+
this.cwsIns.sendMessage({ event: "networkQualityChange", data: { ...ct, userId: nt, roomId: ot } }, !1);
|
|
8434
8434
|
}
|
|
8435
8435
|
}
|
|
8436
8436
|
} catch (k) {
|
|
@@ -8459,7 +8459,6 @@ class RoomCalls extends RoomPeer {
|
|
|
8459
8459
|
super();
|
|
8460
8460
|
// sdk服务版本
|
|
8461
8461
|
H(this, "sdk_service_version", "1.0.5");
|
|
8462
|
-
// createWsResolves = []
|
|
8463
8462
|
/**
|
|
8464
8463
|
* 设置本地流
|
|
8465
8464
|
* @param mediaType MediaType
|
|
@@ -8512,15 +8511,16 @@ class RoomCalls extends RoomPeer {
|
|
|
8512
8511
|
* @example quickvo.joinRoom({ userId: '', roomId: '', sdkToken: '', callType: '1' , newPublishAutoSubscribe: true })
|
|
8513
8512
|
* @returns Promise<boolean>
|
|
8514
8513
|
*/
|
|
8515
|
-
H(this, "joinRoom", async (k) => new Promise((D, $) => {
|
|
8516
|
-
this.
|
|
8514
|
+
H(this, "joinRoom", async (k) => (this.setOptions(k), await this.createWs(), new Promise((D, $) => {
|
|
8515
|
+
this.clearUsers();
|
|
8517
8516
|
let I = "";
|
|
8518
8517
|
const e = async () => {
|
|
8519
8518
|
this.taskQueue.clear([I]), await this.emitNotifyUpdateUsers();
|
|
8520
8519
|
const N = await this.getUsers();
|
|
8521
|
-
D(N);
|
|
8520
|
+
this.taskQueue.setCondition("joinRoom", !0), D(N);
|
|
8522
8521
|
}, u = async () => {
|
|
8523
8522
|
try {
|
|
8523
|
+
this.taskQueue.setCondition("joinRoom", !1);
|
|
8524
8524
|
const { roomId: N, userId: A, callType: U } = this.options;
|
|
8525
8525
|
this.cwsIns.sendMessage({
|
|
8526
8526
|
event: this.isEarly ? "joinRoomEx" : "joinRoom",
|
|
@@ -8533,11 +8533,11 @@ class RoomCalls extends RoomPeer {
|
|
|
8533
8533
|
this.createSession(), await this.updateUsers(J), e();
|
|
8534
8534
|
});
|
|
8535
8535
|
} catch (N) {
|
|
8536
|
-
$(`加入房间失败: ${N.message || N || "服务器繁忙"}`);
|
|
8536
|
+
this.taskQueue.setCondition("joinRoom", !0), $(`加入房间失败: ${N.message || N || "服务器繁忙"}`);
|
|
8537
8537
|
}
|
|
8538
8538
|
};
|
|
8539
|
-
I = this.taskQueue.addTask(u, ["createWs"], { describe: "joinRoom", strict: !0 });
|
|
8540
|
-
}));
|
|
8539
|
+
I = this.taskQueue.addTask(u, ["createWs", "joinRoom"], { describe: "joinRoom", strict: !0 });
|
|
8540
|
+
})));
|
|
8541
8541
|
/**
|
|
8542
8542
|
* 退出房间
|
|
8543
8543
|
* @example quickvo.quitRoom()
|