Function memoizeFunction

docs/app/js/sanddance-app.js:24043–24079

(cb, maxCacheSize, ignoreNullOrUndefinedResult)

    };
}
function memoizeFunction(cb, maxCacheSize, ignoreNullOrUndefinedResult) {
    if (maxCacheSize === void 0) maxCacheSize = 100;
    if (ignoreNullOrUndefinedResult === void 0) ignoreNullOrUndefinedResult = false;
    // Avoid breaking scenarios which don't have weak map.
    if (!_weakMap) return cb;
    if (!_initializedStylesheetResets) {
        var stylesheet = (0, _mergeStyles.Stylesheet).getInstance();
        if (stylesheet && stylesheet.onReset) (0, _mergeStyles.Stylesheet).getInstance().onReset(resetMemoizations);
        _initializedStylesheetResets = true;
    }
    var rootNode;
    var cacheSize = 0;
    var localResetCounter = _resetCounter;
    return function memoizedFunction() {
        var args = [];
        for(var _i = 0; _i < arguments.length; _i++)args[_i] = arguments[_i];
        var currentNode = rootNode;
        if (rootNode === undefined || localResetCounter !== _resetCounter || maxCacheSize > 0 && cacheSize > maxCacheSize) {
            rootNode = _createNode();
            cacheSize = 0;
            localResetCounter = _resetCounter;
        }
        currentNode = rootNode;
        // Traverse the tree until we find the match.
        for(var i = 0; i < args.length; i++){
            var arg = _normalizeArg(args[i]);
            if (!currentNode.map.has(arg)) currentNode.map.set(arg, _createNode());
            currentNode = currentNode.map.get(arg);
        }
        if (!currentNode.hasOwnProperty("value")) {
            currentNode.value = cb.apply(void 0, args);
            cacheSize++;
        }
        if (ignoreNullOrUndefinedResult && (currentNode.value === null || currentNode.value === undefined)) currentNode.value = cb.apply(void 0, args);
        return currentNode.value;
    };
}
function createMemoizer(getValue) {
    if (!_weakMap) // Without a `WeakMap` implementation, memoization is not possible.
    return getValue;