react-dayo
Version:
A Queue component for notification etc
118 lines • 4.94 kB
JavaScript
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
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) : new P(function (resolve) { resolve(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 };
}
};
import NanoEvents from 'nanoevents';
/**
* Value Object
*/
var Interval = /** @class */ (function () {
function Interval() {
this.emitter = new NanoEvents();
this.items = new Map();
}
Interval.create = function () {
if (this.instance === undefined) {
this.instance = new Interval();
}
return this.instance;
};
/**
* just run with `window.setInterval`
*/
Interval.prototype.startTick = function () {
var _this = this;
this.intervalId = window.setInterval(function () {
_this.emitter.emit('tick', {});
}, 30);
};
/**
* Weather running `window.setInterval`
*/
Interval.prototype.isRunningTick = function () {
return this.intervalId !== undefined;
};
/**
* To stop running `window.setInterval`
*/
Interval.prototype.stopTick = function () {
if (!this.isRunningTick()) {
return;
}
clearInterval(this.intervalId);
this.intervalId = undefined;
};
Interval.prototype.hasItems = function () {
return this.items.size > 0;
};
/**
* whether item has
*/
Interval.prototype.has = function (item) {
return this.items.has(item);
};
Interval.prototype.add = function (item) {
this.items.set(item, item);
};
Interval.prototype.remove = function (item) {
this.items.delete(item);
};
Interval.prototype.wait = function (item, condition) {
return __awaiter(this, void 0, void 0, function () {
var onTick;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
this.add(item);
if (this.has(item) && this.hasItems() && !this.isRunningTick()) {
this.startTick();
}
onTick = this.emitter.on.bind(this.emitter, 'tick');
return [4 /*yield*/, condition(onTick)];
case 1:
_a.sent();
this.remove(item);
if (!this.has(item) && !this.hasItems() && this.isRunningTick()) {
this.stopTick();
}
return [2 /*return*/];
}
});
});
};
return Interval;
}());
export { Interval };
export default Interval;
//# sourceMappingURL=interval.js.map