golden hour

/home/godaofbq/besthyperbaric.com/wp-includes/js/dist

File/Folder	Size	Actions
.htaccess	420 B
a11y.js	5.58 KB
a11y.min.js	2.16 KB
admin-ui.js	5.58 KB
admin-ui.min.js	2.11 KB
annotations.js	15.83 KB
annotations.min.js	5.19 KB
api-fetch.js	15.94 KB
api-fetch.min.js	5.66 KB
autop.js	9.95 KB
autop.min.js	5.48 KB
base-styles.js	266 B
base-styles.min.js	75 B
blob.js	3.09 KB
blob.min.js	1.08 KB
block-directory.js	70.22 KB
block-directory.min.js	20.18 KB
block-editor.js	2.23 MB
block-editor.min.js	871.33 KB
block-library.js	2.19 MB
block-library.min.js	960 KB
block-serialization-default-parser.js	6.81 KB
block-serialization-default-parser.min.js	2.34 KB
blocks.js	427.52 KB
blocks.min.js	172.73 KB
commands.js	171.71 KB
commands.min.js	48.76 KB
components.js	2.39 MB
components.min.js	786.6 KB
compose.js	142.91 KB
compose.min.js	35.78 KB
core-commands.js	25.66 KB
core-commands.min.js	10.39 KB
core-data.js	216.7 KB
core-data.min.js	68.73 KB
customize-widgets.js	86.45 KB
customize-widgets.min.js	34.22 KB
data-controls.js	4.39 KB
data-controls.min.js	1.44 KB
data.js	88.15 KB
data.min.js	24.85 KB
date.js	790.86 KB
date.min.js	765.33 KB
deprecated.js	2.25 KB
deprecated.min.js	684 B
development	-
dom-ready.js	1.57 KB
dom-ready.min.js	457 B
dom.js	34.18 KB
dom.min.js	12.3 KB
edit-post.js	104.66 KB
edit-post.min.js	42.69 KB
edit-site.js	1.76 MB
edit-site.min.js	700.25 KB
edit-widgets.js	152.38 KB
edit-widgets.min.js	57.61 KB
editor.js	1.09 MB
editor.min.js	409.79 KB
element.js	46.17 KB
element.min.js	11.83 KB
escape-html.js	2.99 KB
escape-html.min.js	1000 B
format-library.js	71.43 KB
format-library.min.js	26.76 KB
hooks.js	15.64 KB
hooks.min.js	5.53 KB
html-entities.js	2.29 KB
html-entities.min.js	792 B
i18n.js	24.35 KB
i18n.min.js	5.19 KB
is-shallow-equal.js	3.28 KB
is-shallow-equal.min.js	1018 B
keyboard-shortcuts.js	9.23 KB
keyboard-shortcuts.min.js	2.98 KB
keycodes.js	7.89 KB
keycodes.min.js	2.51 KB
latex-to-mathml.js	444.74 KB
latex-to-mathml.min.js	192.02 KB
list-reusable-blocks.js	29.95 KB
list-reusable-blocks.min.js	4.62 KB
media-utils.js	23.35 KB
media-utils.min.js	9.72 KB
notices.js	5.84 KB
notices.min.js	2.03 KB
nux.js	9.89 KB
nux.min.js	3.43 KB
patterns.js	60.31 KB
patterns.min.js	21.47 KB
plugins.js	13.65 KB
plugins.min.js	4.23 KB
preferences-persistence.js	16.82 KB
preferences-persistence.min.js	5.33 KB
preferences.js	20.27 KB
preferences.min.js	6.85 KB
primitives.js	5.1 KB
primitives.min.js	1.62 KB
priority-queue.js	9.89 KB
priority-queue.min.js	3.3 KB
private-apis.js	5.35 KB
private-apis.min.js	2.77 KB
redux-routine.js	21.23 KB
redux-routine.min.js	8.68 KB
reusable-blocks.js	18.45 KB
reusable-blocks.min.js	5.91 KB
rich-text.js	83.52 KB
rich-text.min.js	36.42 KB
router.js	52.27 KB
router.min.js	13.44 KB
script-modules	-
server-side-render.js	9.68 KB
server-side-render.min.js	3.08 KB
shortcode.js	9.83 KB
shortcode.min.js	2.83 KB
style-engine.js	35.12 KB
style-engine.min.js	5.92 KB
token-list.js	5.86 KB
token-list.min.js	1.27 KB
url.js	20.26 KB
url.min.js	8.33 KB
vendor	-
viewport.js	6.29 KB
viewport.min.js	1.83 KB
views.js	7.8 KB
views.min.js	2.68 KB
warning.js	1.6 KB
warning.min.js	303 B
widgets.js	47.61 KB
widgets.min.js	19.5 KB
wordcount.js	13.25 KB
wordcount.min.js	3.24 KB

Edit: 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<F>) => ReturnType<F>) & 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

(window.wp = window.wp || {}).shortcode = __webpack_exports__["default"];
/******/ })()
;