1if (!String.prototype.repeat) { 2 String.prototype.repeat = function (count) { 3 'use strict'; 4 if (this == null) 5 throw new TypeError('can\'t convert ' + this + ' to object'); 6 7 var str = '' + this; 8 // To convert string to integer. 9 count = +count; 10 // Check NaN 11 if (count != count) 12 count = 0; 13 14 if (count < 0) 15 throw new RangeError('repeat count must be non-negative'); 16 17 if (count == Infinity) 18 throw new RangeError('repeat count must be less than infinity'); 19 20 count = Math.floor(count); 21 if (str.length == 0 || count == 0) 22 return ''; 23 24 // Ensuring count is a 31-bit integer allows us to heavily optimize the 25 // main part. But anyway, most current (August 2014) browsers can't handle 26 // strings 1 << 28 chars or longer, so: 27 if (str.length * count >= 1 << 28) 28 throw new RangeError('repeat count must not overflow maximum string size'); 29 30 var maxCount = str.length * count; 31 count = Math.floor(Math.log(count) / Math.log(2)); 32 while (count) { 33 str += str; 34 count--; 35 } 36 str += str.substring(0, maxCount - str.length); 37 return str; 38 } 39} 40 41if (!String.prototype.startsWith) { 42 Object.defineProperty(String.prototype, 'startsWith', { 43 value: function (search, rawPos) { 44 var pos = rawPos > 0 ? rawPos | 0 : 0; 45 return this.substring(pos, pos + search.length) === search; 46 } 47 }); 48} 49 50 51if (typeof Object.assign !== 'function') { 52 // Must be writable: true, enumerable: false, configurable: true 53 Object.defineProperty(Object, "assign", { 54 value: function assign(target, varArgs) { // .length of function is 2 55 'use strict'; 56 if (target === null || target === undefined) { 57 throw new TypeError('Cannot convert undefined or null to object'); 58 } 59 60 var to = Object(target); 61 62 for (var index = 1; index < arguments.length; index++) { 63 var nextSource = arguments[index]; 64 65 if (nextSource !== null && nextSource !== undefined) { 66 for (var nextKey in nextSource) { 67 // Avoid bugs when hasOwnProperty is shadowed 68 if (Object.prototype.hasOwnProperty.call(nextSource, nextKey)) { 69 to[nextKey] = nextSource[nextKey]; 70 } 71 } 72 } 73 } 74 return to; 75 }, 76 writable: true, 77 configurable: true 78 }); 79} 80 81 82if (!Array.prototype.find) { 83 Object.defineProperty(Array.prototype, 'find', { 84 value: function (predicate) { 85 // 1. Let O be ? ToObject(this value). 86 if (this == null) { 87 throw TypeError('"this" is null or not defined'); 88 } 89 90 var o = Object(this); 91 92 // 2. Let len be ? ToLength(? Get(O, "length")). 93 var len = o.length >>> 0; 94 95 // 3. If IsCallable(predicate) is false, throw a TypeError exception. 96 if (typeof predicate !== 'function') { 97 throw TypeError('predicate must be a function'); 98 } 99 100 // 4. If thisArg was supplied, let T be thisArg; else let T be undefined. 101 var thisArg = arguments[1]; 102 103 // 5. Let k be 0. 104 var k = 0; 105 106 // 6. Repeat, while k < len 107 while (k < len) { 108 // a. Let Pk be ! ToString(k). 109 // b. Let kValue be ? Get(O, Pk). 110 // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)). 111 // d. If testResult is true, return kValue. 112 var kValue = o[k]; 113 if (predicate.call(thisArg, kValue, k, o)) { 114 return kValue; 115 } 116 // e. Increase k by 1. 117 k++; 118 } 119 120 // 7. Return undefined. 121 return undefined; 122 }, 123 configurable: true, 124 writable: true 125 });
126} 127 128 129if( typeof Promise === "undefined"){ 130 (function (undefined) { 131 132// Promise 133 !function (n) { 134 function t(r) { 135 if (e[r]) return e[r].exports; 136 var o = e[r] = {i: r, l: !1, exports: {}}; 137 return n[r].call(o.exports, o, o.exports, t), o.l = !0, o.exports 138 } 139 140 var e = {}; 141 t.m = n, t.c = e, t.i = function (n) { 142 return n 143 }, t.d = function (n, e, r) { 144 t.o(n, e) || Object.defineProperty(n, e, {configurable: !1, enumerable: !0, get: r}) 145 }, t.n = function (n) { 146 var e = n && n.__esModule ? function () { 147 return n["default"] 148 } : function () { 149 return n 150 }; 151 return t.d(e, "a", e), e 152 }, t.o = function (n, t) { 153 return Object.prototype.hasOwnProperty.call(n, t) 154 }, t.p = "", t(t.s = 100) 155 }({ 156 100:/*!***********************!*\ 157 !*** ./src/global.js ***! 158 \***********************/ 159 function (n, t, e) { 160 (function (n) { 161 var t = e(/*! ./yaku */5); 162 try { 163 n.Promise = t, window.Promise = t 164 } catch (r) { 165 } 166 }).call(t, e(/*! ./../~/webpack/buildin/global.js */2)) 167 }, 2:/*!***********************************!*\ 168 !*** (webpack)/buildin/global.js ***! 169 \***********************************/ 170 function (n, t) { 171 var e; 172 e = function () { 173 return this 174 }(); 175 try { 176 e = e || Function("return this")() || (0, eval)("this") 177 } catch (r) { 178 "object" == typeof window && (e = window) 179 } 180 n.exports = e 181 }, 5:/*!*********************!*\ 182 !*** ./src/yaku.js ***! 183 \*********************/ 184 function (n, t, e) { 185 (function (t) { 186 !function () { 187 "use strict"; 188 189 function e() { 190 return rn[q][B] || D 191 } 192 193 function r(n) { 194 return n && "object" == typeof n 195 } 196 197 function o(n) { 198 return "function" == typeof n 199 } 200 201 function i(n, t) { 202 return n instanceof t 203 } 204 205 function u(n) { 206 return i(n, M) 207 } 208 209 function c(n, t, e) { 210 if (!t(n)) throw h(e) 211 } 212 213 function f() { 214 try { 215 return R.apply(S, arguments) 216 } catch (n) { 217 return nn.e = n, nn 218 } 219 } 220 221 function s(n, t) { 222 return R = n, S = t, f 223 } 224 225 function a(n, t) { 226 function e() { 227 for (var e = 0; e < o;) t(r[e], r[e + 1]), r[e++] = P, r[e++] = P; 228 o = 0, r.length > n && (r.length = n) 229 } 230 231 var r = A(n), o = 0; 232 return function (n, t) { 233 r[o++] = n, r[o++] = t, 2 === o && rn.nextTick(e) 234 } 235 } 236 237 function l(n, t) { 238 var e, r, u, c, f = 0; 239 if (!n) throw h(Q); 240 var a = n[rn[q][z]]; 241 if (o(a)) r = a.call(n); else { 242 if (!o(n.next)) { 243 if (i(n, A)) { 244 for (e = n.length; f < e;) t(n[f], f++); 245 return f 246 } 247 throw h(Q) 248 } 249 r = n 250 } 251 for (; !(u = r.next()).done;) if ((c = s(t)(u.value, f++)) === nn) throw o(r[G]) && r[G](), c.e; 252 return f 253 } 254 255 function h(n) { 256 return new TypeError(n) 257 } 258 259 function v(n) { 260 return (n ? "" : V) + (new M).stack 261 } 262 263 function _(n, t) { 264 var e = "on" + n.toLowerCase(), r = O[e]; 265 H && H.listeners(n).length ? n === Z ? H.emit
vendor: 7,419 bytes, lines 265-400
265(n, t._v, t) : H.emit(n, t) : r ? r({ 266 reason: t._v, 267 promise: t 268 }) : rn[n](t._v, t) 269 } 270 271 function p(n) { 272 return n && n._s 273 } 274 275 function d(n) { 276 if (p(n)) return new n(tn); 277 var t, e, r; 278 return t = new n(function (n, o) { 279 if (t) throw h(); 280 e = n, r = o 281 }), c(e, o), c(r, o), t 282 } 283 284 function w(n, t) { 285 var e = !1; 286 return function (r) { 287 e || (e = !0, L && (n[N] = v(!0)), t === Y ? k(n, r) : x(n, t, r)) 288 } 289 } 290 291 function y(n, t, e, r) { 292 return o(e) && (t._onFulfilled = e), o(r) && (n[J] && _(X, n), t._onRejected = r), L && (t._p = n), n[n._c++] = t, n._s !== $ && on(n, t), t 293 } 294 295 function m(n) { 296 if (n._umark) return !0; 297 n._umark = !0; 298 for (var t, e = 0, r = n._c; e < r;) if (t = n[e++], t._onRejected || m(t)) return !0 299 } 300 301 function j(n, t) { 302 function e(n) { 303 return r.push(n.replace(/^\s+|\s+$/g, "")) 304 } 305 306 var r = []; 307 return L && (t[N] && e(t[N]), function o(n) { 308 n && K in n && (o(n._next), e(n[K] + ""), o(n._p)) 309 }(t)), (n && n.stack ? n.stack : n) + ("\n" + r.join("\n")).replace(en, "") 310 } 311 312 function g(n, t) { 313 return n(t) 314 } 315 316 function x(n, t, e) { 317 var r = 0, o = n._c; 318 if (n._s === $) for (n._s = t, n._v = e, t === U && (L && u(e) && (e.longStack = j(e, n)), un(n)); r < o;) on(n, n[r++]); 319 return n 320 } 321 322 function k(n, t) { 323 if (t === n && t) return x(n, U, h(W)), n; 324 if (t !== C && (o(t) || r(t))) { 325 var e = s(b)(t); 326 if (e === nn) return x(n, U, e.e), n; 327 o(e) ? (L && p(t) && (n._next = t), p(t) ? T(n, t, e) : rn.nextTick(function () { 328 T(n, t, e) 329 })) : x(n, Y, t) 330 } else x(n, Y, t); 331 return n 332 } 333 334 function b(n) { 335 return n.then 336 } 337 338 function T(n, t, e) { 339 var r = s(e, t)(function (e) { 340 t && (t = C, k(n, e)) 341 }, function (e) { 342 t && (t = C, x(n, U, e)) 343 }); 344 r === nn && t && (x(n, U, r.e), t = C) 345 } 346 347 var P, R, S, C = null, F = "object" == typeof self, O = F ? self : t, E = O.Promise, 348 H = O.process, I = O.console, L = !1, A = Array, M = Error, U = 1, Y = 2, $ = 3, 349 q = "Symbol", z = "iterator", B = "species", D = q + "(" + B + ")", G = "return", J = "_uh", 350 K = "_pt", N = "_st", Q = "Invalid argument", V = "\nFrom previous ", 351 W = "Chaining cycle detected for promise", X = "rejectionHandled", Z = "unhandledRejection", 352 nn = {e: C}, tn = function () { 353 }, en = /^.+\/node_modules\/yaku\/.+\n?/gm, rn = function (n) { 354 var t, e = this; 355 if (!r(e) || e._s !== P) throw h("Invalid this"); 356 if (e._s = $, L && (e[K] = v()), n !== tn) { 357 if (!o(n)) throw h(Q); 358 t = s(n)(w(e, Y), w(e, U)), t === nn && x(e, U, t.e) 359 } 360 }; 361 rn["default"] = rn, function (n, t) { 362 for (var e in t) n[e] = t[e] 363 }(rn.prototype, { 364 then: function (n, t) { 365 if (this._s === undefined) throw h(); 366 return y(this, d(rn.speciesConstructor(this, rn)), n, t) 367 }, "catch": function (n) { 368 return this.then(P, n) 369 }, "finally": function (n) { 370 return this.then(function (t) { 371 return rn.resolve(n()).then(function () { 372 return t 373 }) 374 }, function (t) { 375 return rn.resolve(n()).then(function () { 376 throw t 377 }) 378 }) 379 }, _c: 0, _p: C 380 }), rn.resolve = function (n) { 381 return p(n) ? n : k(d(this), n) 382 }, rn.reject = function (n) { 383 return x(d(this), U, n) 384 }, rn.race = function (n) { 385 var t = this, e = d(t), r = function (n) { 386 x(e, Y, n) 387 }, o = function (n) { 388 x(e, U, n) 389 }, i = s(l)(n, function (n) { 390 t.resolve(n).then(r, o) 391 }); 392 return i === nn ? t.reject(i.e) : e 393 }, rn.all = function (n) { 394 function t(n) { 395 x(o, U, n) 396 } 397 398 var e, r = this, o = d(r), i = []; 399 return (e = s(l)(n, function (n, u) { 400 r.resolve(n).then(function (n) {
vendor: 2,235 bytes, lines 401-441
401 i[u] = n, --e || x(o, Y, i) 402 }, t) 403 })) === nn ? r.reject(e.e) : (e || x(o, Y, []), o) 404 }, rn.Symbol = O[q] || {}, s(function () { 405 Object.defineProperty(rn, e(), { 406 get: function () { 407 return this 408 } 409 }) 410 })(), rn.speciesConstructor = function (n, t) { 411 var r = n.constructor; 412 return r ? r[e()] || t : t 413 }, rn.unhandledRejection = function (n, t) { 414 I && I.error("Uncaught (in promise)", L ? t.longStack : j(n, t)) 415 }, rn.rejectionHandled = tn, rn.enableLongStackTrace = function () { 416 L = !0 417 }, rn.nextTick = F ? function (n) { 418 E ? new E(function (n) { 419 n() 420 }).then(n) : setTimeout(n) 421 } : H.nextTick, rn._s = 1; 422 var on = a(999, function (n, t) { 423 var e, r; 424 return (r = n._s !== U ? t._onFulfilled : t._onRejected) === P ? void x(t, n._s, n._v) : (e = s(g)(r, n._v)) === nn ? void x(t, U, e.e) : void k(t, e) 425 }), un = a(9, function (n) { 426 m(n) || (n[J] = 1, _(Z, n)) 427 }); 428 try { 429 n.exports = rn 430 } catch (cn) { 431 O.Yaku = rn 432 } 433 }() 434 }).call(t, e(/*! ./../~/webpack/buildin/global.js */2)) 435 } 436 }); 437 }) 438 .call('object' === typeof window && window || 'object' === typeof self && self || 'object' === typeof global && global || {}); 439} 440 441
442var __spreadArrays = (this && this.__spreadArrays) || function () { 443 for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length; 444 for (var r = Array(s), k = 0, i = 0; i < il; i++) 445 for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++) 446 r[k] = a[j]; 447 return r; 448}; 449
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.