var n;
n = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function(n) {
return typeof n;
} : function(n) {
return n && "function" == typeof Symbol && n.constructor === Symbol && n !== Symbol.prototype ? "symbol" : typeof n;
}, function() {
var t = Array.prototype, r = Object.prototype, e = Function.prototype, u = t.push, i = t.slice, o = r.toString, a = r.hasOwnProperty, c = Array.isArray, l = Object.keys, f = e.bind, s = Object.create, p = function() {}, h = function n(t) {
return t instanceof n ? t : this instanceof n ? void (this._wrapped = t) : new n(t);
};
(module.exports = h).VERSION = "1.8.2";
var v = function(n, t, r) {
if (void 0 === t) return n;
switch (null == r ? 3 : r) {
case 1:
return function(r) {
return n.call(t, r);
};
case 2:
return function(r, e) {
return n.call(t, r, e);
};
case 3:
return function(r, e, u) {
return n.call(t, r, e, u);
};
case 4:
return function(r, e, u, i) {
return n.call(t, r, e, u, i);
};
}
return function() {
return n.apply(t, arguments);
};
}, y = function(n, t, r) {
return null == n ? h.identity : h.isFunction(n) ? v(n, t, r) : h.isObject(n) ? h.matcher(n) : h.property(n);
};
h.iteratee = function(n, t) {
return y(n, t, 1 / 0);
};
var d = function(n, t) {
return function(r) {
var e = arguments.length;
if (e < 2 || null == r) return r;
for (var u = 1; u < e; u++) for (var i = arguments[u], o = n(i), a = o.length, c = 0; c < a; c++) {
var l = o[c];
t && void 0 !== r[l] || (r[l] = i[l]);
}
return r;
};
}, g = function(n) {
if (!h.isObject(n)) return {};
if (s) return s(n);
p.prototype = n;
var t = new p();
return p.prototype = null, t;
}, m = Math.pow(2, 53) - 1, b = function(n) {
var t = null != n && n.length;
return "number" == typeof t && 0 <= t && t <= m;
};
function j(n) {
return function(t, r, e, u) {
r = v(r, u, 4);
var i = !b(t) && h.keys(t), o = (i || t).length, a = 0 < n ? 0 : o - 1;
return arguments.length < 3 && (e = t[i ? i[a] : a], a += n), function(t, r, e, u, i, o) {
for (;0 <= i && i < o; i += n) {
var a = u ? u[i] : i;
e = r(e, t[a], a, t);
}
return e;
}(t, r, e, i, a, o);
};
}
h.each = h.forEach = function(n, t, r) {
var e, u;
if (t = v(t, r), b(n)) for (e = 0, u = n.length; e < u; e++) t(n[e], e, n); else {
var i = h.keys(n);
for (e = 0, u = i.length; e < u; e++) t(n[i[e]], i[e], n);
}
return n;
}, h.map = h.collect = function(n, t, r) {
t = y(t, r);
for (var e = !b(n) && h.keys(n), u = (e || n).length, i = Array(u), o = 0; o < u; o++) {
var a = e ? e[o] : o;
i[o] = t(n[a], a, n);
}
return i;
}, h.reduce = h.foldl = h.inject = j(1), h.reduceRight = h.foldr = j(-1), h.find = h.detect = function(n, t, r) {
var e;
if (void 0 !== (e = b(n) ? h.findIndex(n, t, r) : h.findKey(n, t, r)) && -1 !== e) return n[e];
}, h.filter = h.select = function(n, t, r) {
var e = [];
return t = y(t, r), h.each(n, function(n, r, u) {
t(n, r, u) && e.push(n);
}), e;
}, h.reject = function(n, t, r) {
return h.filter(n, h.negate(y(t)), r);
}, h.every = h.all = function(n, t, r) {
t = y(t, r);
for (var e = !b(n) && h.keys(n), u = (e || n).length, i = 0; i < u; i++) {
var o = e ? e[i] : i;
if (!t(n[o], o, n)) return !1;
}
return !0;
}, h.some = h.any = function(n, t, r) {
t = y(t, r);
for (var e = !b(n) && h.keys(n), u = (e || n).length, i = 0; i < u; i++) {
var o = e ? e[i] : i;
if (t(n[o], o, n)) return !0;
}
return !1;
}, h.contains = h.includes = h.include = function(n, t, r) {
return b(n) || (n = h.values(n)), 0 <= h.indexOf(n, t, "number" == typeof r && r);
}, h.invoke = function(n, t) {
var r = i.call(arguments, 2), e = h.isFunction(t);
return h.map(n, function(n) {
var u = e ? t : n[t];
return null == u ? u : u.apply(n, r);
});
}, h.pluck = function(n, t) {
return h.map(n, h.property(t));
}, h.where = function(n, t) {
return h.filter(n, h.matcher(t));
}, h.findWhere = function(n, t) {
return h.find(n, h.matcher(t));
}, h.max = function(n, t, r) {
var e, u, i = -1 / 0, o = -1 / 0;
if (null == t && null != n) for (var a = 0, c = (n = b(n) ? n : h.values(n)).length; a < c; a++) e = n[a],
i < e && (i = e); else t = y(t, r), h.each(n, function(n, r, e) {
u = t(n, r, e), (o < u || u === -1 / 0 && i === -1 / 0) && (i = n, o = u);
});
return i;
}, h.min = function(n, t, r) {
var e, u, i = 1 / 0, o = 1 / 0;
if (null == t && null != n) for (var a = 0, c = (n = b(n) ? n : h.values(n)).length; a < c; a++) (e = n[a]) < i && (i = e); else t = y(t, r),
h.each(n, function(n, r, e) {
((u = t(n, r, e)) < o || u === 1 / 0 && i === 1 / 0) && (i = n, o = u);
});
return i;
}, h.shuffle = function(n) {
for (var t, r = b(n) ? n : h.values(n), e = r.length, u = Array(e), i = 0; i < e; i++) (t = h.random(0, i)) !== i && (u[i] = u[t]),
u[t] = r[i];
return u;
}, h.sample = function(n, t, r) {
return null == t || r ? (b(n) || (n = h.values(n)), n[h.random(n.length - 1)]) : h.shuffle(n).slice(0, Math.max(0, t));
}, h.sortBy = function(n, t, r) {
return t = y(t, r), h.pluck(h.map(n, function(n, r, e) {
return {
value: n,
index: r,
criteria: t(n, r, e)
};
}).sort(function(n, t) {
var r = n.criteria, e = t.criteria;
if (r !== e) {
if (e < r || void 0 === r) return 1;
if (r < e || void 0 === e) return -1;
}
return n.index - t.index;
}), "value");
};
var x = function(n) {
return function(t, r, e) {
var u = {};
return r = y(r, e), h.each(t, function(e, i) {
var o = r(e, i, t);
n(u, e, o);
}), u;
};
};
h.groupBy = x(function(n, t, r) {
h.has(n, r) ? n[r].push(t) : n[r] = [ t ];
}), h.indexBy = x(function(n, t, r) {
n[r] = t;
}), h.countBy = x(function(n, t, r) {
h.has(n, r) ? n[r]++ : n[r] = 1;
}), h.toArray = function(n) {
return n ? h.isArray(n) ? i.call(n) : b(n) ? h.map(n, h.identity) : h.values(n) : [];
}, h.size = function(n) {
return null == n ? 0 : b(n) ? n.length : h.keys(n).length;
}, h.partition = function(n, t, r) {
t = y(t, r);
var e = [], u = [];
return h.each(n, function(n, r, i) {
(t(n, r, i) ? e : u).push(n);
}), [ e, u ];
}, h.first = h.head = h.take = function(n, t, r) {
if (null != n) return null == t || r ? n[0] : h.initial(n, n.length - t);
}, h.initial = function(n, t, r) {
return i.call(n, 0, Math.max(0, n.length - (null == t || r ? 1 : t)));
}, h.last = function(n, t, r) {
if (null != n) return null == t || r ? n[n.length - 1] : h.rest(n, Math.max(0, n.length - t));
}, h.rest = h.tail = h.drop = function(n, t, r) {
return i.call(n, null == t || r ? 1 : t);
}, h.compact = f
超多制作模板的姓氏头像生成器微信小程序源码
需积分: 5 78 浏览量
2024-05-27
16:58:41
上传
评论
收藏 169KB ZIP 举报
姓氏头像生成器.zip （96个子文件） 
姓氏头像生成器 
sitemap.json 191B project.private.config.json 451B pages index index.wxml 1KB index.js 5KB index.json 63B index.wxss 2KB sign sign.json 29B sign.js 17KB sign.wxss 3KB sign.wxml 4KB app.json 530B project.config.json 1KB app.js 3KB app.wxss 35KB we7 resource js md5.js 5KB underscore.js 25KB util.js 17KB images 
userselect.png 5KB home.png 1KB hotelselect.png 1KB hotel.png 1KB user.png 4KB homeselect.png 2KB icon userselect.png 5KB img_3.png 3KB pay.png 4KB home.png 1KB hotelselect.png 1KB hotel.png 1KB todo.png 4KB payselect.png 6KB img_4.png 4KB user.png 4KB homeselect.png 2KB order.png 3KB todoselect.png 5KB orderselect.png 4KB img_1.png 1KB img_2.png 1KB images index-tab.png 1KB success.png 2KB error.png 2KB tab3-2.png 2KB tab1.png 932B download.png 1KB back-top.png 6KB kf.png 4KB about.png 7KB share.png 3KB tab3.png 1KB at2.png 2KB index.png 1KB fh.png 526B tab2.png 2KB tab2-2.png 2KB tab1-2.png 946B index2.png 1KB share-tab.png 1008B at.png 1KB siteinfo.js 191B pagesA more more.js 272B more.wxml 35B more.wxss 0B more.json 29B index index.wxml 37B index2.wxss 0B index2.json 29B index2.js 272B index.js 272B index2.wxml 38B index.json 29B index.wxss 0B rank rank.wxml 35B rank.wxss 0B rank.js 272B rank.json 29B web web.json 29B web.wxml 33B web.js 272B web.wxss 0B templates template.json 29B template.js 272B template.wxml 44B template.wxss 0B home home.wxml 35B home.json 29B home.wxss 0B home.js 272B puzzle puzzle.wxml 39B puzzle.json 29B puzzle.js 272B puzzle.wxss 0B login login.js 272B login.json 29B login.wxml 37B login.wxss 0B资源评论
