MxWeiXinPF.Web/obj/Release/Package/PackageTmp/weixin/wfangchan/js/share.js
(开头部分) 75KB这里只显示每个文件的开头 60 行。登录后可以解锁完整代码。
if (!window.jq || typeof (jq) !== "function") {
var jq = (function (window) {
var undefined, document = window.document, emptyArray = [], slice = emptyArray.slice, classCache = {}, eventHandlers = [], _eventID = 1, jsonPHandlers = [], _jsonPID = 1, fragementRE = /^\s*<(\w+)[^>]*>/, _attrCache = {}, _propCache = {}; function _insertFragments(jqm, container, insert) {
var frag = document.createDocumentFragment(); if (insert) {
for (var j = jqm.length - 1; j >= 0; j--)
{ frag.insertBefore(jqm[j], frag.firstChild); }
container.insertBefore(frag, container.firstChild);
}
else {
for (var j = 0; j < jqm.length; j++)
frag.appendChild(jqm[j]); container.appendChild(frag);
}
frag = null;
}
function classRE(name) { return name in classCache ? classCache[name] : (classCache[name] = new RegExp('(^|\\s)' + name + '(\\s|$)')); }
function unique(arr) {
for (var i = 0; i < arr.length; i++) { if (arr.indexOf(arr[i]) != i) { arr.splice(i, 1); i--; } }
return arr;
}
function siblings(nodes, element) {
var elems = []; if (nodes == undefined)
return elems; for (; nodes; nodes = nodes.nextSibling) { if (nodes.nodeType == 1 && nodes !== element) { elems.push(nodes); } }
return elems;
}
var $jqm = function (toSelect, what) {
this.length = 0; if (!toSelect) { return this; } else if (toSelect instanceof $jqm && what == undefined) { return toSelect; } else if ($.isFunction(toSelect)) { return $(document).ready(toSelect); } else if ($.isArray(toSelect) && toSelect.length != undefined) {
for (var i = 0; i < toSelect.length; i++)
this[this.length++] = toSelect[i]; return this;
} else if ($.isObject(toSelect) && $.isObject(what)) {
if (toSelect.length == undefined) {
if (toSelect.parentNode == what)
this[this.length++] = toSelect;
} else {
for (var i = 0; i < toSelect.length; i++)
if (toSelect[i].parentNode == what)
this[this.length++] = toSelect[i];
}
return this;
} else if ($.isObject(toSelect) && what == undefined) { this[this.length++] = toSelect; return this; } else if (what !== undefined) { if (what instanceof $jqm) { return what.find(toSelect); } } else { what = document; }
return this.selector(toSelect, what);
}; var $ = function (selector, what) { return new $jqm(selector, what); }; function _selectorAll(selector, what) { try { return what.querySelectorAll(selector); } catch (e) { return []; } }; function _selector(selector, what) {
selector = selector.trim(); if (selector[0] === "#" && selector.indexOf(".") == -1 && selector.indexOf(" ") === -1 && selector.indexOf(">") === -1) {
if (what == document)
_shimNodes(what.getElementById(selector.replace("#", "")), this); else
_shimNodes(_selectorAll(selector, what), this);
} else if (selector[0] === "<" && selector[selector.length - 1] === ">")
{ var tmp = document.createElement("div"); tmp.innerHTML = selector.trim(); _shimNodes(tmp.childNodes, this); } else { _shimNodes((_selectorAll(selector, what)), this); }
return this;
}
function _shimNodes(nodes, obj) {
if (!nodes)
return; if (nodes.nodeType)
return obj[obj.length++] = nodes; for (var i = 0, iz = nodes.length; i < iz; i++)
obj[obj.length++] = nodes[i];
}
$.is$ = function (obj) { return obj instanceof $jqm; }
$.map = function (elements, callback) {
var value, values = [], i, key; if ($.isArray(elements))
for (i = 0; i < elements.length; i++) {
value = callback(elements[i], i); if (value !== undefined)
后面还有 592 行代码,购买后查看完整代码
24 小时内免费解锁 3 个项目,之后 1 积分/个。 规则说明
AI 解读
登录后可用,每次 10 积分,解读结果公开显示在下面。
还没有人解读过这个文件。
