naive-ui 2.38.2 → 2.40.0

package/lib/qr-code/src/qrcodegen.js

@@ -1,3 +1,4 @@
+/* eslint-disable ts/no-namespace */
 /*
  * QR Code generator library (TypeScript)
  *
@@ -22,7 +23,6 @@
  */
 'use strict';
 Object.defineProperty(exports, "__esModule", { value: true });
-// eslint-disable-next-line @typescript-eslint/no-namespace
 var qrcodegen;
 (function (qrcodegen) {
     /* ---- QR Code symbol class ---- */
@@ -72,11 +72,11 @@ var qrcodegen;
         // between modes (such as alphanumeric and byte) to encode text in less space.
         // This is a mid-level API; the high-level API is encodeText() and encodeBinary().
         static encodeSegments(segs, ecl, minVersion = 1, maxVersion = 40, mask = -1, boostEcl = true) {
-            if (!(QrCode.MIN_VERSION <= minVersion &&
-                minVersion <= maxVersion &&
-                maxVersion <= QrCode.MAX_VERSION) ||
-                mask < -1 ||
-                mask > 7) {
+            if (!(QrCode.MIN_VERSION <= minVersion
+                && minVersion <= maxVersion
+                && maxVersion <= QrCode.MAX_VERSION)
+                || mask < -1
+                || mask > 7) {
                 throw new RangeError('Invalid value');
             }
             // Find the minimal version number to use
@@ -101,8 +101,8 @@ var qrcodegen;
                 QrCode.Ecc.HIGH
             ]) {
                 // From low to high
-                if (boostEcl &&
-                    dataUsedBits <= QrCode.getNumDataCodewords(version, newEcl) * 8) {
+                if (boostEcl
+                    && dataUsedBits <= QrCode.getNumDataCodewords(version, newEcl) * 8) {
                     ecl = newEcl;
                 }
             }
@@ -120,7 +120,7 @@ var qrcodegen;
             appendBits(0, Math.min(4, dataCapacityBits - bb.length), bb);
             appendBits(0, (8 - (bb.length % 8)) % 8, bb);
             // Pad with alternating bytes until data capacity is reached
-            for (let padByte = 0xec; bb.length < dataCapacityBits; padByte ^= 0xec ^ 0x11) {
+            for (let padByte = 0xEC; bb.length < dataCapacityBits; padByte ^= 0xEC ^ 0x11) {
                 appendBits(padByte, 8, bb);
             }
             // Pack bits into bytes in big endian
@@ -220,9 +220,9 @@ var qrcodegen;
             for (let i = 0; i < numAlign; i++) {
                 for (let j = 0; j < numAlign; j++) {
                     // Don't draw on the three finder corners
-                    if (!((i === 0 && j === 0) ||
-                        (i === 0 && j === numAlign - 1) ||
-                        (i === numAlign - 1 && j === 0))) {
+                    if (!((i === 0 && j === 0)
+                        || (i === 0 && j === numAlign - 1)
+                        || (i === numAlign - 1 && j === 0))) {
                         this.drawAlignmentPattern(alignPatPos[i], alignPatPos[j]);
                     }
                 }
@@ -269,7 +269,7 @@ var qrcodegen;
             // Calculate error correction code and pack bits
             let rem = this.version; // version is uint6, in the range [7, 40]
             for (let i = 0; i < 12; i++) {
-                rem = (rem << 1) ^ ((rem >>> 11) * 0x1f25);
+                rem = (rem << 1) ^ ((rem >>> 11) * 0x1F25);
             }
             const bits = (this.version << 12) | rem; // uint18
             // Draw two copies
@@ -352,8 +352,8 @@ var qrcodegen;
         // Draws the given sequence of 8-bit codewords (data and error correction) onto the entire
         // data area of this QR Code. Function modules need to be marked off before this is called.
         drawCodewords(data) {
-            if (data.length !==
-                Math.floor(QrCode.getNumRawDataModules(this.version) / 8)) {
+            if (data.length
+                !== Math.floor(QrCode.getNumRawDataModules(this.version) / 8)) {
                 throw new RangeError('Invalid argument');
             }
             let i = 0; // Bit index into the data
@@ -447,16 +447,16 @@ var qrcodegen;
                     else {
                         this.finderPenaltyAddHistory(runX, runHistory);
                         if (!runColor) {
-                            result +=
-                                this.finderPenaltyCountPatterns(runHistory) * QrCode.PENALTY_N3;
+                            result
+                                += this.finderPenaltyCountPatterns(runHistory) * QrCode.PENALTY_N3;
                         }
                         runColor = this.modules[y][x];
                         runX = 1;
                     }
                 }
-                result +=
-                    this.finderPenaltyTerminateAndCount(runColor, runX, runHistory) *
-                        QrCode.PENALTY_N3;
+                result
+                    += this.finderPenaltyTerminateAndCount(runColor, runX, runHistory)
+                        * QrCode.PENALTY_N3;
             }
             // Adjacent modules in column having same color, and finder-like patterns
             for (let x = 0; x < this.size; x++) {
@@ -476,24 +476,24 @@ var qrcodegen;
                     else {
                         this.finderPenaltyAddHistory(runY, runHistory);
                         if (!runColor) {
-                            result +=
-                                this.finderPenaltyCountPatterns(runHistory) * QrCode.PENALTY_N3;
+                            result
+                                += this.finderPenaltyCountPatterns(runHistory) * QrCode.PENALTY_N3;
                         }
                         runColor = this.modules[y][x];
                         runY = 1;
                     }
                 }
-                result +=
-                    this.finderPenaltyTerminateAndCount(runColor, runY, runHistory) *
-                        QrCode.PENALTY_N3;
+                result
+                    += this.finderPenaltyTerminateAndCount(runColor, runY, runHistory)
+                        * QrCode.PENALTY_N3;
             }
             // 2*2 blocks of modules having same color
             for (let y = 0; y < this.size - 1; y++) {
                 for (let x = 0; x < this.size - 1; x++) {
                     const color = this.modules[y][x];
-                    if (color === this.modules[y][x + 1] &&
-                        color === this.modules[y + 1][x] &&
-                        color === this.modules[y + 1][x + 1]) {
+                    if (color === this.modules[y][x + 1]
+                        && color === this.modules[y + 1][x]
+                        && color === this.modules[y + 1][x + 1]) {
                         result += QrCode.PENALTY_N2;
                     }
                 }
@@ -550,9 +550,9 @@ var qrcodegen;
         // QR Code of the given version number and error correction level, with remainder bits discarded.
         // This stateless pure function could be implemented as a (40*4)-cell lookup table.
         static getNumDataCodewords(ver, ecl) {
-            return (Math.floor(QrCode.getNumRawDataModules(ver) / 8) -
-                QrCode.ECC_CODEWORDS_PER_BLOCK[ecl.ordinal][ver] *
-                    QrCode.NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver]);
+            return (Math.floor(QrCode.getNumRawDataModules(ver) / 8)
+                - QrCode.ECC_CODEWORDS_PER_BLOCK[ecl.ordinal][ver]
+                    * QrCode.NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver]);
         }
         // Returns a Reed-Solomon ECC generator polynomial for the given degree. This could be
         // implemented as a lookup table over all possible parameter values, instead of as an algorithm.
@@ -585,10 +585,9 @@ var qrcodegen;
         }
         // Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.
         static reedSolomonComputeRemainder(data, divisor) {
-            const result = divisor.map((_) => 0);
+            const result = divisor.map(_ => 0);
             for (const b of data) {
                 // Polynomial division
-                // eslint-disable-next-line @typescript-eslint/non-nullable-type-assertion-style
                 const factor = b ^ result.shift();
                 result.push(0);
                 divisor.forEach((coef, i) => (result[i] ^= QrCode.reedSolomonMultiply(coef, factor)));
@@ -604,7 +603,7 @@ var qrcodegen;
             // Russian peasant multiplication
             let z = 0;
             for (let i = 7; i >= 0; i--) {
-                z = (z << 1) ^ ((z >>> 7) * 0x11d);
+                z = (z << 1) ^ ((z >>> 7) * 0x11D);
                 z ^= ((y >>> i) & 1) * x;
             }
             return z;
@@ -613,13 +612,13 @@ var qrcodegen;
         // returns either 0, 1, or 2. A helper function for getPenaltyScore().
         finderPenaltyCountPatterns(runHistory) {
             const n = runHistory[1];
-            const core = n > 0 &&
-                runHistory[2] === n &&
-                runHistory[3] === n * 3 &&
-                runHistory[4] === n &&
-                runHistory[5] === n;
-            return ((core && runHistory[0] >= n * 4 && runHistory[6] >= n ? 1 : 0) +
-                (core && runHistory[6] >= n * 4 && runHistory[0] >= n ? 1 : 0));
+            const core = n > 0
+                && runHistory[2] === n
+                && runHistory[3] === n * 3
+                && runHistory[4] === n
+                && runHistory[5] === n;
+            return ((core && runHistory[0] >= n * 4 && runHistory[6] >= n ? 1 : 0)
+                + (core && runHistory[6] >= n * 4 && runHistory[0] >= n ? 1 : 0));
         }
         // Must be called at the end of a line (row or column) of modules. A helper function for getPenaltyScore().
         finderPenaltyTerminateAndCount(currentRunColor, currentRunLength, runHistory) {
@@ -655,47 +654,352 @@ var qrcodegen;
         // Version: (note that index 0 is for padding, and is set to an illegal value)
         // 0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level
         [
-            -1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28,
-            30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30,
-            30, 30, 30, 30, 30
+            -1,
+            7,
+            10,
+            15,
+            20,
+            26,
+            18,
+            20,
+            24,
+            30,
+            18,
+            20,
+            24,
+            26,
+            30,
+            22,
+            24,
+            28,
+            30,
+            28,
+            28,
+            28,
+            28,
+            30,
+            30,
+            26,
+            28,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30
         ], // Low
         [
-            -1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28,
-            26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
-            28, 28, 28, 28, 28
+            -1,
+            10,
+            16,
+            26,
+            18,
+            24,
+            16,
+            18,
+            22,
+            22,
+            26,
+            30,
+            22,
+            22,
+            24,
+            24,
+            28,
+            28,
+            26,
+            26,
+            26,
+            26,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28,
+            28
         ], // Medium
         [
-            -1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28,
-            28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30,
-            30, 30, 30, 30, 30
+            -1,
+            13,
+            22,
+            18,
+            26,
+            18,
+            24,
+            18,
+            22,
+            20,
+            24,
+            28,
+            26,
+            24,
+            20,
+            30,
+            24,
+            28,
+            28,
+            26,
+            30,
+            28,
+            30,
+            30,
+            30,
+            30,
+            28,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30
         ], // Quartile
         [
-            -1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28,
-            28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,
-            30, 30, 30, 30, 30
+            -1,
+            17,
+            28,
+            22,
+            16,
+            22,
+            28,
+            26,
+            26,
+            24,
+            28,
+            24,
+            28,
+            22,
+            24,
+            24,
+            30,
+            28,
+            28,
+            26,
+            28,
+            30,
+            24,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30,
+            30
         ] // High
     ];
     QrCode.NUM_ERROR_CORRECTION_BLOCKS = [
         // Version: (note that index 0 is for padding, and is set to an illegal value)
         // 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level
         [
-            -1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9,
-            10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25
+            -1,
+            1,
+            1,
+            1,
+            1,
+            1,
+            2,
+            2,
+            2,
+            2,
+            4,
+            4,
+            4,
+            4,
+            4,
+            6,
+            6,
+            6,
+            6,
+            7,
+            8,
+            8,
+            9,
+            9,
+            10,
+            12,
+            12,
+            12,
+            13,
+            14,
+            15,
+            16,
+            17,
+            18,
+            19,
+            19,
+            20,
+            21,
+            22,
+            24,
+            25
         ], // Low
         [
-            -1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16,
-            17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45,
-            47, 49
+            -1,
+            1,
+            1,
+            1,
+            2,
+            2,
+            4,
+            4,
+            4,
+            5,
+            5,
+            5,
+            8,
+            9,
+            9,
+            10,
+            10,
+            11,
+            13,
+            14,
+            16,
+            17,
+            17,
+            18,
+            20,
+            21,
+            23,
+            25,
+            26,
+            28,
+            29,
+            31,
+            33,
+            35,
+            37,
+            38,
+            40,
+            43,
+            45,
+            47,
+            49
         ], // Medium
         [
-            -1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20,
-            23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62,
-            65, 68
+            -1,
+            1,
+            1,
+            2,
+            2,
+            4,
+            4,
+            6,
+            6,
+            8,
+            8,
+            8,
+            10,
+            12,
+            16,
+            12,
+            17,
+            16,
+            18,
+            21,
+            20,
+            23,
+            23,
+            25,
+            27,
+            29,
+            34,
+            34,
+            35,
+            38,
+            40,
+            43,
+            45,
+            48,
+            51,
+            53,
+            56,
+            59,
+            62,
+            65,
+            68
         ], // Quartile
         [
-            -1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25,
-            25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70,
-            74, 77, 81
+            -1,
+            1,
+            1,
+            2,
+            4,
+            4,
+            4,
+            5,
+            6,
+            8,
+            8,
+            11,
+            11,
+            16,
+            16,
+            18,
+            16,
+            19,
+            21,
+            25,
+            25,
+            25,
+            34,
+            30,
+            32,
+            35,
+            37,
+            40,
+            42,
+            45,
+            48,
+            51,
+            54,
+            57,
+            60,
+            63,
+            66,
+            70,
+            74,
+            77,
+            81
         ] // High
     ];
     qrcodegen.QrCode = QrCode;
@@ -747,7 +1051,7 @@ var qrcodegen;
             for (let i = 0; i < digits.length;) {
                 // Consume up to 3 digits per iteration
                 const n = Math.min(digits.length - i, 3);
-                appendBits(parseInt(digits.substr(i, n), 10), n * 3 + 1, bb);
+                appendBits(Number.parseInt(digits.substr(i, n), 10), n * 3 + 1, bb);
                 i += n;
             }
             return new QrSegment(QrSegment.Mode.NUMERIC, digits.length, bb);
@@ -872,7 +1176,7 @@ var qrcodegen;
                     result.push(str.charCodeAt(i));
                 }
                 else {
-                    result.push(parseInt(str.substr(i + 1, 2), 16));
+                    result.push(Number.parseInt(str.substr(i + 1, 2), 16));
                     i += 2;
                 }
             }
@@ -890,7 +1194,6 @@ var qrcodegen;
     qrcodegen.QrSegment = QrSegment;
 })(qrcodegen || (qrcodegen = {}));
 /* ---- Public helper enumeration ---- */
-// eslint-disable-next-line @typescript-eslint/no-namespace
 (function (qrcodegen) {
     var QrCode;
     (function (QrCode) {
@@ -917,7 +1220,6 @@ var qrcodegen;
     })(QrCode = qrcodegen.QrCode || (qrcodegen.QrCode = {}));
 })(qrcodegen || (qrcodegen = {}));
 /* ---- Public helper enumeration ---- */
-// eslint-disable-next-line @typescript-eslint/no-namespace
 (function (qrcodegen) {
     var QrSegment;
     (function (QrSegment) {

package/lib/qr-code/styles/dark.d.ts

@@ -1,3 +1,3 @@
-import { type QrCodeTheme } from './light';
+import type { QrCodeTheme } from './light';
 declare const qrcodeDark: QrCodeTheme;
 export default qrcodeDark;

package/lib/qr-code/styles/light.d.ts

@@ -1,6 +1,6 @@
 import type { ThemeCommonVars } from '../../_styles/common';
-import { type Theme } from '../../_mixins';
-declare const self: (vars: ThemeCommonVars) => {
+import type { Theme } from '../../_mixins';
+declare function self(vars: ThemeCommonVars): {
     borderRadius: string;
 };
 export type QrCodeThemeVars = ReturnType<typeof self>;

package/lib/qr-code/styles/light.js

@@ -1,11 +1,11 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 const common_1 = require("../../_styles/common");
-const self = (vars) => {
+function self(vars) {
     return {
         borderRadius: vars.borderRadius
     };
-};
+}
 const themeLight = {
     name: 'QrCode',
     common: common_1.commonLight,

package/lib/radio/src/Radio.d.ts

@@ -16,8 +16,8 @@ export declare const radioProps: {
     };
     readonly label: StringConstructor;
     readonly size: import("vue").PropType<"small" | "medium" | "large">;
-    readonly onUpdateChecked: import("vue").PropType<import("../../_utils").MaybeArray<(value: boolean) => void> | undefined>;
-    readonly 'onUpdate:checked': import("vue").PropType<import("../../_utils").MaybeArray<(value: boolean) => void> | undefined>;
+    readonly onUpdateChecked: import("vue").PropType<undefined | import("../../_utils").MaybeArray<(value: boolean) => void>>;
+    readonly 'onUpdate:checked': import("vue").PropType<undefined | import("../../_utils").MaybeArray<(value: boolean) => void>>;
     readonly checkedValue: {
         readonly type: import("vue").PropType<boolean | undefined>;
         readonly default: undefined;
@@ -158,8 +158,8 @@ declare const _default: import("vue").DefineComponent<{
     };
     readonly label: StringConstructor;
     readonly size: import("vue").PropType<"small" | "medium" | "large">;
-    readonly onUpdateChecked: import("vue").PropType<import("../../_utils").MaybeArray<(value: boolean) => void> | undefined>;
-    readonly 'onUpdate:checked': import("vue").PropType<import("../../_utils").MaybeArray<(value: boolean) => void> | undefined>;
+    readonly onUpdateChecked: import("vue").PropType<undefined | import("../../_utils").MaybeArray<(value: boolean) => void>>;
+    readonly 'onUpdate:checked': import("vue").PropType<undefined | import("../../_utils").MaybeArray<(value: boolean) => void>>;
     readonly checkedValue: {
         readonly type: import("vue").PropType<boolean | undefined>;
         readonly default: undefined;
@@ -322,8 +322,8 @@ declare const _default: import("vue").DefineComponent<{
     };
     readonly label: StringConstructor;
     readonly size: import("vue").PropType<"small" | "medium" | "large">;
-    readonly onUpdateChecked: import("vue").PropType<import("../../_utils").MaybeArray<(value: boolean) => void> | undefined>;
-    readonly 'onUpdate:checked': import("vue").PropType<import("../../_utils").MaybeArray<(value: boolean) => void> | undefined>;
+    readonly onUpdateChecked: import("vue").PropType<undefined | import("../../_utils").MaybeArray<(value: boolean) => void>>;
+    readonly 'onUpdate:checked': import("vue").PropType<undefined | import("../../_utils").MaybeArray<(value: boolean) => void>>;
     readonly checkedValue: {
         readonly type: import("vue").PropType<boolean | undefined>;
         readonly default: undefined;