var t = t || function(t, e) {
var r = {}, i = r.lib = {}, n = function() {}, s = i.Base = {
extend: function(t) {
n.prototype = this;
var e = new n();
return t && e.mixIn(t), e.hasOwnProperty("init") || (e.init = function() {
e.$super.init.apply(this, arguments);
}), e.init.prototype = e, e.$super = this, e;
},
create: function() {
var t = this.extend();
return t.init.apply(t, arguments), t;
},
init: function() {},
mixIn: function(t) {
for (var e in t) t.hasOwnProperty(e) && (this[e] = t[e]);
t.hasOwnProperty("toString") && (this.toString = t.toString);
},
clone: function() {
return this.init.prototype.extend(this);
}
}, o = i.WordArray = s.extend({
init: function(t, e) {
t = this.words = t || [], this.sigBytes = void 0 != e ? e : 4 * t.length;
},
toString: function(t) {
return (t || a).stringify(this);
},
concat: function(t) {
var e = this.words, r = t.words, i = this.sigBytes;
if (t = t.sigBytes, this.clamp(), i % 4) for (var n = 0; n < t; n++) e[i + n >>> 2] |= (r[n >>> 2] >>> 24 - n % 4 * 8 & 255) << 24 - (i + n) % 4 * 8; else if (65535 < r.length) for (n = 0; n < t; n += 4) e[i + n >>> 2] = r[n >>> 2]; else e.push.apply(e, r);
return this.sigBytes += t, this;
},
clamp: function() {
var e = this.words, r = this.sigBytes;
e[r >>> 2] &= 4294967295 << 32 - r % 4 * 8, e.length = t.ceil(r / 4);
},
clone: function() {
var t = s.clone.call(this);
return t.words = this.words.slice(0), t;
},
random: function(e) {
for (var r = [], i = 0; i < e; i += 4) r.push(4294967296 * t.random() | 0);
return new o.init(r, e);
}
}), c = r.enc = {}, a = c.Hex = {
stringify: function(t) {
var e = t.words;
t = t.sigBytes;
for (var r = [], i = 0; i < t; i++) {
var n = e[i >>> 2] >>> 24 - i % 4 * 8 & 255;
r.push((n >>> 4).toString(16)), r.push((15 & n).toString(16));
}
return r.join("");
},
parse: function(t) {
for (var e = t.length, r = [], i = 0; i < e; i += 2) r[i >>> 3] |= parseInt(t.substr(i, 2), 16) << 24 - i % 8 * 4;
return new o.init(r, e / 2);
}
}, f = c.Latin1 = {
stringify: function(t) {
var e = t.words;
t = t.sigBytes;
for (var r = [], i = 0; i < t; i++) r.push(String.fromCharCode(e[i >>> 2] >>> 24 - i % 4 * 8 & 255));
return r.join("");
},
parse: function(t) {
for (var e = t.length, r = [], i = 0; i < e; i++) r[i >>> 2] |= (255 & t.charCodeAt(i)) << 24 - i % 4 * 8;
return new o.init(r, e);
}
}, h = c.Utf8 = {
stringify: function(t) {
try {
return decodeURIComponent(escape(f.stringify(t)));
} catch (t) {
throw Error("Malformed UTF-8 data");
}
},
parse: function(t) {
return f.parse(unescape(encodeURIComponent(t)));
}
}, u = i.BufferedBlockAlgorithm = s.extend({
reset: function() {
this._data = new o.init(), this._nDataBytes = 0;
},
_append: function(t) {
"string" == typeof t && (t = h.parse(t)), this._data.concat(t), this._nDataBytes += t.sigBytes;
},
_process: function(e) {
var r = this._data, i = r.words, n = r.sigBytes, s = this.blockSize, c = n / (4 * s);
if (e = (c = e ? t.ceil(c) : t.max((0 | c) - this._minBufferSize, 0)) * s, n = t.min(4 * e, n),
e) {
for (var a = 0; a < e; a += s) this._doProcessBlock(i, a);
a = i.splice(0, e), r.sigBytes -= n;
}
return new o.init(a, n);
},
clone: function() {
var t = s.clone.call(this);
return t._data = this._data.clone(), t;
},
_minBufferSize: 0
});
i.Hasher = u.extend({
cfg: s.extend(),
init: function(t) {
this.cfg = this.cfg.extend(t), this.reset();
},
reset: function() {
u.reset.call(this), this._doReset();
},
update: function(t) {
return this._append(t), this._process(), this;
},
finalize: function(t) {
return t && this._append(t), this._doFinalize();
},
blockSize: 16,
_createHelper: function(t) {
return function(e, r) {
return new t.init(r).finalize(e);
};
},
_createHmacHelper: function(t) {
return function(e, r) {
return new p.HMAC.init(t, r).finalize(e);
};
}
});
var p = r.algo = {};
return r;
}(Math);
!function() {
var e = t, r = e.lib.WordArray;
e.enc.Base64 = {
stringify: function(t) {
var e = t.words, r = t.sigBytes, i = this._map;
t.clamp(), t = [];
for (var n = 0; n < r; n += 3) for (var s = (e[n >>> 2] >>> 24 - n % 4 * 8 & 255) << 16 | (e[n + 1 >>> 2] >>> 24 - (n + 1) % 4 * 8 & 255) << 8 | e[n + 2 >>> 2] >>> 24 - (n + 2) % 4 * 8 & 255, o = 0; 4 > o && n + .75 * o < r; o++) t.push(i.charAt(s >>> 6 * (3 - o) & 63));
if (e = i.charAt(64)) for (;t.length % 4; ) t.push(e);
return t.join("");
},
parse: function(t) {
var e = t.length, i = this._map;
(n = i.charAt(64)) && -1 != (n = t.indexOf(n)) && (e = n);
for (var n = [], s = 0, o = 0; o < e; o++) if (o % 4) {
var c = i.indexOf(t.charAt(o - 1)) << o % 4 * 2, a = i.indexOf(t.charAt(o)) >>> 6 - o % 4 * 2;
n[s >>> 2] |= (c | a) << 24 - s % 4 * 8, s++;
}
return r.create(n, s);
},
_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
};
}(), function(e) {
function r(t, e, r, i, n, s, o) {
return ((t = t + (e & r | ~e & i) + n + o) << s | t >>> 32 - s) + e;
}
function i(t, e, r, i, n, s, o) {
return ((t = t + (e & i | r & ~i) + n + o) << s | t >>> 32 - s) + e;
}
function n(t, e, r, i, n, s, o) {
return ((t = t + (e ^ r ^ i) + n + o) << s | t >>> 32 - s) + e;
}
function s(t, e, r, i, n, s, o) {
return ((t = t + (r ^ (e | ~i)) + n + o) << s | t >>> 32 - s) + e;
}
for (var o = t, c = (f = o.lib).WordArray, a = f.Hasher, f = o.algo, h = [], u = 0; 64 > u; u++) h[u] = 4294967296 * e.abs(e.sin(u + 1)) | 0;
f = f.MD5 = a.extend({
_doReset: function() {
this._hash = new c.init([ 1732584193, 4023233417, 2562383102, 271733878 ]);
},
_doProcessBlock: function(t, e) {
for (o = 0; 16 > o; o++) a = t[c = e + o], t[c] = 16711935 & (a << 8 | a >>> 24) | 4278255360 & (a << 24 | a >>> 8);
var o = this._hash.words, c = t[e + 0], a = t[e + 1], f = t[e + 2], u = t[e + 3], p = t[e + 4], d = t[e + 5], l = t[e + 6], y = t[e + 7], _ = t[e + 8], g = t[e + 9], v = t[e + 10], B = t[e + 11], m = t[e + 12], x = t[e + 13], k = t[e + 14], S = t[e + 15], z = o[0], w = o[1], C = o[2], E = o[3], w = s(w = s(w = s(w = s(w = n(w = n(w = n(w = n(w = i(w = i(w = i(w = i(w = r(w = r(w = r(w = r(w, C = r(C, E = r(E, z = r(z, w, C, E, c, 7, h[0]), w, C, a, 12, h[1]), z, w, f, 17, h[2]), E, z, u, 22, h[3]), C = r(C, E = r(E, z = r(z, w, C, E, p, 7, h[4]), w, C, d, 12, h[5]), z, w, l, 17, h[6]), E, z, y, 22, h[7]), C = r(C, E = r(E, z = r(z, w, C, E, _, 7, h[8]), w, C, g, 12, h[9]), z, w, v, 17, h[10]), E, z, B, 22, h[11]), C = r(C, E = r(E, z = r(z, w, C, E, m, 7, h[12]), w, C, x, 12, h[13]), z, w,
猫狗动物声音模拟器微信小程序源码带流量主 （145个子文件） 
02add20b581be471b8d17f887b8e8337070546 194B 037e020e1fc310b5c63c81a916015c3d1d77af 2KB 057f60dd0e89b9fb43c573151e7f93a47767df 135B 0bcab314b07fe5d904e1a3965edfcfc1a3f396 605B 110f3c2b61e72c1abb4fb378ef02064a0946f1 202B 115522e31ca99ef2193dfcce7afbdb720e766d 36KB 1941c5b387367cd46a70b4a1d02dec3de1b566 107B 1a7d775cfe0100e1a09a2aa233572d0792401d 80B 1d23e58fa27393e7648fac26e30525ed91eaee 733B 26bbb734463a2972a254665d9496f8a3d89724 47KB 3133ae8eb69bce1c3cd1d13ce312d36f91ed7a 9KB 33f1c90dfe60a18f6238bd950d3602d42545b0 1024B 34f436a63197f8381babfce64abcf581ff9c8e 460B 36942934127f3908b878188dff37903936ab0a 710B 36b6b5e762c2c7e4e7fc2cf00f1789ccf6231a 3KB 37c035345681e2cffda8403731b1a000930241 55B 3b054d082c9dcf624bb96d906d2f1c91cb0a29 64KB 3f72354366b90eb5cddf95ccbfc3eb2b99cd01 6KB 436985080c56af0ae3f78fbd698c9d5049d7c5 3KB 4553b45c8d2c94adcb03e10a1473b871fe4d79 2KB 48a6553b516b241faca8968974bc5eb7787b9b 888B 5155ba0bcc15c6a695426af5785bf813f35841 160B 56e4c8cabd1dc888615d8fea699098e6565b12 325B 57c6763094e24ad482f41770fabb12bf5d2c79 5KB 58c8ea04c416729872b2b3c40d7cf8a8f114e8 280B 5db46d34deb7ee084a4a6ad9606ea33884bd21 483B 5e0d9c32971810bb15f417d976d1d110e97021 1KB 60a82d9cd477e94bb7c50c71134bda15323dba 9KB 61464dacbe0c81707ebc52035c6087e2137d93 135B 6ad9608a75af8eba26a6bc1fc2f35a8f7435bb 130B 717440e1f8f5cbcaa0115a053f98a271d4e9b5 598KB 71f52fe278c89494e048462455ad0f6b5c084c 1KB 779e066174a72d88187d32a60843d8a74ea765 13KB 7b07eeef25d64479b1eae4c6259e59c2fbb8d6 522B 7b0e6eedba237e5646affd3783ac851f5c8cfd 229B 8062bc8b476472cb755e2f09e28fceaf47210a 57B 8087ee7787c17322b65a78ef17236ce6765225 4KB 82bf7f08a118fcfbed58102a8a9182b689ea06 85B 845d52d5555e9e5c40b90a245f2f1441f89640 826B 89441e93c99c599361db765fc91e9270c5fc1a 83B 996694ad3abb5b7b33eec91549998081a9fc40 435B 9d7dae9f224f57701f7523e0200cb0f7c8fa15 135B 9f9abf6585e4c37675b07a3b1c985ae2471b71 665B a01cb9a40a76009572e66c906f80c28445c2a3 134B a2123463358fe572905deaa2f8a85332cee036 9KB a21d8f20ecf2cfa4a009a2f26e405459b1bd22 7KB a4665eb2769bbfb4f115c7b0b7f8c0e8f50651 69B adf1279943a55e7f5d9cf5d99b150f9ee88a38 392B af86252508990d872174de3cf4dece3f0dde02 5KB b3a6dd6ed0db5feed0382b49cd00d94867a1a8 800B b8fbee8e6a201cbaeb9c0da6134894c2361e88 2KB b92abec33c57bbf1d3e6d779f2b667855db465 748B bc29f2cc65ef9f98eef3354ce3ec8ce6d57c14 9KB bc573e81272422f8e6178ee085853dfd9ae90f 34KB c511040061ef871036e7918c0fc098cc1938df 85B c6a79b6daa5afaacd1b45737d9a66050b67daa 5KB c7f0ea9abe58f9c81832348c7ebed1a93848f9 181B cf8497afea86abe158b40611fe7704735eb00a 73B config 130B d25c8913509fa10e03ea9257ade3d43b1276e3 501B d4cdbf8f6f198c9ab678a90c84b240c2147fb0 571B dae4ea76f2d53a7aae81cd64fe5b17c6fbf5f3 3KB dd39f6e85e557b7928432f1bfa70be24f02902 6KB dd8ebfd23e5879f694ff21e2ce838fbf01a2f1 129B description 73B dfd0cf22ae4c78512703a2bf1ff91871e04378 6KB e672d67200dbee4a14f24e3562b0176ec78d27 106B e9327c37e8c8d74b05f85c9d641af06fe82b14 4KB exclude 113B f0cf7c14e0ae28b9907a8b40a322a54d18cd18 709B f2acd211d265bf66bda79d83194f0026022b42 3KB f632b978e3aa3d3d7b33e5807f9fd1257b8d60 17KB f6709ec40f16dbedbb5555d4a42ad6c36b46e9 1KB f6846335ac82778eae0d8c17c9953ac06ef7e4 1KB f9a89fe3066547ffd93bf1513842adfbee822e 167B fa70bec8e58648499843a426118aaa5a7f04bd 158B fbbe6e4a4f239e27149d226c7d9ac56504fe09 5KB
bg.gif 674KB .gitignore 159B HEAD 162B HEAD 23B index 5KB aes.js 21KB sign.js 9KB index.js 8KB app.js 5KB utils.js 4KB qiniuUploader-min.js 4KB index.js 3KB util.js 3KB index.js 3KB baseModel.js 2KB http.js 2KB index.js 588B promisify.js 437B util3.js 343B index.js 285B config.js 196B tips.js 158B config.js 97B共 145 条
- 1
- 2
资源评论
