首頁







玄幻奇幻 都市言情 武俠仙俠 軍事歷史 網游競技 科幻靈異 二次元 收藏夾
  • 放肆文學 » 都市言情 » 穹頂之上» 九.沒有好事
  • 熱門作品 | 最新上架 | 全本小說 | 閱讀紀錄

    穹頂之上 - 九.沒有好事字體大小: A+
     
    r.arg = new TypeError("iterator result is not an object"), r.delegate = null, m) } function k(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e) } function D(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e } function I(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(k, this), this.reset(!0) } function R(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1 , i = function r() { for (; ++o < e.length; ) if (n.call(e, o)) return r.value = e[o], r.done = !1, r; return r.value = t, r.done = !0, r }; return i.next = i } } throw new TypeError(mf(e) + " is not iterable") } return _.prototype = g, o(P, "constructor", { value: g, configurable: !0 }), o(g, "constructor", { value: _, configurable: !0 }), _.displayName = u(g, c, "GeneratorFunction"), e.isGeneratorFunction = function(t) { var e = "function" == typeof t && t.constructor; return !!e && (e === _ || "GeneratorFunction" === (e.displayName || e.name)) } , e.mark = function(t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, g) : (t.__proto__ = g, u(t, c, "GeneratorFunction")), t.prototype = Object.create(P), t } , e.awrap = function(t) { return { __await: t } } , w(A.prototype), u(A.prototype, s, (function() { return this } )), e.AsyncIterator = A, e.async = function(t, r, n, o, i) { void 0 === i && (i = Promise); var a = new A(l(t, r, n, o),i); return e.isGeneratorFunction(r) ? a : a.next().then((function(t) { return t.done ? t.value : a.next() } )) } , w(P), u(P, c, "Generator"), u(P, a, (function() { return this } )), u(P, "toString", (function() { return "[object Generator]" } )), e.keys = function(t) { var e = Object(t) , r = []; for (var n in e) r.push(n); return r.reverse(), function t() { for (; r.length; ) { var n = r.pop(); if (n in e) return t.value = n, t.done = !1, t } return t.done = !0, t } } , e.values = R, I.prototype = { constructor: I, reset: function(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(D), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t) }, stop: function() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval }, dispatchException: function(e) { if (this.done) throw e; var r = this; function o(n, o) { return s.type = "throw", s.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o } for (var i = this.tryEntries.length - 1; i >= 0; --i) { var a = this.tryEntries[i] , s = a.completion; if ("root" === a.tryLoc) return o("end"); if (a.tryLoc <= this.prev) { var c = n.call(a, "catchLoc") , u = n.call(a, "finallyLoc"); if (c && u) { if (this.prev < a.catchLoc) return o(a.catchLoc, !0); if (this.prev < a.finallyLoc) return o(a.finallyLoc) } else if (c) { if (this.prev < a.catchLoc) return o(a.catchLoc, !0) } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < a.finallyLoc) return o(a.finallyLoc) } } } }, abrupt: function(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, m) : this.complete(a) }, complete: function(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), m }, finish: function(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), D(r), m } }, catch: function(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; D(r) } return o } } throw new Error("illegal catch attempt") }, delegateYield: function(e, r, n) { return this.delegate = { iterator: R(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), m } }, e } function Sf(t, e, r, n, o, i, a) { try { var s = t[i](a) , c = s.value } catch (t) { return void r(t) } s.done ? e(c) : Promise.resolve(c).then(n, o) } function bf(t) { return function() { var e = this , r = arguments; return new Promise((function(n, o) { var i = t.apply(e, r); function a(t) { Sf(i, n, o, a, s, "next", t) } function s(t) { Sf(i, n, o, a, s, "throw", t) } a(void 0) } )) } } function Ef(t, e) { for (var r = 0; r < e.length; r++) { var n = e[r]; n.enumerable = n.enumerable || !1, n.configurable = !0, "value"in n && (n.writable = !0), Object.defineProperty(t, Pf(n.key), n) } } function Pf(t) { var e = function(t, e) { if ("object" != mf(t) || !t) return t; var r = t[Symbol.toPrimitive]; if (void 0 !== r) { var n = r.call(t, "string"); if ("object" != mf(n)) return n; throw new TypeError("@@toPrimitive must return a primitive value.") } return String(t) }(t); return "symbol" == mf(e) ? e : String(e) } function wf() { return wf = "undefined" != typeof Reflect && Reflect.get ? Reflect.get.bind() : function(t, e, r) { var n


    上一頁 ←    → 下一頁

    大聖傳龍符修真聊天群他與愛同罪明日之劫
    逆天神醫妃:鬼王,纏上全職抽獎系統一劍斬破九重天最強升級系統狙擊天才