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,
没有合适的资源?快使用搜索试试~ 我知道了~
猫狗叫声模拟器微信小程序前端源码.zip
共61个文件
png:23个
js:18个
json:8个
1.该资源内容由用户上传,如若侵权请联系客服进行举报
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
版权申诉
0 下载量 127 浏览量
2023-01-06
10:11:30
上传
评论
收藏 941KB ZIP 举报
温馨提示
猫狗叫声模拟器微信小程序前端源码 无后台 这是一款纯前端无后台的猫狗叫声模拟器小程序,是可以模拟猫咪、狗狗叫声与猫狗进行交流的一款小工具
资源推荐
资源详情
资源评论
收起资源包目录
猫狗叫声模拟器微信小程序前端源码.zip (61个子文件)
73253猫狗叫声模拟器微信小程序前端源码
11739
sitemap.json 191B
pages
index
index.wxml 1KB
index.js 8KB
index.json 82B
index.wxss 2KB
gengduo
index.wxml 3KB
index.js 577B
index.json 71B
index.wxss 1KB
wode
index.wxml 2KB
index.js 3KB
images
you.png 35KB
zuo.png 47KB
index.json 71B
index.wxss 4KB
app.json 1KB
project.config.json 2KB
app.js 5KB
utils
qiniuUploader-min.js 4KB
sign.js 9KB
utils.js 4KB
aes.js 21KB
promisify.js 437B
util3.js 343B
util.js 3KB
config.js 97B
tips.js 158B
http.js 2KB
app.wxss 2KB
components
image-button
index.wxml 140B
index.js 285B
index.json 52B
index.wxss 68B
modal
index.wxml 1KB
index.js 3KB
index.json 52B
index.wxss 1KB
model
baseModel.js 2KB
config.js 150B
images
wode1.png 5KB
huancun.png 4KB
caidan1.png 5KB
clickca2t.png 9KB
women.png 6KB
back-top.png 6KB
cat.png 17KB
clickdog.png 9KB
bg.gif 674KB
player.png 2KB
share.png 36KB
My-background.png 64KB
RightArrow.png 3KB
clickcat.png 9KB
dog.png 13KB
back.png 3KB
youdog.png 7KB
youcat.png 9KB
shouye2.png 4KB
wode2.png 5KB
caidan2.png 5KB
shouye1.png 4KB
共 61 条
- 1
资源评论
智慧浩海
- 粉丝: 1w+
- 资源: 5103
下载权益
C知道特权
VIP文章
课程特权
开通VIP
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功