sh-tools 1.2.5 → 1.2.6

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "sh-tools",
-  "version": "1.2.5",
+  "version": "1.2.6",
   "description": "基于xe-ajax和xe-utils二次封装",
   "main": "packages/index.js",
   "scripts": {
@@ -36,8 +36,6 @@
     "html-webpack-tags-plugin": "^3.0.2",
     "node-polyfill-webpack-plugin": "^2.0.1",
     "prettier": "^2.4.1",
-    "sass": "^1.32.7",
-    "sass-loader": "^12.0.0",
     "vue": "^3.3.4"
   }
 }

package/packages/api/smSecret/base64.js

@@ -1,168 +0,0 @@
-const isPlainObject = value => {
-	if (!value || typeof value !== 'object' || {}.toString.call(value) !== '[object Object]') {
-		return false
-	}
-	var proto = Object.getPrototypeOf(value)
-	if (proto === null) {
-		return true
-	}
-	var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor
-	return typeof Ctor === 'function' && Ctor instanceof Ctor && Function.prototype.toString.call(Ctor) === Function.prototype.toString.call(Object)
-}
-
-const base64 = {
-	_keyStr: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=',
-	encode: function (input) {
-		if (!input && input !== 0) {
-			return input
-		}
-		var output = ''
-		var chr1, chr2, chr3, enc1, enc2, enc3, enc4
-		var i = 0
-		input = this._utf8_encode(input)
-		while (i < input.length) {
-			chr1 = input.charCodeAt(i++)
-			chr2 = input.charCodeAt(i++)
-			chr3 = input.charCodeAt(i++)
-			enc1 = chr1 >> 2
-			enc2 = ((chr1 & 3) << 4) | (chr2 >> 4)
-			enc3 = ((chr2 & 15) << 2) | (chr3 >> 6)
-			enc4 = chr3 & 63
-			if (isNaN(chr2)) {
-				enc3 = enc4 = 64
-			} else if (isNaN(chr3)) {
-				enc4 = 64
-			}
-			output = output + this._keyStr.charAt(enc1) + this._keyStr.charAt(enc2) + this._keyStr.charAt(enc3) + this._keyStr.charAt(enc4)
-		}
-		return output
-	},
-	decode: function (input) {
-		if (!input && input !== 0) {
-			return input
-		}
-		var output = ''
-		var chr1, chr2, chr3
-		var enc1, enc2, enc3, enc4
-		var i = 0
-		input = input.replace(/[^A-Za-z0-9\+\/\=]/g, '')
-		while (i < input.length) {
-			enc1 = this._keyStr.indexOf(input.charAt(i++))
-			enc2 = this._keyStr.indexOf(input.charAt(i++))
-			enc3 = this._keyStr.indexOf(input.charAt(i++))
-			enc4 = this._keyStr.indexOf(input.charAt(i++))
-			chr1 = (enc1 << 2) | (enc2 >> 4)
-			chr2 = ((enc2 & 15) << 4) | (enc3 >> 2)
-			chr3 = ((enc3 & 3) << 6) | enc4
-			output = output + String.fromCharCode(chr1)
-			if (enc3 !== 64) {
-				output = output + String.fromCharCode(chr2)
-			}
-			if (enc4 !== 64) {
-				output = output + String.fromCharCode(chr3)
-			}
-		}
-		output = this._utf8_decode(output)
-		return output
-	},
-	_utf8_encode: function (string) {
-		if (!string && string !== 0) {
-			return string
-		}
-		string = String(string)
-		// console.log(string);
-		string = string.replace(/\r\n/g, '\n')
-		var utftext = ''
-		for (var n = 0; n < string.length; n++) {
-			var c = string.charCodeAt(n)
-			if (c < 128) {
-				utftext += String.fromCharCode(c)
-			} else if (c > 127 && c < 2048) {
-				utftext += String.fromCharCode((c >> 6) | 192)
-				utftext += String.fromCharCode((c & 63) | 128)
-			} else {
-				utftext += String.fromCharCode((c >> 12) | 224)
-				utftext += String.fromCharCode(((c >> 6) & 63) | 128)
-				utftext += String.fromCharCode((c & 63) | 128)
-			}
-		}
-		return utftext
-	},
-	_utf8_decode: function (utftext) {
-		if (!utftext && utftext !== 0) {
-			return utftext
-		}
-		var stringtext = ''
-		var i = 0
-		var c = 0
-		var c1 = 0
-		var c2 = 0
-		while (i < utftext.length) {
-			c = utftext.charCodeAt(i)
-			if (c < 128) {
-				stringtext += String.fromCharCode(c)
-				i++
-			} else if (c > 191 && c < 224) {
-				c2 = utftext.charCodeAt(i + 1)
-				stringtext += String.fromCharCode(((c & 31) << 6) | (c2 & 63))
-				i += 2
-			} else {
-				c2 = utftext.charCodeAt(i + 1)
-				let c3 = utftext.charCodeAt(i + 2)
-				stringtext += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63))
-				i += 3
-			}
-		}
-		return stringtext
-	},
-	/**
-	 * 递归条用对参数进行编码
-	 * @param parameters
-	 * @returns {*}
-	 */
-	encrypt: function (parameters, isRecursive) {
-		if (!parameters) {
-			return parameters
-		}
-		var curParam
-		if (isRecursive) {
-			// 递归调用
-			curParam = parameters
-		} else {
-			curParam = JSON.parse(JSON.stringify(parameters))
-		}
-		if (Array.isArray(curParam)) {
-			// 是数组
-			curParam.forEach((row, index) => {
-				if (!row && row !== 0) {
-					// 非空的不处理
-					return
-				}
-				if (isPlainObject(row) || Array.isArray(row)) {
-					// 对象和数组需要递归
-					this.encrypt(row, true)
-				} else {
-					// 其他直接加密
-					curParam[index] = this.encode(row)
-				}
-			})
-		} else if (isPlainObject(curParam)) {
-			// 对象
-			for (var key in curParam) {
-				if (!curParam[key] && curParam[key] !== 0) {
-					// 非空的不处理
-					continue
-				}
-				if (isPlainObject(curParam[key]) || Array.isArray(curParam[key])) {
-					// 对象和数组需要递归
-					this.encrypt(curParam[key], true)
-				} else {
-					curParam[key] = this.encode(curParam[key])
-				}
-			}
-		}
-		return curParam
-	}
-}
-
-export default base64

package/packages/api/smSecret/hex.js

@@ -1,92 +0,0 @@
-const hex = {
-	encode: function (b, pos, len) {
-		var hexCh = new Array(len * 2)
-		var hexCode = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F']
-		for (var i = pos, j = 0; i < len + pos; i++, j++) {
-			hexCh[j] = hexCode[(b[i] & 0xff) >> 4]
-			hexCh[++j] = hexCode[b[i] & 0x0f]
-		}
-		return hexCh.join('')
-	},
-	decode: function (hex) {
-		if (hex == null || hex === '') {
-			return null
-		}
-		if (hex.length % 2 !== 0) {
-			return null
-		}
-		var ascLen = hex.length / 2
-		var hexCh = this.toCharCodeArray(hex)
-		var asc = new Array(ascLen)
-		for (var i = 0; i < ascLen; i++) {
-			if (hexCh[2 * i] >= 0x30 && hexCh[2 * i] <= 0x39) {
-				asc[i] = (hexCh[2 * i] - 0x30) << 4
-			} else if (hexCh[2 * i] >= 0x41 && hexCh[2 * i] <= 0x46) {
-				// A-F : 0x41-0x46
-				asc[i] = (hexCh[2 * i] - 0x41 + 10) << 4
-			} else if (hexCh[2 * i] >= 0x61 && hexCh[2 * i] <= 0x66) {
-				// a-f  : 0x61-0x66
-				asc[i] = (hexCh[2 * i] - 0x61 + 10) << 4
-			} else {
-				return null
-			}
-			if (hexCh[2 * i + 1] >= 0x30 && hexCh[2 * i + 1] <= 0x39) {
-				asc[i] = asc[i] | (hexCh[2 * i + 1] - 0x30)
-			} else if (hexCh[2 * i + 1] >= 0x41 && hexCh[2 * i + 1] <= 0x46) {
-				asc[i] = asc[i] | (hexCh[2 * i + 1] - 0x41 + 10)
-			} else if (hexCh[2 * i + 1] >= 0x61 && hexCh[2 * i + 1] <= 0x66) {
-				asc[i] = asc[i] | (hexCh[2 * i + 1] - 0x61 + 10)
-			} else {
-				return null
-			}
-		}
-		return asc
-	},
-	utf8StrToHex: function (utf8Str) {
-		var ens = encodeURIComponent(utf8Str)
-		var es = unescape(ens)
-		var esLen = es.length
-		// Convert
-		var words = []
-		for (var i = 0; i < esLen; i++) {
-			words[i] = es.charCodeAt(i).toString(16)
-		}
-		return words.join('')
-	},
-	utf8StrToBytes: function (utf8Str) {
-		var ens = encodeURIComponent(utf8Str)
-		var es = unescape(ens)
-		var esLen = es.length
-		// Convert
-		var words = []
-		for (var i = 0; i < esLen; i++) {
-			words[i] = es.charCodeAt(i)
-		}
-		return words
-	},
-	hexToUtf8Str: function (utf8Str) {
-		var utf8Byte = this.decode(utf8Str)
-		var latin1Chars = []
-		for (var i = 0; i < utf8Byte.length; i++) {
-			latin1Chars.push(String.fromCharCode(utf8Byte[i]))
-		}
-		return decodeURIComponent(escape(latin1Chars.join('')))
-	},
-	bytesToUtf8Str: function (bytesArray) {
-		var utf8Byte = bytesArray
-		var latin1Chars = []
-		for (var i = 0; i < utf8Byte.length; i++) {
-			latin1Chars.push(String.fromCharCode(utf8Byte[i]))
-		}
-		return decodeURIComponent(escape(latin1Chars.join('')))
-	},
-	toCharCodeArray: function (chs) {
-		var chArr = new Array(chs.length)
-		for (var i = 0; i < chs.length; i++) {
-			chArr[i] = chs.charCodeAt(i)
-		}
-		return chArr
-	}
-}
-
-export default hex

package/packages/api/smSecret/index.js

@@ -1,13 +0,0 @@
-import hex from './hex'
-import SM3Digest from './sm3'
-
-function smSecret(inputtext) {
-	var dataBy = hex.utf8StrToBytes(inputtext)
-	var sm3 = new SM3Digest()
-	sm3.update(dataBy, 0, dataBy.length) // 数据很多的话，可以分多次update
-	var sm3Hash = sm3.doFinal() // 得到的数据是个byte数组
-	var sm3HashHex = hex.encode(sm3Hash, 0, sm3Hash.length) // 编码成16进制可见字符
-	return sm3HashHex
-}
-
-export default smSecret

package/packages/api/smSecret/sm3.js

@@ -1,276 +0,0 @@
-import { arrayCopy, longToByte, intToByte, intArrayToByteArray, byteToInt, byteArrayToIntArray } from './util'
-/*
- * sm3-1.0.js
- *
- * Copyright (c) 2019 RuXing Liang
- */
-/**
- * @name sm3-1.0.js
- * @author RuXing Liang
- * @version 1.0.0 (2019-04-16)
- */
-
-// 加密数据不能超过500M
-
-function SM3Digest() {
-	this.ivByte = new Array(
-		0x73,
-		0x80,
-		0x16,
-		0x6f,
-		0x49,
-		0x14,
-		0xb2,
-		0xb9,
-		0x17,
-		0x24,
-		0x42,
-		0xd7,
-		0xda,
-		0x8a,
-		0x06,
-		0x00,
-		0xa9,
-		0x6f,
-		0x30,
-		0xbc,
-		0x16,
-		0x31,
-		0x38,
-		0xaa,
-		0xe3,
-		0x8d,
-		0xee,
-		0x4d,
-		0xb0,
-		0xfb,
-		0x0e,
-		0x4e
-	)
-	this.iv = byteArrayToIntArray(this.ivByte)
-	this.tj = new Array(64)
-	this.BLOCK_BYTE_LEN = 64
-
-	this.vbuf = new Array(8)
-	// 数据缓冲区
-	this.dataBuf = new Array(64)
-	// 缓冲区长度
-	this.dataBufLen = 0
-	// 缓冲区总长度
-	this.totalLen = 0 // 事实上需要long,后续需改进
-
-	for (var i = 0; i < 64; i++) {
-		if (i <= 15) {
-			this.tj[i] = 0x79cc4519
-		} else {
-			this.tj[i] = 0x7a879d8a
-		}
-	}
-	arrayCopy(this.iv, 0, this.vbuf, 0, this.vbuf.length)
-}
-
-SM3Digest.prototype = {
-	ffj: function (x, y, z, i) {
-		var tmp
-		if (i <= 15) {
-			tmp = x ^ y ^ z
-		} else {
-			tmp = (x & y) | (x & z) | (y & z)
-		}
-
-		return tmp
-	},
-	ggj: function (x, y, z, i) {
-		var tmp = 0
-		if (i <= 15) {
-			tmp = x ^ y ^ z
-		} else {
-			tmp = (x & y) | (~x & z)
-		}
-
-		return tmp
-	},
-	p0: function (x) {
-		// 这里的公式是：对于一个二进制有n位的数字循环左移(循环右移)m位，
-		// 可以将此数字左移(无符号右移)m位的结果与此数字 无符号 右移(左移)n-m位的结果进行或操作。
-		return x ^ ((x << 9) | (x >>> (32 - 9))) ^ ((x << 17) | (x >>> (32 - 17)))
-	},
-	p1: function (x) {
-		// 这里的公式是：对于一个二进制有n位的数字循环左移(循环右移)m位，
-		// 可以将此数字左移(无符号右移)m位的结果与此数字 无符号 右移(左移)n-m位的结果进行或操作。
-		return x ^ ((x << 15) | (x >>> (32 - 15))) ^ ((x << 23) | (x >>> (32 - 23)))
-	},
-
-	/**
-	 * 循环左移
-	 */
-	cycleLeft: function (x, moveLen) {
-		return (x << moveLen) | (x >>> (32 - moveLen))
-	},
-
-	/**
-	 * 消息填充函数
-	 * @param data
-	 * @return
-	 */
-	padding: function (data) {
-		var k = 0
-		var len = data.length
-		var padding
-
-		k = 64 - ((len + 1 + 8) % 64)
-		if (k >= 64) {
-			k = 0
-		}
-		padding = new Array(k + 1 + len + 8)
-		padding[len] = 1 << 7
-
-		arrayCopy(data, 0, padding, 0, len)
-		arrayCopy(longToByte(this.totalLen << 3), 0, padding, len + k + 1, 8)
-
-		return padding
-	},
-
-	/**
-	 * 对数据进行分组迭代，每64个字节迭代一次
-	 * <br>1、对消息进行分组，由于是int类型，则每16个分一组，对每一组再调用{@link #expand}进行拓展
-	 * <br>2、使用上一轮的迭代结果V，调用{@link #cf}进行本轮迭代
-	 * <br>3、最后一轮迭代结果复制进缓冲区vbuf
-	 * @param message
-	 */
-	iterate: function (message) {
-		var len = message.length
-		var n = parseInt(len / 16)
-		var v, b
-		var ep
-
-		v = this.vbuf
-		b = new Array(16)
-
-		for (var i = 0; i < n; i++) {
-			arrayCopy(message, i * 16, b, 0, b.length)
-			ep = this.expand(b)
-			v = this.cf(v, ep[0], ep[1])
-		}
-		arrayCopy(v, 0, this.vbuf, 0, v.length)
-	},
-
-	/**
-	 * 消息数据拓展函数
-	 * @param b
-	 * @return
-	 */
-	expand: function (b) {
-		var w1 = new Array(68)
-		var w2 = new Array(64)
-
-		arrayCopy(b, 0, w1, 0, b.length)
-
-		for (let i = 16; i < w1.length; i++) {
-			w1[i] = this.p1(w1[i - 16] ^ w1[i - 9] ^ this.cycleLeft(w1[i - 3], 15)) ^ this.cycleLeft(w1[i - 13], 7) ^ w1[i - 6]
-		}
-
-		for (let i = 0; i < w2.length; i++) {
-			w2[i] = w1[i] ^ w1[i + 4]
-		}
-
-		return new Array(w1, w2)
-	},
-
-	/**
-	 * 迭代压缩函数
-	 *
-	 * @param v
-	 * @param w1
-	 * @param w2
-	 * @return
-	 */
-	cf: function (v, w1, w2) {
-		var result
-		var a, b, c, d, e, f, g, h, ss1, ss2, tt1, tt2
-		a = v[0]
-		b = v[1]
-		c = v[2]
-		d = v[3]
-		e = v[4]
-		f = v[5]
-		g = v[6]
-		h = v[7]
-
-		for (var i = 0; i < 64; i++) {
-			ss1 = this.cycleLeft(this.cycleLeft(a, 12) + e + this.cycleLeft(this.tj[i], i), 7)
-			ss2 = ss1 ^ this.cycleLeft(a, 12)
-			tt1 = this.ffj(a, b, c, i) + d + ss2 + w2[i]
-			tt2 = this.ggj(e, f, g, i) + h + ss1 + w1[i]
-			d = c
-			c = this.cycleLeft(b, 9)
-			b = a
-			a = tt1
-			h = g
-			g = this.cycleLeft(f, 19)
-			f = e
-			e = this.p0(tt2)
-		}
-
-		result = new Array(8)
-		result[0] = a ^ v[0]
-		result[1] = b ^ v[1]
-		result[2] = c ^ v[2]
-		result[3] = d ^ v[3]
-		result[4] = e ^ v[4]
-		result[5] = f ^ v[5]
-		result[6] = g ^ v[6]
-		result[7] = h ^ v[7]
-
-		return result
-	},
-
-	digest: function (data) {
-		var mac
-
-		var padding = this.padding(data)
-		var paddingInt = byteArrayToIntArray(padding)
-		this.iterate(paddingInt)
-		var macInt = this.vbuf
-		mac = intArrayToByteArray(macInt)
-		return mac
-	},
-
-	update: function (data, pos, len) {
-		var loop = parseInt((len + this.dataBufLen) / 64) // 向下取整
-		this.totalLen += len
-
-		if (len + this.dataBufLen < this.BLOCK_BYTE_LEN) {
-			arrayCopy(data, 0, this.dataBuf, this.dataBufLen, len)
-			this.dataBufLen = len + this.dataBufLen
-		} else {
-			var dataInt
-			arrayCopy(data, 0, this.dataBuf, this.dataBufLen, this.BLOCK_BYTE_LEN - this.dataBufLen)
-			dataInt = byteArrayToIntArray(this.dataBuf)
-			this.iterate(dataInt)
-			for (var i = 1; i < loop; i++) {
-				arrayCopy(data, i * this.BLOCK_BYTE_LEN - this.dataBufLen, this.dataBuf, 0, this.BLOCK_BYTE_LEN)
-				dataInt = byteArrayToIntArray(this.dataBuf)
-				this.iterate(dataInt)
-			}
-			arrayCopy(data, loop * this.BLOCK_BYTE_LEN - this.dataBufLen, this.dataBuf, 0, len - (loop * this.BLOCK_BYTE_LEN - this.dataBufLen))
-			this.dataBufLen = len - (loop * this.BLOCK_BYTE_LEN - this.dataBufLen)
-		}
-	},
-
-	doFinal: function () {
-		var mac
-		var finalData = new Array(this.dataBufLen)
-
-		arrayCopy(this.dataBuf, 0, finalData, 0, this.dataBufLen)
-		// 对不足64字节的数据进行填充
-		var paddingArr = this.padding(finalData)
-		var paddingInt = byteArrayToIntArray(paddingArr)
-		this.iterate(paddingInt)
-		var macInt = this.vbuf
-		mac = intArrayToByteArray(macInt)
-		return mac
-	}
-}
-
-export default SM3Digest

package/packages/api/smSecret/util.js

@@ -1,92 +0,0 @@
-/*
- *
- * 字节流转换工具js
- *
- */
-
-/*
- * 数组复制
- */
-export const arrayCopy = (src, pos1, dest, pos2, len) => {
-	var realLen = len
-	if (pos1 + len > src.length && pos2 + len <= dest.length) {
-		realLen = src.length - pos1
-	} else if (pos2 + len > dest.length && pos1 + len <= src.length) {
-		realLen = dest.length - pos2
-	} else if (pos1 + len <= src.length && pos2 + len <= dest.length) {
-		realLen = len
-	} else if (dest.length < src.length) {
-		realLen = dest.length - pos2
-	} else {
-		realLen = src.length - pos2
-	}
-
-	for (var i = 0; i < realLen; i++) {
-		dest[i + pos2] = src[i + pos1]
-	}
-}
-
-/*
- * 长整型转成字节，一个长整型为8字节
- * 返回：字节数组
- */
-export const longToByte = num => {
-	// TODO 这里目前只转换了低四字节，因为js没有长整型，得要封装
-	return new Array(0, 0, 0, 0, (num >> 24) & 0x000000ff, (num >> 16) & 0x000000ff, (num >> 8) & 0x000000ff, num & 0x000000ff)
-}
-
-/*
- * int数转成byte数组
- * 事实上只不过转成byte大小的数，实际占用空间还是4字节
- * 返回：字节数组
- */
-export const intToByte = num => {
-	return new Array((num >> 24) & 0x000000ff, (num >> 16) & 0x000000ff, (num >> 8) & 0x000000ff, num & 0x000000ff)
-}
-
-/*
- * int数组转成byte数组，一个int数值转成四个byte
- * 返回:byte数组
- */
-export const intArrayToByteArray = nums => {
-	var b = new Array(nums.length * 4)
-
-	for (var i = 0; i < nums.length; i++) {
-		arrayCopy(intToByte(nums[i]), 0, b, i * 4, 4)
-	}
-
-	return b
-}
-
-/*
- * byte数组转成int数值
- * 返回：int数值
- */
-export const byteToInt = (b, pos) => {
-	if (pos + 3 < b.length) {
-		return (b[pos] << 24) | (b[pos + 1] << 16) | (b[pos + 2] << 8) | b[pos + 3]
-	} else if (pos + 2 < b.length) {
-		return (b[pos + 1] << 16) | (b[pos + 2] << 8) | b[pos + 3]
-	} else if (pos + 1 < b.length) {
-		return (b[pos] << 8) | b[pos + 1]
-	} else {
-		return b[pos]
-	}
-}
-
-/*
- * byte数组转成int数组,每四个字节转成一个int数值
- *
- */
-export const byteArrayToIntArray = b => {
-	// var arrLen = b.length%4==0 ? b.length/4:b.length/4+1;
-	var arrLen = Math.ceil(b.length / 4) // 向上取整
-	var out = new Array(arrLen)
-	for (let i = 0; i < b.length; i++) {
-		b[i] = b[i] & 0xff // 避免负数造成影响
-	}
-	for (let i = 0; i < out.length; i++) {
-		out[i] = byteToInt(b, i * 4)
-	}
-	return out
-}