@flying-studio/use-pagination/dist/utils/wrapperSchedular.js

分页请求库

var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
    return new (P || (P = Promise))(function (resolve, reject) {
        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
        step((generator = generator.apply(thisArg, _arguments || [])).next());
    });
};
var __generator = (this && this.__generator) || function (thisArg, body) {
    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
    function verb(n) { return function (v) { return step([n, v]); }; }
    function step(op) {
        if (f) throw new TypeError("Generator is already executing.");
        while (_) try {
            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
            if (y = 0, t) op = [op[0] & 2, t.value];
            switch (op[0]) {
                case 0: case 1: t = op; break;
                case 4: _.label++; return { value: op[1], done: false };
                case 5: _.label++; y = op[1]; op = [0]; continue;
                case 7: op = _.ops.pop(); _.trys.pop(); continue;
                default:
                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
                    if (t[2]) _.ops.pop();
                    _.trys.pop(); continue;
            }
            op = body.call(thisArg, _);
        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
    }
};
function wrapperSchedular(requestFn, option) {
    var _a = (option !== null && option !== void 0 ? option : {}).type, type = _a === void 0 ? 'fastest' : _a;
    var st = [];
    return function () {
        var args = [];
        for (var _i = 0; _i < arguments.length; _i++) {
            args[_i] = arguments[_i];
        }
        return __awaiter(this, void 0, void 0, function () {
            var _this = this;
            return __generator(this, function (_a) {
                return [2, new Promise(function (resolve) {
                        var task = function (_res) {
                            resolve(_res);
                        };
                        st.push(task);
                        if (type === 'fastest') {
                            requestFn.apply(_this, args).then(function (res) {
                                st.forEach(function (t) { return t(res); });
                                st.length = 0;
                            });
                        }
                        else if (type === 'latest') {
                            requestFn.apply(_this, args).then(function (res) {
                                var index = st.indexOf(task);
                                if (index === st.length - 1) {
                                    st.forEach(function (t) { return t(res); });
                                    st.length = 0;
                                }
                            });
                        }
                        else if (type === 'list') {
                            requestFn.apply(_this, args).then(function (res) {
                                var _a;
                                task.value = res;
                                var index = st.indexOf(task);
                                if (index === 0) {
                                    while (st.length && ((_a = st[0]) === null || _a === void 0 ? void 0 : _a.value) !== undefined) {
                                        var t = st.shift();
                                        t(t.value);
                                    }
                                }
                            });
                        }
                    })];
            });
        });
    };
}
export default wrapperSchedular;