UNPKG

computed-async-mobx

Version:

Define a computed by returning a Promise

148 lines 7.9 kB
"use strict"; 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 }; } }; Object.defineProperty(exports, "__esModule", { value: true }); var util_1 = require("./util"); var delay_1 = require("./delay"); var mobx_1 = require("mobx"); var index_1 = require("../src/index"); function getInsideReaction(getter) { var result = undefined; var stop = mobx_1.autorun(function () { result = getter(); }); stop(); return result; } util_1.testStrictness("throttledComputed - synchronous at first", function (assert) { return __awaiter(void 0, void 0, void 0, function () { var o, r, results, stop; return __generator(this, function (_a) { switch (_a.label) { case 0: o = mobx_1.observable({ x: 1, y: 2 }); r = index_1.throttledComputed(function () { return o.x + o.y; }, 50); assert.equal(getInsideReaction(function () { return r.get(); }), 3, "Initial computation is synchronous"); mobx_1.runInAction(function () { return o.x = 5; }); assert.equal(getInsideReaction(function () { return r.get(); }), 7, "Subsequent computations outside reactive contexts are also synchronous"); mobx_1.runInAction(function () { return o.x = 6; }); assert.equal(getInsideReaction(function () { return r.get(); }), 8, "Ditto"); results = []; stop = mobx_1.autorun(function () { return results.push(r.get()); }); assert.deepEqual(results, [8]); mobx_1.runInAction(function () { return o.x = 3; }); assert.deepEqual(results, [8], "Reactive contexts don't see immediate changes"); return [4 /*yield*/, util_1.waitForLength(results, 2)]; case 1: _a.sent(); assert.deepEqual(results, [8, 5], "But do see delayed changes"); mobx_1.runInAction(function () { return o.x = 10; }); mobx_1.runInAction(function () { return o.x = 20; }); return [4 /*yield*/, util_1.waitForLength(results, 3)]; case 2: _a.sent(); assert.deepEqual(results, [8, 5, 22], "Changes are batched by throttling"); stop(); return [2 /*return*/]; } }); }); }); util_1.testStrictness("throttledComputed - propagates exceptions", function (assert) { return __awaiter(void 0, void 0, void 0, function () { var o, r, results, stop; return __generator(this, function (_a) { switch (_a.label) { case 0: o = new util_1.Obs(false); r = index_1.throttledComputed(function () { if (o.get()) { throw new Error("Badness"); } return 1; }, 50); assert.equal(getInsideReaction(function () { return r.get(); }), 1, "Initial computation is synchronous"); results = []; stop = mobx_1.autorun(function () { try { results.push(r.get()); } catch (x) { results.push(x.message); } }); assert.deepEqual(results, [1]); mobx_1.runInAction(function () { return o.set(true); }); assert.deepEqual(results, [1], "Reactive contexts don't see immediate changes"); return [4 /*yield*/, util_1.waitForLength(results, 2)]; case 1: _a.sent(); assert.deepEqual(results, [1, "Badness"], "But do see delayed changes"); mobx_1.runInAction(function () { return o.set(false); }); mobx_1.runInAction(function () { return o.set(true); }); mobx_1.runInAction(function () { return o.set(false); }); return [4 /*yield*/, util_1.waitForLength(results, 3)]; case 2: _a.sent(); assert.deepEqual(results, [1, "Badness", 1], "Changes are batched by throttling"); mobx_1.runInAction(function () { return o.set(true); }); return [4 /*yield*/, delay_1.delay(1)]; case 3: _a.sent(); mobx_1.runInAction(function () { return o.set(false); }); mobx_1.runInAction(function () { return o.set(true); }); return [4 /*yield*/, util_1.waitForLength(results, 4)]; case 4: _a.sent(); assert.deepEqual(results, [1, "Badness", 1, "Badness"], "Changes are batched again"); stop(); return [2 /*return*/]; } }); }); }); util_1.testStrictness("throttledComputed - can be refreshed", function (assert) { return __awaiter(void 0, void 0, void 0, function () { var counter, r, trace, stop; return __generator(this, function (_a) { counter = 0; r = index_1.throttledComputed(function () { return ++counter; }, 10); trace = []; stop = mobx_1.autorun(function () { return trace.push(r.get()); }); assert.deepEqual(trace, [1], "Initial value appears synchronously"); r.refresh(); assert.deepEqual(trace, [1, 2], "Second value appears synchronously"); stop(); return [2 /*return*/]; }); }); }); //# sourceMappingURL=throttledComputedTests.js.map