/******/ 		};

/************************************************************************/

// ESM COMPAT FLAG

__webpack_require__.r(__webpack_exports__);

// EXPORTS

// NAMESPACE OBJECT: ./node_modules/@wordpress/keyboard-shortcuts/build-module/store/actions.js

var actions_namespaceObject = {};

__webpack_require__.r(actions_namespaceObject);

// NAMESPACE OBJECT: ./node_modules/@wordpress/keyboard-shortcuts/build-module/store/selectors.js

var selectors_namespaceObject = {};

__webpack_require__.r(selectors_namespaceObject);

/**

 * External dependencies

 */

/**

 * Reducer returning the registered shortcuts

 *

 * @param {Object} state  Current state.

 * @param {Object} action Dispatched action.

 *

 * @return {Object} Updated state.

 */

  switch (action.type) {

    case 'REGISTER_SHORTCUT':

      return { ...state,

        [action.name]: {

          category: action.category,

          keyCombination: action.keyCombination,

          aliases: action.aliases,

          description: action.description

        }

      };

    case 'UNREGISTER_SHORTCUT':

  }

  return state;

}

/* harmony default export */ var store_reducer = (reducer);

/** @typedef {import('@wordpress/keycodes').WPKeycodeModifier} WPKeycodeModifier */

/**

 * Keyboard key combination.

 *

 * @typedef {Object} WPShortcutKeyCombination

 *

 * @property {string}                      character Character.

 * @property {WPKeycodeModifier|undefined} modifier  Modifier.

 */

/**

 * Configuration of a registered keyboard shortcut.

 *

 * @typedef {Object} WPShortcutConfig

 *

 * @property {string}                     name           Shortcut name.

 * @property {string}                     category       Shortcut category.

 * @property {string}                     description    Shortcut description.

 * @property {WPShortcutKeyCombination}   keyCombination Shortcut key combination.

 * @property {WPShortcutKeyCombination[]} [aliases]      Shortcut aliases.

 */

/**

 * Returns an action object used to register a new keyboard shortcut.

 *

 * @param {WPShortcutConfig} config Shortcut config.

 *

 * @return {Object} action.

 */

  return {

    type: 'REGISTER_SHORTCUT',

    name,

    category,

    keyCombination,

    aliases,

    description

  };

}

/**

 * Returns an action object used to unregister a keyboard shortcut.

 *

 * @param {string} name Shortcut name.

 *

 * @return {Object} action.

 */

function unregisterShortcut(name) {

  return {

    type: 'UNREGISTER_SHORTCUT',

    name

  };

}

var LEAF_KEY, hasWeakMap;

/**

 * Arbitrary value used as key for referencing cache object in WeakMap tree.

 *

 * @type {Object}

 */

LEAF_KEY = {};

/**

 * Whether environment supports WeakMap.

 *

 * @type {boolean}

 */

hasWeakMap = typeof WeakMap !== 'undefined';

/**

 * Returns the first argument as the sole entry in an array.

 *

 * @param {*} value Value to return.

 *

 * @return {Array} Value returned as entry in array.

 */

function arrayOf( value ) {

	return [ value ];

}

/**

 * Returns true if the value passed is object-like, or false otherwise. A value

 * is object-like if it can support property assignment, e.g. object or array.

 *

 * @param {*} value Value to test.

 *

 * @return {boolean} Whether value is object-like.

 */

function isObjectLike( value ) {

	return !! value && 'object' === typeof value;

}

/**

 * Creates and returns a new cache object.

 *

 * @return {Object} Cache object.

 */

function createCache() {

	var cache = {

		clear: function() {

			cache.head = null;

		},

	};

	return cache;

}

/**

 * Returns true if entries within the two arrays are strictly equal by

 * reference from a starting index.

 *

 * @param {Array}  a         First array.

 * @param {Array}  b         Second array.

 * @param {number} fromIndex Index from which to start comparison.

 *

 * @return {boolean} Whether arrays are shallowly equal.

 */

function isShallowEqual( a, b, fromIndex ) {

	var i;

	if ( a.length !== b.length ) {

		return false;

	}

	for ( i = fromIndex; i < a.length; i++ ) {

		if ( a[ i ] !== b[ i ] ) {

			return false;

		}

	}

	return true;

}

/**

 * Returns a memoized selector function. The getDependants function argument is

 * called before the memoized selector and is expected to return an immutable

 * reference or array of references on which the selector depends for computing

 * its own return value. The memoize cache is preserved only as long as those

 * dependant references remain the same. If getDependants returns a different

 * reference(s), the cache is cleared and the selector value regenerated.

 *

 * @param {Function} selector      Selector function.

 * @param {Function} getDependants Dependant getter returning an immutable

 *                                 reference or array of reference used in

 *                                 cache bust consideration.

 *

 * @return {Function} Memoized selector.

 */

	var rootCache, getCache;

	// Use object source as dependant if getter not provided

	if ( ! getDependants ) {

		getDependants = arrayOf;

	}

	/**

	 * Returns the root cache. If WeakMap is supported, this is assigned to the

	 * root WeakMap cache set, otherwise it is a shared instance of the default

	 * cache object.

	 *

	 * @return {(WeakMap|Object)} Root cache object.

	 */

	function getRootCache() {

		return rootCache;

	}

	/**

	 * Returns the cache for a given dependants array. When possible, a WeakMap

	 * will be used to create a unique cache for each set of dependants. This

	 * is feasible due to the nature of WeakMap in allowing garbage collection

	 * to occur on entries where the key object is no longer referenced. Since

	 * WeakMap requires the key to be an object, this is only possible when the

	 * dependant is object-like. The root cache is created as a hierarchy where

	 * each top-level key is the first entry in a dependants set, the value a

	 * WeakMap where each key is the next dependant, and so on. This continues

	 * so long as the dependants are object-like. If no dependants are object-

	 * like, then the cache is shared across all invocations.

	 *

	 * @see isObjectLike

	 *

	 * @param {Array} dependants Selector dependants.

	 *

	 * @return {Object} Cache object.

	 */

	function getWeakMapCache( dependants ) {

		var caches = rootCache,

			isUniqueByDependants = true,

			i, dependant, map, cache;

		for ( i = 0; i < dependants.length; i++ ) {

			dependant = dependants[ i ];

			// Can only compose WeakMap from object-like key.

			if ( ! isObjectLike( dependant ) ) {

				isUniqueByDependants = false;

				break;

			}

			// Does current segment of cache already have a WeakMap?

			if ( caches.has( dependant ) ) {

				// Traverse into nested WeakMap.

				caches = caches.get( dependant );

			} else {

				// Create, set, and traverse into a new one.

				map = new WeakMap();

				caches.set( dependant, map );

				caches = map;

			}

		}

		// We use an arbitrary (but consistent) object as key for the last item

		// in the WeakMap to serve as our running cache.

		if ( ! caches.has( LEAF_KEY ) ) {

			cache = createCache();

			cache.isUniqueByDependants = isUniqueByDependants;

			caches.set( LEAF_KEY, cache );

		}

		return caches.get( LEAF_KEY );

	}

	// Assign cache handler by availability of WeakMap

	getCache = hasWeakMap ? getWeakMapCache : getRootCache;

	/**

	 * Resets root memoization cache.

	 */

	function clear() {

		rootCache = hasWeakMap ? new WeakMap() : createCache();

	}

	// eslint-disable-next-line jsdoc/check-param-names

	/**

	 * The augmented selector call, considering first whether dependants have

	 * changed before passing it to underlying memoize function.

	 *

	 * @param {Object} source    Source object for derivation.

	 * @param {...*}   extraArgs Additional arguments to pass to selector.

	 *

	 * @return {*} Selector result.

	 */

	function callSelector( /* source, ...extraArgs */ ) {

		var len = arguments.length,

			cache, node, i, args, dependants;

		// Create copy of arguments (avoid leaking deoptimization).

		args = new Array( len );

		for ( i = 0; i < len; i++ ) {

			args[ i ] = arguments[ i ];

		}

		dependants = getDependants.apply( null, args );

		cache = getCache( dependants );

		// If not guaranteed uniqueness by dependants (primitive type or lack

		// of WeakMap support), shallow compare against last dependants and, if

		// references have changed, destroy cache to recalculate result.

		if ( ! cache.isUniqueByDependants ) {

			if ( cache.lastDependants && ! isShallowEqual( dependants, cache.lastDependants, 0 ) ) {

				cache.clear();

			}

			cache.lastDependants = dependants;

		}

		node = cache.head;

		while ( node ) {

			// Check whether node arguments match arguments

			if ( ! isShallowEqual( node.args, args, 1 ) ) {

				node = node.next;