wp core update 6.6
This commit is contained in:
Tony Volpe
304
wp/wp-includes/js/dist/annotations.js
vendored
304
wp/wp-includes/js/dist/annotations.js
vendored
@@ -402,307 +402,9 @@ function annotations(state = {}, action) {
|
||||
}
|
||||
/* harmony default export */ const reducer = (annotations);
|
||||
|
||||
;// CONCATENATED MODULE: ./node_modules/rememo/rememo.js
|
||||
|
||||
|
||||
/** @typedef {(...args: any[]) => *[]} GetDependants */
|
||||
|
||||
/** @typedef {() => void} Clear */
|
||||
|
||||
/**
|
||||
* @typedef {{
|
||||
* getDependants: GetDependants,
|
||||
* clear: Clear
|
||||
* }} EnhancedSelector
|
||||
*/
|
||||
|
||||
/**
|
||||
* Internal cache entry.
|
||||
*
|
||||
* @typedef CacheNode
|
||||
*
|
||||
* @property {?CacheNode|undefined} [prev] Previous node.
|
||||
* @property {?CacheNode|undefined} [next] Next node.
|
||||
* @property {*[]} args Function arguments for cache entry.
|
||||
* @property {*} val Function result.
|
||||
*/
|
||||
|
||||
/**
|
||||
* @typedef Cache
|
||||
*
|
||||
* @property {Clear} clear Function to clear cache.
|
||||
* @property {boolean} [isUniqueByDependants] Whether dependants are valid in
|
||||
* considering cache uniqueness. A cache is unique if dependents are all arrays
|
||||
* or objects.
|
||||
* @property {CacheNode?} [head] Cache head.
|
||||
* @property {*[]} [lastDependants] Dependants from previous invocation.
|
||||
*/
|
||||
|
||||
/**
|
||||
* Arbitrary value used as key for referencing cache object in WeakMap tree.
|
||||
*
|
||||
* @type {{}}
|
||||
*/
|
||||
var LEAF_KEY = {};
|
||||
|
||||
/**
|
||||
* Returns the first argument as the sole entry in an array.
|
||||
*
|
||||
* @template T
|
||||
*
|
||||
* @param {T} value Value to return.
|
||||
*
|
||||
* @return {[T]} 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 {Cache} Cache object.
|
||||
*/
|
||||
function createCache() {
|
||||
/** @type {Cache} */
|
||||
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 {*[]} a First array.
|
||||
* @param {*[]} 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.
|
||||
*
|
||||
* @template {(...args: *[]) => *} S
|
||||
*
|
||||
* @param {S} selector Selector function.
|
||||
* @param {GetDependants=} getDependants Dependant getter returning an array of
|
||||
* references used in cache bust consideration.
|
||||
*/
|
||||
/* harmony default export */ function rememo(selector, getDependants) {
|
||||
/** @type {WeakMap<*,*>} */
|
||||
var rootCache;
|
||||
|
||||
/** @type {GetDependants} */
|
||||
var normalizedGetDependants = getDependants ? getDependants : arrayOf;
|
||||
|
||||
/**
|
||||
* 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 {*[]} dependants Selector dependants.
|
||||
*
|
||||
* @return {Cache} Cache object.
|
||||
*/
|
||||
function getCache(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);
|
||||
}
|
||||
|
||||
/**
|
||||
* Resets root memoization cache.
|
||||
*/
|
||||
function clear() {
|
||||
rootCache = new WeakMap();
|
||||
}
|
||||
|
||||
/* eslint-disable jsdoc/check-param-names */
|
||||
/**
|
||||
* The augmented selector call, considering first whether dependants have
|
||||
* changed before passing it to underlying memoize function.
|
||||
*
|
||||
* @param {*} source Source object for derivation.
|
||||
* @param {...*} extraArgs Additional arguments to pass to selector.
|
||||
*
|
||||
* @return {*} Selector result.
|
||||
*/
|
||||
/* eslint-enable jsdoc/check-param-names */
|
||||
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 = normalizedGetDependants.apply(null, args);
|
||||
cache = getCache(dependants);
|
||||
|
||||
// If not guaranteed uniqueness by dependants (primitive type), 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;
|
||||
continue;
|
||||
}
|
||||
|
||||
// At this point we can assume we've found a match
|
||||
|
||||
// Surface matched node to head if not already
|
||||
if (node !== cache.head) {
|
||||
// Adjust siblings to point to each other.
|
||||
/** @type {CacheNode} */ (node.prev).next = node.next;
|
||||
if (node.next) {
|
||||
node.next.prev = node.prev;
|
||||
}
|
||||
|
||||
node.next = cache.head;
|
||||
node.prev = null;
|
||||
/** @type {CacheNode} */ (cache.head).prev = node;
|
||||
cache.head = node;
|
||||
}
|
||||
|
||||
// Return immediately
|
||||
return node.val;
|
||||
}
|
||||
|
||||
// No cached value found. Continue to insertion phase:
|
||||
|
||||
node = /** @type {CacheNode} */ ({
|
||||
// Generate the result from original function
|
||||
val: selector.apply(null, args),
|
||||
});
|
||||
|
||||
// Avoid including the source object in the cache.
|
||||
args[0] = null;
|
||||
node.args = 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 (cache.head) {
|
||||
cache.head.prev = node;
|
||||
node.next = cache.head;
|
||||
}
|
||||
|
||||
cache.head = node;
|
||||
|
||||
return node.val;
|
||||
}
|
||||
|
||||
callSelector.getDependants = normalizedGetDependants;
|
||||
callSelector.clear = clear;
|
||||
clear();
|
||||
|
||||
return /** @type {S & EnhancedSelector} */ (callSelector);
|
||||
}
|
||||
|
||||
;// CONCATENATED MODULE: ./node_modules/@wordpress/annotations/build-module/store/selectors.js
|
||||
/**
|
||||
* External dependencies
|
||||
* WordPress dependencies
|
||||
*/
|
||||
|
||||
|
||||
@@ -725,7 +427,7 @@ const EMPTY_ARRAY = [];
|
||||
*
|
||||
* @return {Array} The annotations applicable to this block.
|
||||
*/
|
||||
const __experimentalGetAnnotationsForBlock = rememo((state, blockClientId) => {
|
||||
const __experimentalGetAnnotationsForBlock = (0,external_wp_data_namespaceObject.createSelector)((state, blockClientId) => {
|
||||
var _state$blockClientId;
|
||||
return ((_state$blockClientId = state?.[blockClientId]) !== null && _state$blockClientId !== void 0 ? _state$blockClientId : []).filter(annotation => {
|
||||
return annotation.selector === 'block';
|
||||
@@ -751,7 +453,7 @@ function __experimentalGetAllAnnotationsForBlock(state, blockClientId) {
|
||||
* @param {string} richTextIdentifier Unique identifier that identifies the given RichText.
|
||||
* @return {Array} All the annotations relevant for the `RichText`.
|
||||
*/
|
||||
const __experimentalGetAnnotationsForRichText = rememo((state, blockClientId, richTextIdentifier) => {
|
||||
const __experimentalGetAnnotationsForRichText = (0,external_wp_data_namespaceObject.createSelector)((state, blockClientId, richTextIdentifier) => {
|
||||
var _state$blockClientId4;
|
||||
return ((_state$blockClientId4 = state?.[blockClientId]) !== null && _state$blockClientId4 !== void 0 ? _state$blockClientId4 : []).filter(annotation => {
|
||||
return annotation.selector === 'range' && richTextIdentifier === annotation.richTextIdentifier;
|
||||
|
||||
Reference in New Issue
Block a user