Файловый менеджер - Редактировать - /home/freeclou/app.optimyar.com/front-web/build/assets/fonts/iran-yekan/beflpn/lib.zip
Назад
PK ��g[p�-� � defaultMemoize.jsnu �Iw�� "use strict"; Object.defineProperty(exports, "__esModule", { value: true }); exports.createCacheKeyComparator = createCacheKeyComparator; exports.defaultEqualityCheck = void 0; exports.defaultMemoize = defaultMemoize; // Cache implementation based on Erik Rasmussen's `lru-memoize`: // https://github.com/erikras/lru-memoize var NOT_FOUND = 'NOT_FOUND'; function createSingletonCache(equals) { var entry; return { get: function get(key) { if (entry && equals(entry.key, key)) { return entry.value; } return NOT_FOUND; }, put: function put(key, value) { entry = { key: key, value: value }; }, getEntries: function getEntries() { return entry ? [entry] : []; }, clear: function clear() { entry = undefined; } }; } function createLruCache(maxSize, equals) { var entries = []; function get(key) { var cacheIndex = entries.findIndex(function (entry) { return equals(key, entry.key); }); // We found a cached entry if (cacheIndex > -1) { var entry = entries[cacheIndex]; // Cached entry not at top of cache, move it to the top if (cacheIndex > 0) { entries.splice(cacheIndex, 1); entries.unshift(entry); } return entry.value; } // No entry found in cache, return sentinel return NOT_FOUND; } function put(key, value) { if (get(key) === NOT_FOUND) { // TODO Is unshift slow? entries.unshift({ key: key, value: value }); if (entries.length > maxSize) { entries.pop(); } } } function getEntries() { return entries; } function clear() { entries = []; } return { get: get, put: put, getEntries: getEntries, clear: clear }; } var defaultEqualityCheck = function defaultEqualityCheck(a, b) { return a === b; }; exports.defaultEqualityCheck = defaultEqualityCheck; function createCacheKeyComparator(equalityCheck) { return function areArgumentsShallowlyEqual(prev, next) { if (prev === null || next === null || prev.length !== next.length) { return false; } // Do this in a for loop (and not a `forEach` or an `every`) so we can determine equality as fast as possible. var length = prev.length; for (var i = 0; i < length; i++) { if (!equalityCheck(prev[i], next[i])) { return false; } } return true; }; } // defaultMemoize now supports a configurable cache size with LRU behavior, // and optional comparison of the result value with existing values function defaultMemoize(func, equalityCheckOrOptions) { var providedOptions = typeof equalityCheckOrOptions === 'object' ? equalityCheckOrOptions : { equalityCheck: equalityCheckOrOptions }; var _providedOptions$equa = providedOptions.equalityCheck, equalityCheck = _providedOptions$equa === void 0 ? defaultEqualityCheck : _providedOptions$equa, _providedOptions$maxS = providedOptions.maxSize, maxSize = _providedOptions$maxS === void 0 ? 1 : _providedOptions$maxS, resultEqualityCheck = providedOptions.resultEqualityCheck; var comparator = createCacheKeyComparator(equalityCheck); var cache = maxSize === 1 ? createSingletonCache(comparator) : createLruCache(maxSize, comparator); // we reference arguments instead of spreading them for performance reasons function memoized() { var value = cache.get(arguments); if (value === NOT_FOUND) { // @ts-ignore value = func.apply(null, arguments); if (resultEqualityCheck) { var entries = cache.getEntries(); var matchingEntry = entries.find(function (entry) { return resultEqualityCheck(entry.value, value); }); if (matchingEntry) { return matchingEntry.value; } } cache.put(arguments, value); } return value; } memoized.clearCache = function () { return cache.clear(); }; return memoized; }PK ��g[��Q�� � index.jsnu �Iw�� 'use strict'; /* * cls-bluebird * Module entry point */ // Modules var isBluebird = require('is-bluebird'); // Require Bluebird library // Ignore errors if cannot be required var Bluebird; try { Bluebird = require('bluebird'); } catch (err) {} // Imports var shimMethod = require('./shimMethod'), shimOnCancel = require('./shimOnCancel'), shimCall = require('./shimCall'), shimUsing = require('./shimUsing'), shimCoroutine = require('./shimCoroutine'); // Exports /** * Patch bluebird to run maintain CLS context for a specific namespace. * If a Bluebird Promise constructor is provided, it is patched. * If not provided, the version returned by `require('bluebird')` is used. * * @param {Object} ns - CLS namespace object * @param {Function} [Promise] - Bluebird Promise constructor to patch (optional) * @returns {Function} - Bluebird Promise constructor * @throws {TypeError} - If `ns` or `Promise` are not of correct type * @throws {Error} - If `Promise` not provided and cannot require `bluebird` module */ module.exports = function patchBluebird(ns, Promise) { // Check namespace is valid if (!ns || typeof ns !== 'object' || typeof ns.bind !== 'function' || typeof ns.run !== 'function') throw new TypeError('Must provide CLS namespace to patch Bluebird against'); // Check Promise implementation is some variation of Bluebird // If none provided, use default Bluebird if (!Promise) { Promise = Bluebird; if (!Promise) throw new Error('Could not require Bluebird'); } else if (!isBluebird.ctor(Promise)) { throw new TypeError('Promise implementation provided must be Bluebird'); } // Patch all methods to carry CLS context var v3 = isBluebird.ctor.v3(Promise); /* * Core * * Not patched as always run callback synchronously: * new Promise() * Promise.try() / Promise.attempt() * * Not patched as do not take a callback: * Promise.bind() / .bind() * Promise.resolve() / Promise.fulfilled() / Promise.cast() * Promise.reject() / Promise.rejected() * * Not patched as call another patched method synchronously * .error() - calls .catch() * * Not patched as are wrappers: * Promise.method() * * NB Due to bug in bluebird v2 https://github.com/petkaantonov/bluebird/issues/1153 * `Promise.join()` calls the callback synchronously if input is only values or * resolved promises, but async if any promises are pending. * So handler is sometimes bound to CLS context unnecessarily, but this does no harm * beyond the very slight performance overhead of an extra `ns.bind()` call. */ shimProto('then', v3 ? [0, 1] : [0, 1, 2]); shimProto('spread', v3 ? [0] : [0, 1]); shimProto('finally', [0]); Promise.prototype.lastly = Promise.prototype.finally; shimStatic('join', [-1]); if (!v3) { // Only patched in bluebird v2. // In bluebird v3 `.catch()` calls `.then()` immediately which binds callback. shimProto('catch', [-1]); Promise.prototype.caught = Promise.prototype.catch; } /* * Synchronous inspection * * Not patched as do not take a callback: * .isFulfilled() * .isRejected() * .isPending() * .isCancelled() * .isResolved() * .value() * .reason() * .reflect() */ /* * Collections * * Not patched as do not take a callback: * Promise.all() / .all() * Promise.props() / .props() * Promise.any() / .any() * Promise.some() / .some() * Promise.race() / .race() */ shimBoth('map', [0]); shimBoth('filter', [0]); shimBoth('reduce', [0]); shimBoth('each', [0]); // In bluebird v2, there is no `Promise.mapSeries()`/`.mapSeries()` method if (v3) shimBoth('mapSeries', [0]); /* * Resource management * * NB disposer callbacks are bound to context at time disposer created, not when utilized in `using()` */ shimUsing(Promise, ns, v3); // shims `Promise.using()` shimProto('disposer', [0]); /* * Promisification * * Not patched as always run callback synchronously: * Promise.fromCallback() * Promise.fromNode() * * Not patched as they are wrappers: * Promise.promisify() * Promise.promisifyAll() */ shimProto('asCallback', [0]); Promise.prototype.nodeify = Promise.prototype.asCallback; /* * Timers * * Not patched as do not take a callback: * Promise.delay() / .delay() * .timeout() */ /* * Cancellation * * Not patched as does not take a callback: * .cancel() / .break() * .isCancellable() * .cancellable() (bluebird v2 only) * .uncancellable() (bluebird v2 only) * * NB In bluebird v3 `onCancel` handler will be called * in CLS context of call to `onCancel()`. */ // Patch `Promise.prototype._resolveFromExecutor` // in order to patch `onCancel` handler in `new Promise()`. if (v3) shimOnCancel(Promise, ns); /* * Generators * * Not patched as does not take a callback: * Promise.coroutine.addYieldHandler() * * NB `options.yieldHandler` will run in whatever CLS context is active at time of `yield` */ var addYieldHandler = Promise.coroutine.addYieldHandler; shimCoroutine('coroutine', Promise, ns, v3); // shims `Promise.coroutine()` Promise.coroutine.addYieldHandler = addYieldHandler; /* * Utility * * Not patched as do not take a callback: * .get() * .return() / .thenReturn() * .throw() / .thenThrow() * .catchReturn() * .catchThrow() * Promise.getNewLibraryCopy() * Promise.noConflict() * Promise.setScheduler() */ shimProto('tap', [0]); if (v3) shimProto('tapCatch', [-1]); shimCall(Promise, ns); // shims `.call()` /* * Configuration * * Not patched as do not take a callback: * Promise.config() * .suppressUnhandledRejections() * Promise.longStackTraces() * Promise.hasLongStackTraces() * * Not patched as meaningless to do so: * Promise.onPossiblyUnhandledRejection() * Promise.onUnhandledRejectionHandled() * * NB Error handlers will run with unknown CLS context. * CLS context should not be relied upon to be the context at the time error was thrown. * Catch errors with `.catch()` instead! */ shimProto('done', v3 ? [0, 1] : [0, 1, 2]); /* * Progression (bluebird v2 only) */ if (!v3) shimProto('progressed', [0]); /* * Undocumented * * Not patched as do not take a callback: * Promise.is() * Promise.settle() / .settle() * Promise.defer() / Promise.pending() * .toString() * .toJSON() */ // `.fork()` does not exist in bluebird v3 if (!v3) shimProto('fork', [0, 1, 2]); shimCoroutine('spawn', Promise, ns, v3); // shims `Promise.spawn()` // Return patched Bluebird constructor return Promise; /* * Patching functions */ function shimStatic(methodName, args) { shimMethod(Promise, methodName, args, ns); } function shimProto(methodName, args) { shimMethod(Promise.prototype, methodName, args, ns); } function shimBoth(methodName, args) { shimProto(methodName, args); shimStatic(methodName, args.map(function(arg) { return arg < 0 ? arg : arg + 1; })); } }; PK ��g[A�M� addStyleUrl.jsnu �Iw�� /* MIT License http://www.opensource.org/licenses/mit-license.php Author Tobias Koppers @sokra */ function addAttrs (element, attrs) { Object.keys(attrs).forEach(function (key) { element.setAttribute(key, attrs[key]); }); } module.exports = function addStyleUrl (url, options) { if (typeof DEBUG !== "undefined" && DEBUG) { if (typeof document !== "object") throw new Error("The style-loader cannot be used in a non-browser environment"); } options = options || {}; options.attrs = typeof options.attrs === "object" ? options.attrs : {}; options.hmr = typeof options.hmr === 'undefined' ? true : options.hmr; var link = document.createElement("link"); link.rel = "stylesheet"; link.type = "text/css"; link.href = url; addAttrs(link, options.attrs); var head = document.getElementsByTagName("head")[0]; head.appendChild(link); if (options.hmr && module.hot) { return function(url) { if(typeof url === "string") { link.href = url; } else { head.removeChild(link); } }; } } PK ��g[_0�$�( �( addStyles.jsnu �Iw�� /* MIT License http://www.opensource.org/licenses/mit-license.php Author Tobias Koppers @sokra */ var stylesInDom = {}; var memoize = function (fn) { var memo; return function () { if (typeof memo === "undefined") memo = fn.apply(this, arguments); return memo; }; }; var isOldIE = memoize(function () { // Test for IE <= 9 as proposed by Browserhacks // @see http://browserhacks.com/#hack-e71d8692f65334173fee715c222cb805 // Tests for existence of standard globals is to allow style-loader // to operate correctly into non-standard environments // @see https://github.com/webpack-contrib/style-loader/issues/177 return window && document && document.all && !window.atob; }); var getTarget = function (target, parent) { if (parent){ return parent.querySelector(target); } return document.querySelector(target); }; var getElement = (function (fn) { var memo = {}; return function(target, parent) { // If passing function in options, then use it for resolve "head" element. // Useful for Shadow Root style i.e // { // insertInto: function () { return document.querySelector("#foo").shadowRoot } // } if (typeof target === 'function') { return target(); } if (typeof memo[target] === "undefined") { var styleTarget = getTarget.call(this, target, parent); // Special case to return head of iframe instead of iframe itself if (window.HTMLIFrameElement && styleTarget instanceof window.HTMLIFrameElement) { try { // This will throw an exception if access to iframe is blocked // due to cross-origin restrictions styleTarget = styleTarget.contentDocument.head; } catch(e) { styleTarget = null; } } memo[target] = styleTarget; } return memo[target] }; })(); var singleton = null; var singletonCounter = 0; var stylesInsertedAtTop = []; var fixUrls = require("./urls"); module.exports = function(list, options) { if (typeof DEBUG !== "undefined" && DEBUG) { if (typeof document !== "object") throw new Error("The style-loader cannot be used in a non-browser environment"); } options = options || {}; options.attrs = typeof options.attrs === "object" ? options.attrs : {}; // Force single-tag solution on IE6-9, which has a hard limit on the # of <style> // tags it will allow on a page if (!options.singleton && typeof options.singleton !== "boolean") options.singleton = isOldIE(); // By default, add <style> tags to the <head> element if (!options.insertInto) options.insertInto = "head"; // By default, add <style> tags to the bottom of the target if (!options.insertAt) options.insertAt = "bottom"; var styles = listToStyles(list, options); addStylesToDom(styles, options); return function update (newList) { var mayRemove = []; for (var i = 0; i < styles.length; i++) { var item = styles[i]; var domStyle = stylesInDom[item.id]; domStyle.refs--; mayRemove.push(domStyle); } if(newList) { var newStyles = listToStyles(newList, options); addStylesToDom(newStyles, options); } for (var i = 0; i < mayRemove.length; i++) { var domStyle = mayRemove[i]; if(domStyle.refs === 0) { for (var j = 0; j < domStyle.parts.length; j++) domStyle.parts[j](); delete stylesInDom[domStyle.id]; } } }; }; function addStylesToDom (styles, options) { for (var i = 0; i < styles.length; i++) { var item = styles[i]; var domStyle = stylesInDom[item.id]; if(domStyle) { domStyle.refs++; for(var j = 0; j < domStyle.parts.length; j++) { domStyle.parts[j](item.parts[j]); } for(; j < item.parts.length; j++) { domStyle.parts.push(addStyle(item.parts[j], options)); } } else { var parts = []; for(var j = 0; j < item.parts.length; j++) { parts.push(addStyle(item.parts[j], options)); } stylesInDom[item.id] = {id: item.id, refs: 1, parts: parts}; } } } function listToStyles (list, options) { var styles = []; var newStyles = {}; for (var i = 0; i < list.length; i++) { var item = list[i]; var id = options.base ? item[0] + options.base : item[0]; var css = item[1]; var media = item[2]; var sourceMap = item[3]; var part = {css: css, media: media, sourceMap: sourceMap}; if(!newStyles[id]) styles.push(newStyles[id] = {id: id, parts: [part]}); else newStyles[id].parts.push(part); } return styles; } function insertStyleElement (options, style) { var target = getElement(options.insertInto) if (!target) { throw new Error("Couldn't find a style target. This probably means that the value for the 'insertInto' parameter is invalid."); } var lastStyleElementInsertedAtTop = stylesInsertedAtTop[stylesInsertedAtTop.length - 1]; if (options.insertAt === "top") { if (!lastStyleElementInsertedAtTop) { target.insertBefore(style, target.firstChild); } else if (lastStyleElementInsertedAtTop.nextSibling) { target.insertBefore(style, lastStyleElementInsertedAtTop.nextSibling); } else { target.appendChild(style); } stylesInsertedAtTop.push(style); } else if (options.insertAt === "bottom") { target.appendChild(style); } else if (typeof options.insertAt === "object" && options.insertAt.before) { var nextSibling = getElement(options.insertAt.before, target); target.insertBefore(style, nextSibling); } else { throw new Error("[Style Loader]\n\n Invalid value for parameter 'insertAt' ('options.insertAt') found.\n Must be 'top', 'bottom', or Object.\n (https://github.com/webpack-contrib/style-loader#insertat)\n"); } } function removeStyleElement (style) { if (style.parentNode === null) return false; style.parentNode.removeChild(style); var idx = stylesInsertedAtTop.indexOf(style); if(idx >= 0) { stylesInsertedAtTop.splice(idx, 1); } } function createStyleElement (options) { var style = document.createElement("style"); if(options.attrs.type === undefined) { options.attrs.type = "text/css"; } if(options.attrs.nonce === undefined) { var nonce = getNonce(); if (nonce) { options.attrs.nonce = nonce; } } addAttrs(style, options.attrs); insertStyleElement(options, style); return style; } function createLinkElement (options) { var link = document.createElement("link"); if(options.attrs.type === undefined) { options.attrs.type = "text/css"; } options.attrs.rel = "stylesheet"; addAttrs(link, options.attrs); insertStyleElement(options, link); return link; } function addAttrs (el, attrs) { Object.keys(attrs).forEach(function (key) { el.setAttribute(key, attrs[key]); }); } function getNonce() { if (typeof __webpack_nonce__ === 'undefined') { return null; } return __webpack_nonce__; } function addStyle (obj, options) { var style, update, remove, result; // If a transform function was defined, run it on the css if (options.transform && obj.css) { result = typeof options.transform === 'function' ? options.transform(obj.css) : options.transform.default(obj.css); if (result) { // If transform returns a value, use that instead of the original css. // This allows running runtime transformations on the css. obj.css = result; } else { // If the transform function returns a falsy value, don't add this css. // This allows conditional loading of css return function() { // noop }; } } if (options.singleton) { var styleIndex = singletonCounter++; style = singleton || (singleton = createStyleElement(options)); update = applyToSingletonTag.bind(null, style, styleIndex, false); remove = applyToSingletonTag.bind(null, style, styleIndex, true); } else if ( obj.sourceMap && typeof URL === "function" && typeof URL.createObjectURL === "function" && typeof URL.revokeObjectURL === "function" && typeof Blob === "function" && typeof btoa === "function" ) { style = createLinkElement(options); update = updateLink.bind(null, style, options); remove = function () { removeStyleElement(style); if(style.href) URL.revokeObjectURL(style.href); }; } else { style = createStyleElement(options); update = applyToTag.bind(null, style); remove = function () { removeStyleElement(style); }; } update(obj); return function updateStyle (newObj) { if (newObj) { if ( newObj.css === obj.css && newObj.media === obj.media && newObj.sourceMap === obj.sourceMap ) { return; } update(obj = newObj); } else { remove(); } }; } var replaceText = (function () { var textStore = []; return function (index, replacement) { textStore[index] = replacement; return textStore.filter(Boolean).join('\n'); }; })(); function applyToSingletonTag (style, index, remove, obj) { var css = remove ? "" : obj.css; if (style.styleSheet) { style.styleSheet.cssText = replaceText(index, css); } else { var cssNode = document.createTextNode(css); var childNodes = style.childNodes; if (childNodes[index]) style.removeChild(childNodes[index]); if (childNodes.length) { style.insertBefore(cssNode, childNodes[index]); } else { style.appendChild(cssNode); } } } function applyToTag (style, obj) { var css = obj.css; var media = obj.media; if(media) { style.setAttribute("media", media) } if(style.styleSheet) { style.styleSheet.cssText = css; } else { while(style.firstChild) { style.removeChild(style.firstChild); } style.appendChild(document.createTextNode(css)); } } function updateLink (link, options, obj) { var css = obj.css; var sourceMap = obj.sourceMap; /* If convertToAbsoluteUrls isn't defined, but sourcemaps are enabled and there is no publicPath defined then lets turn convertToAbsoluteUrls on by default. Otherwise default to the convertToAbsoluteUrls option directly */ var autoFixUrls = options.convertToAbsoluteUrls === undefined && sourceMap; if (options.convertToAbsoluteUrls || autoFixUrls) { css = fixUrls(css); } if (sourceMap) { // http://stackoverflow.com/a/26603875 css += "\n/*# sourceMappingURL=data:application/json;base64," + btoa(unescape(encodeURIComponent(JSON.stringify(sourceMap)))) + " */"; } var blob = new Blob([css], { type: "text/css" }); var oldSrc = link.href; link.href = URL.createObjectURL(blob); if(oldSrc) URL.revokeObjectURL(oldSrc); } PK ��g[�< G� � urls.jsnu �Iw�� /** * When source maps are enabled, `style-loader` uses a link element with a data-uri to * embed the css on the page. This breaks all relative urls because now they are relative to a * bundle instead of the current page. * * One solution is to only use full urls, but that may be impossible. * * Instead, this function "fixes" the relative urls to be absolute according to the current page location. * * A rudimentary test suite is located at `test/fixUrls.js` and can be run via the `npm test` command. * */ module.exports = function (css) { // get current location var location = typeof window !== "undefined" && window.location; if (!location) { throw new Error("fixUrls requires window.location"); } // blank or null? if (!css || typeof css !== "string") { return css; } var baseUrl = location.protocol + "//" + location.host; var currentDir = baseUrl + location.pathname.replace(/\/[^\/]*$/, "/"); // convert each url(...) /* This regular expression is just a way to recursively match brackets within a string. /url\s*\( = Match on the word "url" with any whitespace after it and then a parens ( = Start a capturing group (?: = Start a non-capturing group [^)(] = Match anything that isn't a parentheses | = OR \( = Match a start parentheses (?: = Start another non-capturing groups [^)(]+ = Match anything that isn't a parentheses | = OR \( = Match a start parentheses [^)(]* = Match anything that isn't a parentheses \) = Match a end parentheses ) = End Group *\) = Match anything and then a close parens ) = Close non-capturing group * = Match anything ) = Close capturing group \) = Match a close parens /gi = Get all matches, not the first. Be case insensitive. */ var fixedCss = css.replace(/url\s*\(((?:[^)(]|\((?:[^)(]+|\([^)(]*\))*\))*)\)/gi, function(fullMatch, origUrl) { // strip quotes (if they exist) var unquotedOrigUrl = origUrl .trim() .replace(/^"(.*)"$/, function(o, $1){ return $1; }) .replace(/^'(.*)'$/, function(o, $1){ return $1; }); // already a full url? no change if (/^(#|data:|http:\/\/|https:\/\/|file:\/\/\/|\s*$)/i.test(unquotedOrigUrl)) { return fullMatch; } // convert the url to a full url var newUrl; if (unquotedOrigUrl.indexOf("//") === 0) { //TODO: should we add protocol? newUrl = unquotedOrigUrl; } else if (unquotedOrigUrl.indexOf("/") === 0) { // path should be relative to the base url newUrl = baseUrl + unquotedOrigUrl; // already starts with '/' } else { // path should be relative to current directory newUrl = currentDir + unquotedOrigUrl.replace(/^\.\//, ""); // Strip leading './' } // send back the fixed url(...) return "url(" + JSON.stringify(newUrl) + ")"; }); // send back the fixed css return fixedCss; }; PK u~h[J[� =a =a bn.jsnu �Iw�� (function (module, exports) { 'use strict'; // Utils function assert (val, msg) { if (!val) throw new Error(msg || 'Assertion failed'); } // Could use `inherits` module, but don't want to move from single file // architecture yet. function inherits (ctor, superCtor) { ctor.super_ = superCtor; var TempCtor = function () {}; TempCtor.prototype = superCtor.prototype; ctor.prototype = new TempCtor(); ctor.prototype.constructor = ctor; } // BN function BN (number, base, endian) { if (BN.isBN(number)) { return number; } this.negative = 0; this.words = null; this.length = 0; // Reduction context this.red = null; if (number !== null) { if (base === 'le' || base === 'be') { endian = base; base = 10; } this._init(number || 0, base || 10, endian || 'be'); } } if (typeof module === 'object') { module.exports = BN; } else { exports.BN = BN; } BN.BN = BN; BN.wordSize = 26; var Buffer; try { if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') { Buffer = window.Buffer; } else { Buffer = require('buffer').Buffer; } } catch (e) { } BN.isBN = function isBN (num) { if (num instanceof BN) { return true; } return num !== null && typeof num === 'object' && num.constructor.wordSize === BN.wordSize && Array.isArray(num.words); }; BN.max = function max (left, right) { if (left.cmp(right) > 0) return left; return right; }; BN.min = function min (left, right) { if (left.cmp(right) < 0) return left; return right; }; BN.prototype._init = function init (number, base, endian) { if (typeof number === 'number') { return this._initNumber(number, base, endian); } if (typeof number === 'object') { return this._initArray(number, base, endian); } if (base === 'hex') { base = 16; } assert(base === (base | 0) && base >= 2 && base <= 36); number = number.toString().replace(/\s+/g, ''); var start = 0; if (number[0] === '-') { start++; this.negative = 1; } if (start < number.length) { if (base === 16) { this._parseHex(number, start, endian); } else { this._parseBase(number, base, start); if (endian === 'le') { this._initArray(this.toArray(), base, endian); } } } }; BN.prototype._initNumber = function _initNumber (number, base, endian) { if (number < 0) { this.negative = 1; number = -number; } if (number < 0x4000000) { this.words = [number & 0x3ffffff]; this.length = 1; } else if (number < 0x10000000000000) { this.words = [ number & 0x3ffffff, (number / 0x4000000) & 0x3ffffff ]; this.length = 2; } else { assert(number < 0x20000000000000); // 2 ^ 53 (unsafe) this.words = [ number & 0x3ffffff, (number / 0x4000000) & 0x3ffffff, 1 ]; this.length = 3; } if (endian !== 'le') return; // Reverse the bytes this._initArray(this.toArray(), base, endian); }; BN.prototype._initArray = function _initArray (number, base, endian) { // Perhaps a Uint8Array assert(typeof number.length === 'number'); if (number.length <= 0) { this.words = [0]; this.length = 1; return this; } this.length = Math.ceil(number.length / 3); this.words = new Array(this.length); for (var i = 0; i < this.length; i++) { this.words[i] = 0; } var j, w; var off = 0; if (endian === 'be') { for (i = number.length - 1, j = 0; i >= 0; i -= 3) { w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16); this.words[j] |= (w << off) & 0x3ffffff; this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; off += 24; if (off >= 26) { off -= 26; j++; } } } else if (endian === 'le') { for (i = 0, j = 0; i < number.length; i += 3) { w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16); this.words[j] |= (w << off) & 0x3ffffff; this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; off += 24; if (off >= 26) { off -= 26; j++; } } } return this._strip(); }; function parseHex4Bits (string, index) { var c = string.charCodeAt(index); // '0' - '9' if (c >= 48 && c <= 57) { return c - 48; // 'A' - 'F' } else if (c >= 65 && c <= 70) { return c - 55; // 'a' - 'f' } else if (c >= 97 && c <= 102) { return c - 87; } else { assert(false, 'Invalid character in ' + string); } } function parseHexByte (string, lowerBound, index) { var r = parseHex4Bits(string, index); if (index - 1 >= lowerBound) { r |= parseHex4Bits(string, index - 1) << 4; } return r; } BN.prototype._parseHex = function _parseHex (number, start, endian) { // Create possibly bigger array to ensure that it fits the number this.length = Math.ceil((number.length - start) / 6); this.words = new Array(this.length); for (var i = 0; i < this.length; i++) { this.words[i] = 0; } // 24-bits chunks var off = 0; var j = 0; var w; if (endian === 'be') { for (i = number.length - 1; i >= start; i -= 2) { w = parseHexByte(number, start, i) << off; this.words[j] |= w & 0x3ffffff; if (off >= 18) { off -= 18; j += 1; this.words[j] |= w >>> 26; } else { off += 8; } } } else { var parseLength = number.length - start; for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) { w = parseHexByte(number, start, i) << off; this.words[j] |= w & 0x3ffffff; if (off >= 18) { off -= 18; j += 1; this.words[j] |= w >>> 26; } else { off += 8; } } } this._strip(); }; function parseBase (str, start, end, mul) { var r = 0; var b = 0; var len = Math.min(str.length, end); for (var i = start; i < len; i++) { var c = str.charCodeAt(i) - 48; r *= mul; // 'a' if (c >= 49) { b = c - 49 + 0xa; // 'A' } else if (c >= 17) { b = c - 17 + 0xa; // '0' - '9' } else { b = c; } assert(c >= 0 && b < mul, 'Invalid character'); r += b; } return r; } BN.prototype._parseBase = function _parseBase (number, base, start) { // Initialize as zero this.words = [0]; this.length = 1; // Find length of limb in base for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) { limbLen++; } limbLen--; limbPow = (limbPow / base) | 0; var total = number.length - start; var mod = total % limbLen; var end = Math.min(total, total - mod) + start; var word = 0; for (var i = start; i < end; i += limbLen) { word = parseBase(number, i, i + limbLen, base); this.imuln(limbPow); if (this.words[0] + word < 0x4000000) { this.words[0] += word; } else { this._iaddn(word); } } if (mod !== 0) { var pow = 1; word = parseBase(number, i, number.length, base); for (i = 0; i < mod; i++) { pow *= base; } this.imuln(pow); if (this.words[0] + word < 0x4000000) { this.words[0] += word; } else { this._iaddn(word); } } this._strip(); }; BN.prototype.copy = function copy (dest) { dest.words = new Array(this.length); for (var i = 0; i < this.length; i++) { dest.words[i] = this.words[i]; } dest.length = this.length; dest.negative = this.negative; dest.red = this.red; }; function move (dest, src) { dest.words = src.words; dest.length = src.length; dest.negative = src.negative; dest.red = src.red; } BN.prototype._move = function _move (dest) { move(dest, this); }; BN.prototype.clone = function clone () { var r = new BN(null); this.copy(r); return r; }; BN.prototype._expand = function _expand (size) { while (this.length < size) { this.words[this.length++] = 0; } return this; }; // Remove leading `0` from `this` BN.prototype._strip = function strip () { while (this.length > 1 && this.words[this.length - 1] === 0) { this.length--; } return this._normSign(); }; BN.prototype._normSign = function _normSign () { // -0 = 0 if (this.length === 1 && this.words[0] === 0) { this.negative = 0; } return this; }; // Check Symbol.for because not everywhere where Symbol defined // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') { try { BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect; } catch (e) { BN.prototype.inspect = inspect; } } else { BN.prototype.inspect = inspect; } function inspect () { return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>'; } /* var zeros = []; var groupSizes = []; var groupBases = []; var s = ''; var i = -1; while (++i < BN.wordSize) { zeros[i] = s; s += '0'; } groupSizes[0] = 0; groupSizes[1] = 0; groupBases[0] = 0; groupBases[1] = 0; var base = 2 - 1; while (++base < 36 + 1) { var groupSize = 0; var groupBase = 1; while (groupBase < (1 << BN.wordSize) / base) { groupBase *= base; groupSize += 1; } groupSizes[base] = groupSize; groupBases[base] = groupBase; } */ var zeros = [ '', '0', '00', '000', '0000', '00000', '000000', '0000000', '00000000', '000000000', '0000000000', '00000000000', '000000000000', '0000000000000', '00000000000000', '000000000000000', '0000000000000000', '00000000000000000', '000000000000000000', '0000000000000000000', '00000000000000000000', '000000000000000000000', '0000000000000000000000', '00000000000000000000000', '000000000000000000000000', '0000000000000000000000000' ]; var groupSizes = [ 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5 ]; var groupBases = [ 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632, 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149, 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176 ]; BN.prototype.toString = function toString (base, padding) { base = base || 10; padding = padding | 0 || 1; var out; if (base === 16 || base === 'hex') { out = ''; var off = 0; var carry = 0; for (var i = 0; i < this.length; i++) { var w = this.words[i]; var word = (((w << off) | carry) & 0xffffff).toString(16); carry = (w >>> (24 - off)) & 0xffffff; if (carry !== 0 || i !== this.length - 1) { out = zeros[6 - word.length] + word + out; } else { out = word + out; } off += 2; if (off >= 26) { off -= 26; i--; } } if (carry !== 0) { out = carry.toString(16) + out; } while (out.length % padding !== 0) { out = '0' + out; } if (this.negative !== 0) { out = '-' + out; } return out; } if (base === (base | 0) && base >= 2 && base <= 36) { // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base)); var groupSize = groupSizes[base]; // var groupBase = Math.pow(base, groupSize); var groupBase = groupBases[base]; out = ''; var c = this.clone(); c.negative = 0; while (!c.isZero()) { var r = c.modrn(groupBase).toString(base); c = c.idivn(groupBase); if (!c.isZero()) { out = zeros[groupSize - r.length] + r + out; } else { out = r + out; } } if (this.isZero()) { out = '0' + out; } while (out.length % padding !== 0) { out = '0' + out; } if (this.negative !== 0) { out = '-' + out; } return out; } assert(false, 'Base should be between 2 and 36'); }; BN.prototype.toNumber = function toNumber () { var ret = this.words[0]; if (this.length === 2) { ret += this.words[1] * 0x4000000; } else if (this.length === 3 && this.words[2] === 0x01) { // NOTE: at this stage it is known that the top bit is set ret += 0x10000000000000 + (this.words[1] * 0x4000000); } else if (this.length > 2) { assert(false, 'Number can only safely store up to 53 bits'); } return (this.negative !== 0) ? -ret : ret; }; BN.prototype.toJSON = function toJSON () { return this.toString(16, 2); }; if (Buffer) { BN.prototype.toBuffer = function toBuffer (endian, length) { return this.toArrayLike(Buffer, endian, length); }; } BN.prototype.toArray = function toArray (endian, length) { return this.toArrayLike(Array, endian, length); }; var allocate = function allocate (ArrayType, size) { if (ArrayType.allocUnsafe) { return ArrayType.allocUnsafe(size); } return new ArrayType(size); }; BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) { this._strip(); var byteLength = this.byteLength(); var reqLength = length || Math.max(1, byteLength); assert(byteLength <= reqLength, 'byte array longer than desired length'); assert(reqLength > 0, 'Requested array length <= 0'); var res = allocate(ArrayType, reqLength); var postfix = endian === 'le' ? 'LE' : 'BE'; this['_toArrayLike' + postfix](res, byteLength); return res; }; BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) { var position = 0; var carry = 0; for (var i = 0, shift = 0; i < this.length; i++) { var word = (this.words[i] << shift) | carry; res[position++] = word & 0xff; if (position < res.length) { res[position++] = (word >> 8) & 0xff; } if (position < res.length) { res[position++] = (word >> 16) & 0xff; } if (shift === 6) { if (position < res.length) { res[position++] = (word >> 24) & 0xff; } carry = 0; shift = 0; } else { carry = word >>> 24; shift += 2; } } if (position < res.length) { res[position++] = carry; while (position < res.length) { res[position++] = 0; } } }; BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) { var position = res.length - 1; var carry = 0; for (var i = 0, shift = 0; i < this.length; i++) { var word = (this.words[i] << shift) | carry; res[position--] = word & 0xff; if (position >= 0) { res[position--] = (word >> 8) & 0xff; } if (position >= 0) { res[position--] = (word >> 16) & 0xff; } if (shift === 6) { if (position >= 0) { res[position--] = (word >> 24) & 0xff; } carry = 0; shift = 0; } else { carry = word >>> 24; shift += 2; } } if (position >= 0) { res[position--] = carry; while (position >= 0) { res[position--] = 0; } } }; if (Math.clz32) { BN.prototype._countBits = function _countBits (w) { return 32 - Math.clz32(w); }; } else { BN.prototype._countBits = function _countBits (w) { var t = w; var r = 0; if (t >= 0x1000) { r += 13; t >>>= 13; } if (t >= 0x40) { r += 7; t >>>= 7; } if (t >= 0x8) { r += 4; t >>>= 4; } if (t >= 0x02) { r += 2; t >>>= 2; } return r + t; }; } BN.prototype._zeroBits = function _zeroBits (w) { // Short-cut if (w === 0) return 26; var t = w; var r = 0; if ((t & 0x1fff) === 0) { r += 13; t >>>= 13; } if ((t & 0x7f) === 0) { r += 7; t >>>= 7; } if ((t & 0xf) === 0) { r += 4; t >>>= 4; } if ((t & 0x3) === 0) { r += 2; t >>>= 2; } if ((t & 0x1) === 0) { r++; } return r; }; // Return number of used bits in a BN BN.prototype.bitLength = function bitLength () { var w = this.words[this.length - 1]; var hi = this._countBits(w); return (this.length - 1) * 26 + hi; }; function toBitArray (num) { var w = new Array(num.bitLength()); for (var bit = 0; bit < w.length; bit++) { var off = (bit / 26) | 0; var wbit = bit % 26; w[bit] = (num.words[off] >>> wbit) & 0x01; } return w; } // Number of trailing zero bits BN.prototype.zeroBits = function zeroBits () { if (this.isZero()) return 0; var r = 0; for (var i = 0; i < this.length; i++) { var b = this._zeroBits(this.words[i]); r += b; if (b !== 26) break; } return r; }; BN.prototype.byteLength = function byteLength () { return Math.ceil(this.bitLength() / 8); }; BN.prototype.toTwos = function toTwos (width) { if (this.negative !== 0) { return this.abs().inotn(width).iaddn(1); } return this.clone(); }; BN.prototype.fromTwos = function fromTwos (width) { if (this.testn(width - 1)) { return this.notn(width).iaddn(1).ineg(); } return this.clone(); }; BN.prototype.isNeg = function isNeg () { return this.negative !== 0; }; // Return negative clone of `this` BN.prototype.neg = function neg () { return this.clone().ineg(); }; BN.prototype.ineg = function ineg () { if (!this.isZero()) { this.negative ^= 1; } return this; }; // Or `num` with `this` in-place BN.prototype.iuor = function iuor (num) { while (this.length < num.length) { this.words[this.length++] = 0; } for (var i = 0; i < num.length; i++) { this.words[i] = this.words[i] | num.words[i]; } return this._strip(); }; BN.prototype.ior = function ior (num) { assert((this.negative | num.negative) === 0); return this.iuor(num); }; // Or `num` with `this` BN.prototype.or = function or (num) { if (this.length > num.length) return this.clone().ior(num); return num.clone().ior(this); }; BN.prototype.uor = function uor (num) { if (this.length > num.length) return this.clone().iuor(num); return num.clone().iuor(this); }; // And `num` with `this` in-place BN.prototype.iuand = function iuand (num) { // b = min-length(num, this) var b; if (this.length > num.length) { b = num; } else { b = this; } for (var i = 0; i < b.length; i++) { this.words[i] = this.words[i] & num.words[i]; } this.length = b.length; return this._strip(); }; BN.prototype.iand = function iand (num) { assert((this.negative | num.negative) === 0); return this.iuand(num); }; // And `num` with `this` BN.prototype.and = function and (num) { if (this.length > num.length) return this.clone().iand(num); return num.clone().iand(this); }; BN.prototype.uand = function uand (num) { if (this.length > num.length) return this.clone().iuand(num); return num.clone().iuand(this); }; // Xor `num` with `this` in-place BN.prototype.iuxor = function iuxor (num) { // a.length > b.length var a; var b; if (this.length > num.length) { a = this; b = num; } else { a = num; b = this; } for (var i = 0; i < b.length; i++) { this.words[i] = a.words[i] ^ b.words[i]; } if (this !== a) { for (; i < a.length; i++) { this.words[i] = a.words[i]; } } this.length = a.length; return this._strip(); }; BN.prototype.ixor = function ixor (num) { assert((this.negative | num.negative) === 0); return this.iuxor(num); }; // Xor `num` with `this` BN.prototype.xor = function xor (num) { if (this.length > num.length) return this.clone().ixor(num); return num.clone().ixor(this); }; BN.prototype.uxor = function uxor (num) { if (this.length > num.length) return this.clone().iuxor(num); return num.clone().iuxor(this); }; // Not ``this`` with ``width`` bitwidth BN.prototype.inotn = function inotn (width) { assert(typeof width === 'number' && width >= 0); var bytesNeeded = Math.ceil(width / 26) | 0; var bitsLeft = width % 26; // Extend the buffer with leading zeroes this._expand(bytesNeeded); if (bitsLeft > 0) { bytesNeeded--; } // Handle complete words for (var i = 0; i < bytesNeeded; i++) { this.words[i] = ~this.words[i] & 0x3ffffff; } // Handle the residue if (bitsLeft > 0) { this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft)); } // And remove leading zeroes return this._strip(); }; BN.prototype.notn = function notn (width) { return this.clone().inotn(width); }; // Set `bit` of `this` BN.prototype.setn = function setn (bit, val) { assert(typeof bit === 'number' && bit >= 0); var off = (bit / 26) | 0; var wbit = bit % 26; this._expand(off + 1); if (val) { this.words[off] = this.words[off] | (1 << wbit); } else { this.words[off] = this.words[off] & ~(1 << wbit); } return this._strip(); }; // Add `num` to `this` in-place BN.prototype.iadd = function iadd (num) { var r; // negative + positive if (this.negative !== 0 && num.negative === 0) { this.negative = 0; r = this.isub(num); this.negative ^= 1; return this._normSign(); // positive + negative } else if (this.negative === 0 && num.negative !== 0) { num.negative = 0; r = this.isub(num); num.negative = 1; return r._normSign(); } // a.length > b.length var a, b; if (this.length > num.length) { a = this; b = num; } else { a = num; b = this; } var carry = 0; for (var i = 0; i < b.length; i++) { r = (a.words[i] | 0) + (b.words[i] | 0) + carry; this.words[i] = r & 0x3ffffff; carry = r >>> 26; } for (; carry !== 0 && i < a.length; i++) { r = (a.words[i] | 0) + carry; this.words[i] = r & 0x3ffffff; carry = r >>> 26; } this.length = a.length; if (carry !== 0) { this.words[this.length] = carry; this.length++; // Copy the rest of the words } else if (a !== this) { for (; i < a.length; i++) { this.words[i] = a.words[i]; } } return this; }; // Add `num` to `this` BN.prototype.add = function add (num) { var res; if (num.negative !== 0 && this.negative === 0) { num.negative = 0; res = this.sub(num); num.negative ^= 1; return res; } else if (num.negative === 0 && this.negative !== 0) { this.negative = 0; res = num.sub(this); this.negative = 1; return res; } if (this.length > num.length) return this.clone().iadd(num); return num.clone().iadd(this); }; // Subtract `num` from `this` in-place BN.prototype.isub = function isub (num) { // this - (-num) = this + num if (num.negative !== 0) { num.negative = 0; var r = this.iadd(num); num.negative = 1; return r._normSign(); // -this - num = -(this + num) } else if (this.negative !== 0) { this.negative = 0; this.iadd(num); this.negative = 1; return this._normSign(); } // At this point both numbers are positive var cmp = this.cmp(num); // Optimization - zeroify if (cmp === 0) { this.negative = 0; this.length = 1; this.words[0] = 0; return this; } // a > b var a, b; if (cmp > 0) { a = this; b = num; } else { a = num; b = this; } var carry = 0; for (var i = 0; i < b.length; i++) { r = (a.words[i] | 0) - (b.words[i] | 0) + carry; carry = r >> 26; this.words[i] = r & 0x3ffffff; } for (; carry !== 0 && i < a.length; i++) { r = (a.words[i] | 0) + carry; carry = r >> 26; this.words[i] = r & 0x3ffffff; } // Copy rest of the words if (carry === 0 && i < a.length && a !== this) { for (; i < a.length; i++) { this.words[i] = a.words[i]; } } this.length = Math.max(this.length, i); if (a !== this) { this.negative = 1; } return this._strip(); }; // Subtract `num` from `this` BN.prototype.sub = function sub (num) { return this.clone().isub(num); }; function smallMulTo (self, num, out) { out.negative = num.negative ^ self.negative; var len = (self.length + num.length) | 0; out.length = len; len = (len - 1) | 0; // Peel one iteration (compiler can't do it, because of code complexity) var a = self.words[0] | 0; var b = num.words[0] | 0; var r = a * b; var lo = r & 0x3ffffff; var carry = (r / 0x4000000) | 0; out.words[0] = lo; for (var k = 1; k < len; k++) { // Sum all words with the same `i + j = k` and accumulate `ncarry`, // note that ncarry could be >= 0x3ffffff var ncarry = carry >>> 26; var rword = carry & 0x3ffffff; var maxJ = Math.min(k, num.length - 1); for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { var i = (k - j) | 0; a = self.words[i] | 0; b = num.words[j] | 0; r = a * b + rword; ncarry += (r / 0x4000000) | 0; rword = r & 0x3ffffff; } out.words[k] = rword | 0; carry = ncarry | 0; } if (carry !== 0) { out.words[k] = carry | 0; } else { out.length--; } return out._strip(); } // TODO(indutny): it may be reasonable to omit it for users who don't need // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit // multiplication (like elliptic secp256k1). var comb10MulTo = function comb10MulTo (self, num, out) { var a = self.words; var b = num.words; var o = out.words; var c = 0; var lo; var mid; var hi; var a0 = a[0] | 0; var al0 = a0 & 0x1fff; var ah0 = a0 >>> 13; var a1 = a[1] | 0; var al1 = a1 & 0x1fff; var ah1 = a1 >>> 13; var a2 = a[2] | 0; var al2 = a2 & 0x1fff; var ah2 = a2 >>> 13; var a3 = a[3] | 0; var al3 = a3 & 0x1fff; var ah3 = a3 >>> 13; var a4 = a[4] | 0; var al4 = a4 & 0x1fff; var ah4 = a4 >>> 13; var a5 = a[5] | 0; var al5 = a5 & 0x1fff; var ah5 = a5 >>> 13; var a6 = a[6] | 0; var al6 = a6 & 0x1fff; var ah6 = a6 >>> 13; var a7 = a[7] | 0; var al7 = a7 & 0x1fff; var ah7 = a7 >>> 13; var a8 = a[8] | 0; var al8 = a8 & 0x1fff; var ah8 = a8 >>> 13; var a9 = a[9] | 0; var al9 = a9 & 0x1fff; var ah9 = a9 >>> 13; var b0 = b[0] | 0; var bl0 = b0 & 0x1fff; var bh0 = b0 >>> 13; var b1 = b[1] | 0; var bl1 = b1 & 0x1fff; var bh1 = b1 >>> 13; var b2 = b[2] | 0; var bl2 = b2 & 0x1fff; var bh2 = b2 >>> 13; var b3 = b[3] | 0; var bl3 = b3 & 0x1fff; var bh3 = b3 >>> 13; var b4 = b[4] | 0; var bl4 = b4 & 0x1fff; var bh4 = b4 >>> 13; var b5 = b[5] | 0; var bl5 = b5 & 0x1fff; var bh5 = b5 >>> 13; var b6 = b[6] | 0; var bl6 = b6 & 0x1fff; var bh6 = b6 >>> 13; var b7 = b[7] | 0; var bl7 = b7 & 0x1fff; var bh7 = b7 >>> 13; var b8 = b[8] | 0; var bl8 = b8 & 0x1fff; var bh8 = b8 >>> 13; var b9 = b[9] | 0; var bl9 = b9 & 0x1fff; var bh9 = b9 >>> 13; out.negative = self.negative ^ num.negative; out.length = 19; /* k = 0 */ lo = Math.imul(al0, bl0); mid = Math.imul(al0, bh0); mid = (mid + Math.imul(ah0, bl0)) | 0; hi = Math.imul(ah0, bh0); var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0; w0 &= 0x3ffffff; /* k = 1 */ lo = Math.imul(al1, bl0); mid = Math.imul(al1, bh0); mid = (mid + Math.imul(ah1, bl0)) | 0; hi = Math.imul(ah1, bh0); lo = (lo + Math.imul(al0, bl1)) | 0; mid = (mid + Math.imul(al0, bh1)) | 0; mid = (mid + Math.imul(ah0, bl1)) | 0; hi = (hi + Math.imul(ah0, bh1)) | 0; var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0; w1 &= 0x3ffffff; /* k = 2 */ lo = Math.imul(al2, bl0); mid = Math.imul(al2, bh0); mid = (mid + Math.imul(ah2, bl0)) | 0; hi = Math.imul(ah2, bh0); lo = (lo + Math.imul(al1, bl1)) | 0; mid = (mid + Math.imul(al1, bh1)) | 0; mid = (mid + Math.imul(ah1, bl1)) | 0; hi = (hi + Math.imul(ah1, bh1)) | 0; lo = (lo + Math.imul(al0, bl2)) | 0; mid = (mid + Math.imul(al0, bh2)) | 0; mid = (mid + Math.imul(ah0, bl2)) | 0; hi = (hi + Math.imul(ah0, bh2)) | 0; var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0; w2 &= 0x3ffffff; /* k = 3 */ lo = Math.imul(al3, bl0); mid = Math.imul(al3, bh0); mid = (mid + Math.imul(ah3, bl0)) | 0; hi = Math.imul(ah3, bh0); lo = (lo + Math.imul(al2, bl1)) | 0; mid = (mid + Math.imul(al2, bh1)) | 0; mid = (mid + Math.imul(ah2, bl1)) | 0; hi = (hi + Math.imul(ah2, bh1)) | 0; lo = (lo + Math.imul(al1, bl2)) | 0; mid = (mid + Math.imul(al1, bh2)) | 0; mid = (mid + Math.imul(ah1, bl2)) | 0; hi = (hi + Math.imul(ah1, bh2)) | 0; lo = (lo + Math.imul(al0, bl3)) | 0; mid = (mid + Math.imul(al0, bh3)) | 0; mid = (mid + Math.imul(ah0, bl3)) | 0; hi = (hi + Math.imul(ah0, bh3)) | 0; var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0; w3 &= 0x3ffffff; /* k = 4 */ lo = Math.imul(al4, bl0); mid = Math.imul(al4, bh0); mid = (mid + Math.imul(ah4, bl0)) | 0; hi = Math.imul(ah4, bh0); lo = (lo + Math.imul(al3, bl1)) | 0; mid = (mid + Math.imul(al3, bh1)) | 0; mid = (mid + Math.imul(ah3, bl1)) | 0; hi = (hi + Math.imul(ah3, bh1)) | 0; lo = (lo + Math.imul(al2, bl2)) | 0; mid = (mid + Math.imul(al2, bh2)) | 0; mid = (mid + Math.imul(ah2, bl2)) | 0; hi = (hi + Math.imul(ah2, bh2)) | 0; lo = (lo + Math.imul(al1, bl3)) | 0; mid = (mid + Math.imul(al1, bh3)) | 0; mid = (mid + Math.imul(ah1, bl3)) | 0; hi = (hi + Math.imul(ah1, bh3)) | 0; lo = (lo + Math.imul(al0, bl4)) | 0; mid = (mid + Math.imul(al0, bh4)) | 0; mid = (mid + Math.imul(ah0, bl4)) | 0; hi = (hi + Math.imul(ah0, bh4)) | 0; var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0; w4 &= 0x3ffffff; /* k = 5 */ lo = Math.imul(al5, bl0); mid = Math.imul(al5, bh0); mid = (mid + Math.imul(ah5, bl0)) | 0; hi = Math.imul(ah5, bh0); lo = (lo + Math.imul(al4, bl1)) | 0; mid = (mid + Math.imul(al4, bh1)) | 0; mid = (mid + Math.imul(ah4, bl1)) | 0; hi = (hi + Math.imul(ah4, bh1)) | 0; lo = (lo + Math.imul(al3, bl2)) | 0; mid = (mid + Math.imul(al3, bh2)) | 0; mid = (mid + Math.imul(ah3, bl2)) | 0; hi = (hi + Math.imul(ah3, bh2)) | 0; lo = (lo + Math.imul(al2, bl3)) | 0; mid = (mid + Math.imul(al2, bh3)) | 0; mid = (mid + Math.imul(ah2, bl3)) | 0; hi = (hi + Math.imul(ah2, bh3)) | 0; lo = (lo + Math.imul(al1, bl4)) | 0; mid = (mid + Math.imul(al1, bh4)) | 0; mid = (mid + Math.imul(ah1, bl4)) | 0; hi = (hi + Math.imul(ah1, bh4)) | 0; lo = (lo + Math.imul(al0, bl5)) | 0; mid = (mid + Math.imul(al0, bh5)) | 0; mid = (mid + Math.imul(ah0, bl5)) | 0; hi = (hi + Math.imul(ah0, bh5)) | 0; var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0; w5 &= 0x3ffffff; /* k = 6 */ lo = Math.imul(al6, bl0); mid = Math.imul(al6, bh0); mid = (mid + Math.imul(ah6, bl0)) | 0; hi = Math.imul(ah6, bh0); lo = (lo + Math.imul(al5, bl1)) | 0; mid = (mid + Math.imul(al5, bh1)) | 0; mid = (mid + Math.imul(ah5, bl1)) | 0; hi = (hi + Math.imul(ah5, bh1)) | 0; lo = (lo + Math.imul(al4, bl2)) | 0; mid = (mid + Math.imul(al4, bh2)) | 0; mid = (mid + Math.imul(ah4, bl2)) | 0; hi = (hi + Math.imul(ah4, bh2)) | 0; lo = (lo + Math.imul(al3, bl3)) | 0; mid = (mid + Math.imul(al3, bh3)) | 0; mid = (mid + Math.imul(ah3, bl3)) | 0; hi = (hi + Math.imul(ah3, bh3)) | 0; lo = (lo + Math.imul(al2, bl4)) | 0; mid = (mid + Math.imul(al2, bh4)) | 0; mid = (mid + Math.imul(ah2, bl4)) | 0; hi = (hi + Math.imul(ah2, bh4)) | 0; lo = (lo + Math.imul(al1, bl5)) | 0; mid = (mid + Math.imul(al1, bh5)) | 0; mid = (mid + Math.imul(ah1, bl5)) | 0; hi = (hi + Math.imul(ah1, bh5)) | 0; lo = (lo + Math.imul(al0, bl6)) | 0; mid = (mid + Math.imul(al0, bh6)) | 0; mid = (mid + Math.imul(ah0, bl6)) | 0; hi = (hi + Math.imul(ah0, bh6)) | 0; var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0; w6 &= 0x3ffffff; /* k = 7 */ lo = Math.imul(al7, bl0); mid = Math.imul(al7, bh0); mid = (mid + Math.imul(ah7, bl0)) | 0; hi = Math.imul(ah7, bh0); lo = (lo + Math.imul(al6, bl1)) | 0; mid = (mid + Math.imul(al6, bh1)) | 0; mid = (mid + Math.imul(ah6, bl1)) | 0; hi = (hi + Math.imul(ah6, bh1)) | 0; lo = (lo + Math.imul(al5, bl2)) | 0; mid = (mid + Math.imul(al5, bh2)) | 0; mid = (mid + Math.imul(ah5, bl2)) | 0; hi = (hi + Math.imul(ah5, bh2)) | 0; lo = (lo + Math.imul(al4, bl3)) | 0; mid = (mid + Math.imul(al4, bh3)) | 0; mid = (mid + Math.imul(ah4, bl3)) | 0; hi = (hi + Math.imul(ah4, bh3)) | 0; lo = (lo + Math.imul(al3, bl4)) | 0; mid = (mid + Math.imul(al3, bh4)) | 0; mid = (mid + Math.imul(ah3, bl4)) | 0; hi = (hi + Math.imul(ah3, bh4)) | 0; lo = (lo + Math.imul(al2, bl5)) | 0; mid = (mid + Math.imul(al2, bh5)) | 0; mid = (mid + Math.imul(ah2, bl5)) | 0; hi = (hi + Math.imul(ah2, bh5)) | 0; lo = (lo + Math.imul(al1, bl6)) | 0; mid = (mid + Math.imul(al1, bh6)) | 0; mid = (mid + Math.imul(ah1, bl6)) | 0; hi = (hi + Math.imul(ah1, bh6)) | 0; lo = (lo + Math.imul(al0, bl7)) | 0; mid = (mid + Math.imul(al0, bh7)) | 0; mid = (mid + Math.imul(ah0, bl7)) | 0; hi = (hi + Math.imul(ah0, bh7)) | 0; var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0; w7 &= 0x3ffffff; /* k = 8 */ lo = Math.imul(al8, bl0); mid = Math.imul(al8, bh0); mid = (mid + Math.imul(ah8, bl0)) | 0; hi = Math.imul(ah8, bh0); lo = (lo + Math.imul(al7, bl1)) | 0; mid = (mid + Math.imul(al7, bh1)) | 0; mid = (mid + Math.imul(ah7, bl1)) | 0; hi = (hi + Math.imul(ah7, bh1)) | 0; lo = (lo + Math.imul(al6, bl2)) | 0; mid = (mid + Math.imul(al6, bh2)) | 0; mid = (mid + Math.imul(ah6, bl2)) | 0; hi = (hi + Math.imul(ah6, bh2)) | 0; lo = (lo + Math.imul(al5, bl3)) | 0; mid = (mid + Math.imul(al5, bh3)) | 0; mid = (mid + Math.imul(ah5, bl3)) | 0; hi = (hi + Math.imul(ah5, bh3)) | 0; lo = (lo + Math.imul(al4, bl4)) | 0; mid = (mid + Math.imul(al4, bh4)) | 0; mid = (mid + Math.imul(ah4, bl4)) | 0; hi = (hi + Math.imul(ah4, bh4)) | 0; lo = (lo + Math.imul(al3, bl5)) | 0; mid = (mid + Math.imul(al3, bh5)) | 0; mid = (mid + Math.imul(ah3, bl5)) | 0; hi = (hi + Math.imul(ah3, bh5)) | 0; lo = (lo + Math.imul(al2, bl6)) | 0; mid = (mid + Math.imul(al2, bh6)) | 0; mid = (mid + Math.imul(ah2, bl6)) | 0; hi = (hi + Math.imul(ah2, bh6)) | 0; lo = (lo + Math.imul(al1, bl7)) | 0; mid = (mid + Math.imul(al1, bh7)) | 0; mid = (mid + Math.imul(ah1, bl7)) | 0; hi = (hi + Math.imul(ah1, bh7)) | 0; lo = (lo + Math.imul(al0, bl8)) | 0; mid = (mid + Math.imul(al0, bh8)) | 0; mid = (mid + Math.imul(ah0, bl8)) | 0; hi = (hi + Math.imul(ah0, bh8)) | 0; var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0; w8 &= 0x3ffffff; /* k = 9 */ lo = Math.imul(al9, bl0); mid = Math.imul(al9, bh0); mid = (mid + Math.imul(ah9, bl0)) | 0; hi = Math.imul(ah9, bh0); lo = (lo + Math.imul(al8, bl1)) | 0; mid = (mid + Math.imul(al8, bh1)) | 0; mid = (mid + Math.imul(ah8, bl1)) | 0; hi = (hi + Math.imul(ah8, bh1)) | 0; lo = (lo + Math.imul(al7, bl2)) | 0; mid = (mid + Math.imul(al7, bh2)) | 0; mid = (mid + Math.imul(ah7, bl2)) | 0; hi = (hi + Math.imul(ah7, bh2)) | 0; lo = (lo + Math.imul(al6, bl3)) | 0; mid = (mid + Math.imul(al6, bh3)) | 0; mid = (mid + Math.imul(ah6, bl3)) | 0; hi = (hi + Math.imul(ah6, bh3)) | 0; lo = (lo + Math.imul(al5, bl4)) | 0; mid = (mid + Math.imul(al5, bh4)) | 0; mid = (mid + Math.imul(ah5, bl4)) | 0; hi = (hi + Math.imul(ah5, bh4)) | 0; lo = (lo + Math.imul(al4, bl5)) | 0; mid = (mid + Math.imul(al4, bh5)) | 0; mid = (mid + Math.imul(ah4, bl5)) | 0; hi = (hi + Math.imul(ah4, bh5)) | 0; lo = (lo + Math.imul(al3, bl6)) | 0; mid = (mid + Math.imul(al3, bh6)) | 0; mid = (mid + Math.imul(ah3, bl6)) | 0; hi = (hi + Math.imul(ah3, bh6)) | 0; lo = (lo + Math.imul(al2, bl7)) | 0; mid = (mid + Math.imul(al2, bh7)) | 0; mid = (mid + Math.imul(ah2, bl7)) | 0; hi = (hi + Math.imul(ah2, bh7)) | 0; lo = (lo + Math.imul(al1, bl8)) | 0; mid = (mid + Math.imul(al1, bh8)) | 0; mid = (mid + Math.imul(ah1, bl8)) | 0; hi = (hi + Math.imul(ah1, bh8)) | 0; lo = (lo + Math.imul(al0, bl9)) | 0; mid = (mid + Math.imul(al0, bh9)) | 0; mid = (mid + Math.imul(ah0, bl9)) | 0; hi = (hi + Math.imul(ah0, bh9)) | 0; var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0; w9 &= 0x3ffffff; /* k = 10 */ lo = Math.imul(al9, bl1); mid = Math.imul(al9, bh1); mid = (mid + Math.imul(ah9, bl1)) | 0; hi = Math.imul(ah9, bh1); lo = (lo + Math.imul(al8, bl2)) | 0; mid = (mid + Math.imul(al8, bh2)) | 0; mid = (mid + Math.imul(ah8, bl2)) | 0; hi = (hi + Math.imul(ah8, bh2)) | 0; lo = (lo + Math.imul(al7, bl3)) | 0; mid = (mid + Math.imul(al7, bh3)) | 0; mid = (mid + Math.imul(ah7, bl3)) | 0; hi = (hi + Math.imul(ah7, bh3)) | 0; lo = (lo + Math.imul(al6, bl4)) | 0; mid = (mid + Math.imul(al6, bh4)) | 0; mid = (mid + Math.imul(ah6, bl4)) | 0; hi = (hi + Math.imul(ah6, bh4)) | 0; lo = (lo + Math.imul(al5, bl5)) | 0; mid = (mid + Math.imul(al5, bh5)) | 0; mid = (mid + Math.imul(ah5, bl5)) | 0; hi = (hi + Math.imul(ah5, bh5)) | 0; lo = (lo + Math.imul(al4, bl6)) | 0; mid = (mid + Math.imul(al4, bh6)) | 0; mid = (mid + Math.imul(ah4, bl6)) | 0; hi = (hi + Math.imul(ah4, bh6)) | 0; lo = (lo + Math.imul(al3, bl7)) | 0; mid = (mid + Math.imul(al3, bh7)) | 0; mid = (mid + Math.imul(ah3, bl7)) | 0; hi = (hi + Math.imul(ah3, bh7)) | 0; lo = (lo + Math.imul(al2, bl8)) | 0; mid = (mid + Math.imul(al2, bh8)) | 0; mid = (mid + Math.imul(ah2, bl8)) | 0; hi = (hi + Math.imul(ah2, bh8)) | 0; lo = (lo + Math.imul(al1, bl9)) | 0; mid = (mid + Math.imul(al1, bh9)) | 0; mid = (mid + Math.imul(ah1, bl9)) | 0; hi = (hi + Math.imul(ah1, bh9)) | 0; var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0; w10 &= 0x3ffffff; /* k = 11 */ lo = Math.imul(al9, bl2); mid = Math.imul(al9, bh2); mid = (mid + Math.imul(ah9, bl2)) | 0; hi = Math.imul(ah9, bh2); lo = (lo + Math.imul(al8, bl3)) | 0; mid = (mid + Math.imul(al8, bh3)) | 0; mid = (mid + Math.imul(ah8, bl3)) | 0; hi = (hi + Math.imul(ah8, bh3)) | 0; lo = (lo + Math.imul(al7, bl4)) | 0; mid = (mid + Math.imul(al7, bh4)) | 0; mid = (mid + Math.imul(ah7, bl4)) | 0; hi = (hi + Math.imul(ah7, bh4)) | 0; lo = (lo + Math.imul(al6, bl5)) | 0; mid = (mid + Math.imul(al6, bh5)) | 0; mid = (mid + Math.imul(ah6, bl5)) | 0; hi = (hi + Math.imul(ah6, bh5)) | 0; lo = (lo + Math.imul(al5, bl6)) | 0; mid = (mid + Math.imul(al5, bh6)) | 0; mid = (mid + Math.imul(ah5, bl6)) | 0; hi = (hi + Math.imul(ah5, bh6)) | 0; lo = (lo + Math.imul(al4, bl7)) | 0; mid = (mid + Math.imul(al4, bh7)) | 0; mid = (mid + Math.imul(ah4, bl7)) | 0; hi = (hi + Math.imul(ah4, bh7)) | 0; lo = (lo + Math.imul(al3, bl8)) | 0; mid = (mid + Math.imul(al3, bh8)) | 0; mid = (mid + Math.imul(ah3, bl8)) | 0; hi = (hi + Math.imul(ah3, bh8)) | 0; lo = (lo + Math.imul(al2, bl9)) | 0; mid = (mid + Math.imul(al2, bh9)) | 0; mid = (mid + Math.imul(ah2, bl9)) | 0; hi = (hi + Math.imul(ah2, bh9)) | 0; var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0; w11 &= 0x3ffffff; /* k = 12 */ lo = Math.imul(al9, bl3); mid = Math.imul(al9, bh3); mid = (mid + Math.imul(ah9, bl3)) | 0; hi = Math.imul(ah9, bh3); lo = (lo + Math.imul(al8, bl4)) | 0; mid = (mid + Math.imul(al8, bh4)) | 0; mid = (mid + Math.imul(ah8, bl4)) | 0; hi = (hi + Math.imul(ah8, bh4)) | 0; lo = (lo + Math.imul(al7, bl5)) | 0; mid = (mid + Math.imul(al7, bh5)) | 0; mid = (mid + Math.imul(ah7, bl5)) | 0; hi = (hi + Math.imul(ah7, bh5)) | 0; lo = (lo + Math.imul(al6, bl6)) | 0; mid = (mid + Math.imul(al6, bh6)) | 0; mid = (mid + Math.imul(ah6, bl6)) | 0; hi = (hi + Math.imul(ah6, bh6)) | 0; lo = (lo + Math.imul(al5, bl7)) | 0; mid = (mid + Math.imul(al5, bh7)) | 0; mid = (mid + Math.imul(ah5, bl7)) | 0; hi = (hi + Math.imul(ah5, bh7)) | 0; lo = (lo + Math.imul(al4, bl8)) | 0; mid = (mid + Math.imul(al4, bh8)) | 0; mid = (mid + Math.imul(ah4, bl8)) | 0; hi = (hi + Math.imul(ah4, bh8)) | 0; lo = (lo + Math.imul(al3, bl9)) | 0; mid = (mid + Math.imul(al3, bh9)) | 0; mid = (mid + Math.imul(ah3, bl9)) | 0; hi = (hi + Math.imul(ah3, bh9)) | 0; var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0; w12 &= 0x3ffffff; /* k = 13 */ lo = Math.imul(al9, bl4); mid = Math.imul(al9, bh4); mid = (mid + Math.imul(ah9, bl4)) | 0; hi = Math.imul(ah9, bh4); lo = (lo + Math.imul(al8, bl5)) | 0; mid = (mid + Math.imul(al8, bh5)) | 0; mid = (mid + Math.imul(ah8, bl5)) | 0; hi = (hi + Math.imul(ah8, bh5)) | 0; lo = (lo + Math.imul(al7, bl6)) | 0; mid = (mid + Math.imul(al7, bh6)) | 0; mid = (mid + Math.imul(ah7, bl6)) | 0; hi = (hi + Math.imul(ah7, bh6)) | 0; lo = (lo + Math.imul(al6, bl7)) | 0; mid = (mid + Math.imul(al6, bh7)) | 0; mid = (mid + Math.imul(ah6, bl7)) | 0; hi = (hi + Math.imul(ah6, bh7)) | 0; lo = (lo + Math.imul(al5, bl8)) | 0; mid = (mid + Math.imul(al5, bh8)) | 0; mid = (mid + Math.imul(ah5, bl8)) | 0; hi = (hi + Math.imul(ah5, bh8)) | 0; lo = (lo + Math.imul(al4, bl9)) | 0; mid = (mid + Math.imul(al4, bh9)) | 0; mid = (mid + Math.imul(ah4, bl9)) | 0; hi = (hi + Math.imul(ah4, bh9)) | 0; var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0; w13 &= 0x3ffffff; /* k = 14 */ lo = Math.imul(al9, bl5); mid = Math.imul(al9, bh5); mid = (mid + Math.imul(ah9, bl5)) | 0; hi = Math.imul(ah9, bh5); lo = (lo + Math.imul(al8, bl6)) | 0; mid = (mid + Math.imul(al8, bh6)) | 0; mid = (mid + Math.imul(ah8, bl6)) | 0; hi = (hi + Math.imul(ah8, bh6)) | 0; lo = (lo + Math.imul(al7, bl7)) | 0; mid = (mid + Math.imul(al7, bh7)) | 0; mid = (mid + Math.imul(ah7, bl7)) | 0; hi = (hi + Math.imul(ah7, bh7)) | 0; lo = (lo + Math.imul(al6, bl8)) | 0; mid = (mid + Math.imul(al6, bh8)) | 0; mid = (mid + Math.imul(ah6, bl8)) | 0; hi = (hi + Math.imul(ah6, bh8)) | 0; lo = (lo + Math.imul(al5, bl9)) | 0; mid = (mid + Math.imul(al5, bh9)) | 0; mid = (mid + Math.imul(ah5, bl9)) | 0; hi = (hi + Math.imul(ah5, bh9)) | 0; var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0; w14 &= 0x3ffffff; /* k = 15 */ lo = Math.imul(al9, bl6); mid = Math.imul(al9, bh6); mid = (mid + Math.imul(ah9, bl6)) | 0; hi = Math.imul(ah9, bh6); lo = (lo + Math.imul(al8, bl7)) | 0; mid = (mid + Math.imul(al8, bh7)) | 0; mid = (mid + Math.imul(ah8, bl7)) | 0; hi = (hi + Math.imul(ah8, bh7)) | 0; lo = (lo + Math.imul(al7, bl8)) | 0; mid = (mid + Math.imul(al7, bh8)) | 0; mid = (mid + Math.imul(ah7, bl8)) | 0; hi = (hi + Math.imul(ah7, bh8)) | 0; lo = (lo + Math.imul(al6, bl9)) | 0; mid = (mid + Math.imul(al6, bh9)) | 0; mid = (mid + Math.imul(ah6, bl9)) | 0; hi = (hi + Math.imul(ah6, bh9)) | 0; var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0; w15 &= 0x3ffffff; /* k = 16 */ lo = Math.imul(al9, bl7); mid = Math.imul(al9, bh7); mid = (mid + Math.imul(ah9, bl7)) | 0; hi = Math.imul(ah9, bh7); lo = (lo + Math.imul(al8, bl8)) | 0; mid = (mid + Math.imul(al8, bh8)) | 0; mid = (mid + Math.imul(ah8, bl8)) | 0; hi = (hi + Math.imul(ah8, bh8)) | 0; lo = (lo + Math.imul(al7, bl9)) | 0; mid = (mid + Math.imul(al7, bh9)) | 0; mid = (mid + Math.imul(ah7, bl9)) | 0; hi = (hi + Math.imul(ah7, bh9)) | 0; var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0; w16 &= 0x3ffffff; /* k = 17 */ lo = Math.imul(al9, bl8); mid = Math.imul(al9, bh8); mid = (mid + Math.imul(ah9, bl8)) | 0; hi = Math.imul(ah9, bh8); lo = (lo + Math.imul(al8, bl9)) | 0; mid = (mid + Math.imul(al8, bh9)) | 0; mid = (mid + Math.imul(ah8, bl9)) | 0; hi = (hi + Math.imul(ah8, bh9)) | 0; var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0; w17 &= 0x3ffffff; /* k = 18 */ lo = Math.imul(al9, bl9); mid = Math.imul(al9, bh9); mid = (mid + Math.imul(ah9, bl9)) | 0; hi = Math.imul(ah9, bh9); var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0; w18 &= 0x3ffffff; o[0] = w0; o[1] = w1; o[2] = w2; o[3] = w3; o[4] = w4; o[5] = w5; o[6] = w6; o[7] = w7; o[8] = w8; o[9] = w9; o[10] = w10; o[11] = w11; o[12] = w12; o[13] = w13; o[14] = w14; o[15] = w15; o[16] = w16; o[17] = w17; o[18] = w18; if (c !== 0) { o[19] = c; out.length++; } return out; }; // Polyfill comb if (!Math.imul) { comb10MulTo = smallMulTo; } function bigMulTo (self, num, out) { out.negative = num.negative ^ self.negative; out.length = self.length + num.length; var carry = 0; var hncarry = 0; for (var k = 0; k < out.length - 1; k++) { // Sum all words with the same `i + j = k` and accumulate `ncarry`, // note that ncarry could be >= 0x3ffffff var ncarry = hncarry; hncarry = 0; var rword = carry & 0x3ffffff; var maxJ = Math.min(k, num.length - 1); for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { var i = k - j; var a = self.words[i] | 0; var b = num.words[j] | 0; var r = a * b; var lo = r & 0x3ffffff; ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0; lo = (lo + rword) | 0; rword = lo & 0x3ffffff; ncarry = (ncarry + (lo >>> 26)) | 0; hncarry += ncarry >>> 26; ncarry &= 0x3ffffff; } out.words[k] = rword; carry = ncarry; ncarry = hncarry; } if (carry !== 0) { out.words[k] = carry; } else { out.length--; } return out._strip(); } function jumboMulTo (self, num, out) { // Temporary disable, see https://github.com/indutny/bn.js/issues/211 // var fftm = new FFTM(); // return fftm.mulp(self, num, out); return bigMulTo(self, num, out); } BN.prototype.mulTo = function mulTo (num, out) { var res; var len = this.length + num.length; if (this.length === 10 && num.length === 10) { res = comb10MulTo(this, num, out); } else if (len < 63) { res = smallMulTo(this, num, out); } else if (len < 1024) { res = bigMulTo(this, num, out); } else { res = jumboMulTo(this, num, out); } return res; }; // Cooley-Tukey algorithm for FFT // slightly revisited to rely on looping instead of recursion function FFTM (x, y) { this.x = x; this.y = y; } FFTM.prototype.makeRBT = function makeRBT (N) { var t = new Array(N); var l = BN.prototype._countBits(N) - 1; for (var i = 0; i < N; i++) { t[i] = this.revBin(i, l, N); } return t; }; // Returns binary-reversed representation of `x` FFTM.prototype.revBin = function revBin (x, l, N) { if (x === 0 || x === N - 1) return x; var rb = 0; for (var i = 0; i < l; i++) { rb |= (x & 1) << (l - i - 1); x >>= 1; } return rb; }; // Performs "tweedling" phase, therefore 'emulating' // behaviour of the recursive algorithm FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) { for (var i = 0; i < N; i++) { rtws[i] = rws[rbt[i]]; itws[i] = iws[rbt[i]]; } }; FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) { this.permute(rbt, rws, iws, rtws, itws, N); for (var s = 1; s < N; s <<= 1) { var l = s << 1; var rtwdf = Math.cos(2 * Math.PI / l); var itwdf = Math.sin(2 * Math.PI / l); for (var p = 0; p < N; p += l) { var rtwdf_ = rtwdf; var itwdf_ = itwdf; for (var j = 0; j < s; j++) { var re = rtws[p + j]; var ie = itws[p + j]; var ro = rtws[p + j + s]; var io = itws[p + j + s]; var rx = rtwdf_ * ro - itwdf_ * io; io = rtwdf_ * io + itwdf_ * ro; ro = rx; rtws[p + j] = re + ro; itws[p + j] = ie + io; rtws[p + j + s] = re - ro; itws[p + j + s] = ie - io; /* jshint maxdepth : false */ if (j !== l) { rx = rtwdf * rtwdf_ - itwdf * itwdf_; itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_; rtwdf_ = rx; } } } } }; FFTM.prototype.guessLen13b = function guessLen13b (n, m) { var N = Math.max(m, n) | 1; var odd = N & 1; var i = 0; for (N = N / 2 | 0; N; N = N >>> 1) { i++; } return 1 << i + 1 + odd; }; FFTM.prototype.conjugate = function conjugate (rws, iws, N) { if (N <= 1) return; for (var i = 0; i < N / 2; i++) { var t = rws[i]; rws[i] = rws[N - i - 1]; rws[N - i - 1] = t; t = iws[i]; iws[i] = -iws[N - i - 1]; iws[N - i - 1] = -t; } }; FFTM.prototype.normalize13b = function normalize13b (ws, N) { var carry = 0; for (var i = 0; i < N / 2; i++) { var w = Math.round(ws[2 * i + 1] / N) * 0x2000 + Math.round(ws[2 * i] / N) + carry; ws[i] = w & 0x3ffffff; if (w < 0x4000000) { carry = 0; } else { carry = w / 0x4000000 | 0; } } return ws; }; FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) { var carry = 0; for (var i = 0; i < len; i++) { carry = carry + (ws[i] | 0); rws[2 * i] = carry & 0x1fff; carry = carry >>> 13; rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13; } // Pad with zeroes for (i = 2 * len; i < N; ++i) { rws[i] = 0; } assert(carry === 0); assert((carry & ~0x1fff) === 0); }; FFTM.prototype.stub = function stub (N) { var ph = new Array(N); for (var i = 0; i < N; i++) { ph[i] = 0; } return ph; }; FFTM.prototype.mulp = function mulp (x, y, out) { var N = 2 * this.guessLen13b(x.length, y.length); var rbt = this.makeRBT(N); var _ = this.stub(N); var rws = new Array(N); var rwst = new Array(N); var iwst = new Array(N); var nrws = new Array(N); var nrwst = new Array(N); var niwst = new Array(N); var rmws = out.words; rmws.length = N; this.convert13b(x.words, x.length, rws, N); this.convert13b(y.words, y.length, nrws, N); this.transform(rws, _, rwst, iwst, N, rbt); this.transform(nrws, _, nrwst, niwst, N, rbt); for (var i = 0; i < N; i++) { var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i]; iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i]; rwst[i] = rx; } this.conjugate(rwst, iwst, N); this.transform(rwst, iwst, rmws, _, N, rbt); this.conjugate(rmws, _, N); this.normalize13b(rmws, N); out.negative = x.negative ^ y.negative; out.length = x.length + y.length; return out._strip(); }; // Multiply `this` by `num` BN.prototype.mul = function mul (num) { var out = new BN(null); out.words = new Array(this.length + num.length); return this.mulTo(num, out); }; // Multiply employing FFT BN.prototype.mulf = function mulf (num) { var out = new BN(null); out.words = new Array(this.length + num.length); return jumboMulTo(this, num, out); }; // In-place Multiplication BN.prototype.imul = function imul (num) { return this.clone().mulTo(num, this); }; BN.prototype.imuln = function imuln (num) { var isNegNum = num < 0; if (isNegNum) num = -num; assert(typeof num === 'number'); assert(num < 0x4000000); // Carry var carry = 0; for (var i = 0; i < this.length; i++) { var w = (this.words[i] | 0) * num; var lo = (w & 0x3ffffff) + (carry & 0x3ffffff); carry >>= 26; carry += (w / 0x4000000) | 0; // NOTE: lo is 27bit maximum carry += lo >>> 26; this.words[i] = lo & 0x3ffffff; } if (carry !== 0) { this.words[i] = carry; this.length++; } return isNegNum ? this.ineg() : this; }; BN.prototype.muln = function muln (num) { return this.clone().imuln(num); }; // `this` * `this` BN.prototype.sqr = function sqr () { return this.mul(this); }; // `this` * `this` in-place BN.prototype.isqr = function isqr () { return this.imul(this.clone()); }; // Math.pow(`this`, `num`) BN.prototype.pow = function pow (num) { var w = toBitArray(num); if (w.length === 0) return new BN(1); // Skip leading zeroes var res = this; for (var i = 0; i < w.length; i++, res = res.sqr()) { if (w[i] !== 0) break; } if (++i < w.length) { for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) { if (w[i] === 0) continue; res = res.mul(q); } } return res; }; // Shift-left in-place BN.prototype.iushln = function iushln (bits) { assert(typeof bits === 'number' && bits >= 0); var r = bits % 26; var s = (bits - r) / 26; var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r); var i; if (r !== 0) { var carry = 0; for (i = 0; i < this.length; i++) { var newCarry = this.words[i] & carryMask; var c = ((this.words[i] | 0) - newCarry) << r; this.words[i] = c | carry; carry = newCarry >>> (26 - r); } if (carry) { this.words[i] = carry; this.length++; } } if (s !== 0) { for (i = this.length - 1; i >= 0; i--) { this.words[i + s] = this.words[i]; } for (i = 0; i < s; i++) { this.words[i] = 0; } this.length += s; } return this._strip(); }; BN.prototype.ishln = function ishln (bits) { // TODO(indutny): implement me assert(this.negative === 0); return this.iushln(bits); }; // Shift-right in-place // NOTE: `hint` is a lowest bit before trailing zeroes // NOTE: if `extended` is present - it will be filled with destroyed bits BN.prototype.iushrn = function iushrn (bits, hint, extended) { assert(typeof bits === 'number' && bits >= 0); var h; if (hint) { h = (hint - (hint % 26)) / 26; } else { h = 0; } var r = bits % 26; var s = Math.min((bits - r) / 26, this.length); var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); var maskedWords = extended; h -= s; h = Math.max(0, h); // Extended mode, copy masked part if (maskedWords) { for (var i = 0; i < s; i++) { maskedWords.words[i] = this.words[i]; } maskedWords.length = s; } if (s === 0) { // No-op, we should not move anything at all } else if (this.length > s) { this.length -= s; for (i = 0; i < this.length; i++) { this.words[i] = this.words[i + s]; } } else { this.words[0] = 0; this.length = 1; } var carry = 0; for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) { var word = this.words[i] | 0; this.words[i] = (carry << (26 - r)) | (word >>> r); carry = word & mask; } // Push carried bits as a mask if (maskedWords && carry !== 0) { maskedWords.words[maskedWords.length++] = carry; } if (this.length === 0) { this.words[0] = 0; this.length = 1; } return this._strip(); }; BN.prototype.ishrn = function ishrn (bits, hint, extended) { // TODO(indutny): implement me assert(this.negative === 0); return this.iushrn(bits, hint, extended); }; // Shift-left BN.prototype.shln = function shln (bits) { return this.clone().ishln(bits); }; BN.prototype.ushln = function ushln (bits) { return this.clone().iushln(bits); }; // Shift-right BN.prototype.shrn = function shrn (bits) { return this.clone().ishrn(bits); }; BN.prototype.ushrn = function ushrn (bits) { return this.clone().iushrn(bits); }; // Test if n bit is set BN.prototype.testn = function testn (bit) { assert(typeof bit === 'number' && bit >= 0); var r = bit % 26; var s = (bit - r) / 26; var q = 1 << r; // Fast case: bit is much higher than all existing words if (this.length <= s) return false; // Check bit and return var w = this.words[s]; return !!(w & q); }; // Return only lowers bits of number (in-place) BN.prototype.imaskn = function imaskn (bits) { assert(typeof bits === 'number' && bits >= 0); var r = bits % 26; var s = (bits - r) / 26; assert(this.negative === 0, 'imaskn works only with positive numbers'); if (this.length <= s) { return this; } if (r !== 0) { s++; } this.length = Math.min(s, this.length); if (r !== 0) { var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); this.words[this.length - 1] &= mask; } return this._strip(); }; // Return only lowers bits of number BN.prototype.maskn = function maskn (bits) { return this.clone().imaskn(bits); }; // Add plain number `num` to `this` BN.prototype.iaddn = function iaddn (num) { assert(typeof num === 'number'); assert(num < 0x4000000); if (num < 0) return this.isubn(-num); // Possible sign change if (this.negative !== 0) { if (this.length === 1 && (this.words[0] | 0) <= num) { this.words[0] = num - (this.words[0] | 0); this.negative = 0; return this; } this.negative = 0; this.isubn(num); this.negative = 1; return this; } // Add without checks return this._iaddn(num); }; BN.prototype._iaddn = function _iaddn (num) { this.words[0] += num; // Carry for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) { this.words[i] -= 0x4000000; if (i === this.length - 1) { this.words[i + 1] = 1; } else { this.words[i + 1]++; } } this.length = Math.max(this.length, i + 1); return this; }; // Subtract plain number `num` from `this` BN.prototype.isubn = function isubn (num) { assert(typeof num === 'number'); assert(num < 0x4000000); if (num < 0) return this.iaddn(-num); if (this.negative !== 0) { this.negative = 0; this.iaddn(num); this.negative = 1; return this; } this.words[0] -= num; if (this.length === 1 && this.words[0] < 0) { this.words[0] = -this.words[0]; this.negative = 1; } else { // Carry for (var i = 0; i < this.length && this.words[i] < 0; i++) { this.words[i] += 0x4000000; this.words[i + 1] -= 1; } } return this._strip(); }; BN.prototype.addn = function addn (num) { return this.clone().iaddn(num); }; BN.prototype.subn = function subn (num) { return this.clone().isubn(num); }; BN.prototype.iabs = function iabs () { this.negative = 0; return this; }; BN.prototype.abs = function abs () { return this.clone().iabs(); }; BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) { var len = num.length + shift; var i; this._expand(len); var w; var carry = 0; for (i = 0; i < num.length; i++) { w = (this.words[i + shift] | 0) + carry; var right = (num.words[i] | 0) * mul; w -= right & 0x3ffffff; carry = (w >> 26) - ((right / 0x4000000) | 0); this.words[i + shift] = w & 0x3ffffff; } for (; i < this.length - shift; i++) { w = (this.words[i + shift] | 0) + carry; carry = w >> 26; this.words[i + shift] = w & 0x3ffffff; } if (carry === 0) return this._strip(); // Subtraction overflow assert(carry === -1); carry = 0; for (i = 0; i < this.length; i++) { w = -(this.words[i] | 0) + carry; carry = w >> 26; this.words[i] = w & 0x3ffffff; } this.negative = 1; return this._strip(); }; BN.prototype._wordDiv = function _wordDiv (num, mode) { var shift = this.length - num.length; var a = this.clone(); var b = num; // Normalize var bhi = b.words[b.length - 1] | 0; var bhiBits = this._countBits(bhi); shift = 26 - bhiBits; if (shift !== 0) { b = b.ushln(shift); a.iushln(shift); bhi = b.words[b.length - 1] | 0; } // Initialize quotient var m = a.length - b.length; var q; if (mode !== 'mod') { q = new BN(null); q.length = m + 1; q.words = new Array(q.length); for (var i = 0; i < q.length; i++) { q.words[i] = 0; } } var diff = a.clone()._ishlnsubmul(b, 1, m); if (diff.negative === 0) { a = diff; if (q) { q.words[m] = 1; } } for (var j = m - 1; j >= 0; j--) { var qj = (a.words[b.length + j] | 0) * 0x4000000 + (a.words[b.length + j - 1] | 0); // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max // (0x7ffffff) qj = Math.min((qj / bhi) | 0, 0x3ffffff); a._ishlnsubmul(b, qj, j); while (a.negative !== 0) { qj--; a.negative = 0; a._ishlnsubmul(b, 1, j); if (!a.isZero()) { a.negative ^= 1; } } if (q) { q.words[j] = qj; } } if (q) { q._strip(); } a._strip(); // Denormalize if (mode !== 'div' && shift !== 0) { a.iushrn(shift); } return { div: q || null, mod: a }; }; // NOTE: 1) `mode` can be set to `mod` to request mod only, // to `div` to request div only, or be absent to // request both div & mod // 2) `positive` is true if unsigned mod is requested BN.prototype.divmod = function divmod (num, mode, positive) { assert(!num.isZero()); if (this.isZero()) { return { div: new BN(0), mod: new BN(0) }; } var div, mod, res; if (this.negative !== 0 && num.negative === 0) { res = this.neg().divmod(num, mode); if (mode !== 'mod') { div = res.div.neg(); } if (mode !== 'div') { mod = res.mod.neg(); if (positive && mod.negative !== 0) { mod.iadd(num); } } return { div: div, mod: mod }; } if (this.negative === 0 && num.negative !== 0) { res = this.divmod(num.neg(), mode); if (mode !== 'mod') { div = res.div.neg(); } return { div: div, mod: res.mod }; } if ((this.negative & num.negative) !== 0) { res = this.neg().divmod(num.neg(), mode); if (mode !== 'div') { mod = res.mod.neg(); if (positive && mod.negative !== 0) { mod.isub(num); } } return { div: res.div, mod: mod }; } // Both numbers are positive at this point // Strip both numbers to approximate shift value if (num.length > this.length || this.cmp(num) < 0) { return { div: new BN(0), mod: this }; } // Very short reduction if (num.length === 1) { if (mode === 'div') { return { div: this.divn(num.words[0]), mod: null }; } if (mode === 'mod') { return { div: null, mod: new BN(this.modrn(num.words[0])) }; } return { div: this.divn(num.words[0]), mod: new BN(this.modrn(num.words[0])) }; } return this._wordDiv(num, mode); }; // Find `this` / `num` BN.prototype.div = function div (num) { return this.divmod(num, 'div', false).div; }; // Find `this` % `num` BN.prototype.mod = function mod (num) { return this.divmod(num, 'mod', false).mod; }; BN.prototype.umod = function umod (num) { return this.divmod(num, 'mod', true).mod; }; // Find Round(`this` / `num`) BN.prototype.divRound = function divRound (num) { var dm = this.divmod(num); // Fast case - exact division if (dm.mod.isZero()) return dm.div; var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod; var half = num.ushrn(1); var r2 = num.andln(1); var cmp = mod.cmp(half); // Round down if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div; // Round up return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1); }; BN.prototype.modrn = function modrn (num) { var isNegNum = num < 0; if (isNegNum) num = -num; assert(num <= 0x3ffffff); var p = (1 << 26) % num; var acc = 0; for (var i = this.length - 1; i >= 0; i--) { acc = (p * acc + (this.words[i] | 0)) % num; } return isNegNum ? -acc : acc; }; // WARNING: DEPRECATED BN.prototype.modn = function modn (num) { return this.modrn(num); }; // In-place division by number BN.prototype.idivn = function idivn (num) { var isNegNum = num < 0; if (isNegNum) num = -num; assert(num <= 0x3ffffff); var carry = 0; for (var i = this.length - 1; i >= 0; i--) { var w = (this.words[i] | 0) + carry * 0x4000000; this.words[i] = (w / num) | 0; carry = w % num; } this._strip(); return isNegNum ? this.ineg() : this; }; BN.prototype.divn = function divn (num) { return this.clone().idivn(num); }; BN.prototype.egcd = function egcd (p) { assert(p.negative === 0); assert(!p.isZero()); var x = this; var y = p.clone(); if (x.negative !== 0) { x = x.umod(p); } else { x = x.clone(); } // A * x + B * y = x var A = new BN(1); var B = new BN(0); // C * x + D * y = y var C = new BN(0); var D = new BN(1); var g = 0; while (x.isEven() && y.isEven()) { x.iushrn(1); y.iushrn(1); ++g; } var yp = y.clone(); var xp = x.clone(); while (!x.isZero()) { for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1); if (i > 0) { x.iushrn(i); while (i-- > 0) { if (A.isOdd() || B.isOdd()) { A.iadd(yp); B.isub(xp); } A.iushrn(1); B.iushrn(1); } } for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); if (j > 0) { y.iushrn(j); while (j-- > 0) { if (C.isOdd() || D.isOdd()) { C.iadd(yp); D.isub(xp); } C.iushrn(1); D.iushrn(1); } } if (x.cmp(y) >= 0) { x.isub(y); A.isub(C); B.isub(D); } else { y.isub(x); C.isub(A); D.isub(B); } } return { a: C, b: D, gcd: y.iushln(g) }; }; // This is reduced incarnation of the binary EEA // above, designated to invert members of the // _prime_ fields F(p) at a maximal speed BN.prototype._invmp = function _invmp (p) { assert(p.negative === 0); assert(!p.isZero()); var a = this; var b = p.clone(); if (a.negative !== 0) { a = a.umod(p); } else { a = a.clone(); } var x1 = new BN(1); var x2 = new BN(0); var delta = b.clone(); while (a.cmpn(1) > 0 && b.cmpn(1) > 0) { for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1); if (i > 0) { a.iushrn(i); while (i-- > 0) { if (x1.isOdd()) { x1.iadd(delta); } x1.iushrn(1); } } for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); if (j > 0) { b.iushrn(j); while (j-- > 0) { if (x2.isOdd()) { x2.iadd(delta); } x2.iushrn(1); } } if (a.cmp(b) >= 0) { a.isub(b); x1.isub(x2); } else { b.isub(a); x2.isub(x1); } } var res; if (a.cmpn(1) === 0) { res = x1; } else { res = x2; } if (res.cmpn(0) < 0) { res.iadd(p); } return res; }; BN.prototype.gcd = function gcd (num) { if (this.isZero()) return num.abs(); if (num.isZero()) return this.abs(); var a = this.clone(); var b = num.clone(); a.negative = 0; b.negative = 0; // Remove common factor of two for (var shift = 0; a.isEven() && b.isEven(); shift++) { a.iushrn(1); b.iushrn(1); } do { while (a.isEven()) { a.iushrn(1); } while (b.isEven()) { b.iushrn(1); } var r = a.cmp(b); if (r < 0) { // Swap `a` and `b` to make `a` always bigger than `b` var t = a; a = b; b = t; } else if (r === 0 || b.cmpn(1) === 0) { break; } a.isub(b); } while (true); return b.iushln(shift); }; // Invert number in the field F(num) BN.prototype.invm = function invm (num) { return this.egcd(num).a.umod(num); }; BN.prototype.isEven = function isEven () { return (this.words[0] & 1) === 0; }; BN.prototype.isOdd = function isOdd () { return (this.words[0] & 1) === 1; }; // And first word and num BN.prototype.andln = function andln (num) { return this.words[0] & num; }; // Increment at the bit position in-line BN.prototype.bincn = function bincn (bit) { assert(typeof bit === 'number'); var r = bit % 26; var s = (bit - r) / 26; var q = 1 << r; // Fast case: bit is much higher than all existing words if (this.length <= s) { this._expand(s + 1); this.words[s] |= q; return this; } // Add bit and propagate, if needed var carry = q; for (var i = s; carry !== 0 && i < this.length; i++) { var w = this.words[i] | 0; w += carry; carry = w >>> 26; w &= 0x3ffffff; this.words[i] = w; } if (carry !== 0) { this.words[i] = carry; this.length++; } return this; }; BN.prototype.isZero = function isZero () { return this.length === 1 && this.words[0] === 0; }; BN.prototype.cmpn = function cmpn (num) { var negative = num < 0; if (this.negative !== 0 && !negative) return -1; if (this.negative === 0 && negative) return 1; this._strip(); var res; if (this.length > 1) { res = 1; } else { if (negative) { num = -num; } assert(num <= 0x3ffffff, 'Number is too big'); var w = this.words[0] | 0; res = w === num ? 0 : w < num ? -1 : 1; } if (this.negative !== 0) return -res | 0; return res; }; // Compare two numbers and return: // 1 - if `this` > `num` // 0 - if `this` == `num` // -1 - if `this` < `num` BN.prototype.cmp = function cmp (num) { if (this.negative !== 0 && num.negative === 0) return -1; if (this.negative === 0 && num.negative !== 0) return 1; var res = this.ucmp(num); if (this.negative !== 0) return -res | 0; return res; }; // Unsigned comparison BN.prototype.ucmp = function ucmp (num) { // At this point both numbers have the same sign if (this.length > num.length) return 1; if (this.length < num.length) return -1; var res = 0; for (var i = this.length - 1; i >= 0; i--) { var a = this.words[i] | 0; var b = num.words[i] | 0; if (a === b) continue; if (a < b) { res = -1; } else if (a > b) { res = 1; } break; } return res; }; BN.prototype.gtn = function gtn (num) { return this.cmpn(num) === 1; }; BN.prototype.gt = function gt (num) { return this.cmp(num) === 1; }; BN.prototype.gten = function gten (num) { return this.cmpn(num) >= 0; }; BN.prototype.gte = function gte (num) { return this.cmp(num) >= 0; }; BN.prototype.ltn = function ltn (num) { return this.cmpn(num) === -1; }; BN.prototype.lt = function lt (num) { return this.cmp(num) === -1; }; BN.prototype.lten = function lten (num) { return this.cmpn(num) <= 0; }; BN.prototype.lte = function lte (num) { return this.cmp(num) <= 0; }; BN.prototype.eqn = function eqn (num) { return this.cmpn(num) === 0; }; BN.prototype.eq = function eq (num) { return this.cmp(num) === 0; }; // // A reduce context, could be using montgomery or something better, depending // on the `m` itself. // BN.red = function red (num) { return new Red(num); }; BN.prototype.toRed = function toRed (ctx) { assert(!this.red, 'Already a number in reduction context'); assert(this.negative === 0, 'red works only with positives'); return ctx.convertTo(this)._forceRed(ctx); }; BN.prototype.fromRed = function fromRed () { assert(this.red, 'fromRed works only with numbers in reduction context'); return this.red.convertFrom(this); }; BN.prototype._forceRed = function _forceRed (ctx) { this.red = ctx; return this; }; BN.prototype.forceRed = function forceRed (ctx) { assert(!this.red, 'Already a number in reduction context'); return this._forceRed(ctx); }; BN.prototype.redAdd = function redAdd (num) { assert(this.red, 'redAdd works only with red numbers'); return this.red.add(this, num); }; BN.prototype.redIAdd = function redIAdd (num) { assert(this.red, 'redIAdd works only with red numbers'); return this.red.iadd(this, num); }; BN.prototype.redSub = function redSub (num) { assert(this.red, 'redSub works only with red numbers'); return this.red.sub(this, num); }; BN.prototype.redISub = function redISub (num) { assert(this.red, 'redISub works only with red numbers'); return this.red.isub(this, num); }; BN.prototype.redShl = function redShl (num) { assert(this.red, 'redShl works only with red numbers'); return this.red.shl(this, num); }; BN.prototype.redMul = function redMul (num) { assert(this.red, 'redMul works only with red numbers'); this.red._verify2(this, num); return this.red.mul(this, num); }; BN.prototype.redIMul = function redIMul (num) { assert(this.red, 'redMul works only with red numbers'); this.red._verify2(this, num); return this.red.imul(this, num); }; BN.prototype.redSqr = function redSqr () { assert(this.red, 'redSqr works only with red numbers'); this.red._verify1(this); return this.red.sqr(this); }; BN.prototype.redISqr = function redISqr () { assert(this.red, 'redISqr works only with red numbers'); this.red._verify1(this); return this.red.isqr(this); }; // Square root over p BN.prototype.redSqrt = function redSqrt () { assert(this.red, 'redSqrt works only with red numbers'); this.red._verify1(this); return this.red.sqrt(this); }; BN.prototype.redInvm = function redInvm () { assert(this.red, 'redInvm works only with red numbers'); this.red._verify1(this); return this.red.invm(this); }; // Return negative clone of `this` % `red modulo` BN.prototype.redNeg = function redNeg () { assert(this.red, 'redNeg works only with red numbers'); this.red._verify1(this); return this.red.neg(this); }; BN.prototype.redPow = function redPow (num) { assert(this.red && !num.red, 'redPow(normalNum)'); this.red._verify1(this); return this.red.pow(this, num); }; // Prime numbers with efficient reduction var primes = { k256: null, p224: null, p192: null, p25519: null }; // Pseudo-Mersenne prime function MPrime (name, p) { // P = 2 ^ N - K this.name = name; this.p = new BN(p, 16); this.n = this.p.bitLength(); this.k = new BN(1).iushln(this.n).isub(this.p); this.tmp = this._tmp(); } MPrime.prototype._tmp = function _tmp () { var tmp = new BN(null); tmp.words = new Array(Math.ceil(this.n / 13)); return tmp; }; MPrime.prototype.ireduce = function ireduce (num) { // Assumes that `num` is less than `P^2` // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P) var r = num; var rlen; do { this.split(r, this.tmp); r = this.imulK(r); r = r.iadd(this.tmp); rlen = r.bitLength(); } while (rlen > this.n); var cmp = rlen < this.n ? -1 : r.ucmp(this.p); if (cmp === 0) { r.words[0] = 0; r.length = 1; } else if (cmp > 0) { r.isub(this.p); } else { if (r.strip !== undefined) { // r is a BN v4 instance r.strip(); } else { // r is a BN v5 instance r._strip(); } } return r; }; MPrime.prototype.split = function split (input, out) { input.iushrn(this.n, 0, out); }; MPrime.prototype.imulK = function imulK (num) { return num.imul(this.k); }; function K256 () { MPrime.call( this, 'k256', 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f'); } inherits(K256, MPrime); K256.prototype.split = function split (input, output) { // 256 = 9 * 26 + 22 var mask = 0x3fffff; var outLen = Math.min(input.length, 9); for (var i = 0; i < outLen; i++) { output.words[i] = input.words[i]; } output.length = outLen; if (input.length <= 9) { input.words[0] = 0; input.length = 1; return; } // Shift by 9 limbs var prev = input.words[9]; output.words[output.length++] = prev & mask; for (i = 10; i < input.length; i++) { var next = input.words[i] | 0; input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22); prev = next; } prev >>>= 22; input.words[i - 10] = prev; if (prev === 0 && input.length > 10) { input.length -= 10; } else { input.length -= 9; } }; K256.prototype.imulK = function imulK (num) { // K = 0x1000003d1 = [ 0x40, 0x3d1 ] num.words[num.length] = 0; num.words[num.length + 1] = 0; num.length += 2; // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390 var lo = 0; for (var i = 0; i < num.length; i++) { var w = num.words[i] | 0; lo += w * 0x3d1; num.words[i] = lo & 0x3ffffff; lo = w * 0x40 + ((lo / 0x4000000) | 0); } // Fast length reduction if (num.words[num.length - 1] === 0) { num.length--; if (num.words[num.length - 1] === 0) { num.length--; } } return num; }; function P224 () { MPrime.call( this, 'p224', 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001'); } inherits(P224, MPrime); function P192 () { MPrime.call( this, 'p192', 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff'); } inherits(P192, MPrime); function P25519 () { // 2 ^ 255 - 19 MPrime.call( this, '25519', '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed'); } inherits(P25519, MPrime); P25519.prototype.imulK = function imulK (num) { // K = 0x13 var carry = 0; for (var i = 0; i < num.length; i++) { var hi = (num.words[i] | 0) * 0x13 + carry; var lo = hi & 0x3ffffff; hi >>>= 26; num.words[i] = lo; carry = hi; } if (carry !== 0) { num.words[num.length++] = carry; } return num; }; // Exported mostly for testing purposes, use plain name instead BN._prime = function prime (name) { // Cached version of prime if (primes[name]) return primes[name]; var prime; if (name === 'k256') { prime = new K256(); } else if (name === 'p224') { prime = new P224(); } else if (name === 'p192') { prime = new P192(); } else if (name === 'p25519') { prime = new P25519(); } else { throw new Error('Unknown prime ' + name); } primes[name] = prime; return prime; }; // // Base reduction engine // function Red (m) { if (typeof m === 'string') { var prime = BN._prime(m); this.m = prime.p; this.prime = prime; } else { assert(m.gtn(1), 'modulus must be greater than 1'); this.m = m; this.prime = null; } } Red.prototype._verify1 = function _verify1 (a) { assert(a.negative === 0, 'red works only with positives'); assert(a.red, 'red works only with red numbers'); }; Red.prototype._verify2 = function _verify2 (a, b) { assert((a.negative | b.negative) === 0, 'red works only with positives'); assert(a.red && a.red === b.red, 'red works only with red numbers'); }; Red.prototype.imod = function imod (a) { if (this.prime) return this.prime.ireduce(a)._forceRed(this); move(a, a.umod(this.m)._forceRed(this)); return a; }; Red.prototype.neg = function neg (a) { if (a.isZero()) { return a.clone(); } return this.m.sub(a)._forceRed(this); }; Red.prototype.add = function add (a, b) { this._verify2(a, b); var res = a.add(b); if (res.cmp(this.m) >= 0) { res.isub(this.m); } return res._forceRed(this); }; Red.prototype.iadd = function iadd (a, b) { this._verify2(a, b); var res = a.iadd(b); if (res.cmp(this.m) >= 0) { res.isub(this.m); } return res; }; Red.prototype.sub = function sub (a, b) { this._verify2(a, b); var res = a.sub(b); if (res.cmpn(0) < 0) { res.iadd(this.m); } return res._forceRed(this); }; Red.prototype.isub = function isub (a, b) { this._verify2(a, b); var res = a.isub(b); if (res.cmpn(0) < 0) { res.iadd(this.m); } return res; }; Red.prototype.shl = function shl (a, num) { this._verify1(a); return this.imod(a.ushln(num)); }; Red.prototype.imul = function imul (a, b) { this._verify2(a, b); return this.imod(a.imul(b)); }; Red.prototype.mul = function mul (a, b) { this._verify2(a, b); return this.imod(a.mul(b)); }; Red.prototype.isqr = function isqr (a) { return this.imul(a, a.clone()); }; Red.prototype.sqr = function sqr (a) { return this.mul(a, a); }; Red.prototype.sqrt = function sqrt (a) { if (a.isZero()) return a.clone(); var mod3 = this.m.andln(3); assert(mod3 % 2 === 1); // Fast case if (mod3 === 3) { var pow = this.m.add(new BN(1)).iushrn(2); return this.pow(a, pow); } // Tonelli-Shanks algorithm (Totally unoptimized and slow) // // Find Q and S, that Q * 2 ^ S = (P - 1) var q = this.m.subn(1); var s = 0; while (!q.isZero() && q.andln(1) === 0) { s++; q.iushrn(1); } assert(!q.isZero()); var one = new BN(1).toRed(this); var nOne = one.redNeg(); // Find quadratic non-residue // NOTE: Max is such because of generalized Riemann hypothesis. var lpow = this.m.subn(1).iushrn(1); var z = this.m.bitLength(); z = new BN(2 * z * z).toRed(this); while (this.pow(z, lpow).cmp(nOne) !== 0) { z.redIAdd(nOne); } var c = this.pow(z, q); var r = this.pow(a, q.addn(1).iushrn(1)); var t = this.pow(a, q); var m = s; while (t.cmp(one) !== 0) { var tmp = t; for (var i = 0; tmp.cmp(one) !== 0; i++) { tmp = tmp.redSqr(); } assert(i < m); var b = this.pow(c, new BN(1).iushln(m - i - 1)); r = r.redMul(b); c = b.redSqr(); t = t.redMul(c); m = i; } return r; }; Red.prototype.invm = function invm (a) { var inv = a._invmp(this.m); if (inv.negative !== 0) { inv.negative = 0; return this.imod(inv).redNeg(); } else { return this.imod(inv); } }; Red.prototype.pow = function pow (a, num) { if (num.isZero()) return new BN(1).toRed(this); if (num.cmpn(1) === 0) return a.clone(); var windowSize = 4; var wnd = new Array(1 << windowSize); wnd[0] = new BN(1).toRed(this); wnd[1] = a; for (var i = 2; i < wnd.length; i++) { wnd[i] = this.mul(wnd[i - 1], a); } var res = wnd[0]; var current = 0; var currentLen = 0; var start = num.bitLength() % 26; if (start === 0) { start = 26; } for (i = num.length - 1; i >= 0; i--) { var word = num.words[i]; for (var j = start - 1; j >= 0; j--) { var bit = (word >> j) & 1; if (res !== wnd[0]) { res = this.sqr(res); } if (bit === 0 && current === 0) { currentLen = 0; continue; } current <<= 1; current |= bit; currentLen++; if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue; res = this.mul(res, wnd[current]); currentLen = 0; current = 0; } start = 26; } return res; }; Red.prototype.convertTo = function convertTo (num) { var r = num.umod(this.m); return r === num ? r.clone() : r; }; Red.prototype.convertFrom = function convertFrom (num) { var res = num.clone(); res.red = null; return res; }; // // Montgomery method engine // BN.mont = function mont (num) { return new Mont(num); }; function Mont (m) { Red.call(this, m); this.shift = this.m.bitLength(); if (this.shift % 26 !== 0) { this.shift += 26 - (this.shift % 26); } this.r = new BN(1).iushln(this.shift); this.r2 = this.imod(this.r.sqr()); this.rinv = this.r._invmp(this.m); this.minv = this.rinv.mul(this.r).isubn(1).div(this.m); this.minv = this.minv.umod(this.r); this.minv = this.r.sub(this.minv); } inherits(Mont, Red); Mont.prototype.convertTo = function convertTo (num) { return this.imod(num.ushln(this.shift)); }; Mont.prototype.convertFrom = function convertFrom (num) { var r = this.imod(num.mul(this.rinv)); r.red = null; return r; }; Mont.prototype.imul = function imul (a, b) { if (a.isZero() || b.isZero()) { a.words[0] = 0; a.length = 1; return a; } var t = a.imul(b); var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); var u = t.isub(c).iushrn(this.shift); var res = u; if (u.cmp(this.m) >= 0) { res = u.isub(this.m); } else if (u.cmpn(0) < 0) { res = u.iadd(this.m); } return res._forceRed(this); }; Mont.prototype.mul = function mul (a, b) { if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this); var t = a.mul(b); var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); var u = t.isub(c).iushrn(this.shift); var res = u; if (u.cmp(this.m) >= 0) { res = u.isub(this.m); } else if (u.cmpn(0) < 0) { res = u.iadd(this.m); } return res._forceRed(this); }; Mont.prototype.invm = function invm (a) { // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R var res = this.imod(a._invmp(this.m).mul(this.r2)); return res._forceRed(this); }; })(typeof module === 'undefined' || module, this); PK �~h[��� captains.jsnu �Iw�� /** * Return a default logger which writes to stdout and stderr. * * @return {Function} [enhanced log fn] * @api private */ module.exports = function LowLevelLogger() { var _stdout = console.log.bind(console); var _stderr = console.error.bind(console); // Emulate winston's output stream conventions // (so that existing tests will pass) return { crit: _stderr, error: _stderr, warn: _stdout, debug: _stderr, info: _stdout, verbose: _stdout, silly: _stdout, blank: _stdout }; }; PK �~h[]��# �# configure.jsnu �Iw�� /** * Module dependencies. */ var _ = require('@sailshq/lodash'); var rc = require('rc'); var chalk = require('chalk'); var DEFAULT = require('./defaults'); /** * By default, look for configuration in: * + `.captainslogrc` files * + `CAPTAINSLOG-*` env variables * * More on `rc` conventions: * https://github.com/dominictarr/rc#standards * * Special overrides: * + overrides.ignoreCLIArgs * -> ignore --verbose, --silent, and --silly * + overrides.rc * -> custom rc prefix to use * (or `false` to disable rc conf completely) * -> defaults to 'captainslog' * * @api private */ module.exports = function(overrides) { // console.log('overrides:',overrides); // console.log('DEFAULT.OVERRIDES:',DEFAULT.OVERRIDES); overrides = overrides || {}; // Overrides passed in programmatically always take precedence. overrides = _.extend({}, DEFAULT.OVERRIDES, overrides, { prefixThemes: (function (){ if (_.isObject(overrides.prefixThemes)) { return _.cloneDeep(overrides.prefixThemes); } else { return undefined; } })(), colors: _.extend({}, DEFAULT.OVERRIDES.colors, overrides.colors), logLevels: (function (){ if (_.isObject(overrides.logLevels)) { return _.clone(overrides.logLevels); } else { return undefined; } })() }); // Strip top-level undefined properties. _.each(_.keys(overrides), function (key) { if (_.isUndefined(overrides[key])) { delete overrides[key]; } }); // console.log('overrides (after merge):',overrides); // Then `rc` configuration conventions. // (https://github.com/dominictarr/rc#standards) var rconf; if (overrides.rc === false) { rconf = {}; } else { rconf = rc(overrides.rc); if (!overrides.ignoreCLIArgs) { rconf.level = rconf.level || // Accept command-line shortcuts: rconf.verbose ? 'verbose' : // --verbose rconf.silent ? 'silent' : // --silent rconf.silly ? 'silly' : // --silly undefined; } } rconf = rconf || {}; // console.log('\n* * * rconf:',rconf); // console.log('\n* * * overrides:',overrides); // Combine overrides and rc config into `options` var options = _.extend(_.clone(rconf), overrides, { prefixThemes: (function (){ if (_.isUndefined(overrides.prefixThemes)) { return _.cloneDeep(rconf.prefixThemes); } else if (_.isObject(overrides.prefixThemes)) { return _.merge(_.cloneDeep(rconf.prefixThemes||{}), _.cloneDeep(overrides.prefixThemes)); } else { return _.cloneDeep(overrides.prefixThemes); } })(), colors: (function (){ if (_.isUndefined(overrides.colors)) { return _.clone(rconf.colors); } else if (_.isObject(overrides.colors)) { return _.extend(_.clone(rconf.colors||{}), overrides.colors); } else { return _.clone(overrides.colors); } })(), logLevels: (function (){ if (_.isUndefined(overrides.logLevels)) { return _.clone(rconf.logLevels); } else if (_.isObject(overrides.logLevels)) { return _.extend(_.clone(rconf.logLevels||{}), overrides.logLevels); } else { return _.clone(overrides.logLevels); } })() }); // Strip top-level undefined properties. _.each(_.keys(options), function (key) { if (_.isUndefined(options[key])) { delete options[key]; } }); // console.log('\n* * * options (after merge):',options); // If `prefixes` were not explicitly set in user config, // and `colors` were not disabled in user config, // display colorized prefixes. if (options.prefixes === undefined && options.colors) { options.prefixes = {}; // Use prefixTheme if specified var prefixTheme = (options.prefixTheme || DEFAULT.OPTIONS.prefixTheme); // console.log('PREFIX THEME:',prefixTheme); // console.log('DEFAULT.OPTIONS.prefixThemes:',DEFAULT.OPTIONS.prefixThemes); // console.log('options.prefixThemes:',options.prefixThemes); var prefixes = options.prefixes; if (prefixTheme) { prefixes = (options.prefixThemes || DEFAULT.OPTIONS.prefixThemes)[prefixTheme]; if (!prefixes) { throw new Error('Consistency violation: prefixTheme option (`'+prefixTheme+'`) does not match any of the available themes.'); } } // console.log('---------------\nprefixes:',prefixes); DEFAULT.METHODS.forEach(function(logAt) { var prefix = prefixes[logAt]; // If a `prefix` was specified, use it instead // (keep in mind this is only if the user didn't define `prefixes`) var configuredPrefix = (options.prefix || DEFAULT.OPTIONS.prefix); // If `prefix` is explicitly set to `false` or `null`, // disable prefixes altogether. if (options.prefix === false || options.prefix === null) { configuredPrefix = ''; } // Default prefix for each log level to whatever's in the `prefixes` // conf, as long as no explicit global prefix was defined. configuredPrefix = configuredPrefix || prefixes[logAt]; // Add some color to this prefix: // Use the appropriate color for the log level. var colorMappings = _.isObject(options.colors) ? options.colors : {}; var colorName = colorMappings[logAt]; // Failsafe in case of troublesome configuration: if (colorName === undefined) { colorName = 'white'; } // Get the ANSI-colorized prefix. var colorizedPrefix = (function _getColorizedPrefix() { // If this is "rainbow" or "dimrainbow", handle it as a special case. // (based on https://github.com/Marak/colors.js/blob/dfb15b55382772ba4fd34fc21922a2d83e9d34d3/lib/maps/rainbow.js) if (colorName === 'rainbow' || colorName === 'dimrainbow') { //RoY G BiV var RAINBOW_COLORS = ['red', 'yellow', 'green', 'blue', 'magenta']; var exploded = configuredPrefix.split(''); var inRainbows = exploded.map(function (letter, i){ if (letter === ' ') { return letter; } else { var chalkOfThisColor = chalk[RAINBOW_COLORS[i++ % RAINBOW_COLORS.length]]; if (!chalkOfThisColor) { throw new Error('Consistency violation: Rainbow contains unrecognized color.'); } return chalkOfThisColor(letter); } }); inRainbows = inRainbows.join(''); // Dim rainbow, if desired. if (colorName === 'dimrainbow') { return chalk.dim(inRainbows); } else { return inRainbows; } }//• </if "rainbow"> // --• // Otherwise, this is some misc. color. // So attempt to get the appropriate chalk function. // If one exists, use it to transform the prefix. var chalkOfThisColor = chalk[colorName]; if (chalkOfThisColor) { return chalkOfThisColor(configuredPrefix); } // Otherwise see if this is looking for a "dim" chalk, // and if so, tint a chalk, use it to transform the prefix, // and then return that. else if (colorName.match(/^dim/)) { var similarChalk = chalk[colorName.slice(3)]; if (similarChalk) { return chalk.dim(similarChalk(configuredPrefix)); } } // --• // But otherwise, if no such color can be found, // then just use the uncolored prefix. return configuredPrefix; })();//</self-calling function :: _getColorizedPrefix()> // Set the now-potentially-customized prefix string // for this particular log level. options.prefixes[logAt] = colorizedPrefix; }); }//</if colored prefixes are enabled> // Then mix in the rest of the implicit default. // (DEFAULT.OPTIONS above) // console.log('options:',options); // console.log('DEFAULT.OPTIONS:',DEFAULT.OPTIONS); var finalOptions = _.extend({}, DEFAULT.OPTIONS, options, { prefixThemes: (function(){ if (_.isUndefined(options.prefixThemes)) { return _.cloneDeep(DEFAULT.OPTIONS.prefixThemes); } else if (_.isObject(options.prefixThemes)) { return _.merge(_.cloneDeep(DEFAULT.OPTIONS.prefixThemes), _.cloneDeep(options.prefixThemes)); } else { return _.cloneDeep(options.prefixThemes); } })(), colors: (function (){ if (_.isUndefined(options.colors)) { return _.clone(DEFAULT.OPTIONS.colors); } else if (_.isObject(options.colors)) { return _.extend({}, DEFAULT.OPTIONS.colors||{}, options.colors); } else { return _.clone(options.colors); } })(), logLevels: (function (){ if (_.isUndefined(options.logLevels)) { return _.clone(DEFAULT.OPTIONS.logLevels); } else if (_.isObject(options.logLevels)) { return _.extend({}, DEFAULT.OPTIONS.logLevels||{}, options.logLevels); } else { return _.clone(options.logLevels); } })() }); // Strip top-level undefined properties. _.each(_.keys(finalOptions), function (key) { if (_.isUndefined(finalOptions[key])) { delete finalOptions[key]; } }); // console.log('final options (after merge):',finalOptions); return finalOptions; }; PK �~h[�\j2 2 defaults.jsnu �Iw�� /** * Implicit defaults. * (OPTIONS and OVERRIDES) * * @type {Dictionary} * @api private */ module.exports = { OPTIONS: { level: 'info', //////////////////////////////////////////////////////////// // Backwards compatibility: // (should always be true going forward) // // Whether to use additional `inspect` logic // (if false- just do exactly what `console.log` would do) inspect: true, //////////////////////////////////////////////////////////// logLevels: { silly: 0, verbose: 1, info: 2, blank: 2, debug: 3, warn: 4, error: 5, crit: 6, silent: 7 }, globalizeAs: false, // If defined, uses a prefixTheme as default prefixTheme: 'traditional', // Different built-in prefix themes: prefixThemes: { traditional: { silly: ' : ', verbose: 'verbo: ', info: ' info: ', blank: '', debug: 'debug: ', warn: ' warn: ', error: 'error: ', crit: ' crit: ' }, abbreviated: { silly: '[~] ', verbose: '[v] ', info: '[i] ', blank: '', debug: '[d] ', warn: '[!] ', error: '[×] ', crit: '[Ω] ' }, moderate: { silly: '[silly] ', verbose: '[verbose] ', info: ' ', blank: '', debug: '[-] ', warn: '[!] ', error: '[err] ', crit: '[CRITICAL] ' }, aligned: { silly: ' silly | ', verbose: ' verbose | ', info: ' info | ', blank: '', debug: ' debug | ', warn: ' warn | ', error: ' error | ', crit: 'CRITICAL | ' }, minimalist: { silly: ' | ', verbose: ' | ', info: ' | ', blank: '', debug: ' | ', warn: 'warn: ', error: 'error: ', crit: 'CRITICAL: ' }, bubbles: { silly: ' ', verbose: '˙˙ ', info: '˙· ', blank: '', debug: '•· ', warn: 'warn: ', error: 'error: ', crit: 'CRITICAL: ' }, flowers: { silly: ' ', verbose: '˙˘˙ ', info: '~%° ', blank: '', debug: '~∞%° ', warn: 'warn: ', error: 'error: ', crit: 'CRITICAL: ' } }, // The `prefixTheme` option is really just shorthand that allows // for configuring a set of log-level-specific prefix settings. // If specified, the following, lower-level `prefix` option overrides // the themes above: // prefix: '||| ' }, OVERRIDES: { rc: 'captainslog', ignoreCLIArgs: false, // (only used if prefixes are not explicitly set) colors: { silly: 'black', input: 'black',//« uncommon verbose: 'dimgray', prompt: 'gray',//« uncommon info: 'green', blank: 'white', data: 'gray',//« uncommon help: 'cyan',//« uncommon warn: 'yellow', debug: 'blue', error: 'red', crit: 'bgRed'//« uncommon } }, // Log methods to expose METHODS: ['crit', 'error', 'warn', 'debug', 'info', 'blank', 'verbose', 'silly'] }; PK �~h[G�߸ wrap.jsnu �Iw�� /** * Module dependencies. */ var write = require('./write'); var DEFAULT = require('./defaults'); /** * Return a special version of `logger` which may * be called directly as a function (implicitly calls * `logger.debug` behind the scenes) * * @param {Dictionary} logger [original logger] * @return {Function} [callable Logger] * @api private */ module.exports = function _wrap(logger, options) { // Make base logger callable (debug) var _CallableLogger = write(logger.debug, 'debug', options); // Mix-in log methods, but run `write` // on their arguments to improve the readability // of log output. DEFAULT.METHODS.forEach(function(logAt) { _CallableLogger[logAt] = write(logger[logAt], logAt, options); }); return _CallableLogger; }; PK �~h[�ۄ write.jsnu �Iw�� /** * Module dependencies. */ var util = require('util'); var _ = require('@sailshq/lodash'); var semver = require('semver'); var IS_NODE_8_OR_NEWER = semver.satisfies(semver.clean(process.version), '8'); /** * Build a log function which combines arguments into a string, * enhancing them for readability. If specified, prefixes will be * added. * * @param {Function} logFn [log fn] * @param {String} logAt [e.g. 'silly' or 'error'] * @param {Dictionary} options * * @return {Function} [enhanced log fn] * @api private */ module.exports = function(logFn, logAt, options) { return function _writeLogToConsole() { // Check `options.level` against logAt // to see whether to write the log. // ( silly = 0 | silent = highest ) var lvlMap = options.logLevels; var configuredLvl = options.level; if (lvlMap[logAt] < lvlMap[configuredLvl]) { return; } var args = Array.prototype.slice.call(arguments); ///////////////////////////////////////////////////////////////// // For backwards-compatibility: // (options.inspect should always be true going forward) // // Note that prefixes and other options will not work with // `inspect===false`. New features will also not support // inspect:false. // // If `options.inspect` is disabled, just call the log fn normally if (!options.inspect) { return logFn.apply(logFn, args); } ///////////////////////////////////////////////////////////////// // For reference on the following impl, see: // https://github.com/defunctzombie/node-util/blob/master/util.js#L22 // Combine & pre-process the arguments passed into the log fn var pieces = []; _.each(args, function(arg) { // JavaScript Error instances // > Note that if the experimental `_dontAccessErrorStacks` option is enabled, // > Error stacks will never accessed. This is useful for performance tuning, // > as explained in: https://github.com/balderdashy/captains-log/issues/17 if (!options._dontAccessErrorStacks && _.isError(arg) && !arg.inspect) { // In Node 8, the behavior of util.inspect-ing Errors changed to include // their stack traces, plus additional information. So if supported, // we take advange of that. pieces.push(IS_NODE_8_OR_NEWER ? util.inspect(arg) : arg.stack); } // Non-strings // (miscellaneous arrays, dictionaries, mysterious objects, etc) else if (!_.isString(arg)) { if (options.inspectOptions) { pieces.push(util.inspect(arg, options.inspectOptions)); } else { pieces.push(util.inspect(arg)); } return; } // Strings else { pieces.push(arg); } }); // Compose `str` of all the arguments // (include the appropriate prefix if specified) var prefixStr = (options.prefixes && options.prefixes[logAt]) || ''; var str = prefixStr + util.format.apply(util, pieces); // Call log fn return logFn.apply(logFn, [str]); }; }; PK ̄j[o��q� � retry.jsnu �Iw�� var RetryOperation = require('./retry_operation'); exports.operation = function(options) { var timeouts = exports.timeouts(options); return new RetryOperation(timeouts, { forever: options && options.forever, unref: options && options.unref, maxRetryTime: options && options.maxRetryTime }); }; exports.timeouts = function(options) { if (options instanceof Array) { return [].concat(options); } var opts = { retries: 10, factor: 2, minTimeout: 1 * 1000, maxTimeout: Infinity, randomize: false }; for (var key in options) { opts[key] = options[key]; } if (opts.minTimeout > opts.maxTimeout) { throw new Error('minTimeout is greater than maxTimeout'); } var timeouts = []; for (var i = 0; i < opts.retries; i++) { timeouts.push(this.createTimeout(i, opts)); } if (options && options.forever && !timeouts.length) { timeouts.push(this.createTimeout(i, opts)); } // sort the array numerically ascending timeouts.sort(function(a,b) { return a - b; }); return timeouts; }; exports.createTimeout = function(attempt, opts) { var random = (opts.randomize) ? (Math.random() + 1) : 1; var timeout = Math.round(random * opts.minTimeout * Math.pow(opts.factor, attempt)); timeout = Math.min(timeout, opts.maxTimeout); return timeout; }; exports.wrap = function(obj, options, methods) { if (options instanceof Array) { methods = options; options = null; } if (!methods) { methods = []; for (var key in obj) { if (typeof obj[key] === 'function') { methods.push(key); } } } for (var i = 0; i < methods.length; i++) { var method = methods[i]; var original = obj[method]; obj[method] = function retryWrapper(original) { var op = exports.operation(options); var args = Array.prototype.slice.call(arguments, 1); var callback = args.pop(); args.push(function(err) { if (op.retry(err)) { return; } if (err) { arguments[0] = op.mainError(); } callback.apply(this, arguments); }); op.attempt(function() { original.apply(obj, args); }); }.bind(obj, original); obj[method].options = options; } }; PK ̄j[�9��I I retry_operation.jsnu �Iw�� function RetryOperation(timeouts, options) { // Compatibility for the old (timeouts, retryForever) signature if (typeof options === 'boolean') { options = { forever: options }; } this._originalTimeouts = JSON.parse(JSON.stringify(timeouts)); this._timeouts = timeouts; this._options = options || {}; this._maxRetryTime = options && options.maxRetryTime || Infinity; this._fn = null; this._errors = []; this._attempts = 1; this._operationTimeout = null; this._operationTimeoutCb = null; this._timeout = null; this._operationStart = null; if (this._options.forever) { this._cachedTimeouts = this._timeouts.slice(0); } } module.exports = RetryOperation; RetryOperation.prototype.reset = function() { this._attempts = 1; this._timeouts = this._originalTimeouts; } RetryOperation.prototype.stop = function() { if (this._timeout) { clearTimeout(this._timeout); } this._timeouts = []; this._cachedTimeouts = null; }; RetryOperation.prototype.retry = function(err) { if (this._timeout) { clearTimeout(this._timeout); } if (!err) { return false; } var currentTime = new Date().getTime(); if (err && currentTime - this._operationStart >= this._maxRetryTime) { this._errors.unshift(new Error('RetryOperation timeout occurred')); return false; } this._errors.push(err); var timeout = this._timeouts.shift(); if (timeout === undefined) { if (this._cachedTimeouts) { // retry forever, only keep last error this._errors.splice(this._errors.length - 1, this._errors.length); this._timeouts = this._cachedTimeouts.slice(0); timeout = this._timeouts.shift(); } else { return false; } } var self = this; var timer = setTimeout(function() { self._attempts++; if (self._operationTimeoutCb) { self._timeout = setTimeout(function() { self._operationTimeoutCb(self._attempts); }, self._operationTimeout); if (self._options.unref) { self._timeout.unref(); } } self._fn(self._attempts); }, timeout); if (this._options.unref) { timer.unref(); } return true; }; RetryOperation.prototype.attempt = function(fn, timeoutOps) { this._fn = fn; if (timeoutOps) { if (timeoutOps.timeout) { this._operationTimeout = timeoutOps.timeout; } if (timeoutOps.cb) { this._operationTimeoutCb = timeoutOps.cb; } } var self = this; if (this._operationTimeoutCb) { this._timeout = setTimeout(function() { self._operationTimeoutCb(); }, self._operationTimeout); } this._operationStart = new Date().getTime(); this._fn(this._attempts); }; RetryOperation.prototype.try = function(fn) { console.log('Using RetryOperation.try() is deprecated'); this.attempt(fn); }; RetryOperation.prototype.start = function(fn) { console.log('Using RetryOperation.start() is deprecated'); this.attempt(fn); }; RetryOperation.prototype.start = RetryOperation.prototype.try; RetryOperation.prototype.errors = function() { return this._errors; }; RetryOperation.prototype.attempts = function() { return this._attempts; }; RetryOperation.prototype.mainError = function() { if (this._errors.length === 0) { return null; } var counts = {}; var mainError = null; var mainErrorCount = 0; for (var i = 0; i < this._errors.length; i++) { var error = this._errors[i]; var message = error.message; var count = (counts[message] || 0) + 1; counts[message] = count; if (count >= mainErrorCount) { mainError = error; mainErrorCount = count; } } return mainError; }; PK An[��kU U bom-handling.jsnu �Iw�� "use strict"; var BOMChar = '\uFEFF'; exports.PrependBOM = PrependBOMWrapper function PrependBOMWrapper(encoder, options) { this.encoder = encoder; this.addBOM = true; } PrependBOMWrapper.prototype.write = function(str) { if (this.addBOM) { str = BOMChar + str; this.addBOM = false; } return this.encoder.write(str); } PrependBOMWrapper.prototype.end = function() { return this.encoder.end(); } //------------------------------------------------------------------------------ exports.StripBOM = StripBOMWrapper; function StripBOMWrapper(decoder, options) { this.decoder = decoder; this.pass = false; this.options = options || {}; } StripBOMWrapper.prototype.write = function(buf) { var res = this.decoder.write(buf); if (this.pass || !res) return res; if (res[0] === BOMChar) { res = res.slice(1); if (typeof this.options.stripBOM === 'function') this.options.stripBOM(); } this.pass = true; return res; } StripBOMWrapper.prototype.end = function() { return this.decoder.end(); } PK An[� �}�! �! extend-node.jsnu �Iw�� "use strict"; var Buffer = require("buffer").Buffer; // Note: not polyfilled with safer-buffer on a purpose, as overrides Buffer // == Extend Node primitives to use iconv-lite ================================= module.exports = function (iconv) { var original = undefined; // Place to keep original methods. // Node authors rewrote Buffer internals to make it compatible with // Uint8Array and we cannot patch key functions since then. // Note: this does use older Buffer API on a purpose iconv.supportsNodeEncodingsExtension = !(Buffer.from || new Buffer(0) instanceof Uint8Array); iconv.extendNodeEncodings = function extendNodeEncodings() { if (original) return; original = {}; if (!iconv.supportsNodeEncodingsExtension) { console.error("ACTION NEEDED: require('iconv-lite').extendNodeEncodings() is not supported in your version of Node"); console.error("See more info at https://github.com/ashtuchkin/iconv-lite/wiki/Node-v4-compatibility"); return; } var nodeNativeEncodings = { 'hex': true, 'utf8': true, 'utf-8': true, 'ascii': true, 'binary': true, 'base64': true, 'ucs2': true, 'ucs-2': true, 'utf16le': true, 'utf-16le': true, }; Buffer.isNativeEncoding = function(enc) { return enc && nodeNativeEncodings[enc.toLowerCase()]; } // -- SlowBuffer ----------------------------------------------------------- var SlowBuffer = require('buffer').SlowBuffer; original.SlowBufferToString = SlowBuffer.prototype.toString; SlowBuffer.prototype.toString = function(encoding, start, end) { encoding = String(encoding || 'utf8').toLowerCase(); // Use native conversion when possible if (Buffer.isNativeEncoding(encoding)) return original.SlowBufferToString.call(this, encoding, start, end); // Otherwise, use our decoding method. if (typeof start == 'undefined') start = 0; if (typeof end == 'undefined') end = this.length; return iconv.decode(this.slice(start, end), encoding); } original.SlowBufferWrite = SlowBuffer.prototype.write; SlowBuffer.prototype.write = function(string, offset, length, encoding) { // Support both (string, offset, length, encoding) // and the legacy (string, encoding, offset, length) if (isFinite(offset)) { if (!isFinite(length)) { encoding = length; length = undefined; } } else { // legacy var swap = encoding; encoding = offset; offset = length; length = swap; } offset = +offset || 0; var remaining = this.length - offset; if (!length) { length = remaining; } else { length = +length; if (length > remaining) { length = remaining; } } encoding = String(encoding || 'utf8').toLowerCase(); // Use native conversion when possible if (Buffer.isNativeEncoding(encoding)) return original.SlowBufferWrite.call(this, string, offset, length, encoding); if (string.length > 0 && (length < 0 || offset < 0)) throw new RangeError('attempt to write beyond buffer bounds'); // Otherwise, use our encoding method. var buf = iconv.encode(string, encoding); if (buf.length < length) length = buf.length; buf.copy(this, offset, 0, length); return length; } // -- Buffer --------------------------------------------------------------- original.BufferIsEncoding = Buffer.isEncoding; Buffer.isEncoding = function(encoding) { return Buffer.isNativeEncoding(encoding) || iconv.encodingExists(encoding); } original.BufferByteLength = Buffer.byteLength; Buffer.byteLength = SlowBuffer.byteLength = function(str, encoding) { encoding = String(encoding || 'utf8').toLowerCase(); // Use native conversion when possible if (Buffer.isNativeEncoding(encoding)) return original.BufferByteLength.call(this, str, encoding); // Slow, I know, but we don't have a better way yet. return iconv.encode(str, encoding).length; } original.BufferToString = Buffer.prototype.toString; Buffer.prototype.toString = function(encoding, start, end) { encoding = String(encoding || 'utf8').toLowerCase(); // Use native conversion when possible if (Buffer.isNativeEncoding(encoding)) return original.BufferToString.call(this, encoding, start, end); // Otherwise, use our decoding method. if (typeof start == 'undefined') start = 0; if (typeof end == 'undefined') end = this.length; return iconv.decode(this.slice(start, end), encoding); } original.BufferWrite = Buffer.prototype.write; Buffer.prototype.write = function(string, offset, length, encoding) { var _offset = offset, _length = length, _encoding = encoding; // Support both (string, offset, length, encoding) // and the legacy (string, encoding, offset, length) if (isFinite(offset)) { if (!isFinite(length)) { encoding = length; length = undefined; } } else { // legacy var swap = encoding; encoding = offset; offset = length; length = swap; } encoding = String(encoding || 'utf8').toLowerCase(); // Use native conversion when possible if (Buffer.isNativeEncoding(encoding)) return original.BufferWrite.call(this, string, _offset, _length, _encoding); offset = +offset || 0; var remaining = this.length - offset; if (!length) { length = remaining; } else { length = +length; if (length > remaining) { length = remaining; } } if (string.length > 0 && (length < 0 || offset < 0)) throw new RangeError('attempt to write beyond buffer bounds'); // Otherwise, use our encoding method. var buf = iconv.encode(string, encoding); if (buf.length < length) length = buf.length; buf.copy(this, offset, 0, length); return length; // TODO: Set _charsWritten. } // -- Readable ------------------------------------------------------------- if (iconv.supportsStreams) { var Readable = require('stream').Readable; original.ReadableSetEncoding = Readable.prototype.setEncoding; Readable.prototype.setEncoding = function setEncoding(enc, options) { // Use our own decoder, it has the same interface. // We cannot use original function as it doesn't handle BOM-s. this._readableState.decoder = iconv.getDecoder(enc, options); this._readableState.encoding = enc; } Readable.prototype.collect = iconv._collect; } } // Remove iconv-lite Node primitive extensions. iconv.undoExtendNodeEncodings = function undoExtendNodeEncodings() { if (!iconv.supportsNodeEncodingsExtension) return; if (!original) throw new Error("require('iconv-lite').undoExtendNodeEncodings(): Nothing to undo; extendNodeEncodings() is not called.") delete Buffer.isNativeEncoding; var SlowBuffer = require('buffer').SlowBuffer; SlowBuffer.prototype.toString = original.SlowBufferToString; SlowBuffer.prototype.write = original.SlowBufferWrite; Buffer.isEncoding = original.BufferIsEncoding; Buffer.byteLength = original.BufferByteLength; Buffer.prototype.toString = original.BufferToString; Buffer.prototype.write = original.BufferWrite; if (iconv.supportsStreams) { var Readable = require('stream').Readable; Readable.prototype.setEncoding = original.ReadableSetEncoding; delete Readable.prototype.collect; } original = undefined; } } PK An[��b�� � index.d.tsnu �Iw�� /*--------------------------------------------------------------------------------------------- * Copyright (c) Microsoft Corporation. All rights reserved. * Licensed under the MIT License. * REQUIREMENT: This definition is dependent on the @types/node definition. * Install with `npm install @types/node --save-dev` *--------------------------------------------------------------------------------------------*/ declare module 'iconv-lite' { export function decode(buffer: Buffer, encoding: string, options?: Options): string; export function encode(content: string, encoding: string, options?: Options): Buffer; export function encodingExists(encoding: string): boolean; export function decodeStream(encoding: string, options?: Options): NodeJS.ReadWriteStream; export function encodeStream(encoding: string, options?: Options): NodeJS.ReadWriteStream; } export interface Options { stripBOM?: boolean; addBOM?: boolean; defaultEncoding?: string; } PK An[�'�(; ; streams.jsnu �Iw�� "use strict"; var Buffer = require("buffer").Buffer, Transform = require("stream").Transform; // == Exports ================================================================== module.exports = function(iconv) { // Additional Public API. iconv.encodeStream = function encodeStream(encoding, options) { return new IconvLiteEncoderStream(iconv.getEncoder(encoding, options), options); } iconv.decodeStream = function decodeStream(encoding, options) { return new IconvLiteDecoderStream(iconv.getDecoder(encoding, options), options); } iconv.supportsStreams = true; // Not published yet. iconv.IconvLiteEncoderStream = IconvLiteEncoderStream; iconv.IconvLiteDecoderStream = IconvLiteDecoderStream; iconv._collect = IconvLiteDecoderStream.prototype.collect; }; // == Encoder stream ======================================================= function IconvLiteEncoderStream(conv, options) { this.conv = conv; options = options || {}; options.decodeStrings = false; // We accept only strings, so we don't need to decode them. Transform.call(this, options); } IconvLiteEncoderStream.prototype = Object.create(Transform.prototype, { constructor: { value: IconvLiteEncoderStream } }); IconvLiteEncoderStream.prototype._transform = function(chunk, encoding, done) { if (typeof chunk != 'string') return done(new Error("Iconv encoding stream needs strings as its input.")); try { var res = this.conv.write(chunk); if (res && res.length) this.push(res); done(); } catch (e) { done(e); } } IconvLiteEncoderStream.prototype._flush = function(done) { try { var res = this.conv.end(); if (res && res.length) this.push(res); done(); } catch (e) { done(e); } } IconvLiteEncoderStream.prototype.collect = function(cb) { var chunks = []; this.on('error', cb); this.on('data', function(chunk) { chunks.push(chunk); }); this.on('end', function() { cb(null, Buffer.concat(chunks)); }); return this; } // == Decoder stream ======================================================= function IconvLiteDecoderStream(conv, options) { this.conv = conv; options = options || {}; options.encoding = this.encoding = 'utf8'; // We output strings. Transform.call(this, options); } IconvLiteDecoderStream.prototype = Object.create(Transform.prototype, { constructor: { value: IconvLiteDecoderStream } }); IconvLiteDecoderStream.prototype._transform = function(chunk, encoding, done) { if (!Buffer.isBuffer(chunk)) return done(new Error("Iconv decoding stream needs buffers as its input.")); try { var res = this.conv.write(chunk); if (res && res.length) this.push(res, this.encoding); done(); } catch (e) { done(e); } } IconvLiteDecoderStream.prototype._flush = function(done) { try { var res = this.conv.end(); if (res && res.length) this.push(res, this.encoding); done(); } catch (e) { done(e); } } IconvLiteDecoderStream.prototype.collect = function(cb) { var res = ''; this.on('error', cb); this.on('data', function(chunk) { res += chunk; }); this.on('end', function() { cb(null, res); }); return this; } PK �n[*� �� � __mocks__/ErrorUtils.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. */ 'use strict'; var ErrorUtils = jest.genMockFromModule("../ErrorUtils"); ErrorUtils.applyWithGuard.mockImplementation(function (callback, context, args) { return callback.apply(context, args); }); ErrorUtils.guard.mockImplementation(function (callback) { return callback; }); module.exports = ErrorUtils;PK �n[]5�� � __mocks__/base62.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. */ 'use strict'; module.exports = require.requireActual("../base62");PK �n[i� � __mocks__/crc32.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. */ 'use strict'; module.exports = require.requireActual("../crc32");PK �n[0Ǐx� � __mocks__/fetch.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @noflow */ 'use strict'; var Deferred = require.requireActual("../Deferred"); var fetch = jest.fn(function (uri, options) { var deferred = new Deferred(); fetch.mock.deferreds.push(deferred); return deferred.getPromise(); }); fetch.mock.deferreds = []; module.exports = fetch;PK �n[�:�� � __mocks__/fetchWithRetries.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @noflow */ 'use strict'; var Deferred = require.requireActual("../Deferred"); function fetchWithRetries() { var deferred = new Deferred(); for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) { args[_key] = arguments[_key]; } fetchWithRetries.mock.calls.push(args); fetchWithRetries.mock.deferreds.push(deferred); return deferred.getPromise(); } fetchWithRetries.mock = { calls: [], deferreds: [] }; module.exports = fetchWithRetries;PK �n[�X�* __mocks__/nullthrows.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. */ 'use strict'; jest.unmock("../nullthrows"); module.exports = require("../nullthrows");PK �n[�cT T TouchEventUtils.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ var TouchEventUtils = { /** * Utility function for common case of extracting out the primary touch from a * touch event. * - `touchEnd` events usually do not have the `touches` property. * http://stackoverflow.com/questions/3666929/ * mobile-sarai-touchend-event-not-firing-when-last-touch-is-removed * * @param {Event} nativeEvent Native event that may or may not be a touch. * @return {TouchesObject?} an object with pageX and pageY or null. */ extractSingleTouch: function extractSingleTouch(nativeEvent) { var touches = nativeEvent.touches; var changedTouches = nativeEvent.changedTouches; var hasTouches = touches && touches.length > 0; var hasChangedTouches = changedTouches && changedTouches.length > 0; return !hasTouches && hasChangedTouches ? changedTouches[0] : hasTouches ? touches[0] : nativeEvent; } }; module.exports = TouchEventUtils;PK �n[�=F# # BrowserSupportCore.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ var getVendorPrefixedName = require("./getVendorPrefixedName"); var BrowserSupportCore = { /** * @return {bool} True if browser supports css animations. */ hasCSSAnimations: function hasCSSAnimations() { return !!getVendorPrefixedName('animationName'); }, /** * @return {bool} True if browser supports css transforms. */ hasCSSTransforms: function hasCSSTransforms() { return !!getVendorPrefixedName('transform'); }, /** * @return {bool} True if browser supports css 3d transforms. */ hasCSS3DTransforms: function hasCSS3DTransforms() { return !!getVendorPrefixedName('perspective'); }, /** * @return {bool} True if browser supports css transitions. */ hasCSSTransitions: function hasCSSTransitions() { return !!getVendorPrefixedName('transition'); } }; module.exports = BrowserSupportCore;PK �n[ ���M M TokenizeUtil.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule TokenizeUtil * @typechecks * @stub * @flow */ 'use strict'; // \u00a1-\u00b1\u00b4-\u00b8\u00ba\u00bb\u00bf // is latin supplement punctuation except fractions and superscript // numbers // \u2010-\u2027\u2030-\u205e // is punctuation from the general punctuation block: // weird quotes, commas, bullets, dashes, etc. // \u30fb\u3001\u3002\u3008-\u3011\u3014-\u301f // is CJK punctuation // \uff1a-\uff1f\uff01-\uff0f\uff3b-\uff40\uff5b-\uff65 // is some full-width/half-width punctuation // \u2E2E\u061f\u066a-\u066c\u061b\u060c\u060d\uFD3e\uFD3F // is some Arabic punctuation marks // \u1801\u0964\u104a\u104b // is misc. other language punctuation marks var PUNCTUATION = '[.,+*?$|#{}()\'\\^\\-\\[\\]\\\\\\/!@%"~=<>_:;' + '\u30fb\u3001\u3002\u3008-\u3011\u3014-\u301f\uff1a-\uff1f\uff01-\uff0f' + '\uff3b-\uff40\uff5b-\uff65\u2E2E\u061f\u066a-\u066c\u061b\u060c\u060d' + '\uFD3e\uFD3F\u1801\u0964\u104a\u104b\u2010-\u2027\u2030-\u205e' + '\u00a1-\u00b1\u00b4-\u00b8\u00ba\u00bb\u00bf]'; module.exports = { getPunctuation: (): string => PUNCTUATION };PK �n[�s � � BrowserSupportCore.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule BrowserSupportCore */ var getVendorPrefixedName = require("./getVendorPrefixedName"); var BrowserSupportCore = { /** * @return {bool} True if browser supports css animations. */ hasCSSAnimations: function () { return !!getVendorPrefixedName('animationName'); }, /** * @return {bool} True if browser supports css transforms. */ hasCSSTransforms: function () { return !!getVendorPrefixedName('transform'); }, /** * @return {bool} True if browser supports css 3d transforms. */ hasCSS3DTransforms: function () { return !!getVendorPrefixedName('perspective'); }, /** * @return {bool} True if browser supports css transitions. */ hasCSSTransitions: function () { return !!getVendorPrefixedName('transition'); } }; module.exports = BrowserSupportCore;PK �n[�� crc32.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ function crc32(str) { /* jslint bitwise: true */ var crc = -1; for (var i = 0, len = str.length; i < len; i++) { crc = crc >>> 8 ^ table[(crc ^ str.charCodeAt(i)) & 0xFF]; } return ~crc; } var table = [0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D]; if (global.Int32Array !== undefined) { table = new Int32Array(table); } module.exports = crc32;PK �n[���6 6 CSSCore.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var invariant = require("./invariant"); /** * The CSSCore module specifies the API (and implements most of the methods) * that should be used when dealing with the display of elements (via their * CSS classes and visibility on screen. It is an API focused on mutating the * display and not reading it as no logical state should be encoded in the * display of elements. */ /* Slow implementation for browsers that don't natively support .matches() */ function matchesSelector_SLOW(element, selector) { var root = element; while (root.parentNode) { root = root.parentNode; } var all = root.querySelectorAll(selector); return Array.prototype.indexOf.call(all, element) !== -1; } var CSSCore = { /** * Adds the class passed in to the element if it doesn't already have it. * * @param {DOMElement} element the element to set the class on * @param {string} className the CSS className * @return {DOMElement} the element passed in */ addClass: function addClass(element, className) { !!/\s/.test(className) ? process.env.NODE_ENV !== "production" ? invariant(false, 'CSSCore.addClass takes only a single class name. "%s" contains ' + 'multiple classes.', className) : invariant(false) : void 0; if (className) { if (element.classList) { element.classList.add(className); } else if (!CSSCore.hasClass(element, className)) { element.className = element.className + ' ' + className; } } return element; }, /** * Removes the class passed in from the element * * @param {DOMElement} element the element to set the class on * @param {string} className the CSS className * @return {DOMElement} the element passed in */ removeClass: function removeClass(element, className) { !!/\s/.test(className) ? process.env.NODE_ENV !== "production" ? invariant(false, 'CSSCore.removeClass takes only a single class name. "%s" contains ' + 'multiple classes.', className) : invariant(false) : void 0; if (className) { if (element.classList) { element.classList.remove(className); } else if (CSSCore.hasClass(element, className)) { element.className = element.className.replace(new RegExp('(^|\\s)' + className + '(?:\\s|$)', 'g'), '$1').replace(/\s+/g, ' ') // multiple spaces to one .replace(/^\s*|\s*$/g, ''); // trim the ends } } return element; }, /** * Helper to add or remove a class from an element based on a condition. * * @param {DOMElement} element the element to set the class on * @param {string} className the CSS className * @param {*} bool condition to whether to add or remove the class * @return {DOMElement} the element passed in */ conditionClass: function conditionClass(element, className, bool) { return (bool ? CSSCore.addClass : CSSCore.removeClass)(element, className); }, /** * Tests whether the element has the class specified. * * @param {DOMNode|DOMWindow} element the element to check the class on * @param {string} className the CSS className * @return {boolean} true if the element has the class, false if not */ hasClass: function hasClass(element, className) { !!/\s/.test(className) ? process.env.NODE_ENV !== "production" ? invariant(false, 'CSS.hasClass takes only a single class name.') : invariant(false) : void 0; if (element.classList) { return !!className && element.classList.contains(className); } return (' ' + element.className + ' ').indexOf(' ' + className + ' ') > -1; }, /** * Tests whether the element matches the selector specified * * @param {DOMNode|DOMWindow} element the element that we are querying * @param {string} selector the CSS selector * @return {boolean} true if the element matches the selector, false if not */ matchesSelector: function matchesSelector(element, selector) { var matchesImpl = element.matches || element.webkitMatchesSelector || element.mozMatchesSelector || element.msMatchesSelector || function (s) { return matchesSelector_SLOW(element, s); }; return matchesImpl.call(element, selector); } }; module.exports = CSSCore;PK �n[�fJI I UserAgentData.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule UserAgentData */ /** * Usage note: * This module makes a best effort to export the same data we would internally. * At Facebook we use a server-generated module that does the parsing and * exports the data for the client to use. We can't rely on a server-side * implementation in open source so instead we make use of an open source * library to do the heavy lifting and then make some adjustments as necessary. * It's likely there will be some differences. Some we can smooth over. * Others are going to be harder. */ 'use strict'; var UAParser = require("ua-parser-js"); var UNKNOWN = 'Unknown'; var PLATFORM_MAP = { 'Mac OS': 'Mac OS X' }; /** * Convert from UAParser platform name to what we expect. */ function convertPlatformName(name) { return PLATFORM_MAP[name] || name; } /** * Get the version number in parts. This is very naive. We actually get major * version as a part of UAParser already, which is generally good enough, but * let's get the minor just in case. */ function getBrowserVersion(version) { if (!version) { return { major: '', minor: '' }; } var parts = version.split('.'); return { major: parts[0], minor: parts[1] }; } /** * Get the UA data fom UAParser and then convert it to the format we're * expecting for our APIS. */ var parser = new UAParser(); var results = parser.getResult(); // Do some conversion first. var browserVersionData = getBrowserVersion(results.browser.version); var uaData = { browserArchitecture: results.cpu.architecture || UNKNOWN, browserFullVersion: results.browser.version || UNKNOWN, browserMinorVersion: browserVersionData.minor || UNKNOWN, browserName: results.browser.name || UNKNOWN, browserVersion: results.browser.major || UNKNOWN, deviceName: results.device.model || UNKNOWN, engineName: results.engine.name || UNKNOWN, engineVersion: results.engine.version || UNKNOWN, platformArchitecture: results.cpu.architecture || UNKNOWN, platformName: convertPlatformName(results.os.name) || UNKNOWN, platformVersion: results.os.version || UNKNOWN, platformFullVersion: results.os.version || UNKNOWN }; module.exports = uaData;PK �n[�:� CSSCore.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule CSSCore * @typechecks */ const invariant = require("./invariant"); /** * The CSSCore module specifies the API (and implements most of the methods) * that should be used when dealing with the display of elements (via their * CSS classes and visibility on screen. It is an API focused on mutating the * display and not reading it as no logical state should be encoded in the * display of elements. */ /* Slow implementation for browsers that don't natively support .matches() */ function matchesSelector_SLOW(element, selector) { let root = element; while (root.parentNode) { root = root.parentNode; } const all = root.querySelectorAll(selector); return Array.prototype.indexOf.call(all, element) !== -1; } const CSSCore = { /** * Adds the class passed in to the element if it doesn't already have it. * * @param {DOMElement} element the element to set the class on * @param {string} className the CSS className * @return {DOMElement} the element passed in */ addClass: function (element, className) { invariant(!/\s/.test(className), 'CSSCore.addClass takes only a single class name. "%s" contains ' + 'multiple classes.', className); if (className) { if (element.classList) { element.classList.add(className); } else if (!CSSCore.hasClass(element, className)) { element.className = element.className + ' ' + className; } } return element; }, /** * Removes the class passed in from the element * * @param {DOMElement} element the element to set the class on * @param {string} className the CSS className * @return {DOMElement} the element passed in */ removeClass: function (element, className) { invariant(!/\s/.test(className), 'CSSCore.removeClass takes only a single class name. "%s" contains ' + 'multiple classes.', className); if (className) { if (element.classList) { element.classList.remove(className); } else if (CSSCore.hasClass(element, className)) { element.className = element.className.replace(new RegExp('(^|\\s)' + className + '(?:\\s|$)', 'g'), '$1').replace(/\s+/g, ' ') // multiple spaces to one .replace(/^\s*|\s*$/g, ''); // trim the ends } } return element; }, /** * Helper to add or remove a class from an element based on a condition. * * @param {DOMElement} element the element to set the class on * @param {string} className the CSS className * @param {*} bool condition to whether to add or remove the class * @return {DOMElement} the element passed in */ conditionClass: function (element, className, bool) { return (bool ? CSSCore.addClass : CSSCore.removeClass)(element, className); }, /** * Tests whether the element has the class specified. * * @param {DOMNode|DOMWindow} element the element to check the class on * @param {string} className the CSS className * @return {boolean} true if the element has the class, false if not */ hasClass: function (element, className) { invariant(!/\s/.test(className), 'CSS.hasClass takes only a single class name.'); if (element.classList) { return !!className && element.classList.contains(className); } return (' ' + element.className + ' ').indexOf(' ' + className + ' ') > -1; }, /** * Tests whether the element matches the selector specified * * @param {DOMNode|DOMWindow} element the element that we are querying * @param {string} selector the CSS selector * @return {boolean} true if the element matches the selector, false if not */ matchesSelector: function (element, selector) { const matchesImpl = element.matches || element.webkitMatchesSelector || element.mozMatchesSelector || element.msMatchesSelector || (s => matchesSelector_SLOW(element, s)); return matchesImpl.call(element, selector); } }; module.exports = CSSCore;PK �n[��E�( �( VersionRange.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ 'use strict'; var invariant = require("./invariant"); var componentRegex = /\./; var orRegex = /\|\|/; var rangeRegex = /\s+\-\s+/; var modifierRegex = /^(<=|<|=|>=|~>|~|>|)?\s*(.+)/; var numericRegex = /^(\d*)(.*)/; /** * Splits input `range` on "||" and returns true if any subrange matches * `version`. * * @param {string} range * @param {string} version * @returns {boolean} */ function checkOrExpression(range, version) { var expressions = range.split(orRegex); if (expressions.length > 1) { return expressions.some(function (range) { return VersionRange.contains(range, version); }); } else { range = expressions[0].trim(); return checkRangeExpression(range, version); } } /** * Splits input `range` on " - " (the surrounding whitespace is required) and * returns true if version falls between the two operands. * * @param {string} range * @param {string} version * @returns {boolean} */ function checkRangeExpression(range, version) { var expressions = range.split(rangeRegex); !(expressions.length > 0 && expressions.length <= 2) ? process.env.NODE_ENV !== "production" ? invariant(false, 'the "-" operator expects exactly 2 operands') : invariant(false) : void 0; if (expressions.length === 1) { return checkSimpleExpression(expressions[0], version); } else { var startVersion = expressions[0], endVersion = expressions[1]; !(isSimpleVersion(startVersion) && isSimpleVersion(endVersion)) ? process.env.NODE_ENV !== "production" ? invariant(false, 'operands to the "-" operator must be simple (no modifiers)') : invariant(false) : void 0; return checkSimpleExpression('>=' + startVersion, version) && checkSimpleExpression('<=' + endVersion, version); } } /** * Checks if `range` matches `version`. `range` should be a "simple" range (ie. * not a compound range using the " - " or "||" operators). * * @param {string} range * @param {string} version * @returns {boolean} */ function checkSimpleExpression(range, version) { range = range.trim(); if (range === '') { return true; } var versionComponents = version.split(componentRegex); var _getModifierAndCompon = getModifierAndComponents(range), modifier = _getModifierAndCompon.modifier, rangeComponents = _getModifierAndCompon.rangeComponents; switch (modifier) { case '<': return checkLessThan(versionComponents, rangeComponents); case '<=': return checkLessThanOrEqual(versionComponents, rangeComponents); case '>=': return checkGreaterThanOrEqual(versionComponents, rangeComponents); case '>': return checkGreaterThan(versionComponents, rangeComponents); case '~': case '~>': return checkApproximateVersion(versionComponents, rangeComponents); default: return checkEqual(versionComponents, rangeComponents); } } /** * Checks whether `a` is less than `b`. * * @param {array<string>} a * @param {array<string>} b * @returns {boolean} */ function checkLessThan(a, b) { return compareComponents(a, b) === -1; } /** * Checks whether `a` is less than or equal to `b`. * * @param {array<string>} a * @param {array<string>} b * @returns {boolean} */ function checkLessThanOrEqual(a, b) { var result = compareComponents(a, b); return result === -1 || result === 0; } /** * Checks whether `a` is equal to `b`. * * @param {array<string>} a * @param {array<string>} b * @returns {boolean} */ function checkEqual(a, b) { return compareComponents(a, b) === 0; } /** * Checks whether `a` is greater than or equal to `b`. * * @param {array<string>} a * @param {array<string>} b * @returns {boolean} */ function checkGreaterThanOrEqual(a, b) { var result = compareComponents(a, b); return result === 1 || result === 0; } /** * Checks whether `a` is greater than `b`. * * @param {array<string>} a * @param {array<string>} b * @returns {boolean} */ function checkGreaterThan(a, b) { return compareComponents(a, b) === 1; } /** * Checks whether `a` is "reasonably close" to `b` (as described in * https://www.npmjs.org/doc/misc/semver.html). For example, if `b` is "1.3.1" * then "reasonably close" is defined as ">= 1.3.1 and < 1.4". * * @param {array<string>} a * @param {array<string>} b * @returns {boolean} */ function checkApproximateVersion(a, b) { var lowerBound = b.slice(); var upperBound = b.slice(); if (upperBound.length > 1) { upperBound.pop(); } var lastIndex = upperBound.length - 1; var numeric = parseInt(upperBound[lastIndex], 10); if (isNumber(numeric)) { upperBound[lastIndex] = numeric + 1 + ''; } return checkGreaterThanOrEqual(a, lowerBound) && checkLessThan(a, upperBound); } /** * Extracts the optional modifier (<, <=, =, >=, >, ~, ~>) and version * components from `range`. * * For example, given `range` ">= 1.2.3" returns an object with a `modifier` of * `">="` and `components` of `[1, 2, 3]`. * * @param {string} range * @returns {object} */ function getModifierAndComponents(range) { var rangeComponents = range.split(componentRegex); var matches = rangeComponents[0].match(modifierRegex); !matches ? process.env.NODE_ENV !== "production" ? invariant(false, 'expected regex to match but it did not') : invariant(false) : void 0; return { modifier: matches[1], rangeComponents: [matches[2]].concat(rangeComponents.slice(1)) }; } /** * Determines if `number` is a number. * * @param {mixed} number * @returns {boolean} */ function isNumber(number) { return !isNaN(number) && isFinite(number); } /** * Tests whether `range` is a "simple" version number without any modifiers * (">", "~" etc). * * @param {string} range * @returns {boolean} */ function isSimpleVersion(range) { return !getModifierAndComponents(range).modifier; } /** * Zero-pads array `array` until it is at least `length` long. * * @param {array} array * @param {number} length */ function zeroPad(array, length) { for (var i = array.length; i < length; i++) { array[i] = '0'; } } /** * Normalizes `a` and `b` in preparation for comparison by doing the following: * * - zero-pads `a` and `b` * - marks any "x", "X" or "*" component in `b` as equivalent by zero-ing it out * in both `a` and `b` * - marks any final "*" component in `b` as a greedy wildcard by zero-ing it * and all of its successors in `a` * * @param {array<string>} a * @param {array<string>} b * @returns {array<array<string>>} */ function normalizeVersions(a, b) { a = a.slice(); b = b.slice(); zeroPad(a, b.length); // mark "x" and "*" components as equal for (var i = 0; i < b.length; i++) { var matches = b[i].match(/^[x*]$/i); if (matches) { b[i] = a[i] = '0'; // final "*" greedily zeros all remaining components if (matches[0] === '*' && i === b.length - 1) { for (var j = i; j < a.length; j++) { a[j] = '0'; } } } } zeroPad(b, a.length); return [a, b]; } /** * Returns the numerical -- not the lexicographical -- ordering of `a` and `b`. * * For example, `10-alpha` is greater than `2-beta`. * * @param {string} a * @param {string} b * @returns {number} -1, 0 or 1 to indicate whether `a` is less than, equal to, * or greater than `b`, respectively */ function compareNumeric(a, b) { var aPrefix = a.match(numericRegex)[1]; var bPrefix = b.match(numericRegex)[1]; var aNumeric = parseInt(aPrefix, 10); var bNumeric = parseInt(bPrefix, 10); if (isNumber(aNumeric) && isNumber(bNumeric) && aNumeric !== bNumeric) { return compare(aNumeric, bNumeric); } else { return compare(a, b); } } /** * Returns the ordering of `a` and `b`. * * @param {string|number} a * @param {string|number} b * @returns {number} -1, 0 or 1 to indicate whether `a` is less than, equal to, * or greater than `b`, respectively */ function compare(a, b) { !(typeof a === typeof b) ? process.env.NODE_ENV !== "production" ? invariant(false, '"a" and "b" must be of the same type') : invariant(false) : void 0; if (a > b) { return 1; } else if (a < b) { return -1; } else { return 0; } } /** * Compares arrays of version components. * * @param {array<string>} a * @param {array<string>} b * @returns {number} -1, 0 or 1 to indicate whether `a` is less than, equal to, * or greater than `b`, respectively */ function compareComponents(a, b) { var _normalizeVersions = normalizeVersions(a, b), aNormalized = _normalizeVersions[0], bNormalized = _normalizeVersions[1]; for (var i = 0; i < bNormalized.length; i++) { var result = compareNumeric(aNormalized[i], bNormalized[i]); if (result) { return result; } } return 0; } var VersionRange = { /** * Checks whether `version` satisfies the `range` specification. * * We support a subset of the expressions defined in * https://www.npmjs.org/doc/misc/semver.html: * * version Must match version exactly * =version Same as just version * >version Must be greater than version * >=version Must be greater than or equal to version * <version Must be less than version * <=version Must be less than or equal to version * ~version Must be at least version, but less than the next significant * revision above version: * "~1.2.3" is equivalent to ">= 1.2.3 and < 1.3" * ~>version Equivalent to ~version * 1.2.x Must match "1.2.x", where "x" is a wildcard that matches * anything * 1.2.* Similar to "1.2.x", but "*" in the trailing position is a * "greedy" wildcard, so will match any number of additional * components: * "1.2.*" will match "1.2.1", "1.2.1.1", "1.2.1.1.1" etc * * Any version * "" (Empty string) Same as * * v1 - v2 Equivalent to ">= v1 and <= v2" * r1 || r2 Passes if either r1 or r2 are satisfied * * @param {string} range * @param {string} version * @returns {boolean} */ contains: function contains(range, version) { return checkOrExpression(range.trim(), version.trim()); } }; module.exports = VersionRange;PK �n[��h h CircularBuffer.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ var invariant = require("./invariant"); var CircularBuffer = /*#__PURE__*/ function () { function CircularBuffer(size) { !(size > 0) ? process.env.NODE_ENV !== "production" ? invariant(false, 'Buffer size should be a positive integer') : invariant(false) : void 0; this._size = size; this._head = 0; this._buffer = []; } var _proto = CircularBuffer.prototype; _proto.write = function write(entry) { if (this._buffer.length < this._size) { this._buffer.push(entry); } else { this._buffer[this._head] = entry; this._head++; this._head %= this._size; } return this; }; _proto.read = function read() { return this._buffer.slice(this._head).concat(this._buffer.slice(0, this._head)); }; _proto.clear = function clear() { this._head = 0; this._buffer = []; return this; }; return CircularBuffer; }(); module.exports = CircularBuffer;PK �n[��f` ` TouchEventUtils.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule TouchEventUtils */ const TouchEventUtils = { /** * Utility function for common case of extracting out the primary touch from a * touch event. * - `touchEnd` events usually do not have the `touches` property. * http://stackoverflow.com/questions/3666929/ * mobile-sarai-touchend-event-not-firing-when-last-touch-is-removed * * @param {Event} nativeEvent Native event that may or may not be a touch. * @return {TouchesObject?} an object with pageX and pageY or null. */ extractSingleTouch: function (nativeEvent) { const touches = nativeEvent.touches; const changedTouches = nativeEvent.changedTouches; const hasTouches = touches && touches.length > 0; const hasChangedTouches = changedTouches && changedTouches.length > 0; return !hasTouches && hasChangedTouches ? changedTouches[0] : hasTouches ? touches[0] : nativeEvent; } }; module.exports = TouchEventUtils;PK �n[n_�Zv v CircularBuffer.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule CircularBuffer */ var invariant = require("./invariant"); class CircularBuffer { constructor(size) { invariant(size > 0, 'Buffer size should be a positive integer'); this._size = size; this._head = 0; this._buffer = []; } write(entry) { if (this._buffer.length < this._size) { this._buffer.push(entry); } else { this._buffer[this._head] = entry; this._head++; this._head %= this._size; } return this; } read() { return this._buffer.slice(this._head).concat(this._buffer.slice(0, this._head)); } clear() { this._head = 0; this._buffer = []; return this; } } module.exports = CircularBuffer;PK �n[�=:� � URI.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ 'use strict'; function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } var URI = /*#__PURE__*/ function () { function URI(uri) { _defineProperty(this, "_uri", void 0); this._uri = uri; } var _proto = URI.prototype; _proto.toString = function toString() { return this._uri; }; return URI; }(); module.exports = URI;PK �n[�x�F� � equalsSet.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @typechecks */ 'use strict'; var everySet = require("./everySet"); /** * Checks if two sets are equal */ function equalsSet(one, two) { if (one.size !== two.size) { return false; } return everySet(one, function (value) { return two.has(value); }); } module.exports = equalsSet;PK �n[X���3 3 DOMMouseMoveTracker.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * This class listens to events on the document and then updates a react * component through callbacks. * Please note that captureMouseMove must be called in * order to initialize listeners on mousemove and mouseup. * releaseMouseMove must be called to remove them. It is important to * call releaseMouseMoves since mousemove is expensive to listen to. * * @typechecks */ 'use strict'; var EventListener = require("./EventListener"); var cancelAnimationFramePolyfill = require("./cancelAnimationFramePolyfill"); var requestAnimationFramePolyfill = require("./requestAnimationFramePolyfill"); var DOMMouseMoveTracker = /*#__PURE__*/ function () { /** * onMove is the callback that will be called on every mouse move. * onMoveEnd is called on mouse up when movement has ended. */ function DOMMouseMoveTracker( /*function*/ onMove, /*function*/ onMoveEnd, /*DOMElement*/ domNode) { this._isDragging = false; this._animationFrameID = null; this._domNode = domNode; this._onMove = onMove; this._onMoveEnd = onMoveEnd; this._onMouseMove = this._onMouseMove.bind(this); this._onMouseUp = this._onMouseUp.bind(this); this._didMouseMove = this._didMouseMove.bind(this); } /** * This is to set up the listeners for listening to mouse move * and mouse up signaling the movement has ended. Please note that these * listeners are added at the document.body level. It takes in an event * in order to grab inital state. */ var _proto = DOMMouseMoveTracker.prototype; _proto.captureMouseMoves = function captureMouseMoves( /*object*/ event) { if (!this._eventMoveToken && !this._eventUpToken) { this._eventMoveToken = EventListener.listen(this._domNode, 'mousemove', this._onMouseMove); this._eventUpToken = EventListener.listen(this._domNode, 'mouseup', this._onMouseUp); } if (!this._isDragging) { this._deltaX = 0; this._deltaY = 0; this._isDragging = true; this._x = event.clientX; this._y = event.clientY; } event.preventDefault(); }; /** * These releases all of the listeners on document.body. */ _proto.releaseMouseMoves = function releaseMouseMoves() { if (this._eventMoveToken && this._eventUpToken) { this._eventMoveToken.remove(); this._eventMoveToken = null; this._eventUpToken.remove(); this._eventUpToken = null; } if (this._animationFrameID !== null) { cancelAnimationFramePolyfill(this._animationFrameID); this._animationFrameID = null; } if (this._isDragging) { this._isDragging = false; this._x = null; this._y = null; } }; /** * Returns whether or not if the mouse movement is being tracked. */ _proto.isDragging = function isDragging() /*boolean*/ { return this._isDragging; }; /** * Calls onMove passed into constructor and updates internal state. */ _proto._onMouseMove = function _onMouseMove( /*object*/ event) { var x = event.clientX; var y = event.clientY; this._deltaX += x - this._x; this._deltaY += y - this._y; if (this._animationFrameID === null) { // The mouse may move faster then the animation frame does. // Use `requestAnimationFramePolyfill` to avoid over-updating. this._animationFrameID = requestAnimationFramePolyfill(this._didMouseMove); } this._x = x; this._y = y; event.preventDefault(); }; _proto._didMouseMove = function _didMouseMove() { this._animationFrameID = null; this._onMove(this._deltaX, this._deltaY); this._deltaX = 0; this._deltaY = 0; }; /** * Calls onMoveEnd passed into constructor and updates internal state. */ _proto._onMouseUp = function _onMouseUp() { if (this._animationFrameID) { this._didMouseMove(); } this._onMoveEnd(); }; return DOMMouseMoveTracker; }(); module.exports = DOMMouseMoveTracker;PK �n[! �V V UnicodeCJK.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ /** * Unicode algorithms for CJK (Chinese, Japanese, Korean) writing systems. * * Utilities for Hanzi/Kanji/Hanja logographs and Kanas (Katakana and Hiragana) * syllables. * * For Korean Hangul see module `UnicodeHangulKorean`. */ 'use strict'; /** * Latin * * NOTE: The code assumes these sets include only BMP characters. */ var R_LATIN_ASCII = 'a-zA-Z'; var R_LATIN_FULLWIDTH = "\uFF21-\uFF3A\uFF41-\uFF5A"; var R_LATIN = R_LATIN_ASCII + R_LATIN_FULLWIDTH; /** * Hiragana & Katakana * * NOTE: Some ranges include non-BMP characters. We do not support those ranges * for now. */ var R_HIRAGANA = "\u3040-\u309F"; var R_KATAKANA = "\u30A0-\u30FF"; var R_KATAKANA_PHONETIC = "\u31F0-\u31FF"; var R_KATAKANA_HALFWIDTH = "\uFF65-\uFF9F"; // var R_KANA_SUPPLEMENT = '\U0001B000-\U0001B0FF'; var R_KATAKANA_ALL = R_KATAKANA + R_KATAKANA_PHONETIC + R_KATAKANA_HALFWIDTH; var R_KANA = R_HIRAGANA + R_KATAKANA_ALL; var I_HIRAGANA = [0x3040, 0x309F]; var I_KATAKANA = [0x30A0, 0x30FF]; var I_HIRAGANA_TO_KATAKANA = I_KATAKANA[0] - I_HIRAGANA[0]; /** * Hanzi/Kanji/Hanja * * NOTE: Some ranges include non-BMP characters. We do not support those ranges * for now. */ var R_IDEO_MAIN = "\u4E00-\u9FCF"; var R_IDEO_EXT_A = "\u3400-\u4DBF"; // var R_IDEO_EXT_B = '\U00020000-\U0002A6DF'; // var R_IDEO_EXT_C = '\U0002A700-\U0002B73F'; // var R_IDEO_EXT_D = '\U0002B740-\U0002B81F'; var R_IDEO = R_IDEO_MAIN + R_IDEO_EXT_A; /** * Hangul */ // var R_HANGUL_JAMO = '\u1100-\u11FF'; // var R_HANGUL_JAMO_EXT_A = '\uA960-\uA97F'; // var R_HANGUL_JAMO_EXT_B = '\uD7B0-\uD7FF'; // var R_HANGUL_COMPATIBILITY = '\u3130-\u318F'; // var R_HANGUL_COMP_HALFWIDTH = '\uFFA0-\uFFDF'; var R_HANGUL_SYLLABLES = "\uAC00-\uD7AF"; /** * Globals */ var R_IDEO_OR_SYLL = R_IDEO + R_KANA + R_HANGUL_SYLLABLES; var REGEX_IDEO = null; var REGEX_KANA = null; var REGEX_IDEO_OR_SYLL = null; var REGEX_IS_KANA_WITH_TRAILING_LATIN = null; /** * Whether the string includes any Katakana or Hiragana characters. * * @param {string} str * @return {boolean} */ function hasKana(str) { REGEX_KANA = REGEX_KANA || new RegExp('[' + R_KANA + ']'); return REGEX_KANA.test(str); } /** * Whether the string includes any CJK Ideograph characters. * * @param {string} str * @return {boolean} */ function hasIdeograph(str) { REGEX_IDEO = REGEX_IDEO || new RegExp('[' + R_IDEO + ']'); return REGEX_IDEO.test(str); } /** * Whether the string includes any CJK Ideograph or Syllable characters. * * @param {string} str * @return {boolean} */ function hasIdeoOrSyll(str) { REGEX_IDEO_OR_SYLL = REGEX_IDEO_OR_SYLL || new RegExp('[' + R_IDEO_OR_SYLL + ']'); return REGEX_IDEO_OR_SYLL.test(str); } /** * @param {string} chr * @output {string} */ function charCodeToKatakana(chr) { var charCode = chr.charCodeAt(0); return String.fromCharCode(charCode < I_HIRAGANA[0] || charCode > I_HIRAGANA[1] ? charCode : charCode + I_HIRAGANA_TO_KATAKANA); } /** * Replace any Hiragana character with the matching Katakana * * @param {string} str * @output {string} */ function hiraganaToKatakana(str) { if (!hasKana(str)) { return str; } return str.split('').map(charCodeToKatakana).join(''); } /** * Whether the string is exactly a sequence of Kana characters followed by one * Latin character. * * @param {string} str * @output {string} */ function isKanaWithTrailingLatin(str) { REGEX_IS_KANA_WITH_TRAILING_LATIN = REGEX_IS_KANA_WITH_TRAILING_LATIN || new RegExp('^' + '[' + R_KANA + ']+' + '[' + R_LATIN + ']' + '$'); return REGEX_IS_KANA_WITH_TRAILING_LATIN.test(str); } /** * Drops the trailing Latin character from a string that is exactly a sequence * of Kana characters followed by one Latin character. * * @param {string} str * @output {string} */ function kanaRemoveTrailingLatin(str) { if (isKanaWithTrailingLatin(str)) { return str.substr(0, str.length - 1); } return str; } var UnicodeCJK = { hasKana: hasKana, hasIdeograph: hasIdeograph, hasIdeoOrSyll: hasIdeoOrSyll, hiraganaToKatakana: hiraganaToKatakana, isKanaWithTrailingLatin: isKanaWithTrailingLatin, kanaRemoveTrailingLatin: kanaRemoveTrailingLatin }; module.exports = UnicodeCJK;PK �n[���" " DOMMouseMoveTracker.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * This class listens to events on the document and then updates a react * component through callbacks. * Please note that captureMouseMove must be called in * order to initialize listeners on mousemove and mouseup. * releaseMouseMove must be called to remove them. It is important to * call releaseMouseMoves since mousemove is expensive to listen to. * * @providesModule DOMMouseMoveTracker * @typechecks */ 'use strict'; const EventListener = require("./EventListener"); const cancelAnimationFramePolyfill = require("./cancelAnimationFramePolyfill"); const requestAnimationFramePolyfill = require("./requestAnimationFramePolyfill"); class DOMMouseMoveTracker { /** * onMove is the callback that will be called on every mouse move. * onMoveEnd is called on mouse up when movement has ended. */ constructor( /*function*/ onMove, /*function*/ onMoveEnd, /*DOMElement*/ domNode) { this._isDragging = false; this._animationFrameID = null; this._domNode = domNode; this._onMove = onMove; this._onMoveEnd = onMoveEnd; this._onMouseMove = this._onMouseMove.bind(this); this._onMouseUp = this._onMouseUp.bind(this); this._didMouseMove = this._didMouseMove.bind(this); } /** * This is to set up the listeners for listening to mouse move * and mouse up signaling the movement has ended. Please note that these * listeners are added at the document.body level. It takes in an event * in order to grab inital state. */ captureMouseMoves( /*object*/ event) { if (!this._eventMoveToken && !this._eventUpToken) { this._eventMoveToken = EventListener.listen(this._domNode, 'mousemove', this._onMouseMove); this._eventUpToken = EventListener.listen(this._domNode, 'mouseup', this._onMouseUp); } if (!this._isDragging) { this._deltaX = 0; this._deltaY = 0; this._isDragging = true; this._x = event.clientX; this._y = event.clientY; } event.preventDefault(); } /** * These releases all of the listeners on document.body. */ releaseMouseMoves() { if (this._eventMoveToken && this._eventUpToken) { this._eventMoveToken.remove(); this._eventMoveToken = null; this._eventUpToken.remove(); this._eventUpToken = null; } if (this._animationFrameID !== null) { cancelAnimationFramePolyfill(this._animationFrameID); this._animationFrameID = null; } if (this._isDragging) { this._isDragging = false; this._x = null; this._y = null; } } /** * Returns whether or not if the mouse movement is being tracked. */ isDragging() /*boolean*/ { return this._isDragging; } /** * Calls onMove passed into constructor and updates internal state. */ _onMouseMove( /*object*/ event) { const x = event.clientX; const y = event.clientY; this._deltaX += x - this._x; this._deltaY += y - this._y; if (this._animationFrameID === null) { // The mouse may move faster then the animation frame does. // Use `requestAnimationFramePolyfill` to avoid over-updating. this._animationFrameID = requestAnimationFramePolyfill(this._didMouseMove); } this._x = x; this._y = y; event.preventDefault(); } _didMouseMove() { this._animationFrameID = null; this._onMove(this._deltaX, this._deltaY); this._deltaX = 0; this._deltaY = 0; } /** * Calls onMoveEnd passed into constructor and updates internal state. */ _onMouseUp() { if (this._animationFrameID) { this._didMouseMove(); } this._onMoveEnd(); } } module.exports = DOMMouseMoveTracker;PK �n[� ��& �& VersionRange.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule VersionRange */ 'use strict'; const invariant = require("./invariant"); const componentRegex = /\./; const orRegex = /\|\|/; const rangeRegex = /\s+\-\s+/; const modifierRegex = /^(<=|<|=|>=|~>|~|>|)?\s*(.+)/; const numericRegex = /^(\d*)(.*)/; /** * Splits input `range` on "||" and returns true if any subrange matches * `version`. * * @param {string} range * @param {string} version * @returns {boolean} */ function checkOrExpression(range, version) { const expressions = range.split(orRegex); if (expressions.length > 1) { return expressions.some(range => VersionRange.contains(range, version)); } else { range = expressions[0].trim(); return checkRangeExpression(range, version); } } /** * Splits input `range` on " - " (the surrounding whitespace is required) and * returns true if version falls between the two operands. * * @param {string} range * @param {string} version * @returns {boolean} */ function checkRangeExpression(range, version) { const expressions = range.split(rangeRegex); invariant(expressions.length > 0 && expressions.length <= 2, 'the "-" operator expects exactly 2 operands'); if (expressions.length === 1) { return checkSimpleExpression(expressions[0], version); } else { const [startVersion, endVersion] = expressions; invariant(isSimpleVersion(startVersion) && isSimpleVersion(endVersion), 'operands to the "-" operator must be simple (no modifiers)'); return checkSimpleExpression('>=' + startVersion, version) && checkSimpleExpression('<=' + endVersion, version); } } /** * Checks if `range` matches `version`. `range` should be a "simple" range (ie. * not a compound range using the " - " or "||" operators). * * @param {string} range * @param {string} version * @returns {boolean} */ function checkSimpleExpression(range, version) { range = range.trim(); if (range === '') { return true; } const versionComponents = version.split(componentRegex); const { modifier, rangeComponents } = getModifierAndComponents(range); switch (modifier) { case '<': return checkLessThan(versionComponents, rangeComponents); case '<=': return checkLessThanOrEqual(versionComponents, rangeComponents); case '>=': return checkGreaterThanOrEqual(versionComponents, rangeComponents); case '>': return checkGreaterThan(versionComponents, rangeComponents); case '~': case '~>': return checkApproximateVersion(versionComponents, rangeComponents); default: return checkEqual(versionComponents, rangeComponents); } } /** * Checks whether `a` is less than `b`. * * @param {array<string>} a * @param {array<string>} b * @returns {boolean} */ function checkLessThan(a, b) { return compareComponents(a, b) === -1; } /** * Checks whether `a` is less than or equal to `b`. * * @param {array<string>} a * @param {array<string>} b * @returns {boolean} */ function checkLessThanOrEqual(a, b) { const result = compareComponents(a, b); return result === -1 || result === 0; } /** * Checks whether `a` is equal to `b`. * * @param {array<string>} a * @param {array<string>} b * @returns {boolean} */ function checkEqual(a, b) { return compareComponents(a, b) === 0; } /** * Checks whether `a` is greater than or equal to `b`. * * @param {array<string>} a * @param {array<string>} b * @returns {boolean} */ function checkGreaterThanOrEqual(a, b) { const result = compareComponents(a, b); return result === 1 || result === 0; } /** * Checks whether `a` is greater than `b`. * * @param {array<string>} a * @param {array<string>} b * @returns {boolean} */ function checkGreaterThan(a, b) { return compareComponents(a, b) === 1; } /** * Checks whether `a` is "reasonably close" to `b` (as described in * https://www.npmjs.org/doc/misc/semver.html). For example, if `b` is "1.3.1" * then "reasonably close" is defined as ">= 1.3.1 and < 1.4". * * @param {array<string>} a * @param {array<string>} b * @returns {boolean} */ function checkApproximateVersion(a, b) { const lowerBound = b.slice(); const upperBound = b.slice(); if (upperBound.length > 1) { upperBound.pop(); } const lastIndex = upperBound.length - 1; const numeric = parseInt(upperBound[lastIndex], 10); if (isNumber(numeric)) { upperBound[lastIndex] = numeric + 1 + ''; } return checkGreaterThanOrEqual(a, lowerBound) && checkLessThan(a, upperBound); } /** * Extracts the optional modifier (<, <=, =, >=, >, ~, ~>) and version * components from `range`. * * For example, given `range` ">= 1.2.3" returns an object with a `modifier` of * `">="` and `components` of `[1, 2, 3]`. * * @param {string} range * @returns {object} */ function getModifierAndComponents(range) { const rangeComponents = range.split(componentRegex); const matches = rangeComponents[0].match(modifierRegex); invariant(matches, 'expected regex to match but it did not'); return { modifier: matches[1], rangeComponents: [matches[2]].concat(rangeComponents.slice(1)) }; } /** * Determines if `number` is a number. * * @param {mixed} number * @returns {boolean} */ function isNumber(number) { return !isNaN(number) && isFinite(number); } /** * Tests whether `range` is a "simple" version number without any modifiers * (">", "~" etc). * * @param {string} range * @returns {boolean} */ function isSimpleVersion(range) { return !getModifierAndComponents(range).modifier; } /** * Zero-pads array `array` until it is at least `length` long. * * @param {array} array * @param {number} length */ function zeroPad(array, length) { for (let i = array.length; i < length; i++) { array[i] = '0'; } } /** * Normalizes `a` and `b` in preparation for comparison by doing the following: * * - zero-pads `a` and `b` * - marks any "x", "X" or "*" component in `b` as equivalent by zero-ing it out * in both `a` and `b` * - marks any final "*" component in `b` as a greedy wildcard by zero-ing it * and all of its successors in `a` * * @param {array<string>} a * @param {array<string>} b * @returns {array<array<string>>} */ function normalizeVersions(a, b) { a = a.slice(); b = b.slice(); zeroPad(a, b.length); // mark "x" and "*" components as equal for (let i = 0; i < b.length; i++) { const matches = b[i].match(/^[x*]$/i); if (matches) { b[i] = a[i] = '0'; // final "*" greedily zeros all remaining components if (matches[0] === '*' && i === b.length - 1) { for (let j = i; j < a.length; j++) { a[j] = '0'; } } } } zeroPad(b, a.length); return [a, b]; } /** * Returns the numerical -- not the lexicographical -- ordering of `a` and `b`. * * For example, `10-alpha` is greater than `2-beta`. * * @param {string} a * @param {string} b * @returns {number} -1, 0 or 1 to indicate whether `a` is less than, equal to, * or greater than `b`, respectively */ function compareNumeric(a, b) { const aPrefix = a.match(numericRegex)[1]; const bPrefix = b.match(numericRegex)[1]; const aNumeric = parseInt(aPrefix, 10); const bNumeric = parseInt(bPrefix, 10); if (isNumber(aNumeric) && isNumber(bNumeric) && aNumeric !== bNumeric) { return compare(aNumeric, bNumeric); } else { return compare(a, b); } } /** * Returns the ordering of `a` and `b`. * * @param {string|number} a * @param {string|number} b * @returns {number} -1, 0 or 1 to indicate whether `a` is less than, equal to, * or greater than `b`, respectively */ function compare(a, b) { invariant(typeof a === typeof b, '"a" and "b" must be of the same type'); if (a > b) { return 1; } else if (a < b) { return -1; } else { return 0; } } /** * Compares arrays of version components. * * @param {array<string>} a * @param {array<string>} b * @returns {number} -1, 0 or 1 to indicate whether `a` is less than, equal to, * or greater than `b`, respectively */ function compareComponents(a, b) { const [aNormalized, bNormalized] = normalizeVersions(a, b); for (let i = 0; i < bNormalized.length; i++) { const result = compareNumeric(aNormalized[i], bNormalized[i]); if (result) { return result; } } return 0; } var VersionRange = { /** * Checks whether `version` satisfies the `range` specification. * * We support a subset of the expressions defined in * https://www.npmjs.org/doc/misc/semver.html: * * version Must match version exactly * =version Same as just version * >version Must be greater than version * >=version Must be greater than or equal to version * <version Must be less than version * <=version Must be less than or equal to version * ~version Must be at least version, but less than the next significant * revision above version: * "~1.2.3" is equivalent to ">= 1.2.3 and < 1.3" * ~>version Equivalent to ~version * 1.2.x Must match "1.2.x", where "x" is a wildcard that matches * anything * 1.2.* Similar to "1.2.x", but "*" in the trailing position is a * "greedy" wildcard, so will match any number of additional * components: * "1.2.*" will match "1.2.1", "1.2.1.1", "1.2.1.1.1" etc * * Any version * "" (Empty string) Same as * * v1 - v2 Equivalent to ">= v1 and <= v2" * r1 || r2 Passes if either r1 or r2 are satisfied * * @param {string} range * @param {string} version * @returns {boolean} */ contains(range, version) { return checkOrExpression(range.trim(), version.trim()); } }; module.exports = VersionRange;PK �n[�n�� � DataTransfer.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var PhotosMimeType = require("./PhotosMimeType"); var createArrayFromMixed = require("./createArrayFromMixed"); var emptyFunction = require("./emptyFunction"); var CR_LF_REGEX = new RegExp("\r\n", 'g'); var LF_ONLY = "\n"; var RICH_TEXT_TYPES = { 'text/rtf': 1, 'text/html': 1 }; /** * If DataTransferItem is a file then return the Blob of data. * * @param {object} item * @return {?blob} */ function getFileFromDataTransfer(item) { if (item.kind == 'file') { return item.getAsFile(); } } var DataTransfer = /*#__PURE__*/ function () { /** * @param {object} data */ function DataTransfer(data) { this.data = data; // Types could be DOMStringList or array this.types = data.types ? createArrayFromMixed(data.types) : []; } /** * Is this likely to be a rich text data transfer? * * @return {boolean} */ var _proto = DataTransfer.prototype; _proto.isRichText = function isRichText() { // If HTML is available, treat this data as rich text. This way, we avoid // using a pasted image if it is packaged with HTML -- this may occur with // pastes from MS Word, for example. However this is only rich text if // there's accompanying text. if (this.getHTML() && this.getText()) { return true; } // When an image is copied from a preview window, you end up with two // DataTransferItems one of which is a file's metadata as text. Skip those. if (this.isImage()) { return false; } return this.types.some(function (type) { return RICH_TEXT_TYPES[type]; }); }; /** * Get raw text. * * @return {?string} */ _proto.getText = function getText() { var text; if (this.data.getData) { if (!this.types.length) { text = this.data.getData('Text'); } else if (this.types.indexOf('text/plain') != -1) { text = this.data.getData('text/plain'); } } return text ? text.replace(CR_LF_REGEX, LF_ONLY) : null; }; /** * Get HTML paste data * * @return {?string} */ _proto.getHTML = function getHTML() { if (this.data.getData) { if (!this.types.length) { return this.data.getData('Text'); } else if (this.types.indexOf('text/html') != -1) { return this.data.getData('text/html'); } } }; /** * Is this a link data transfer? * * @return {boolean} */ _proto.isLink = function isLink() { return this.types.some(function (type) { return type.indexOf('Url') != -1 || type.indexOf('text/uri-list') != -1 || type.indexOf('text/x-moz-url'); }); }; /** * Get a link url. * * @return {?string} */ _proto.getLink = function getLink() { if (this.data.getData) { if (this.types.indexOf('text/x-moz-url') != -1) { var url = this.data.getData('text/x-moz-url').split('\n'); return url[0]; } return this.types.indexOf('text/uri-list') != -1 ? this.data.getData('text/uri-list') : this.data.getData('url'); } return null; }; /** * Is this an image data transfer? * * @return {boolean} */ _proto.isImage = function isImage() { var isImage = this.types.some(function (type) { // Firefox will have a type of application/x-moz-file for images during // dragging return type.indexOf('application/x-moz-file') != -1; }); if (isImage) { return true; } var items = this.getFiles(); for (var i = 0; i < items.length; i++) { var type = items[i].type; if (!PhotosMimeType.isImage(type)) { return false; } } return true; }; _proto.getCount = function getCount() { if (this.data.hasOwnProperty('items')) { return this.data.items.length; } else if (this.data.hasOwnProperty('mozItemCount')) { return this.data.mozItemCount; } else if (this.data.files) { return this.data.files.length; } return null; }; /** * Get files. * * @return {array} */ _proto.getFiles = function getFiles() { if (this.data.items) { // createArrayFromMixed doesn't properly handle DataTransferItemLists. return Array.prototype.slice.call(this.data.items).map(getFileFromDataTransfer).filter(emptyFunction.thatReturnsArgument); } else if (this.data.files) { return Array.prototype.slice.call(this.data.files); } else { return []; } }; /** * Are there any files to fetch? * * @return {boolean} */ _proto.hasFiles = function hasFiles() { return this.getFiles().length > 0; }; return DataTransfer; }(); module.exports = DataTransfer;PK �n[Q<��A A areEqual.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule areEqual * @flow */ const aStackPool = []; const bStackPool = []; /** * Checks if two values are equal. Values may be primitives, arrays, or objects. * Returns true if both arguments have the same keys and values. * * @see http://underscorejs.org * @copyright 2009-2013 Jeremy Ashkenas, DocumentCloud Inc. * @license MIT */ function areEqual(a: any, b: any): boolean { const aStack = aStackPool.length ? aStackPool.pop() : []; const bStack = bStackPool.length ? bStackPool.pop() : []; const result = eq(a, b, aStack, bStack); aStack.length = 0; bStack.length = 0; aStackPool.push(aStack); bStackPool.push(bStack); return result; } function eq(a: any, b: any, aStack: Array<any>, bStack: Array<any>): boolean { if (a === b) { // Identical objects are equal. `0 === -0`, but they aren't identical. return a !== 0 || 1 / a == 1 / b; } if (a == null || b == null) { // a or b can be `null` or `undefined` return false; } if (typeof a != 'object' || typeof b != 'object') { return false; } const objToStr = Object.prototype.toString; const className = objToStr.call(a); if (className != objToStr.call(b)) { return false; } switch (className) { case '[object String]': return a == String(b); case '[object Number]': return isNaN(a) || isNaN(b) ? false : a == Number(b); case '[object Date]': case '[object Boolean]': return +a == +b; case '[object RegExp]': return a.source == b.source && a.global == b.global && a.multiline == b.multiline && a.ignoreCase == b.ignoreCase; } // Assume equality for cyclic structures. let length = aStack.length; while (length--) { if (aStack[length] == a) { return bStack[length] == b; } } aStack.push(a); bStack.push(b); let size = 0; // Recursively compare objects and arrays. if (className === '[object Array]') { size = a.length; if (size !== b.length) { return false; } // Deep compare the contents, ignoring non-numeric properties. while (size--) { if (!eq(a[size], b[size], aStack, bStack)) { return false; } } } else { if (a.constructor !== b.constructor) { return false; } if (a.hasOwnProperty('valueOf') && b.hasOwnProperty('valueOf')) { return a.valueOf() == b.valueOf(); } const keys = Object.keys(a); if (keys.length != Object.keys(b).length) { return false; } for (let i = 0; i < keys.length; i++) { if (!eq(a[keys[i]], b[keys[i]], aStack, bStack)) { return false; } } } aStack.pop(); bStack.pop(); return true; } module.exports = areEqual;PK �n[�J�� � DataTransfer.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule DataTransfer * @typechecks */ var PhotosMimeType = require("./PhotosMimeType"); var createArrayFromMixed = require("./createArrayFromMixed"); var emptyFunction = require("./emptyFunction"); var CR_LF_REGEX = new RegExp('\u000D\u000A', 'g'); var LF_ONLY = '\u000A'; var RICH_TEXT_TYPES = { 'text/rtf': 1, 'text/html': 1 }; /** * If DataTransferItem is a file then return the Blob of data. * * @param {object} item * @return {?blob} */ function getFileFromDataTransfer(item) { if (item.kind == 'file') { return item.getAsFile(); } } class DataTransfer { /** * @param {object} data */ constructor(data) { this.data = data; // Types could be DOMStringList or array this.types = data.types ? createArrayFromMixed(data.types) : []; } /** * Is this likely to be a rich text data transfer? * * @return {boolean} */ isRichText() { // If HTML is available, treat this data as rich text. This way, we avoid // using a pasted image if it is packaged with HTML -- this may occur with // pastes from MS Word, for example. However this is only rich text if // there's accompanying text. if (this.getHTML() && this.getText()) { return true; } // When an image is copied from a preview window, you end up with two // DataTransferItems one of which is a file's metadata as text. Skip those. if (this.isImage()) { return false; } return this.types.some(type => RICH_TEXT_TYPES[type]); } /** * Get raw text. * * @return {?string} */ getText() { var text; if (this.data.getData) { if (!this.types.length) { text = this.data.getData('Text'); } else if (this.types.indexOf('text/plain') != -1) { text = this.data.getData('text/plain'); } } return text ? text.replace(CR_LF_REGEX, LF_ONLY) : null; } /** * Get HTML paste data * * @return {?string} */ getHTML() { if (this.data.getData) { if (!this.types.length) { return this.data.getData('Text'); } else if (this.types.indexOf('text/html') != -1) { return this.data.getData('text/html'); } } } /** * Is this a link data transfer? * * @return {boolean} */ isLink() { return this.types.some(type => { return type.indexOf('Url') != -1 || type.indexOf('text/uri-list') != -1 || type.indexOf('text/x-moz-url'); }); } /** * Get a link url. * * @return {?string} */ getLink() { if (this.data.getData) { if (this.types.indexOf('text/x-moz-url') != -1) { let url = this.data.getData('text/x-moz-url').split('\n'); return url[0]; } return this.types.indexOf('text/uri-list') != -1 ? this.data.getData('text/uri-list') : this.data.getData('url'); } return null; } /** * Is this an image data transfer? * * @return {boolean} */ isImage() { var isImage = this.types.some(type => { // Firefox will have a type of application/x-moz-file for images during // dragging return type.indexOf('application/x-moz-file') != -1; }); if (isImage) { return true; } var items = this.getFiles(); for (var i = 0; i < items.length; i++) { var type = items[i].type; if (!PhotosMimeType.isImage(type)) { return false; } } return true; } getCount() { if (this.data.hasOwnProperty('items')) { return this.data.items.length; } else if (this.data.hasOwnProperty('mozItemCount')) { return this.data.mozItemCount; } else if (this.data.files) { return this.data.files.length; } return null; } /** * Get files. * * @return {array} */ getFiles() { if (this.data.items) { // createArrayFromMixed doesn't properly handle DataTransferItemLists. return Array.prototype.slice.call(this.data.items).map(getFileFromDataTransfer).filter(emptyFunction.thatReturnsArgument); } else if (this.data.files) { return Array.prototype.slice.call(this.data.files); } else { return []; } } /** * Are there any files to fetch? * * @return {boolean} */ hasFiles() { return this.getFiles().length > 0; } } module.exports = DataTransfer;PK �n[3�+ + crc32.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule crc32 * @flow */ function crc32(str: string): number { /* jslint bitwise: true */ var crc = -1; for (var i = 0, len = str.length; i < len; i++) { crc = crc >>> 8 ^ table[(crc ^ str.charCodeAt(i)) & 0xFF]; } return ~crc; } var table = [0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D]; if (global.Int32Array !== undefined) { table = new Int32Array(table); } module.exports = crc32;PK �n[��k@~ ~ Deferred.jsnu �Iw�� "use strict"; var Promise = require("./Promise"); function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks * */ /** * Deferred provides a Promise-like API that exposes methods to resolve and * reject the Promise. It is most useful when converting non-Promise code to use * Promises. * * If you want to export the Promise without exposing access to the resolve and * reject methods, you should export `getPromise` which returns a Promise with * the same semantics excluding those methods. */ var Deferred = /*#__PURE__*/ function () { function Deferred() { var _this = this; _defineProperty(this, "_settled", void 0); _defineProperty(this, "_promise", void 0); _defineProperty(this, "_resolve", void 0); _defineProperty(this, "_reject", void 0); this._settled = false; this._promise = new Promise(function (resolve, reject) { _this._resolve = resolve; _this._reject = reject; }); } var _proto = Deferred.prototype; _proto.getPromise = function getPromise() { return this._promise; }; _proto.resolve = function resolve(value) { this._settled = true; this._resolve(value); }; _proto.reject = function reject(reason) { this._settled = true; this._reject(reason); }; _proto["catch"] = function _catch(onReject) { return Promise.prototype["catch"].apply(this._promise, arguments); }; _proto.then = function then(onFulfill, onReject) { return Promise.prototype.then.apply(this._promise, arguments); }; _proto.done = function done(onFulfill, onReject) { // Embed the polyfill for the non-standard Promise.prototype.done so that // users of the open source fbjs don't need a custom lib for Promise var promise = arguments.length ? this._promise.then.apply(this._promise, arguments) : this._promise; promise.then(undefined, function (err) { setTimeout(function () { throw err; }, 0); }); }; _proto.isSettled = function isSettled() { return this._settled; }; return Deferred; }(); module.exports = Deferred;PK �n[;�:�� � areEqual.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ var aStackPool = []; var bStackPool = []; /** * Checks if two values are equal. Values may be primitives, arrays, or objects. * Returns true if both arguments have the same keys and values. * * @see http://underscorejs.org * @copyright 2009-2013 Jeremy Ashkenas, DocumentCloud Inc. * @license MIT */ function areEqual(a, b) { var aStack = aStackPool.length ? aStackPool.pop() : []; var bStack = bStackPool.length ? bStackPool.pop() : []; var result = eq(a, b, aStack, bStack); aStack.length = 0; bStack.length = 0; aStackPool.push(aStack); bStackPool.push(bStack); return result; } function eq(a, b, aStack, bStack) { if (a === b) { // Identical objects are equal. `0 === -0`, but they aren't identical. return a !== 0 || 1 / a == 1 / b; } if (a == null || b == null) { // a or b can be `null` or `undefined` return false; } if (typeof a != 'object' || typeof b != 'object') { return false; } var objToStr = Object.prototype.toString; var className = objToStr.call(a); if (className != objToStr.call(b)) { return false; } switch (className) { case '[object String]': return a == String(b); case '[object Number]': return isNaN(a) || isNaN(b) ? false : a == Number(b); case '[object Date]': case '[object Boolean]': return +a == +b; case '[object RegExp]': return a.source == b.source && a.global == b.global && a.multiline == b.multiline && a.ignoreCase == b.ignoreCase; } // Assume equality for cyclic structures. var length = aStack.length; while (length--) { if (aStack[length] == a) { return bStack[length] == b; } } aStack.push(a); bStack.push(b); var size = 0; // Recursively compare objects and arrays. if (className === '[object Array]') { size = a.length; if (size !== b.length) { return false; } // Deep compare the contents, ignoring non-numeric properties. while (size--) { if (!eq(a[size], b[size], aStack, bStack)) { return false; } } } else { if (a.constructor !== b.constructor) { return false; } if (a.hasOwnProperty('valueOf') && b.hasOwnProperty('valueOf')) { return a.valueOf() == b.valueOf(); } var keys = Object.keys(a); if (keys.length != Object.keys(b).length) { return false; } for (var i = 0; i < keys.length; i++) { if (!eq(a[keys[i]], b[keys[i]], aStack, bStack)) { return false; } } } aStack.pop(); bStack.pop(); return true; } module.exports = areEqual;PK �n[��? Deferred.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule Deferred * @typechecks * @flow */ /** * Deferred provides a Promise-like API that exposes methods to resolve and * reject the Promise. It is most useful when converting non-Promise code to use * Promises. * * If you want to export the Promise without exposing access to the resolve and * reject methods, you should export `getPromise` which returns a Promise with * the same semantics excluding those methods. */ class Deferred<Tvalue, Treason> { _settled: boolean; _promise: Promise<any>; _resolve: (value: Tvalue) => void; _reject: (reason: Treason) => void; constructor() { this._settled = false; this._promise = new Promise((resolve, reject) => { this._resolve = (resolve: any); this._reject = (reject: any); }); } getPromise(): Promise<any> { return this._promise; } resolve(value: Tvalue): void { this._settled = true; this._resolve(value); } reject(reason: Treason): void { this._settled = true; this._reject(reason); } catch(onReject?: ?(error: any) => mixed): Promise<any> { return Promise.prototype.catch.apply(this._promise, arguments); } then(onFulfill?: ?(value: any) => mixed, onReject?: ?(error: any) => mixed): Promise<any> { return Promise.prototype.then.apply(this._promise, arguments); } done(onFulfill?: ?(value: any) => mixed, onReject?: ?(error: any) => mixed): void { // Embed the polyfill for the non-standard Promise.prototype.done so that // users of the open source fbjs don't need a custom lib for Promise const promise = arguments.length ? this._promise.then.apply(this._promise, arguments) : this._promise; promise.then(undefined, function (err) { setTimeout(function () { throw err; }, 0); }); } isSettled(): boolean { return this._settled; } } module.exports = Deferred;PK �n[�ܮ? base62.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ 'use strict'; var BASE62 = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'; function base62(number) { if (!number) { return '0'; } var string = ''; while (number > 0) { string = BASE62[number % 62] + string; number = Math.floor(number / 62); } return string; } module.exports = base62;PK �n[���8 8 ErrorUtils.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ /* jslint unused:false */ if (global.ErrorUtils) { module.exports = global.ErrorUtils; } else { var ErrorUtils = { applyWithGuard: function applyWithGuard(callback, context, args, onError, name) { return callback.apply(context, args); }, guard: function guard(callback, name) { return callback; } }; module.exports = ErrorUtils; }PK �n[�R*P; ; base62.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule base62 * @flow */ 'use strict'; const BASE62 = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'; function base62(number: number): string { if (!number) { return '0'; } let string = ''; while (number > 0) { string = BASE62[number % 62] + string; number = Math.floor(number / 62); } return string; } module.exports = base62;PK �n[���� ErrorUtils.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule ErrorUtils */ /* jslint unused:false */ if (global.ErrorUtils) { module.exports = global.ErrorUtils; } else { var ErrorUtils = { applyWithGuard(callback, context, args, onError, name) { return callback.apply(context, args); }, guard(callback, name) { return callback; } }; module.exports = ErrorUtils; }PK �n[b��E E camelize.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var _hyphenPattern = /-(.)/g; /** * Camelcases a hyphenated string, for example: * * > camelize('background-color') * < "backgroundColor" * * @param {string} string * @return {string} */ function camelize(string) { return string.replace(_hyphenPattern, function (_, character) { return character.toUpperCase(); }); } module.exports = camelize;PK �n[G���� � EventListener.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var emptyFunction = require("./emptyFunction"); /** * Upstream version of event listener. Does not take into account specific * nature of platform. */ var EventListener = { /** * Listen to DOM events during the bubble phase. * * @param {DOMEventTarget} target DOM element to register listener on. * @param {string} eventType Event type, e.g. 'click' or 'mouseover'. * @param {function} callback Callback function. * @return {object} Object with a `remove` method. */ listen: function listen(target, eventType, callback) { if (target.addEventListener) { target.addEventListener(eventType, callback, false); return { remove: function remove() { target.removeEventListener(eventType, callback, false); } }; } else if (target.attachEvent) { target.attachEvent('on' + eventType, callback); return { remove: function remove() { target.detachEvent('on' + eventType, callback); } }; } }, /** * Listen to DOM events during the capture phase. * * @param {DOMEventTarget} target DOM element to register listener on. * @param {string} eventType Event type, e.g. 'click' or 'mouseover'. * @param {function} callback Callback function. * @return {object} Object with a `remove` method. */ capture: function capture(target, eventType, callback) { if (target.addEventListener) { target.addEventListener(eventType, callback, true); return { remove: function remove() { target.removeEventListener(eventType, callback, true); } }; } else { if (process.env.NODE_ENV !== "production") { console.error('Attempted to listen to events during the capture phase on a ' + 'browser that does not support the capture phase. Your application ' + 'will not receive some events.'); } return { remove: emptyFunction }; } }, registerDefault: function registerDefault() {} }; module.exports = EventListener;PK �n[u� � � UnicodeBidiService.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule UnicodeBidiService * @typechecks * @flow */ /** * Stateful API for text direction detection * * This class can be used in applications where you need to detect the * direction of a sequence of text blocks, where each direction shall be used * as the fallback direction for the next one. * * NOTE: A default direction, if not provided, is set based on the global * direction, as defined by `UnicodeBidiDirection`. * * == Example == * ``` * var UnicodeBidiService = require('UnicodeBidiService'); * * var bidiService = new UnicodeBidiService(); * * ... * * bidiService.reset(); * for (var para in paragraphs) { * var dir = bidiService.getDirection(para); * ... * } * ``` * * Part of our implementation of Unicode Bidirectional Algorithm (UBA) * Unicode Standard Annex #9 (UAX9) * http://www.unicode.org/reports/tr9/ */ 'use strict'; const UnicodeBidi = require("./UnicodeBidi"); const UnicodeBidiDirection = require("./UnicodeBidiDirection"); const invariant = require("./invariant"); import type { BidiDirection } from "./UnicodeBidiDirection"; class UnicodeBidiService { _defaultDir: BidiDirection; _lastDir: BidiDirection; /** * Stateful class for paragraph direction detection * * @param defaultDir Default direction of the service */ constructor(defaultDir: ?BidiDirection) { if (!defaultDir) { defaultDir = UnicodeBidiDirection.getGlobalDir(); } else { invariant(UnicodeBidiDirection.isStrong(defaultDir), 'Default direction must be a strong direction (LTR or RTL)'); } this._defaultDir = defaultDir; this.reset(); } /** * Reset the internal state * * Instead of creating a new instance, you can just reset() your instance * everytime you start a new loop. */ reset(): void { this._lastDir = this._defaultDir; } /** * Returns the direction of a block of text, and remembers it as the * fall-back direction for the next paragraph. * * @param str A text block, e.g. paragraph, table cell, tag * @return The resolved direction */ getDirection(str: string): BidiDirection { this._lastDir = UnicodeBidi.getDirection(str, this._lastDir); return this._lastDir; } } module.exports = UnicodeBidiService;PK �n[����� � EventListener.js.flownu �Iw�� declare var __DEV__: boolean; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule EventListener * @typechecks */ var emptyFunction = require("./emptyFunction"); /** * Upstream version of event listener. Does not take into account specific * nature of platform. */ var EventListener = { /** * Listen to DOM events during the bubble phase. * * @param {DOMEventTarget} target DOM element to register listener on. * @param {string} eventType Event type, e.g. 'click' or 'mouseover'. * @param {function} callback Callback function. * @return {object} Object with a `remove` method. */ listen: function (target, eventType, callback) { if (target.addEventListener) { target.addEventListener(eventType, callback, false); return { remove: function () { target.removeEventListener(eventType, callback, false); } }; } else if (target.attachEvent) { target.attachEvent('on' + eventType, callback); return { remove: function () { target.detachEvent('on' + eventType, callback); } }; } }, /** * Listen to DOM events during the capture phase. * * @param {DOMEventTarget} target DOM element to register listener on. * @param {string} eventType Event type, e.g. 'click' or 'mouseover'. * @param {function} callback Callback function. * @return {object} Object with a `remove` method. */ capture: function (target, eventType, callback) { if (target.addEventListener) { target.addEventListener(eventType, callback, true); return { remove: function () { target.removeEventListener(eventType, callback, true); } }; } else { if (__DEV__) { console.error('Attempted to listen to events during the capture phase on a ' + 'browser that does not support the capture phase. Your application ' + 'will not receive some events.'); } return { remove: emptyFunction }; } }, registerDefault: function () {} }; module.exports = EventListener;PK �n[ᓙ�� � UnicodeCJK.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule UnicodeCJK * @typechecks */ /** * Unicode algorithms for CJK (Chinese, Japanese, Korean) writing systems. * * Utilities for Hanzi/Kanji/Hanja logographs and Kanas (Katakana and Hiragana) * syllables. * * For Korean Hangul see module `UnicodeHangulKorean`. */ 'use strict'; /** * Latin * * NOTE: The code assumes these sets include only BMP characters. */ const R_LATIN_ASCII = 'a-zA-Z'; const R_LATIN_FULLWIDTH = '\uFF21-\uFF3A\uFF41-\uFF5A'; const R_LATIN = R_LATIN_ASCII + R_LATIN_FULLWIDTH; /** * Hiragana & Katakana * * NOTE: Some ranges include non-BMP characters. We do not support those ranges * for now. */ const R_HIRAGANA = '\u3040-\u309F'; const R_KATAKANA = '\u30A0-\u30FF'; const R_KATAKANA_PHONETIC = '\u31F0-\u31FF'; const R_KATAKANA_HALFWIDTH = '\uFF65-\uFF9F'; // var R_KANA_SUPPLEMENT = '\U0001B000-\U0001B0FF'; const R_KATAKANA_ALL = R_KATAKANA + R_KATAKANA_PHONETIC + R_KATAKANA_HALFWIDTH; const R_KANA = R_HIRAGANA + R_KATAKANA_ALL; const I_HIRAGANA = [0x3040, 0x309F]; const I_KATAKANA = [0x30A0, 0x30FF]; const I_HIRAGANA_TO_KATAKANA = I_KATAKANA[0] - I_HIRAGANA[0]; /** * Hanzi/Kanji/Hanja * * NOTE: Some ranges include non-BMP characters. We do not support those ranges * for now. */ const R_IDEO_MAIN = '\u4E00-\u9FCF'; const R_IDEO_EXT_A = '\u3400-\u4DBF'; // var R_IDEO_EXT_B = '\U00020000-\U0002A6DF'; // var R_IDEO_EXT_C = '\U0002A700-\U0002B73F'; // var R_IDEO_EXT_D = '\U0002B740-\U0002B81F'; const R_IDEO = R_IDEO_MAIN + R_IDEO_EXT_A; /** * Hangul */ // var R_HANGUL_JAMO = '\u1100-\u11FF'; // var R_HANGUL_JAMO_EXT_A = '\uA960-\uA97F'; // var R_HANGUL_JAMO_EXT_B = '\uD7B0-\uD7FF'; // var R_HANGUL_COMPATIBILITY = '\u3130-\u318F'; // var R_HANGUL_COMP_HALFWIDTH = '\uFFA0-\uFFDF'; const R_HANGUL_SYLLABLES = '\uAC00-\uD7AF'; /** * Globals */ const R_IDEO_OR_SYLL = R_IDEO + R_KANA + R_HANGUL_SYLLABLES; let REGEX_IDEO = null; let REGEX_KANA = null; let REGEX_IDEO_OR_SYLL = null; let REGEX_IS_KANA_WITH_TRAILING_LATIN = null; /** * Whether the string includes any Katakana or Hiragana characters. * * @param {string} str * @return {boolean} */ function hasKana(str) { REGEX_KANA = REGEX_KANA || new RegExp('[' + R_KANA + ']'); return REGEX_KANA.test(str); } /** * Whether the string includes any CJK Ideograph characters. * * @param {string} str * @return {boolean} */ function hasIdeograph(str) { REGEX_IDEO = REGEX_IDEO || new RegExp('[' + R_IDEO + ']'); return REGEX_IDEO.test(str); } /** * Whether the string includes any CJK Ideograph or Syllable characters. * * @param {string} str * @return {boolean} */ function hasIdeoOrSyll(str) { REGEX_IDEO_OR_SYLL = REGEX_IDEO_OR_SYLL || new RegExp('[' + R_IDEO_OR_SYLL + ']'); return REGEX_IDEO_OR_SYLL.test(str); } /** * @param {string} chr * @output {string} */ function charCodeToKatakana(chr) { const charCode = chr.charCodeAt(0); return String.fromCharCode(charCode < I_HIRAGANA[0] || charCode > I_HIRAGANA[1] ? charCode : charCode + I_HIRAGANA_TO_KATAKANA); } /** * Replace any Hiragana character with the matching Katakana * * @param {string} str * @output {string} */ function hiraganaToKatakana(str) { if (!hasKana(str)) { return str; } return str.split('').map(charCodeToKatakana).join(''); } /** * Whether the string is exactly a sequence of Kana characters followed by one * Latin character. * * @param {string} str * @output {string} */ function isKanaWithTrailingLatin(str) { REGEX_IS_KANA_WITH_TRAILING_LATIN = REGEX_IS_KANA_WITH_TRAILING_LATIN || new RegExp('^' + '[' + R_KANA + ']+' + '[' + R_LATIN + ']' + '$'); return REGEX_IS_KANA_WITH_TRAILING_LATIN.test(str); } /** * Drops the trailing Latin character from a string that is exactly a sequence * of Kana characters followed by one Latin character. * * @param {string} str * @output {string} */ function kanaRemoveTrailingLatin(str) { if (isKanaWithTrailingLatin(str)) { return str.substr(0, str.length - 1); } return str; } const UnicodeCJK = { hasKana: hasKana, hasIdeograph: hasIdeograph, hasIdeoOrSyll: hasIdeoOrSyll, hiraganaToKatakana: hiraganaToKatakana, isKanaWithTrailingLatin: isKanaWithTrailingLatin, kanaRemoveTrailingLatin: kanaRemoveTrailingLatin }; module.exports = UnicodeCJK;PK �n[X��[� � ExecutionEnvironment.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ 'use strict'; var canUseDOM = !!(typeof window !== 'undefined' && window.document && window.document.createElement); /** * Simple, lightweight module assisting with the detection and context of * Worker. Helps avoid circular dependencies and allows code to reason about * whether or not they are in a Worker, even if they never include the main * `ReactWorker` dependency. */ var ExecutionEnvironment = { canUseDOM: canUseDOM, canUseWorkers: typeof Worker !== 'undefined', canUseEventListeners: canUseDOM && !!(window.addEventListener || window.attachEvent), canUseViewport: canUseDOM && !!window.screen, isInWorker: !canUseDOM // For now, this is true - might change in the future. }; module.exports = ExecutionEnvironment;PK �n[��ao UnicodeHangulKorean.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ /** * Unicode algorithms for Hangul script, the Korean writing system * * Hangul script has three encoded models in Unicode: * * A) Conjoining Jamo (covers modern and historic elements) * * U+1100..U+11FF ; Hangul Jamo * * U+A960..U+A97F ; Hangul Jamo Extended-A * * U+D7B0..U+D7FF ; Hangul Jamo Extended-B * * B) Conjoined Syllables (only covers modern Korean language) * * U+AC00..U+D7AF ; Hangul Syllables * * C) Compatibility Jamo (one code-point for each "shape") * * U+3130..U+318F ; Hangul Compatibility Jamo * * This modules helps you convert characters from one model to another. * Primary functionalities are: * * 1) Convert from any encodings to Conjoining Jamo characters (A), * e.g. for prefix matching * * 2) Convert from any encodings to Syllable characters, when possible (B), * e.g. to reach the normal Unicode form (NFC) */ 'use strict'; var HANGUL_COMPATIBILITY_OR_SYLLABLE_REGEX = /[\u3130-\u318F\uAC00-\uD7AF]/; /** * Returns true if the input includes any Hangul Compatibility Jamo or * Hangul Conjoined Syllable. * * @param {string} str */ function hasCompatibilityOrSyllable(str) { return HANGUL_COMPATIBILITY_OR_SYLLABLE_REGEX.test(str); } /* Compatibility Jamo -> Conjoining Jamo * * Maps a compatibility character to the Conjoining Jamo character, * positioned at (compatibilityCodePoint - 0x3131). * * Generated by: * $ grep '^31[3-8].;' UnicodeData.txt |\ * awk -F';' '{print $6}' | awk '{print " 0x"$2","}' */ var CMAP = [0x1100, 0x1101, 0x11AA, 0x1102, 0x11AC, 0x11AD, 0x1103, 0x1104, 0x1105, 0x11B0, 0x11B1, 0x11B2, 0x11B3, 0x11B4, 0x11B5, 0x111A, 0x1106, 0x1107, 0x1108, 0x1121, 0x1109, 0x110A, 0x110B, 0x110C, 0x110D, 0x110E, 0x110F, 0x1110, 0x1111, 0x1112, 0x1161, 0x1162, 0x1163, 0x1164, 0x1165, 0x1166, 0x1167, 0x1168, 0x1169, 0x116A, 0x116B, 0x116C, 0x116D, 0x116E, 0x116F, 0x1170, 0x1171, 0x1172, 0x1173, 0x1174, 0x1175, 0x1160, 0x1114, 0x1115, 0x11C7, 0x11C8, 0x11CC, 0x11CE, 0x11D3, 0x11D7, 0x11D9, 0x111C, 0x11DD, 0x11DF, 0x111D, 0x111E, 0x1120, 0x1122, 0x1123, 0x1127, 0x1129, 0x112B, 0x112C, 0x112D, 0x112E, 0x112F, 0x1132, 0x1136, 0x1140, 0x1147, 0x114C, 0x11F1, 0x11F2, 0x1157, 0x1158, 0x1159, 0x1184, 0x1185, 0x1188, 0x1191, 0x1192, 0x1194, 0x119E, 0x11A1]; var CBASE = 0x3131; var CCOUNT = CMAP.length; var CTOP = CBASE + CCOUNT; /** * Maps one Hangul Compatibility Jamo code-point to the equivalent Hangul * Conjoining Jamo characters, as defined in UnicodeData.txt. * * @param {number} codePoint One Unicode code-point * @output {string} */ function fromCompatibility(codePoint) { return String.fromCharCode(CMAP[codePoint - CBASE]); } /** * Conjoined Syllable -> Conjoining Jamo * * Based on the "Hangul Syllable Decomposition" algorithm provided in * 3.12 Conjoining Jamo Behavior, The Unicode Standard, Version 6.3.0. * <http://www.unicode.org/versions/Unicode6.2.0/ch03.pdf> */ var LBASE = 0x1100; var VBASE = 0x1161; var TBASE = 0x11A7; var SBASE = 0xAC00; var LCOUNT = 19; var VCOUNT = 21; var TCOUNT = 28; var NCOUNT = VCOUNT * TCOUNT; var SCOUNT = LCOUNT * NCOUNT; var STOP = SBASE + SCOUNT; /** * Maps one Hangul Syllable code-point to the equivalent Hangul * Conjoining Jamo characters, as defined in UnicodeData.txt. * * @param {number} codePoint One Unicode character * @output {string} */ function decomposeSyllable(codePoint) { var sylSIndex = codePoint - SBASE; var sylTIndex = sylSIndex % TCOUNT; return String.fromCharCode(LBASE + sylSIndex / NCOUNT) + String.fromCharCode(VBASE + sylSIndex % NCOUNT / TCOUNT) + (sylTIndex > 0 ? String.fromCharCode(TBASE + sylTIndex) : ''); } /* To Conjoining Jamo */ /** * Return Unicode characters as they are, except for Hangul characters, which * will be converted to the Conjoining Jamo form. * * @param {string} string * @output {string} */ function toConjoiningJamo(string) { if (!hasCompatibilityOrSyllable(string)) { return string; } var result = []; for (var i = 0; i < string.length; i++) { var charStr = string.charAt(i); var codeUnit = charStr.charCodeAt(0); result.push(CBASE <= codeUnit && codeUnit < CTOP ? fromCompatibility(codeUnit) : SBASE <= codeUnit && codeUnit < STOP ? decomposeSyllable(codeUnit) : charStr); } return result.join(''); } var UnicodeHangulKorean = { toConjoiningJamo: toConjoiningJamo }; module.exports = UnicodeHangulKorean;PK �n[`ı�� � ExecutionEnvironment.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule ExecutionEnvironment */ 'use strict'; const canUseDOM = !!(typeof window !== 'undefined' && window.document && window.document.createElement); /** * Simple, lightweight module assisting with the detection and context of * Worker. Helps avoid circular dependencies and allows code to reason about * whether or not they are in a Worker, even if they never include the main * `ReactWorker` dependency. */ const ExecutionEnvironment = { canUseDOM: canUseDOM, canUseWorkers: typeof Worker !== 'undefined', canUseEventListeners: canUseDOM && !!(window.addEventListener || window.attachEvent), canUseViewport: canUseDOM && !!window.screen, isInWorker: !canUseDOM // For now, this is true - might change in the future. }; module.exports = ExecutionEnvironment;PK �n[�#�1 1 cx.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule cx */ /** * This function is used to mark string literals representing CSS class names * so that they can be transformed statically. This allows for modularization * and minification of CSS class names. * * In static_upstream, this function is actually implemented, but it should * eventually be replaced with something more descriptive, and the transform * that is used in the main stack should be ported for use elsewhere. * * @param string|object className to modularize, or an object of key/values. * In the object case, the values are conditions that * determine if the className keys should be included. * @param [string ...] Variable list of classNames in the string case. * @return string Renderable space-separated CSS className. */ function cx(classNames) { if (typeof classNames == 'object') { return Object.keys(classNames).filter(className => classNames[className]).map(replace).join(' '); } return Array.prototype.map.call(arguments, replace).join(' '); } function replace(str) { return str.replace(/\//g, '-'); } module.exports = cx;PK �n[�`�� Heap.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks * @preventMunge */ 'use strict'; /* * @param {*} a * @param {*} b * @return {boolean} */ function defaultComparator(a, b) { return a < b; } var Heap = /*#__PURE__*/ function () { function Heap(items, comparator) { this._items = items || []; this._size = this._items.length; this._comparator = comparator || defaultComparator; this._heapify(); } /* * @return {boolean} */ var _proto = Heap.prototype; _proto.empty = function empty() { return this._size === 0; }; /* * @return {*} */ _proto.pop = function pop() { if (this._size === 0) { return; } var elt = this._items[0]; var lastElt = this._items.pop(); this._size--; if (this._size > 0) { this._items[0] = lastElt; this._sinkDown(0); } return elt; }; /* * @param {*} item */ _proto.push = function push(item) { this._items[this._size++] = item; this._bubbleUp(this._size - 1); }; /* * @return {number} */ _proto.size = function size() { return this._size; }; /* * @return {*} */ _proto.peek = function peek() { if (this._size === 0) { return; } return this._items[0]; }; _proto._heapify = function _heapify() { for (var index = Math.floor((this._size + 1) / 2); index >= 0; index--) { this._sinkDown(index); } }; /* * @parent {number} index */ _proto._bubbleUp = function _bubbleUp(index) { var elt = this._items[index]; while (index > 0) { var parentIndex = Math.floor((index + 1) / 2) - 1; var parentElt = this._items[parentIndex]; // if parentElt < elt, stop if (this._comparator(parentElt, elt)) { return; } // swap this._items[parentIndex] = elt; this._items[index] = parentElt; index = parentIndex; } }; /* * @parent {number} index */ _proto._sinkDown = function _sinkDown(index) { var elt = this._items[index]; while (true) { var leftChildIndex = 2 * (index + 1) - 1; var rightChildIndex = 2 * (index + 1); var swapIndex = -1; if (leftChildIndex < this._size) { var leftChild = this._items[leftChildIndex]; if (this._comparator(leftChild, elt)) { swapIndex = leftChildIndex; } } if (rightChildIndex < this._size) { var rightChild = this._items[rightChildIndex]; if (this._comparator(rightChild, elt)) { if (swapIndex === -1 || this._comparator(rightChild, this._items[swapIndex])) { swapIndex = rightChildIndex; } } } // if we don't have a swap, stop if (swapIndex === -1) { return; } this._items[index] = this._items[swapIndex]; this._items[swapIndex] = elt; index = swapIndex; } }; return Heap; }(); module.exports = Heap;PK �n[K<G G cssVar.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ var fbCSSVars = require("fbjs-css-vars"); var invariant = require("./invariant"); /** * @param {string} name */ function cssVar(name) { !Object.prototype.hasOwnProperty.call(fbCSSVars, name) ? process.env.NODE_ENV !== "production" ? invariant(false, 'Unknown key passed to cssVar: %s.', name) : invariant(false) : void 0; return fbCSSVars[name]; } module.exports = cssVar;PK �n[���2 Heap.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule Heap * @typechecks * @preventMunge */ 'use strict'; /* * @param {*} a * @param {*} b * @return {boolean} */ function defaultComparator(a, b) { return a < b; } class Heap { constructor(items, comparator) { this._items = items || []; this._size = this._items.length; this._comparator = comparator || defaultComparator; this._heapify(); } /* * @return {boolean} */ empty() { return this._size === 0; } /* * @return {*} */ pop() { if (this._size === 0) { return; } const elt = this._items[0]; const lastElt = this._items.pop(); this._size--; if (this._size > 0) { this._items[0] = lastElt; this._sinkDown(0); } return elt; } /* * @param {*} item */ push(item) { this._items[this._size++] = item; this._bubbleUp(this._size - 1); } /* * @return {number} */ size() { return this._size; } /* * @return {*} */ peek() { if (this._size === 0) { return; } return this._items[0]; } _heapify() { for (let index = Math.floor((this._size + 1) / 2); index >= 0; index--) { this._sinkDown(index); } } /* * @parent {number} index */ _bubbleUp(index) { const elt = this._items[index]; while (index > 0) { const parentIndex = Math.floor((index + 1) / 2) - 1; const parentElt = this._items[parentIndex]; // if parentElt < elt, stop if (this._comparator(parentElt, elt)) { return; } // swap this._items[parentIndex] = elt; this._items[index] = parentElt; index = parentIndex; } } /* * @parent {number} index */ _sinkDown(index) { const elt = this._items[index]; while (true) { const leftChildIndex = 2 * (index + 1) - 1; const rightChildIndex = 2 * (index + 1); let swapIndex = -1; if (leftChildIndex < this._size) { const leftChild = this._items[leftChildIndex]; if (this._comparator(leftChild, elt)) { swapIndex = leftChildIndex; } } if (rightChildIndex < this._size) { const rightChild = this._items[rightChildIndex]; if (this._comparator(rightChild, elt)) { if (swapIndex === -1 || this._comparator(rightChild, this._items[swapIndex])) { swapIndex = rightChildIndex; } } } // if we don't have a swap, stop if (swapIndex === -1) { return; } this._items[index] = this._items[swapIndex]; this._items[swapIndex] = elt; index = swapIndex; } } } module.exports = Heap;PK �n[���T T camelize.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule camelize * @typechecks */ const _hyphenPattern = /-(.)/g; /** * Camelcases a hyphenated string, for example: * * > camelize('background-color') * < "backgroundColor" * * @param {string} string * @return {string} */ function camelize(string) { return string.replace(_hyphenPattern, function (_, character) { return character.toUpperCase(); }); } module.exports = camelize;PK �n[�&�q� � IntegerBufferSet.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ 'use strict'; var Heap = require("./Heap"); var invariant = require("./invariant"); // Data structure that allows to store values and assign positions to them // in a way to minimize changing positions of stored values when new ones are // added or when some values are replaced. Stored elements are alwasy assigned // a consecutive set of positoins startin from 0 up to count of elements less 1 // Following actions can be executed // * get position assigned to given value (null if value is not stored) // * create new entry for new value and get assigned position back // * replace value that is furthest from specified value range with new value // and get it's position back // All operations take amortized log(n) time where n is number of elements in // the set. var IntegerBufferSet = /*#__PURE__*/ function () { function IntegerBufferSet() { this._valueToPositionMap = {}; this._size = 0; this._smallValues = new Heap([], // Initial data in the heap this._smallerComparator); this._largeValues = new Heap([], // Initial data in the heap this._greaterComparator); this.getNewPositionForValue = this.getNewPositionForValue.bind(this); this.getValuePosition = this.getValuePosition.bind(this); this.getSize = this.getSize.bind(this); this.replaceFurthestValuePosition = this.replaceFurthestValuePosition.bind(this); } var _proto = IntegerBufferSet.prototype; _proto.getSize = function getSize() /*number*/ { return this._size; }; _proto.getValuePosition = function getValuePosition( /*number*/ value) /*?number*/ { if (this._valueToPositionMap[value] === undefined) { return null; } return this._valueToPositionMap[value]; }; _proto.getNewPositionForValue = function getNewPositionForValue( /*number*/ value) /*number*/ { !(this._valueToPositionMap[value] === undefined) ? process.env.NODE_ENV !== "production" ? invariant(false, "Shouldn't try to find new position for value already stored in BufferSet") : invariant(false) : void 0; var newPosition = this._size; this._size++; this._pushToHeaps(newPosition, value); this._valueToPositionMap[value] = newPosition; return newPosition; }; _proto.replaceFurthestValuePosition = function replaceFurthestValuePosition( /*number*/ lowValue, /*number*/ highValue, /*number*/ newValue) /*?number*/ { !(this._valueToPositionMap[newValue] === undefined) ? process.env.NODE_ENV !== "production" ? invariant(false, "Shouldn't try to replace values with value already stored value in " + "BufferSet") : invariant(false) : void 0; this._cleanHeaps(); if (this._smallValues.empty() || this._largeValues.empty()) { // Threre are currently no values stored. We will have to create new // position for this value. return null; } var minValue = this._smallValues.peek().value; var maxValue = this._largeValues.peek().value; if (minValue >= lowValue && maxValue <= highValue) { // All values currently stored are necessary, we can't reuse any of them. return null; } var valueToReplace; if (lowValue - minValue > maxValue - highValue) { // minValue is further from provided range. We will reuse it's position. valueToReplace = minValue; this._smallValues.pop(); } else { valueToReplace = maxValue; this._largeValues.pop(); } var position = this._valueToPositionMap[valueToReplace]; delete this._valueToPositionMap[valueToReplace]; this._valueToPositionMap[newValue] = position; this._pushToHeaps(position, newValue); return position; }; _proto._pushToHeaps = function _pushToHeaps( /*number*/ position, /*number*/ value) { var element = { position: position, value: value }; // We can reuse the same object in both heaps, because we don't mutate them this._smallValues.push(element); this._largeValues.push(element); }; _proto._cleanHeaps = function _cleanHeaps() { // We not usually only remove object from one heap while moving value. // Here we make sure that there is no stale data on top of heaps. this._cleanHeap(this._smallValues); this._cleanHeap(this._largeValues); var minHeapSize = Math.min(this._smallValues.size(), this._largeValues.size()); var maxHeapSize = Math.max(this._smallValues.size(), this._largeValues.size()); if (maxHeapSize > 10 * minHeapSize) { // There are many old values in one of heaps. We nned to get rid of them // to not use too avoid memory leaks this._recreateHeaps(); } }; _proto._recreateHeaps = function _recreateHeaps() { var sourceHeap = this._smallValues.size() < this._largeValues.size() ? this._smallValues : this._largeValues; var newSmallValues = new Heap([], // Initial data in the heap this._smallerComparator); var newLargeValues = new Heap([], // Initial datat in the heap this._greaterComparator); while (!sourceHeap.empty()) { var element = sourceHeap.pop(); // Push all stil valid elements to new heaps if (this._valueToPositionMap[element.value] !== undefined) { newSmallValues.push(element); newLargeValues.push(element); } } this._smallValues = newSmallValues; this._largeValues = newLargeValues; }; _proto._cleanHeap = function _cleanHeap( /*object*/ heap) { while (!heap.empty() && this._valueToPositionMap[heap.peek().value] === undefined) { heap.pop(); } }; _proto._smallerComparator = function _smallerComparator( /*object*/ lhs, /*object*/ rhs) /*boolean*/ { return lhs.value < rhs.value; }; _proto._greaterComparator = function _greaterComparator( /*object*/ lhs, /*object*/ rhs) /*boolean*/ { return lhs.value > rhs.value; }; return IntegerBufferSet; }(); module.exports = IntegerBufferSet;PK �n[��y�S S UnicodeHangulKorean.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule UnicodeHangulKorean * @typechecks */ /** * Unicode algorithms for Hangul script, the Korean writing system * * Hangul script has three encoded models in Unicode: * * A) Conjoining Jamo (covers modern and historic elements) * * U+1100..U+11FF ; Hangul Jamo * * U+A960..U+A97F ; Hangul Jamo Extended-A * * U+D7B0..U+D7FF ; Hangul Jamo Extended-B * * B) Conjoined Syllables (only covers modern Korean language) * * U+AC00..U+D7AF ; Hangul Syllables * * C) Compatibility Jamo (one code-point for each "shape") * * U+3130..U+318F ; Hangul Compatibility Jamo * * This modules helps you convert characters from one model to another. * Primary functionalities are: * * 1) Convert from any encodings to Conjoining Jamo characters (A), * e.g. for prefix matching * * 2) Convert from any encodings to Syllable characters, when possible (B), * e.g. to reach the normal Unicode form (NFC) */ 'use strict'; const HANGUL_COMPATIBILITY_OR_SYLLABLE_REGEX = /[\u3130-\u318F\uAC00-\uD7AF]/; /** * Returns true if the input includes any Hangul Compatibility Jamo or * Hangul Conjoined Syllable. * * @param {string} str */ function hasCompatibilityOrSyllable(str) { return HANGUL_COMPATIBILITY_OR_SYLLABLE_REGEX.test(str); } /* Compatibility Jamo -> Conjoining Jamo * * Maps a compatibility character to the Conjoining Jamo character, * positioned at (compatibilityCodePoint - 0x3131). * * Generated by: * $ grep '^31[3-8].;' UnicodeData.txt |\ * awk -F';' '{print $6}' | awk '{print " 0x"$2","}' */ const CMAP = [0x1100, 0x1101, 0x11AA, 0x1102, 0x11AC, 0x11AD, 0x1103, 0x1104, 0x1105, 0x11B0, 0x11B1, 0x11B2, 0x11B3, 0x11B4, 0x11B5, 0x111A, 0x1106, 0x1107, 0x1108, 0x1121, 0x1109, 0x110A, 0x110B, 0x110C, 0x110D, 0x110E, 0x110F, 0x1110, 0x1111, 0x1112, 0x1161, 0x1162, 0x1163, 0x1164, 0x1165, 0x1166, 0x1167, 0x1168, 0x1169, 0x116A, 0x116B, 0x116C, 0x116D, 0x116E, 0x116F, 0x1170, 0x1171, 0x1172, 0x1173, 0x1174, 0x1175, 0x1160, 0x1114, 0x1115, 0x11C7, 0x11C8, 0x11CC, 0x11CE, 0x11D3, 0x11D7, 0x11D9, 0x111C, 0x11DD, 0x11DF, 0x111D, 0x111E, 0x1120, 0x1122, 0x1123, 0x1127, 0x1129, 0x112B, 0x112C, 0x112D, 0x112E, 0x112F, 0x1132, 0x1136, 0x1140, 0x1147, 0x114C, 0x11F1, 0x11F2, 0x1157, 0x1158, 0x1159, 0x1184, 0x1185, 0x1188, 0x1191, 0x1192, 0x1194, 0x119E, 0x11A1]; const CBASE = 0x3131; const CCOUNT = CMAP.length; const CTOP = CBASE + CCOUNT; /** * Maps one Hangul Compatibility Jamo code-point to the equivalent Hangul * Conjoining Jamo characters, as defined in UnicodeData.txt. * * @param {number} codePoint One Unicode code-point * @output {string} */ function fromCompatibility(codePoint) { return String.fromCharCode(CMAP[codePoint - CBASE]); } /** * Conjoined Syllable -> Conjoining Jamo * * Based on the "Hangul Syllable Decomposition" algorithm provided in * 3.12 Conjoining Jamo Behavior, The Unicode Standard, Version 6.3.0. * <http://www.unicode.org/versions/Unicode6.2.0/ch03.pdf> */ const LBASE = 0x1100; const VBASE = 0x1161; const TBASE = 0x11A7; const SBASE = 0xAC00; const LCOUNT = 19; const VCOUNT = 21; const TCOUNT = 28; const NCOUNT = VCOUNT * TCOUNT; const SCOUNT = LCOUNT * NCOUNT; const STOP = SBASE + SCOUNT; /** * Maps one Hangul Syllable code-point to the equivalent Hangul * Conjoining Jamo characters, as defined in UnicodeData.txt. * * @param {number} codePoint One Unicode character * @output {string} */ function decomposeSyllable(codePoint) { const sylSIndex = codePoint - SBASE; const sylTIndex = sylSIndex % TCOUNT; return String.fromCharCode(LBASE + sylSIndex / NCOUNT) + String.fromCharCode(VBASE + sylSIndex % NCOUNT / TCOUNT) + (sylTIndex > 0 ? String.fromCharCode(TBASE + sylTIndex) : ''); } /* To Conjoining Jamo */ /** * Return Unicode characters as they are, except for Hangul characters, which * will be converted to the Conjoining Jamo form. * * @param {string} string * @output {string} */ function toConjoiningJamo(string) { if (!hasCompatibilityOrSyllable(string)) { return string; } const result = []; for (let i = 0; i < string.length; i++) { const charStr = string.charAt(i); const codeUnit = charStr.charCodeAt(0); result.push(CBASE <= codeUnit && codeUnit < CTOP ? fromCompatibility(codeUnit) : SBASE <= codeUnit && codeUnit < STOP ? decomposeSyllable(codeUnit) : charStr); } return result.join(''); } const UnicodeHangulKorean = { toConjoiningJamo: toConjoiningJamo }; module.exports = UnicodeHangulKorean;PK �n[���� � IntegerBufferSet.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule IntegerBufferSet * @typechecks */ 'use strict'; const Heap = require("./Heap"); const invariant = require("./invariant"); // Data structure that allows to store values and assign positions to them // in a way to minimize changing positions of stored values when new ones are // added or when some values are replaced. Stored elements are alwasy assigned // a consecutive set of positoins startin from 0 up to count of elements less 1 // Following actions can be executed // * get position assigned to given value (null if value is not stored) // * create new entry for new value and get assigned position back // * replace value that is furthest from specified value range with new value // and get it's position back // All operations take amortized log(n) time where n is number of elements in // the set. class IntegerBufferSet { constructor() { this._valueToPositionMap = {}; this._size = 0; this._smallValues = new Heap([], // Initial data in the heap this._smallerComparator); this._largeValues = new Heap([], // Initial data in the heap this._greaterComparator); this.getNewPositionForValue = this.getNewPositionForValue.bind(this); this.getValuePosition = this.getValuePosition.bind(this); this.getSize = this.getSize.bind(this); this.replaceFurthestValuePosition = this.replaceFurthestValuePosition.bind(this); } getSize() /*number*/ { return this._size; } getValuePosition( /*number*/ value) /*?number*/ { if (this._valueToPositionMap[value] === undefined) { return null; } return this._valueToPositionMap[value]; } getNewPositionForValue( /*number*/ value) /*number*/ { invariant(this._valueToPositionMap[value] === undefined, "Shouldn't try to find new position for value already stored in BufferSet"); const newPosition = this._size; this._size++; this._pushToHeaps(newPosition, value); this._valueToPositionMap[value] = newPosition; return newPosition; } replaceFurthestValuePosition( /*number*/ lowValue, /*number*/ highValue, /*number*/ newValue) /*?number*/ { invariant(this._valueToPositionMap[newValue] === undefined, "Shouldn't try to replace values with value already stored value in " + "BufferSet"); this._cleanHeaps(); if (this._smallValues.empty() || this._largeValues.empty()) { // Threre are currently no values stored. We will have to create new // position for this value. return null; } const minValue = this._smallValues.peek().value; const maxValue = this._largeValues.peek().value; if (minValue >= lowValue && maxValue <= highValue) { // All values currently stored are necessary, we can't reuse any of them. return null; } let valueToReplace; if (lowValue - minValue > maxValue - highValue) { // minValue is further from provided range. We will reuse it's position. valueToReplace = minValue; this._smallValues.pop(); } else { valueToReplace = maxValue; this._largeValues.pop(); } const position = this._valueToPositionMap[valueToReplace]; delete this._valueToPositionMap[valueToReplace]; this._valueToPositionMap[newValue] = position; this._pushToHeaps(position, newValue); return position; } _pushToHeaps( /*number*/ position, /*number*/ value) { const element = { position, value }; // We can reuse the same object in both heaps, because we don't mutate them this._smallValues.push(element); this._largeValues.push(element); } _cleanHeaps() { // We not usually only remove object from one heap while moving value. // Here we make sure that there is no stale data on top of heaps. this._cleanHeap(this._smallValues); this._cleanHeap(this._largeValues); const minHeapSize = Math.min(this._smallValues.size(), this._largeValues.size()); const maxHeapSize = Math.max(this._smallValues.size(), this._largeValues.size()); if (maxHeapSize > 10 * minHeapSize) { // There are many old values in one of heaps. We nned to get rid of them // to not use too avoid memory leaks this._recreateHeaps(); } } _recreateHeaps() { const sourceHeap = this._smallValues.size() < this._largeValues.size() ? this._smallValues : this._largeValues; const newSmallValues = new Heap([], // Initial data in the heap this._smallerComparator); const newLargeValues = new Heap([], // Initial datat in the heap this._greaterComparator); while (!sourceHeap.empty()) { const element = sourceHeap.pop(); // Push all stil valid elements to new heaps if (this._valueToPositionMap[element.value] !== undefined) { newSmallValues.push(element); newLargeValues.push(element); } } this._smallValues = newSmallValues; this._largeValues = newLargeValues; } _cleanHeap( /*object*/ heap) { while (!heap.empty() && this._valueToPositionMap[heap.peek().value] === undefined) { heap.pop(); } } _smallerComparator( /*object*/ lhs, /*object*/ rhs) /*boolean*/ { return lhs.value < rhs.value; } _greaterComparator( /*object*/ lhs, /*object*/ rhs) /*boolean*/ { return lhs.value > rhs.value; } } module.exports = IntegerBufferSet;PK �n[�-� cssVar.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule cssVar */ const fbCSSVars = require("fbjs-css-vars"); const invariant = require("./invariant"); /** * @param {string} name */ function cssVar(name) { invariant(Object.prototype.hasOwnProperty.call(fbCSSVars, name), 'Unknown key passed to cssVar: %s.', name); return fbCSSVars[name]; } module.exports = cssVar;PK �n[�9� � Keys.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ module.exports = { BACKSPACE: 8, TAB: 9, RETURN: 13, ALT: 18, ESC: 27, SPACE: 32, PAGE_UP: 33, PAGE_DOWN: 34, END: 35, HOME: 36, LEFT: 37, UP: 38, RIGHT: 39, DOWN: 40, DELETE: 46, COMMA: 188, PERIOD: 190, A: 65, Z: 90, ZERO: 48, NUMPAD_0: 96, NUMPAD_9: 105 };PK �n[J�:iH H cx.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ /** * This function is used to mark string literals representing CSS class names * so that they can be transformed statically. This allows for modularization * and minification of CSS class names. * * In static_upstream, this function is actually implemented, but it should * eventually be replaced with something more descriptive, and the transform * that is used in the main stack should be ported for use elsewhere. * * @param string|object className to modularize, or an object of key/values. * In the object case, the values are conditions that * determine if the className keys should be included. * @param [string ...] Variable list of classNames in the string case. * @return string Renderable space-separated CSS className. */ function cx(classNames) { if (typeof classNames == 'object') { return Object.keys(classNames).filter(function (className) { return classNames[className]; }).map(replace).join(' '); } return Array.prototype.map.call(arguments, replace).join(' '); } function replace(str) { return str.replace(/\//g, '-'); } module.exports = cx;PK �n[�� Keys.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule Keys */ module.exports = { BACKSPACE: 8, TAB: 9, RETURN: 13, ALT: 18, ESC: 27, SPACE: 32, PAGE_UP: 33, PAGE_DOWN: 34, END: 35, HOME: 36, LEFT: 37, UP: 38, RIGHT: 39, DOWN: 40, DELETE: 46, COMMA: 188, PERIOD: 190, A: 65, Z: 90, ZERO: 48, NUMPAD_0: 96, NUMPAD_9: 105 };PK �n[��}�T T debounceCore.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule debounceCore * @typechecks */ /** * Invokes the given callback after a specified number of milliseconds have * elapsed, ignoring subsequent calls. * * For example, if you wanted to update a preview after the user stops typing * you could do the following: * * elem.addEventListener('keyup', debounce(this.updatePreview, 250), false); * * The returned function has a reset method which can be called to cancel a * pending invocation. * * var debouncedUpdatePreview = debounce(this.updatePreview, 250); * elem.addEventListener('keyup', debouncedUpdatePreview, false); * * // later, to cancel pending calls * debouncedUpdatePreview.reset(); * * @param {function} func - the function to debounce * @param {number} wait - how long to wait in milliseconds * @param {*} context - optional context to invoke the function in * @param {?function} setTimeoutFunc - an implementation of setTimeout * if nothing is passed in the default setTimeout function is used * @param {?function} clearTimeoutFunc - an implementation of clearTimeout * if nothing is passed in the default clearTimeout function is used */ function debounce(func, wait, context, setTimeoutFunc, clearTimeoutFunc) { setTimeoutFunc = setTimeoutFunc || setTimeout; clearTimeoutFunc = clearTimeoutFunc || clearTimeout; let timeout; function debouncer(...args) { debouncer.reset(); const callback = function () { func.apply(context, args); }; callback.__SMmeta = func.__SMmeta; timeout = setTimeoutFunc(callback, wait); } debouncer.reset = function () { clearTimeoutFunc(timeout); }; return debouncer; } module.exports = debounce;PK �n[^xR� � Locale.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ var SiteData = require("./SiteData"); var ExecutionEnvironment = require("./ExecutionEnvironment"); function isRTL() { if (!ExecutionEnvironment.canUseDOM) { return false; } else { return SiteData.is_rtl; } } var Locale = { isRTL: isRTL }; module.exports = Locale;PK �n[�3?j j camelizeStyleName.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ 'use strict'; var camelize = require("./camelize"); var msPattern = /^-ms-/; /** * Camelcases a hyphenated CSS property name, for example: * * > camelizeStyleName('background-color') * < "backgroundColor" * > camelizeStyleName('-moz-transition') * < "MozTransition" * > camelizeStyleName('-ms-transition') * < "msTransition" * * As Andi Smith suggests * (http://www.andismith.com/blog/2012/02/modernizr-prefixed/), an `-ms` prefix * is converted to lowercase `ms`. * * @param {string} string * @return {string} */ function camelizeStyleName(string) { return camelize(string.replace(msPattern, 'ms-')); } module.exports = camelizeStyleName;PK �n[��� � Locale.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule Locale */ const SiteData = require("./SiteData"); const ExecutionEnvironment = require("./ExecutionEnvironment"); function isRTL() { if (!ExecutionEnvironment.canUseDOM) { return false; } else { return SiteData.is_rtl; } } var Locale = { isRTL: isRTL }; module.exports = Locale;PK �n[�c�`� � debounceCore.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ /** * Invokes the given callback after a specified number of milliseconds have * elapsed, ignoring subsequent calls. * * For example, if you wanted to update a preview after the user stops typing * you could do the following: * * elem.addEventListener('keyup', debounce(this.updatePreview, 250), false); * * The returned function has a reset method which can be called to cancel a * pending invocation. * * var debouncedUpdatePreview = debounce(this.updatePreview, 250); * elem.addEventListener('keyup', debouncedUpdatePreview, false); * * // later, to cancel pending calls * debouncedUpdatePreview.reset(); * * @param {function} func - the function to debounce * @param {number} wait - how long to wait in milliseconds * @param {*} context - optional context to invoke the function in * @param {?function} setTimeoutFunc - an implementation of setTimeout * if nothing is passed in the default setTimeout function is used * @param {?function} clearTimeoutFunc - an implementation of clearTimeout * if nothing is passed in the default clearTimeout function is used */ function debounce(func, wait, context, setTimeoutFunc, clearTimeoutFunc) { setTimeoutFunc = setTimeoutFunc || setTimeout; clearTimeoutFunc = clearTimeoutFunc || clearTimeout; var timeout; function debouncer() { for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) { args[_key] = arguments[_key]; } debouncer.reset(); var callback = function callback() { func.apply(context, args); }; callback.__SMmeta = func.__SMmeta; timeout = setTimeoutFunc(callback, wait); } debouncer.reset = function () { clearTimeoutFunc(timeout); }; return debouncer; } module.exports = debounce;PK �n[����� � Map.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ module.exports = require("core-js/es/map");PK �n[9|�� � distinctArray.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ var Set = require("./Set"); /** * Returns the distinct elements of an iterable. The result is an array whose * elements are ordered by first occurrence. */ function distinctArray(xs) { return Array.from(new Set(xs).values()); } module.exports = distinctArray;PK �n[��� � Map.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule Map */ module.exports = require("core-js/es/map");PK �n[�86� � clamp.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule clamp * @flow * @typechecks */ /** * Clamps (or clips or confines) the value to be between min and max. */ function clamp(value: number, min: number, max: number): number { if (value < min) { return min; } if (value > max) { return max; } return value; } module.exports = clamp;PK �n[*�l�~ ~ PhotosMimeType.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ var PhotosMimeType = { isImage: function isImage(mimeString) { return getParts(mimeString)[0] === 'image'; }, isJpeg: function isJpeg(mimeString) { var parts = getParts(mimeString); return PhotosMimeType.isImage(mimeString) && ( // see http://fburl.com/10972194 parts[1] === 'jpeg' || parts[1] === 'pjpeg'); } }; function getParts(mimeString) { return mimeString.split('/'); } module.exports = PhotosMimeType;PK �n[8Q�j UnicodeUtils.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ /** * Unicode-enabled replacesments for basic String functions. * * All the functions in this module assume that the input string is a valid * UTF-16 encoding of a Unicode sequence. If it's not the case, the behavior * will be undefined. * * WARNING: Since this module is typechecks-enforced, you may find new bugs * when replacing normal String functions with ones provided here. */ 'use strict'; var invariant = require("./invariant"); // These two ranges are consecutive so anything in [HIGH_START, LOW_END] is a // surrogate code unit. var SURROGATE_HIGH_START = 0xD800; var SURROGATE_HIGH_END = 0xDBFF; var SURROGATE_LOW_START = 0xDC00; var SURROGATE_LOW_END = 0xDFFF; var SURROGATE_UNITS_REGEX = /[\uD800-\uDFFF]/; /** * @param {number} codeUnit A Unicode code-unit, in range [0, 0x10FFFF] * @return {boolean} Whether code-unit is in a surrogate (hi/low) range */ function isCodeUnitInSurrogateRange(codeUnit) { return SURROGATE_HIGH_START <= codeUnit && codeUnit <= SURROGATE_LOW_END; } /** * Returns whether the two characters starting at `index` form a surrogate pair. * For example, given the string s = "\uD83D\uDE0A", (s, 0) returns true and * (s, 1) returns false. * * @param {string} str * @param {number} index * @return {boolean} */ function isSurrogatePair(str, index) { !(0 <= index && index < str.length) ? process.env.NODE_ENV !== "production" ? invariant(false, 'isSurrogatePair: Invalid index %s for string length %s.', index, str.length) : invariant(false) : void 0; if (index + 1 === str.length) { return false; } var first = str.charCodeAt(index); var second = str.charCodeAt(index + 1); return SURROGATE_HIGH_START <= first && first <= SURROGATE_HIGH_END && SURROGATE_LOW_START <= second && second <= SURROGATE_LOW_END; } /** * @param {string} str Non-empty string * @return {boolean} True if the input includes any surrogate code units */ function hasSurrogateUnit(str) { return SURROGATE_UNITS_REGEX.test(str); } /** * Return the length of the original Unicode character at given position in the * String by looking into the UTF-16 code unit; that is equal to 1 for any * non-surrogate characters in BMP ([U+0000..U+D7FF] and [U+E000, U+FFFF]); and * returns 2 for the hi/low surrogates ([U+D800..U+DFFF]), which are in fact * representing non-BMP characters ([U+10000..U+10FFFF]). * * Examples: * - '\u0020' => 1 * - '\u3020' => 1 * - '\uD835' => 2 * - '\uD835\uDDEF' => 2 * - '\uDDEF' => 2 * * @param {string} str Non-empty string * @param {number} pos Position in the string to look for one code unit * @return {number} Number 1 or 2 */ function getUTF16Length(str, pos) { return 1 + isCodeUnitInSurrogateRange(str.charCodeAt(pos)); } /** * Fully Unicode-enabled replacement for String#length * * @param {string} str Valid Unicode string * @return {number} The number of Unicode characters in the string */ function strlen(str) { // Call the native functions if there's no surrogate char if (!hasSurrogateUnit(str)) { return str.length; } var len = 0; for (var pos = 0; pos < str.length; pos += getUTF16Length(str, pos)) { len++; } return len; } /** * Fully Unicode-enabled replacement for String#substr() * * @param {string} str Valid Unicode string * @param {number} start Location in Unicode sequence to begin extracting * @param {?number} length The number of Unicode characters to extract * (default: to the end of the string) * @return {string} Extracted sub-string */ function substr(str, start, length) { start = start || 0; length = length === undefined ? Infinity : length || 0; // Call the native functions if there's no surrogate char if (!hasSurrogateUnit(str)) { return str.substr(start, length); } // Obvious cases var size = str.length; if (size <= 0 || start > size || length <= 0) { return ''; } // Find the actual starting position var posA = 0; if (start > 0) { for (; start > 0 && posA < size; start--) { posA += getUTF16Length(str, posA); } if (posA >= size) { return ''; } } else if (start < 0) { for (posA = size; start < 0 && 0 < posA; start++) { posA -= getUTF16Length(str, posA - 1); } if (posA < 0) { posA = 0; } } // Find the actual ending position var posB = size; if (length < size) { for (posB = posA; length > 0 && posB < size; length--) { posB += getUTF16Length(str, posB); } } return str.substring(posA, posB); } /** * Fully Unicode-enabled replacement for String#substring() * * @param {string} str Valid Unicode string * @param {number} start Location in Unicode sequence to begin extracting * @param {?number} end Location in Unicode sequence to end extracting * (default: end of the string) * @return {string} Extracted sub-string */ function substring(str, start, end) { start = start || 0; end = end === undefined ? Infinity : end || 0; if (start < 0) { start = 0; } if (end < 0) { end = 0; } var length = Math.abs(end - start); start = start < end ? start : end; return substr(str, start, length); } /** * Get a list of Unicode code-points from a String * * @param {string} str Valid Unicode string * @return {array<number>} A list of code-points in [0..0x10FFFF] */ function getCodePoints(str) { var codePoints = []; for (var pos = 0; pos < str.length; pos += getUTF16Length(str, pos)) { codePoints.push(str.codePointAt(pos)); } return codePoints; } var UnicodeUtils = { getCodePoints: getCodePoints, getUTF16Length: getUTF16Length, hasSurrogateUnit: hasSurrogateUnit, isCodeUnitInSurrogateRange: isCodeUnitInSurrogateRange, isSurrogatePair: isSurrogatePair, strlen: strlen, substring: substring, substr: substr }; module.exports = UnicodeUtils;PK �n[��o@t t PhotosMimeType.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule PhotosMimeType */ const PhotosMimeType = { isImage(mimeString) { return getParts(mimeString)[0] === 'image'; }, isJpeg(mimeString) { const parts = getParts(mimeString); return PhotosMimeType.isImage(mimeString) && ( // see http://fburl.com/10972194 parts[1] === 'jpeg' || parts[1] === 'pjpeg'); } }; function getParts(mimeString) { return mimeString.split('/'); } module.exports = PhotosMimeType;PK �n[T��� � UnicodeUtils.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule UnicodeUtils * @typechecks */ /** * Unicode-enabled replacesments for basic String functions. * * All the functions in this module assume that the input string is a valid * UTF-16 encoding of a Unicode sequence. If it's not the case, the behavior * will be undefined. * * WARNING: Since this module is typechecks-enforced, you may find new bugs * when replacing normal String functions with ones provided here. */ 'use strict'; const invariant = require("./invariant"); // These two ranges are consecutive so anything in [HIGH_START, LOW_END] is a // surrogate code unit. const SURROGATE_HIGH_START = 0xD800; const SURROGATE_HIGH_END = 0xDBFF; const SURROGATE_LOW_START = 0xDC00; const SURROGATE_LOW_END = 0xDFFF; const SURROGATE_UNITS_REGEX = /[\uD800-\uDFFF]/; /** * @param {number} codeUnit A Unicode code-unit, in range [0, 0x10FFFF] * @return {boolean} Whether code-unit is in a surrogate (hi/low) range */ function isCodeUnitInSurrogateRange(codeUnit) { return SURROGATE_HIGH_START <= codeUnit && codeUnit <= SURROGATE_LOW_END; } /** * Returns whether the two characters starting at `index` form a surrogate pair. * For example, given the string s = "\uD83D\uDE0A", (s, 0) returns true and * (s, 1) returns false. * * @param {string} str * @param {number} index * @return {boolean} */ function isSurrogatePair(str, index) { invariant(0 <= index && index < str.length, 'isSurrogatePair: Invalid index %s for string length %s.', index, str.length); if (index + 1 === str.length) { return false; } const first = str.charCodeAt(index); const second = str.charCodeAt(index + 1); return SURROGATE_HIGH_START <= first && first <= SURROGATE_HIGH_END && SURROGATE_LOW_START <= second && second <= SURROGATE_LOW_END; } /** * @param {string} str Non-empty string * @return {boolean} True if the input includes any surrogate code units */ function hasSurrogateUnit(str) { return SURROGATE_UNITS_REGEX.test(str); } /** * Return the length of the original Unicode character at given position in the * String by looking into the UTF-16 code unit; that is equal to 1 for any * non-surrogate characters in BMP ([U+0000..U+D7FF] and [U+E000, U+FFFF]); and * returns 2 for the hi/low surrogates ([U+D800..U+DFFF]), which are in fact * representing non-BMP characters ([U+10000..U+10FFFF]). * * Examples: * - '\u0020' => 1 * - '\u3020' => 1 * - '\uD835' => 2 * - '\uD835\uDDEF' => 2 * - '\uDDEF' => 2 * * @param {string} str Non-empty string * @param {number} pos Position in the string to look for one code unit * @return {number} Number 1 or 2 */ function getUTF16Length(str, pos) { return 1 + isCodeUnitInSurrogateRange(str.charCodeAt(pos)); } /** * Fully Unicode-enabled replacement for String#length * * @param {string} str Valid Unicode string * @return {number} The number of Unicode characters in the string */ function strlen(str) { // Call the native functions if there's no surrogate char if (!hasSurrogateUnit(str)) { return str.length; } let len = 0; for (let pos = 0; pos < str.length; pos += getUTF16Length(str, pos)) { len++; } return len; } /** * Fully Unicode-enabled replacement for String#substr() * * @param {string} str Valid Unicode string * @param {number} start Location in Unicode sequence to begin extracting * @param {?number} length The number of Unicode characters to extract * (default: to the end of the string) * @return {string} Extracted sub-string */ function substr(str, start, length) { start = start || 0; length = length === undefined ? Infinity : length || 0; // Call the native functions if there's no surrogate char if (!hasSurrogateUnit(str)) { return str.substr(start, length); } // Obvious cases const size = str.length; if (size <= 0 || start > size || length <= 0) { return ''; } // Find the actual starting position let posA = 0; if (start > 0) { for (; start > 0 && posA < size; start--) { posA += getUTF16Length(str, posA); } if (posA >= size) { return ''; } } else if (start < 0) { for (posA = size; start < 0 && 0 < posA; start++) { posA -= getUTF16Length(str, posA - 1); } if (posA < 0) { posA = 0; } } // Find the actual ending position let posB = size; if (length < size) { for (posB = posA; length > 0 && posB < size; length--) { posB += getUTF16Length(str, posB); } } return str.substring(posA, posB); } /** * Fully Unicode-enabled replacement for String#substring() * * @param {string} str Valid Unicode string * @param {number} start Location in Unicode sequence to begin extracting * @param {?number} end Location in Unicode sequence to end extracting * (default: end of the string) * @return {string} Extracted sub-string */ function substring(str, start, end) { start = start || 0; end = end === undefined ? Infinity : end || 0; if (start < 0) { start = 0; } if (end < 0) { end = 0; } const length = Math.abs(end - start); start = start < end ? start : end; return substr(str, start, length); } /** * Get a list of Unicode code-points from a String * * @param {string} str Valid Unicode string * @return {array<number>} A list of code-points in [0..0x10FFFF] */ function getCodePoints(str) { const codePoints = []; for (let pos = 0; pos < str.length; pos += getUTF16Length(str, pos)) { codePoints.push(str.codePointAt(pos)); } return codePoints; } const UnicodeUtils = { getCodePoints: getCodePoints, getUTF16Length: getUTF16Length, hasSurrogateUnit: hasSurrogateUnit, isCodeUnitInSurrogateRange: isCodeUnitInSurrogateRange, isSurrogatePair: isSurrogatePair, strlen: strlen, substring: substring, substr: substr }; module.exports = UnicodeUtils;PK �n[ � � PrefixIntervalTree.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @typechecks */ 'use strict'; function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } var invariant = require("./invariant"); var parent = function parent(node) { return Math.floor(node / 2); }; var Int32Array = global.Int32Array || function (size) { var xs = []; for (var i = size - 1; i >= 0; --i) { xs[i] = 0; } return xs; }; /** * Computes the next power of 2 after or equal to x. */ function ceilLog2(x) { var y = 1; while (y < x) { y *= 2; } return y; } /** * A prefix interval tree stores an numeric array and the partial sums of that * array. It is optimized for updating the values of the array without * recomputing all of the partial sums. * * - O(ln n) update * - O(1) lookup * - O(ln n) compute a partial sum * - O(n) space * * Note that the sequence of partial sums is one longer than the array, so that * the first partial sum is always 0, and the last partial sum is the sum of the * entire array. */ var PrefixIntervalTree = /*#__PURE__*/ function () { /** * Number of elements in the array */ /** * Half the size of the heap. It is also the number of non-leaf nodes, and the * index of the first element in the heap. Always a power of 2. */ /** * Binary heap */ function PrefixIntervalTree(xs) { _defineProperty(this, "_size", void 0); _defineProperty(this, "_half", void 0); _defineProperty(this, "_heap", void 0); this._size = xs.length; this._half = ceilLog2(this._size); this._heap = new Int32Array(2 * this._half); var i; for (i = 0; i < this._size; ++i) { this._heap[this._half + i] = xs[i]; } for (i = this._half - 1; i > 0; --i) { this._heap[i] = this._heap[2 * i] + this._heap[2 * i + 1]; } } PrefixIntervalTree.uniform = function uniform(size, initialValue) { var xs = []; for (var _i = size - 1; _i >= 0; --_i) { xs[_i] = initialValue; } return new PrefixIntervalTree(xs); }; PrefixIntervalTree.empty = function empty(size) { return PrefixIntervalTree.uniform(size, 0); }; var _proto = PrefixIntervalTree.prototype; _proto.set = function set(index, value) { !(0 <= index && index < this._size) ? process.env.NODE_ENV !== "production" ? invariant(false, 'Index out of range %s', index) : invariant(false) : void 0; var node = this._half + index; this._heap[node] = value; node = parent(node); for (; node !== 0; node = parent(node)) { this._heap[node] = this._heap[2 * node] + this._heap[2 * node + 1]; } }; _proto.get = function get(index) { !(0 <= index && index < this._size) ? process.env.NODE_ENV !== "production" ? invariant(false, 'Index out of range %s', index) : invariant(false) : void 0; var node = this._half + index; return this._heap[node]; }; _proto.getSize = function getSize() { return this._size; }; /** * Returns the sum get(0) + get(1) + ... + get(end - 1). */ _proto.sumUntil = function sumUntil(end) { !(0 <= end && end < this._size + 1) ? process.env.NODE_ENV !== "production" ? invariant(false, 'Index out of range %s', end) : invariant(false) : void 0; if (end === 0) { return 0; } var node = this._half + end - 1; var sum = this._heap[node]; for (; node !== 1; node = parent(node)) { if (node % 2 === 1) { sum += this._heap[node - 1]; } } return sum; }; /** * Returns the sum get(0) + get(1) + ... + get(inclusiveEnd). */ _proto.sumTo = function sumTo(inclusiveEnd) { !(0 <= inclusiveEnd && inclusiveEnd < this._size) ? process.env.NODE_ENV !== "production" ? invariant(false, 'Index out of range %s', inclusiveEnd) : invariant(false) : void 0; return this.sumUntil(inclusiveEnd + 1); }; /** * Returns the sum get(begin) + get(begin + 1) + ... + get(end - 1). */ _proto.sum = function sum(begin, end) { !(begin <= end) ? process.env.NODE_ENV !== "production" ? invariant(false, 'Begin must precede end') : invariant(false) : void 0; return this.sumUntil(end) - this.sumUntil(begin); }; /** * Returns the smallest i such that 0 <= i <= size and sumUntil(i) <= t, or * -1 if no such i exists. */ _proto.greatestLowerBound = function greatestLowerBound(t) { if (t < 0) { return -1; } var node = 1; if (this._heap[node] <= t) { return this._size; } while (node < this._half) { var leftSum = this._heap[2 * node]; if (t < leftSum) { node = 2 * node; } else { node = 2 * node + 1; t -= leftSum; } } return node - this._half; }; /** * Returns the smallest i such that 0 <= i <= size and sumUntil(i) < t, or * -1 if no such i exists. */ _proto.greatestStrictLowerBound = function greatestStrictLowerBound(t) { if (t <= 0) { return -1; } var node = 1; if (this._heap[node] < t) { return this._size; } while (node < this._half) { var leftSum = this._heap[2 * node]; if (t <= leftSum) { node = 2 * node; } else { node = 2 * node + 1; t -= leftSum; } } return node - this._half; }; /** * Returns the smallest i such that 0 <= i <= size and t <= sumUntil(i), or * size + 1 if no such i exists. */ _proto.leastUpperBound = function leastUpperBound(t) { return this.greatestStrictLowerBound(t) + 1; }; /** * Returns the smallest i such that 0 <= i <= size and t < sumUntil(i), or * size + 1 if no such i exists. */ _proto.leastStrictUpperBound = function leastStrictUpperBound(t) { return this.greatestLowerBound(t) + 1; }; return PrefixIntervalTree; }(); module.exports = PrefixIntervalTree;PK �n[���p p UnicodeUtilsExtra.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ /** * Unicode-enabled extra utility functions not always needed. */ 'use strict'; var UnicodeUtils = require("./UnicodeUtils"); /** * @param {number} codePoint Valid Unicode code-point * @param {number} len Zero-padded minimum width of result * @return {string} A zero-padded hexadecimal string (00XXXX) */ function zeroPaddedHex(codePoint, len) { var codePointHex = codePoint.toString(16).toUpperCase(); var numZeros = Math.max(0, len - codePointHex.length); var result = ''; for (var i = 0; i < numZeros; i++) { result += '0'; } result += codePointHex; return result; } /** * @param {number} codePoint Valid Unicode code-point * @return {string} A formatted Unicode code-point string * of the format U+XXXX, U+XXXXX, or U+XXXXXX */ function formatCodePoint(codePoint) { codePoint = codePoint || 0; // NaN --> 0 var formatted = ''; if (codePoint <= 0xFFFF) { formatted = zeroPaddedHex(codePoint, 4); } else { formatted = codePoint.toString(16).toUpperCase(); } return 'U+' + formatted; } /** * Get a list of formatted (string) Unicode code-points from a String * * @param {string} str Valid Unicode string * @return {array<string>} A list of formatted code-point strings */ function getCodePointsFormatted(str) { var codePoints = UnicodeUtils.getCodePoints(str); return codePoints.map(formatCodePoint); } var specialEscape = { 0x07: '\\a', 0x08: '\\b', 0x0C: '\\f', 0x0A: '\\n', 0x0D: '\\r', 0x09: '\\t', 0x0B: '\\v', 0x22: '\\"', 0x5c: '\\\\' }; /** * Returns a double-quoted PHP string with all non-printable and * non-US-ASCII sequences escaped. * * @param {string} str Valid Unicode string * @return {string} Double-quoted string with Unicode sequences escaped */ function phpEscape(s) { var result = '"'; var _iteratorNormalCompletion = true; var _didIteratorError = false; var _iteratorError = undefined; try { for (var _iterator = UnicodeUtils.getCodePoints(s)[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { var cp = _step.value; var special = specialEscape[cp]; if (special !== undefined) { result += special; } else if (cp >= 0x20 && cp <= 0x7e) { result += String.fromCodePoint(cp); } else if (cp <= 0xFFFF) { result += "\\u{" + zeroPaddedHex(cp, 4) + '}'; } else { result += "\\u{" + zeroPaddedHex(cp, 6) + '}'; } } } catch (err) { _didIteratorError = true; _iteratorError = err; } finally { try { if (!_iteratorNormalCompletion && _iterator["return"] != null) { _iterator["return"](); } } finally { if (_didIteratorError) { throw _iteratorError; } } } result += '"'; return result; } /** * Returns a double-quoted Java or JavaScript string with all * non-printable and non-US-ASCII sequences escaped. * * @param {string} str Valid Unicode string * @return {string} Double-quoted string with Unicode sequences escaped */ function jsEscape(s) { var result = '"'; for (var i = 0; i < s.length; i++) { var cp = s.charCodeAt(i); var special = specialEscape[cp]; if (special !== undefined) { result += special; } else if (cp >= 0x20 && cp <= 0x7e) { result += String.fromCodePoint(cp); } else { result += "\\u" + zeroPaddedHex(cp, 4); } } result += '"'; return result; } function c11Escape(s) { var result = ''; var _iteratorNormalCompletion2 = true; var _didIteratorError2 = false; var _iteratorError2 = undefined; try { for (var _iterator2 = UnicodeUtils.getCodePoints(s)[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) { var cp = _step2.value; var special = specialEscape[cp]; if (special !== undefined) { result += special; } else if (cp >= 0x20 && cp <= 0x7e) { result += String.fromCodePoint(cp); } else if (cp <= 0xFFFF) { result += "\\u" + zeroPaddedHex(cp, 4); } else { result += "\\U" + zeroPaddedHex(cp, 8); } } } catch (err) { _didIteratorError2 = true; _iteratorError2 = err; } finally { try { if (!_iteratorNormalCompletion2 && _iterator2["return"] != null) { _iterator2["return"](); } } finally { if (_didIteratorError2) { throw _iteratorError2; } } } return result; } /** * Returns a double-quoted C string with all non-printable and * non-US-ASCII sequences escaped. * * @param {string} str Valid Unicode string * @return {string} Double-quoted string with Unicode sequences escaped */ function cEscape(s) { return 'u8"' + c11Escape(s) + '"'; } /** * Returns a double-quoted Objective-C string with all non-printable * and non-US-ASCII sequences escaped. * * @param {string} str Valid Unicode string * @return {string} Double-quoted string with Unicode sequences escaped */ function objcEscape(s) { return '@"' + c11Escape(s) + '"'; } /** * Returns a double-quoted Python string with all non-printable * and non-US-ASCII sequences escaped. * * @param {string} str Valid Unicode string * @return {string} Double-quoted string with Unicode sequences escaped */ function pyEscape(s) { return 'u"' + c11Escape(s) + '"'; } var UnicodeUtilsExtra = { formatCodePoint: formatCodePoint, getCodePointsFormatted: getCodePointsFormatted, zeroPaddedHex: zeroPaddedHex, phpEscape: phpEscape, jsEscape: jsEscape, cEscape: cEscape, objcEscape: objcEscape, pyEscape: pyEscape }; module.exports = UnicodeUtilsExtra;PK �n[wےȏ � PrefixIntervalTree.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule PrefixIntervalTree * @flow * @typechecks */ 'use strict'; const invariant = require("./invariant"); const parent = node => Math.floor(node / 2); const Int32Array = global.Int32Array || function (size: number): Array<number> { const xs = []; for (let i = size - 1; i >= 0; --i) { xs[i] = 0; } return xs; }; /** * Computes the next power of 2 after or equal to x. */ function ceilLog2(x: number): number { let y = 1; while (y < x) { y *= 2; } return y; } /** * A prefix interval tree stores an numeric array and the partial sums of that * array. It is optimized for updating the values of the array without * recomputing all of the partial sums. * * - O(ln n) update * - O(1) lookup * - O(ln n) compute a partial sum * - O(n) space * * Note that the sequence of partial sums is one longer than the array, so that * the first partial sum is always 0, and the last partial sum is the sum of the * entire array. */ class PrefixIntervalTree { /** * Number of elements in the array */ _size: number; /** * Half the size of the heap. It is also the number of non-leaf nodes, and the * index of the first element in the heap. Always a power of 2. */ _half: number; /** * Binary heap */ _heap: Int32Array; constructor(xs: Array<number>) { this._size = xs.length; this._half = ceilLog2(this._size); this._heap = new Int32Array(2 * this._half); let i; for (i = 0; i < this._size; ++i) { this._heap[this._half + i] = xs[i]; } for (i = this._half - 1; i > 0; --i) { this._heap[i] = this._heap[2 * i] + this._heap[2 * i + 1]; } } static uniform(size: number, initialValue: number): PrefixIntervalTree { const xs = []; for (let i = size - 1; i >= 0; --i) { xs[i] = initialValue; } return new PrefixIntervalTree(xs); } static empty(size: number): PrefixIntervalTree { return PrefixIntervalTree.uniform(size, 0); } set(index: number, value: number): void { invariant(0 <= index && index < this._size, 'Index out of range %s', index); let node = this._half + index; this._heap[node] = value; node = parent(node); for (; node !== 0; node = parent(node)) { this._heap[node] = this._heap[2 * node] + this._heap[2 * node + 1]; } } get(index: number): number { invariant(0 <= index && index < this._size, 'Index out of range %s', index); const node = this._half + index; return this._heap[node]; } getSize(): number { return this._size; } /** * Returns the sum get(0) + get(1) + ... + get(end - 1). */ sumUntil(end: number): number { invariant(0 <= end && end < this._size + 1, 'Index out of range %s', end); if (end === 0) { return 0; } let node = this._half + end - 1; let sum = this._heap[node]; for (; node !== 1; node = parent(node)) { if (node % 2 === 1) { sum += this._heap[node - 1]; } } return sum; } /** * Returns the sum get(0) + get(1) + ... + get(inclusiveEnd). */ sumTo(inclusiveEnd: number): number { invariant(0 <= inclusiveEnd && inclusiveEnd < this._size, 'Index out of range %s', inclusiveEnd); return this.sumUntil(inclusiveEnd + 1); } /** * Returns the sum get(begin) + get(begin + 1) + ... + get(end - 1). */ sum(begin: number, end: number): number { invariant(begin <= end, 'Begin must precede end'); return this.sumUntil(end) - this.sumUntil(begin); } /** * Returns the smallest i such that 0 <= i <= size and sumUntil(i) <= t, or * -1 if no such i exists. */ greatestLowerBound(t: number): number { if (t < 0) { return -1; } let node = 1; if (this._heap[node] <= t) { return this._size; } while (node < this._half) { const leftSum = this._heap[2 * node]; if (t < leftSum) { node = 2 * node; } else { node = 2 * node + 1; t -= leftSum; } } return node - this._half; } /** * Returns the smallest i such that 0 <= i <= size and sumUntil(i) < t, or * -1 if no such i exists. */ greatestStrictLowerBound(t: number): number { if (t <= 0) { return -1; } let node = 1; if (this._heap[node] < t) { return this._size; } while (node < this._half) { const leftSum = this._heap[2 * node]; if (t <= leftSum) { node = 2 * node; } else { node = 2 * node + 1; t -= leftSum; } } return node - this._half; } /** * Returns the smallest i such that 0 <= i <= size and t <= sumUntil(i), or * size + 1 if no such i exists. */ leastUpperBound(t: number): number { return this.greatestStrictLowerBound(t) + 1; } /** * Returns the smallest i such that 0 <= i <= size and t < sumUntil(i), or * size + 1 if no such i exists. */ leastStrictUpperBound(t: number): number { return this.greatestLowerBound(t) + 1; } } module.exports = PrefixIntervalTree;PK �n[�),� � emptyFunction.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ function makeEmptyFunction(arg) { return function () { return arg; }; } /** * This function accepts and discards inputs; it has no side effects. This is * primarily useful idiomatically for overridable function endpoints which * always need to be callable, since JS lacks a null-call idiom ala Cocoa. */ var emptyFunction = function emptyFunction() {}; emptyFunction.thatReturns = makeEmptyFunction; emptyFunction.thatReturnsFalse = makeEmptyFunction(false); emptyFunction.thatReturnsTrue = makeEmptyFunction(true); emptyFunction.thatReturnsNull = makeEmptyFunction(null); emptyFunction.thatReturnsThis = function () { return this; }; emptyFunction.thatReturnsArgument = function (arg) { return arg; }; module.exports = emptyFunction;PK �n[�� � � Promise.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ module.exports = require("promise");PK �n[NbT.� � camelizeStyleName.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule camelizeStyleName * @typechecks */ 'use strict'; const camelize = require("./camelize"); const msPattern = /^-ms-/; /** * Camelcases a hyphenated CSS property name, for example: * * > camelizeStyleName('background-color') * < "backgroundColor" * > camelizeStyleName('-moz-transition') * < "MozTransition" * > camelizeStyleName('-ms-transition') * < "msTransition" * * As Andi Smith suggests * (http://www.andismith.com/blog/2012/02/modernizr-prefixed/), an `-ms` prefix * is converted to lowercase `ms`. * * @param {string} string * @return {string} */ function camelizeStyleName(string) { return camelize(string.replace(msPattern, 'ms-')); } module.exports = camelizeStyleName;PK �n[��� � Promise.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule Promise */ module.exports = require("promise");PK �n[��P� � clamp.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @typechecks */ /** * Clamps (or clips or confines) the value to be between min and max. */ function clamp(value, min, max) { if (value < min) { return min; } if (value > max) { return max; } return value; } module.exports = clamp;PK �n[#=�bz z Promise.native.jsnu �Iw�� /** * * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * This module wraps and augments the minimally ES6-compliant Promise * implementation provided by the promise npm package. * */ 'use strict'; var Promise = require("promise/setimmediate/es6-extensions"); require("promise/setimmediate/done"); /** * Handle either fulfillment or rejection with the same callback. */ Promise.prototype["finally"] = function (onSettled) { return this.then(onSettled, onSettled); }; module.exports = Promise;PK �n[h�:o� � UnicodeUtilsExtra.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule UnicodeUtilsExtra * @typechecks */ /** * Unicode-enabled extra utility functions not always needed. */ 'use strict'; const UnicodeUtils = require("./UnicodeUtils"); /** * @param {number} codePoint Valid Unicode code-point * @param {number} len Zero-padded minimum width of result * @return {string} A zero-padded hexadecimal string (00XXXX) */ function zeroPaddedHex(codePoint, len) { let codePointHex = codePoint.toString(16).toUpperCase(); let numZeros = Math.max(0, len - codePointHex.length); var result = ''; for (var i = 0; i < numZeros; i++) { result += '0'; } result += codePointHex; return result; } /** * @param {number} codePoint Valid Unicode code-point * @return {string} A formatted Unicode code-point string * of the format U+XXXX, U+XXXXX, or U+XXXXXX */ function formatCodePoint(codePoint) { codePoint = codePoint || 0; // NaN --> 0 var formatted = ''; if (codePoint <= 0xFFFF) { formatted = zeroPaddedHex(codePoint, 4); } else { formatted = codePoint.toString(16).toUpperCase(); } return 'U+' + formatted; } /** * Get a list of formatted (string) Unicode code-points from a String * * @param {string} str Valid Unicode string * @return {array<string>} A list of formatted code-point strings */ function getCodePointsFormatted(str) { const codePoints = UnicodeUtils.getCodePoints(str); return codePoints.map(formatCodePoint); } const specialEscape = { 0x07: '\\a', 0x08: '\\b', 0x0C: '\\f', 0x0A: '\\n', 0x0D: '\\r', 0x09: '\\t', 0x0B: '\\v', 0x22: '\\"', 0x5c: '\\\\' }; /** * Returns a double-quoted PHP string with all non-printable and * non-US-ASCII sequences escaped. * * @param {string} str Valid Unicode string * @return {string} Double-quoted string with Unicode sequences escaped */ function phpEscape(s) { var result = '"'; for (let cp of UnicodeUtils.getCodePoints(s)) { let special = specialEscape[cp]; if (special !== undefined) { result += special; } else if (cp >= 0x20 && cp <= 0x7e) { result += String.fromCodePoint(cp); } else if (cp <= 0xFFFF) { result += '\\u{' + zeroPaddedHex(cp, 4) + '}'; } else { result += '\\u{' + zeroPaddedHex(cp, 6) + '}'; } } result += '"'; return result; } /** * Returns a double-quoted Java or JavaScript string with all * non-printable and non-US-ASCII sequences escaped. * * @param {string} str Valid Unicode string * @return {string} Double-quoted string with Unicode sequences escaped */ function jsEscape(s) { var result = '"'; for (var i = 0; i < s.length; i++) { let cp = s.charCodeAt(i); let special = specialEscape[cp]; if (special !== undefined) { result += special; } else if (cp >= 0x20 && cp <= 0x7e) { result += String.fromCodePoint(cp); } else { result += '\\u' + zeroPaddedHex(cp, 4); } } result += '"'; return result; } function c11Escape(s) { var result = ''; for (let cp of UnicodeUtils.getCodePoints(s)) { let special = specialEscape[cp]; if (special !== undefined) { result += special; } else if (cp >= 0x20 && cp <= 0x7e) { result += String.fromCodePoint(cp); } else if (cp <= 0xFFFF) { result += '\\u' + zeroPaddedHex(cp, 4); } else { result += '\\U' + zeroPaddedHex(cp, 8); } } return result; } /** * Returns a double-quoted C string with all non-printable and * non-US-ASCII sequences escaped. * * @param {string} str Valid Unicode string * @return {string} Double-quoted string with Unicode sequences escaped */ function cEscape(s) { return 'u8"' + c11Escape(s) + '"'; } /** * Returns a double-quoted Objective-C string with all non-printable * and non-US-ASCII sequences escaped. * * @param {string} str Valid Unicode string * @return {string} Double-quoted string with Unicode sequences escaped */ function objcEscape(s) { return '@"' + c11Escape(s) + '"'; } /** * Returns a double-quoted Python string with all non-printable * and non-US-ASCII sequences escaped. * * @param {string} str Valid Unicode string * @return {string} Double-quoted string with Unicode sequences escaped */ function pyEscape(s) { return 'u"' + c11Escape(s) + '"'; } const UnicodeUtilsExtra = { formatCodePoint: formatCodePoint, getCodePointsFormatted: getCodePointsFormatted, zeroPaddedHex: zeroPaddedHex, phpEscape: phpEscape, jsEscape: jsEscape, cEscape: cEscape, objcEscape: objcEscape, pyEscape: pyEscape }; module.exports = UnicodeUtilsExtra;PK �n[�N��w w Promise.native.js.flownu �Iw�� /** * * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * This module wraps and augments the minimally ES6-compliant Promise * implementation provided by the promise npm package. * */ 'use strict'; var Promise = require("promise/setimmediate/es6-extensions"); require("promise/setimmediate/done"); /** * Handle either fulfillment or rejection with the same callback. */ Promise.prototype.finally = function (onSettled) { return this.then(onSettled, onSettled); }; module.exports = Promise;PK �n[q�� compactArray.jsnu �Iw�� /** * Copyright 2015-present Facebook. All Rights Reserved. * * @typechecks * */ 'use strict'; /** * Returns a new Array containing all the element of the source array except * `null` and `undefined` ones. This brings the benefit of strong typing over * `Array.prototype.filter`. */ function compactArray(array) { var result = []; for (var i = 0; i < array.length; ++i) { var elem = array[i]; if (elem != null) { result.push(elem); } } return result; } module.exports = compactArray;PK �n[m��� PromiseMap.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ 'use strict'; function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } var Deferred = require("./Deferred"); var invariant = require("./invariant"); /** * A map of asynchronous values that can be get or set in any order. Unlike a * normal map, setting the value for a particular key more than once throws. * Also unlike a normal map, a key can either be resolved or rejected. */ var PromiseMap = /*#__PURE__*/ function () { function PromiseMap() { _defineProperty(this, "_deferred", void 0); this._deferred = {}; } var _proto = PromiseMap.prototype; _proto.get = function get(key) { return getDeferred(this._deferred, key).getPromise(); }; _proto.resolveKey = function resolveKey(key, value) { var entry = getDeferred(this._deferred, key); !!entry.isSettled() ? process.env.NODE_ENV !== "production" ? invariant(false, 'PromiseMap: Already settled `%s`.', key) : invariant(false) : void 0; entry.resolve(value); }; _proto.rejectKey = function rejectKey(key, reason) { var entry = getDeferred(this._deferred, key); !!entry.isSettled() ? process.env.NODE_ENV !== "production" ? invariant(false, 'PromiseMap: Already settled `%s`.', key) : invariant(false) : void 0; entry.reject(reason); }; return PromiseMap; }(); function getDeferred(entries, key) { if (!entries.hasOwnProperty(key)) { entries[key] = new Deferred(); } return entries[key]; } module.exports = PromiseMap;PK �n[����V V compactArray.js.flownu �Iw�� /** * Copyright 2015-present Facebook. All Rights Reserved. * * @providesModule compactArray * @typechecks * @flow */ 'use strict'; /** * Returns a new Array containing all the element of the source array except * `null` and `undefined` ones. This brings the benefit of strong typing over * `Array.prototype.filter`. */ function compactArray<T>(array: Array<T | null | void>): Array<T> { var result = []; for (var i = 0; i < array.length; ++i) { var elem = array[i]; if (elem != null) { result.push(elem); } } return result; } module.exports = compactArray;PK �n[;}��� � PromiseMap.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule PromiseMap * @flow */ 'use strict'; const Deferred = require("./Deferred"); const invariant = require("./invariant"); /** * A map of asynchronous values that can be get or set in any order. Unlike a * normal map, setting the value for a particular key more than once throws. * Also unlike a normal map, a key can either be resolved or rejected. */ class PromiseMap<Tvalue, Treason> { _deferred: { [key: string]: Deferred<any, any> }; constructor() { this._deferred = {}; } get(key: string): Promise<any> { return getDeferred(this._deferred, key).getPromise(); } resolveKey(key: string, value: Tvalue): void { const entry = getDeferred(this._deferred, key); invariant(!entry.isSettled(), 'PromiseMap: Already settled `%s`.', key); entry.resolve(value); } rejectKey(key: string, reason: Treason): void { const entry = getDeferred(this._deferred, key); invariant(!entry.isSettled(), 'PromiseMap: Already settled `%s`.', key); entry.reject(reason); } } function getDeferred(entries: { [key: string]: Deferred<any, any> }, key: string): Deferred<any, any> { if (!entries.hasOwnProperty(key)) { entries[key] = new Deferred(); } return entries[key]; } module.exports = PromiseMap;PK �n[� concatAllArray.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var push = Array.prototype.push; /** * Concats an array of arrays into a single flat array. * * @param {array} array * @return {array} */ function concatAllArray(array) { var ret = []; for (var ii = 0; ii < array.length; ii++) { var value = array[ii]; if (Array.isArray(value)) { push.apply(ret, value); } else if (value != null) { throw new TypeError('concatAllArray: All items in the array must be an array or null, ' + 'got "' + value + '" at index "' + ii + '" instead'); } } return ret; } module.exports = concatAllArray;PK �n[ [��� � ReactWheelHandler.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * This is utility that hanlds onWheel events and calls provided wheel * callback with correct frame rate. * * @typechecks */ 'use strict'; var emptyFunction = require("./emptyFunction"); var normalizeWheel = require("./normalizeWheel"); var requestAnimationFramePolyfill = require("./requestAnimationFramePolyfill"); var ReactWheelHandler = /*#__PURE__*/ function () { /** * onWheel is the callback that will be called with right frame rate if * any wheel events happened * onWheel should is to be called with two arguments: deltaX and deltaY in * this order */ function ReactWheelHandler( /*function*/ onWheel, /*boolean|function*/ handleScrollX, /*boolean|function*/ handleScrollY, /*?boolean|?function*/ stopPropagation) { this._animationFrameID = null; this._deltaX = 0; this._deltaY = 0; this._didWheel = this._didWheel.bind(this); if (typeof handleScrollX !== 'function') { handleScrollX = handleScrollX ? emptyFunction.thatReturnsTrue : emptyFunction.thatReturnsFalse; } if (typeof handleScrollY !== 'function') { handleScrollY = handleScrollY ? emptyFunction.thatReturnsTrue : emptyFunction.thatReturnsFalse; } if (typeof stopPropagation !== 'function') { stopPropagation = stopPropagation ? emptyFunction.thatReturnsTrue : emptyFunction.thatReturnsFalse; } this._handleScrollX = handleScrollX; this._handleScrollY = handleScrollY; this._stopPropagation = stopPropagation; this._onWheelCallback = onWheel; this.onWheel = this.onWheel.bind(this); } var _proto = ReactWheelHandler.prototype; _proto.onWheel = function onWheel( /*object*/ event) { var normalizedEvent = normalizeWheel(event); var deltaX = this._deltaX + normalizedEvent.pixelX; var deltaY = this._deltaY + normalizedEvent.pixelY; var handleScrollX = this._handleScrollX(deltaX, deltaY); var handleScrollY = this._handleScrollY(deltaY, deltaX); if (!handleScrollX && !handleScrollY) { return; } this._deltaX += handleScrollX ? normalizedEvent.pixelX : 0; this._deltaY += handleScrollY ? normalizedEvent.pixelY : 0; event.preventDefault(); var changed; if (this._deltaX !== 0 || this._deltaY !== 0) { if (this._stopPropagation()) { event.stopPropagation(); } changed = true; } if (changed === true && this._animationFrameID === null) { this._animationFrameID = requestAnimationFramePolyfill(this._didWheel); } }; _proto._didWheel = function _didWheel() { this._animationFrameID = null; this._onWheelCallback(this._deltaX, this._deltaY); this._deltaX = 0; this._deltaY = 0; }; return ReactWheelHandler; }(); module.exports = ReactWheelHandler;PK �n[1�P� UserAgent.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ 'use strict'; var UserAgentData = require("./UserAgentData"); var VersionRange = require("./VersionRange"); var mapObject = require("./mapObject"); var memoizeStringOnly = require("./memoizeStringOnly"); /** * Checks to see whether `name` and `version` satisfy `query`. * * @param {string} name Name of the browser, device, engine or platform * @param {?string} version Version of the browser, engine or platform * @param {string} query Query of form "Name [range expression]" * @param {?function} normalizer Optional pre-processor for range expression * @return {boolean} */ function compare(name, version, query, normalizer) { // check for exact match with no version if (name === query) { return true; } // check for non-matching names if (!query.startsWith(name)) { return false; } // full comparison with version var range = query.slice(name.length); if (version) { range = normalizer ? normalizer(range) : range; return VersionRange.contains(range, version); } return false; } /** * Normalizes `version` by stripping any "NT" prefix, but only on the Windows * platform. * * Mimics the stripping performed by the `UserAgentWindowsPlatform` PHP class. * * @param {string} version * @return {string} */ function normalizePlatformVersion(version) { if (UserAgentData.platformName === 'Windows') { return version.replace(/^\s*NT/, ''); } return version; } /** * Provides client-side access to the authoritative PHP-generated User Agent * information supplied by the server. */ var UserAgent = { /** * Check if the User Agent browser matches `query`. * * `query` should be a string like "Chrome" or "Chrome > 33". * * Valid browser names include: * * - ACCESS NetFront * - AOL * - Amazon Silk * - Android * - BlackBerry * - BlackBerry PlayBook * - Chrome * - Chrome for iOS * - Chrome frame * - Facebook PHP SDK * - Facebook for iOS * - Firefox * - IE * - IE Mobile * - Mobile Safari * - Motorola Internet Browser * - Nokia * - Openwave Mobile Browser * - Opera * - Opera Mini * - Opera Mobile * - Safari * - UIWebView * - Unknown * - webOS * - etc... * * An authoritative list can be found in the PHP `BrowserDetector` class and * related classes in the same file (see calls to `new UserAgentBrowser` here: * https://fburl.com/50728104). * * @note Function results are memoized * * @param {string} query Query of the form "Name [range expression]" * @return {boolean} */ isBrowser: function isBrowser(query) { return compare(UserAgentData.browserName, UserAgentData.browserFullVersion, query); }, /** * Check if the User Agent browser uses a 32 or 64 bit architecture. * * @note Function results are memoized * * @param {string} query Query of the form "32" or "64". * @return {boolean} */ isBrowserArchitecture: function isBrowserArchitecture(query) { return compare(UserAgentData.browserArchitecture, null, query); }, /** * Check if the User Agent device matches `query`. * * `query` should be a string like "iPhone" or "iPad". * * Valid device names include: * * - Kindle * - Kindle Fire * - Unknown * - iPad * - iPhone * - iPod * - etc... * * An authoritative list can be found in the PHP `DeviceDetector` class and * related classes in the same file (see calls to `new UserAgentDevice` here: * https://fburl.com/50728332). * * @note Function results are memoized * * @param {string} query Query of the form "Name" * @return {boolean} */ isDevice: function isDevice(query) { return compare(UserAgentData.deviceName, null, query); }, /** * Check if the User Agent rendering engine matches `query`. * * `query` should be a string like "WebKit" or "WebKit >= 537". * * Valid engine names include: * * - Gecko * - Presto * - Trident * - WebKit * - etc... * * An authoritative list can be found in the PHP `RenderingEngineDetector` * class related classes in the same file (see calls to `new * UserAgentRenderingEngine` here: https://fburl.com/50728617). * * @note Function results are memoized * * @param {string} query Query of the form "Name [range expression]" * @return {boolean} */ isEngine: function isEngine(query) { return compare(UserAgentData.engineName, UserAgentData.engineVersion, query); }, /** * Check if the User Agent platform matches `query`. * * `query` should be a string like "Windows" or "iOS 5 - 6". * * Valid platform names include: * * - Android * - BlackBerry OS * - Java ME * - Linux * - Mac OS X * - Mac OS X Calendar * - Mac OS X Internet Account * - Symbian * - SymbianOS * - Windows * - Windows Mobile * - Windows Phone * - iOS * - iOS Facebook Integration Account * - iOS Facebook Social Sharing UI * - webOS * - Chrome OS * - etc... * * An authoritative list can be found in the PHP `PlatformDetector` class and * related classes in the same file (see calls to `new UserAgentPlatform` * here: https://fburl.com/50729226). * * @note Function results are memoized * * @param {string} query Query of the form "Name [range expression]" * @return {boolean} */ isPlatform: function isPlatform(query) { return compare(UserAgentData.platformName, UserAgentData.platformFullVersion, query, normalizePlatformVersion); }, /** * Check if the User Agent platform is a 32 or 64 bit architecture. * * @note Function results are memoized * * @param {string} query Query of the form "32" or "64". * @return {boolean} */ isPlatformArchitecture: function isPlatformArchitecture(query) { return compare(UserAgentData.platformArchitecture, null, query); } }; module.exports = mapObject(UserAgent, memoizeStringOnly);PK �n[$��� � everySet.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @typechecks */ 'use strict'; /** * The everySet() method tests whether all elements in the given Set pass the * test implemented by the provided function. */ function everySet(set, callback, context) { var iterator = set.entries(); var current = iterator.next(); while (!current.done) { var entry = current.value; if (!callback.call(context, entry[1], entry[0], set)) { return false; } current = iterator.next(); } return true; } module.exports = everySet;PK �n[���� ReactWheelHandler.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * This is utility that hanlds onWheel events and calls provided wheel * callback with correct frame rate. * * @providesModule ReactWheelHandler * @typechecks */ 'use strict'; const emptyFunction = require("./emptyFunction"); const normalizeWheel = require("./normalizeWheel"); const requestAnimationFramePolyfill = require("./requestAnimationFramePolyfill"); class ReactWheelHandler { /** * onWheel is the callback that will be called with right frame rate if * any wheel events happened * onWheel should is to be called with two arguments: deltaX and deltaY in * this order */ constructor( /*function*/ onWheel, /*boolean|function*/ handleScrollX, /*boolean|function*/ handleScrollY, /*?boolean|?function*/ stopPropagation) { this._animationFrameID = null; this._deltaX = 0; this._deltaY = 0; this._didWheel = this._didWheel.bind(this); if (typeof handleScrollX !== 'function') { handleScrollX = handleScrollX ? emptyFunction.thatReturnsTrue : emptyFunction.thatReturnsFalse; } if (typeof handleScrollY !== 'function') { handleScrollY = handleScrollY ? emptyFunction.thatReturnsTrue : emptyFunction.thatReturnsFalse; } if (typeof stopPropagation !== 'function') { stopPropagation = stopPropagation ? emptyFunction.thatReturnsTrue : emptyFunction.thatReturnsFalse; } this._handleScrollX = handleScrollX; this._handleScrollY = handleScrollY; this._stopPropagation = stopPropagation; this._onWheelCallback = onWheel; this.onWheel = this.onWheel.bind(this); } onWheel( /*object*/ event) { const normalizedEvent = normalizeWheel(event); const deltaX = this._deltaX + normalizedEvent.pixelX; const deltaY = this._deltaY + normalizedEvent.pixelY; const handleScrollX = this._handleScrollX(deltaX, deltaY); const handleScrollY = this._handleScrollY(deltaY, deltaX); if (!handleScrollX && !handleScrollY) { return; } this._deltaX += handleScrollX ? normalizedEvent.pixelX : 0; this._deltaY += handleScrollY ? normalizedEvent.pixelY : 0; event.preventDefault(); let changed; if (this._deltaX !== 0 || this._deltaY !== 0) { if (this._stopPropagation()) { event.stopPropagation(); } changed = true; } if (changed === true && this._animationFrameID === null) { this._animationFrameID = requestAnimationFramePolyfill(this._didWheel); } } _didWheel() { this._animationFrameID = null; this._onWheelCallback(this._deltaX, this._deltaY); this._deltaX = 0; this._deltaY = 0; } } module.exports = ReactWheelHandler;PK �n[Ԙ�K K emptyObject.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ 'use strict'; var emptyObject = {}; if (process.env.NODE_ENV !== "production") { Object.freeze(emptyObject); } module.exports = emptyObject;PK �n[��� � Scroll.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ /** * @param {DOMElement} element * @param {DOMDocument} doc * @return {boolean} */ function _isViewportScrollElement(element, doc) { return !!doc && (element === doc.documentElement || element === doc.body); } /** * Scroll Module. This class contains 4 simple static functions * to be used to access Element.scrollTop/scrollLeft properties. * To solve the inconsistencies between browsers when either * document.body or document.documentElement is supplied, * below logic will be used to alleviate the issue: * * 1. If 'element' is either 'document.body' or 'document.documentElement, * get whichever element's 'scroll{Top,Left}' is larger. * 2. If 'element' is either 'document.body' or 'document.documentElement', * set the 'scroll{Top,Left}' on both elements. */ var Scroll = { /** * @param {DOMElement} element * @return {number} */ getTop: function getTop(element) { var doc = element.ownerDocument; return _isViewportScrollElement(element, doc) ? // In practice, they will either both have the same value, // or one will be zero and the other will be the scroll position // of the viewport. So we can use `X || Y` instead of `Math.max(X, Y)` doc.body.scrollTop || doc.documentElement.scrollTop : element.scrollTop; }, /** * @param {DOMElement} element * @param {number} newTop */ setTop: function setTop(element, newTop) { var doc = element.ownerDocument; if (_isViewportScrollElement(element, doc)) { doc.body.scrollTop = doc.documentElement.scrollTop = newTop; } else { element.scrollTop = newTop; } }, /** * @param {DOMElement} element * @return {number} */ getLeft: function getLeft(element) { var doc = element.ownerDocument; return _isViewportScrollElement(element, doc) ? doc.body.scrollLeft || doc.documentElement.scrollLeft : element.scrollLeft; }, /** * @param {DOMElement} element * @param {number} newLeft */ setLeft: function setLeft(element, newLeft) { var doc = element.ownerDocument; if (_isViewportScrollElement(element, doc)) { doc.body.scrollLeft = doc.documentElement.scrollLeft = newLeft; } else { element.scrollLeft = newLeft; } } }; module.exports = Scroll;PK �n[-��B� � containsNode.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule containsNode * @flow */ const isTextNode = require("./isTextNode"); /*eslint-disable no-bitwise */ /** * Checks if a given DOM node contains or is another DOM node. */ function containsNode(outerNode: ?Node, innerNode: ?Node): boolean { if (!outerNode || !innerNode) { return false; } else if (outerNode === innerNode) { return true; } else if (isTextNode(outerNode)) { return false; } else if (isTextNode(innerNode)) { return containsNode(outerNode, innerNode.parentNode); } else if ('contains' in outerNode) { return outerNode.contains(innerNode); } else if (outerNode.compareDocumentPosition) { return !!(outerNode.compareDocumentPosition(innerNode) & 16); } else { return false; } } module.exports = containsNode;PK �n[��� � Scroll.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule Scroll */ /** * @param {DOMElement} element * @param {DOMDocument} doc * @return {boolean} */ function _isViewportScrollElement(element, doc) { return !!doc && (element === doc.documentElement || element === doc.body); } /** * Scroll Module. This class contains 4 simple static functions * to be used to access Element.scrollTop/scrollLeft properties. * To solve the inconsistencies between browsers when either * document.body or document.documentElement is supplied, * below logic will be used to alleviate the issue: * * 1. If 'element' is either 'document.body' or 'document.documentElement, * get whichever element's 'scroll{Top,Left}' is larger. * 2. If 'element' is either 'document.body' or 'document.documentElement', * set the 'scroll{Top,Left}' on both elements. */ const Scroll = { /** * @param {DOMElement} element * @return {number} */ getTop: function (element) { const doc = element.ownerDocument; return _isViewportScrollElement(element, doc) ? // In practice, they will either both have the same value, // or one will be zero and the other will be the scroll position // of the viewport. So we can use `X || Y` instead of `Math.max(X, Y)` doc.body.scrollTop || doc.documentElement.scrollTop : element.scrollTop; }, /** * @param {DOMElement} element * @param {number} newTop */ setTop: function (element, newTop) { const doc = element.ownerDocument; if (_isViewportScrollElement(element, doc)) { doc.body.scrollTop = doc.documentElement.scrollTop = newTop; } else { element.scrollTop = newTop; } }, /** * @param {DOMElement} element * @return {number} */ getLeft: function (element) { const doc = element.ownerDocument; return _isViewportScrollElement(element, doc) ? doc.body.scrollLeft || doc.documentElement.scrollLeft : element.scrollLeft; }, /** * @param {DOMElement} element * @param {number} newLeft */ setLeft: function (element, newLeft) { const doc = element.ownerDocument; if (_isViewportScrollElement(element, doc)) { doc.body.scrollLeft = doc.documentElement.scrollLeft = newLeft; } else { element.scrollLeft = newLeft; } } }; module.exports = Scroll;PK �n[���l l emptyObject.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule emptyObject */ 'use strict'; declare var __DEV__: boolean; const emptyObject = {}; if (__DEV__) { Object.freeze(emptyObject); } module.exports = emptyObject;PK �n[�ӽ�� � Set.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ module.exports = require("core-js/es/set");PK �n[ADE, , equalsIterable.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ 'use strict'; var enumerate = require("./enumerate"); /** * Checks if two iterables are equal. A custom areEqual function may be provided * as an optional third argument. */ function equalsIterable(one, two, areEqual) { if (one === two) { return true; } // We might be able to short circuit by using the size or length fields. var oneSize = maybeGetSize(one); var twoSize = maybeGetSize(two); if (oneSize != null && twoSize != null && oneSize !== twoSize) { return false; } // Otherwise use the iterators to check equality. Here we cannot use for-of // because we need to advance the iterators at the same time. var oneIterator = enumerate(one); var oneItem = oneIterator.next(); var twoIterator = enumerate(two); var twoItem = twoIterator.next(); var safeAreEqual = areEqual || referenceEquality; while (!(oneItem.done || twoItem.done)) { if (!safeAreEqual(oneItem.value, twoItem.value)) { return false; } oneItem = oneIterator.next(); twoItem = twoIterator.next(); } return oneItem.done === twoItem.done; } function maybeGetSize(o) { if (o == null) { return null; } if (typeof o.size === 'number') { return o.size; } if (typeof o.length === 'number') { return o.length; } return null; } function referenceEquality(one, two) { return one === two; } module.exports = equalsIterable;PK �n[��� � Set.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule Set */ module.exports = require("core-js/es/set");PK �n[S1r� enumerate.jsnu �Iw�� "use strict"; var _assign = require("object-assign"); /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ var KIND_KEYS = 'keys'; var KIND_VALUES = 'values'; var KIND_ENTRIES = 'entries'; /** * Specific Array iterators. */ var ArrayIterators = function () { var hasNative = hasNativeIterator(Array); var ArrayIterator; if (!hasNative) { ArrayIterator = /*#__PURE__*/ function () { // 22.1.5.1 CreateArrayIterator Abstract Operation function ArrayIterator(array, kind) { this._iteratedObject = array; this._kind = kind; this._nextIndex = 0; } // 22.1.5.2.1 %ArrayIteratorPrototype%.next() var _proto = ArrayIterator.prototype; _proto.next = function next() { if (this._iteratedObject == null) { return { value: undefined, done: true }; } var array = this._iteratedObject; var len = this._iteratedObject.length; var index = this._nextIndex; var kind = this._kind; if (index >= len) { this._iteratedObject = undefined; return { value: undefined, done: true }; } this._nextIndex = index + 1; if (kind === KIND_KEYS) { return { value: index, done: false }; } else if (kind === KIND_VALUES) { return { value: array[index], done: false }; } else if (kind === KIND_ENTRIES) { return { value: [index, array[index]], done: false }; } }; // 22.1.5.2.2 %ArrayIteratorPrototype%[@@iterator]() _proto[Symbol.iterator] = function () { return this; }; return ArrayIterator; }(); } return { keys: hasNative ? function (array) { return array.keys(); } : function (array) { return new ArrayIterator(array, KIND_KEYS); }, values: hasNative ? function (array) { return array.values(); } : function (array) { return new ArrayIterator(array, KIND_VALUES); }, entries: hasNative ? function (array) { return array.entries(); } : function (array) { return new ArrayIterator(array, KIND_ENTRIES); } }; }(); // ----------------------------------------------------------------- /** * Specific String iterators. */ var StringIterators = function () { var hasNative = hasNativeIterator(String); var StringIterator; if (!hasNative) { StringIterator = /*#__PURE__*/ function () { // 21.1.5.1 CreateStringIterator Abstract Operation function StringIterator(string) { this._iteratedString = string; this._nextIndex = 0; } // 21.1.5.2.1 %StringIteratorPrototype%.next() var _proto2 = StringIterator.prototype; _proto2.next = function next() { if (this._iteratedString == null) { return { value: undefined, done: true }; } var index = this._nextIndex; var s = this._iteratedString; var len = s.length; if (index >= len) { this._iteratedString = undefined; return { value: undefined, done: true }; } var ret; var first = s.charCodeAt(index); if (first < 0xD800 || first > 0xDBFF || index + 1 === len) { ret = s[index]; } else { var second = s.charCodeAt(index + 1); if (second < 0xDC00 || second > 0xDFFF) { ret = s[index]; } else { ret = s[index] + s[index + 1]; } } this._nextIndex = index + ret.length; return { value: ret, done: false }; }; // 21.1.5.2.2 %StringIteratorPrototype%[@@iterator]() _proto2[Symbol.iterator] = function () { return this; }; return StringIterator; }(); } return { keys: function keys() { throw TypeError("Strings default iterator doesn't implement keys."); }, values: hasNative ? function (string) { return string[Symbol.iterator](); } : function (string) { return new StringIterator(string); }, entries: function entries() { throw TypeError("Strings default iterator doesn't implement entries."); } }; }(); function hasNativeIterator(classObject) { return typeof classObject.prototype[Symbol.iterator] === 'function' && typeof classObject.prototype.values === 'function' && typeof classObject.prototype.keys === 'function' && typeof classObject.prototype.entries === 'function'; } // ----------------------------------------------------------------- /** * Generic object iterator. */ var ObjectIterator = /*#__PURE__*/ function () { function ObjectIterator(object, kind) { this._iteratedObject = object; this._kind = kind; this._keys = Object.keys(object); this._nextIndex = 0; } var _proto3 = ObjectIterator.prototype; _proto3.next = function next() { var len = this._keys.length; var index = this._nextIndex; var kind = this._kind; var key = this._keys[index]; if (index >= len) { this._iteratedObject = undefined; return { value: undefined, done: true }; } this._nextIndex = index + 1; if (kind === KIND_KEYS) { return { value: key, done: false }; } else if (kind === KIND_VALUES) { return { value: this._iteratedObject[key], done: false }; } else if (kind === KIND_ENTRIES) { return { value: [key, this._iteratedObject[key]], done: false }; } }; _proto3[Symbol.iterator] = function () { return this; }; return ObjectIterator; }(); /** * Generic object iterator, iterates over all own enumerable * properties. Used only if if no specific iterator is available, * and object don't implement iterator protocol. */ var GenericIterators = { keys: function keys(object) { return new ObjectIterator(object, KIND_KEYS); }, values: function values(object) { return new ObjectIterator(object, KIND_VALUES); }, entries: function entries(object) { return new ObjectIterator(object, KIND_ENTRIES); } }; // ----------------------------------------------------------------- /** * Main iterator function. Returns default iterator based * on the class of an instance. */ function enumerate(object, kind) { // First check specific iterators. if (typeof object === 'string') { return StringIterators[kind || KIND_VALUES](object); } else if (Array.isArray(object)) { return ArrayIterators[kind || KIND_VALUES](object); // Then see if an object implements own. } else if (object[Symbol.iterator]) { return object[Symbol.iterator](); // And fallback to generic with entries. } else { return GenericIterators[kind || KIND_ENTRIES](object); } } _assign(enumerate, { /** * Export constants */ KIND_KEYS: KIND_KEYS, KIND_VALUES: KIND_VALUES, KIND_ENTRIES: KIND_ENTRIES, /** * Convenient explicit iterators for special kinds. */ keys: function keys(object) { return enumerate(object, KIND_KEYS); }, values: function values(object) { return enumerate(object, KIND_VALUES); }, entries: function entries(object) { return enumerate(object, KIND_ENTRIES); }, generic: GenericIterators.entries }); module.exports = enumerate;PK �n[����� � SiteData.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ module.exports = { is_rtl: false };PK �n[�M�' ' concatAllArray.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule concatAllArray * @typechecks */ var push = Array.prototype.push; /** * Concats an array of arrays into a single flat array. * * @param {array} array * @return {array} */ function concatAllArray(array) { var ret = []; for (var ii = 0; ii < array.length; ii++) { var value = array[ii]; if (Array.isArray(value)) { push.apply(ret, value); } else if (value != null) { throw new TypeError('concatAllArray: All items in the array must be an array or null, ' + 'got "' + value + '" at index "' + ii + '" instead'); } } return ret; } module.exports = concatAllArray;PK �n[|�(� � SiteData.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule SiteData */ module.exports = { is_rtl: false };PK �n[;�ӛ� � enumerate.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule enumerate * */ const KIND_KEYS = 'keys'; const KIND_VALUES = 'values'; const KIND_ENTRIES = 'entries'; /** * Specific Array iterators. */ const ArrayIterators = function () { let hasNative = hasNativeIterator(Array); let ArrayIterator; if (!hasNative) { ArrayIterator = class ArrayIterator { // 22.1.5.1 CreateArrayIterator Abstract Operation constructor(array, kind) { this._iteratedObject = array; this._kind = kind; this._nextIndex = 0; } // 22.1.5.2.1 %ArrayIteratorPrototype%.next() next() { if (this._iteratedObject == null) { return { value: undefined, done: true }; } let array = this._iteratedObject; let len = this._iteratedObject.length; let index = this._nextIndex; let kind = this._kind; if (index >= len) { this._iteratedObject = undefined; return { value: undefined, done: true }; } this._nextIndex = index + 1; if (kind === KIND_KEYS) { return { value: index, done: false }; } else if (kind === KIND_VALUES) { return { value: array[index], done: false }; } else if (kind === KIND_ENTRIES) { return { value: [index, array[index]], done: false }; } } // 22.1.5.2.2 %ArrayIteratorPrototype%[@@iterator]() [Symbol.iterator]() { return this; } }; } return { keys: hasNative ? array => array.keys() : array => new ArrayIterator(array, KIND_KEYS), values: hasNative ? array => array.values() : array => new ArrayIterator(array, KIND_VALUES), entries: hasNative ? array => array.entries() : array => new ArrayIterator(array, KIND_ENTRIES) }; }(); // ----------------------------------------------------------------- /** * Specific String iterators. */ const StringIterators = function () { let hasNative = hasNativeIterator(String); let StringIterator; if (!hasNative) { StringIterator = class StringIterator { // 21.1.5.1 CreateStringIterator Abstract Operation constructor(string) { this._iteratedString = string; this._nextIndex = 0; } // 21.1.5.2.1 %StringIteratorPrototype%.next() next() { if (this._iteratedString == null) { return { value: undefined, done: true }; } let index = this._nextIndex; let s = this._iteratedString; let len = s.length; if (index >= len) { this._iteratedString = undefined; return { value: undefined, done: true }; } let ret; let first = s.charCodeAt(index); if (first < 0xD800 || first > 0xDBFF || index + 1 === len) { ret = s[index]; } else { let second = s.charCodeAt(index + 1); if (second < 0xDC00 || second > 0xDFFF) { ret = s[index]; } else { ret = s[index] + s[index + 1]; } } this._nextIndex = index + ret.length; return { value: ret, done: false }; } // 21.1.5.2.2 %StringIteratorPrototype%[@@iterator]() [Symbol.iterator]() { return this; } }; } return { keys() { throw TypeError(`Strings default iterator doesn't implement keys.`); }, values: hasNative ? string => string[Symbol.iterator]() : string => new StringIterator(string), entries() { throw TypeError(`Strings default iterator doesn't implement entries.`); } }; }(); function hasNativeIterator(classObject) { return typeof classObject.prototype[Symbol.iterator] === 'function' && typeof classObject.prototype.values === 'function' && typeof classObject.prototype.keys === 'function' && typeof classObject.prototype.entries === 'function'; } // ----------------------------------------------------------------- /** * Generic object iterator. */ class ObjectIterator { constructor(object, kind) { this._iteratedObject = object; this._kind = kind; this._keys = Object.keys(object); this._nextIndex = 0; } next() { let len = this._keys.length; let index = this._nextIndex; let kind = this._kind; let key = this._keys[index]; if (index >= len) { this._iteratedObject = undefined; return { value: undefined, done: true }; } this._nextIndex = index + 1; if (kind === KIND_KEYS) { return { value: key, done: false }; } else if (kind === KIND_VALUES) { return { value: this._iteratedObject[key], done: false }; } else if (kind === KIND_ENTRIES) { return { value: [key, this._iteratedObject[key]], done: false }; } } [Symbol.iterator]() { return this; } } /** * Generic object iterator, iterates over all own enumerable * properties. Used only if if no specific iterator is available, * and object don't implement iterator protocol. */ const GenericIterators = { keys(object) { return new ObjectIterator(object, KIND_KEYS); }, values(object) { return new ObjectIterator(object, KIND_VALUES); }, entries(object) { return new ObjectIterator(object, KIND_ENTRIES); } }; // ----------------------------------------------------------------- /** * Main iterator function. Returns default iterator based * on the class of an instance. */ function enumerate(object, kind) { // First check specific iterators. if (typeof object === 'string') { return StringIterators[kind || KIND_VALUES](object); } else if (Array.isArray(object)) { return ArrayIterators[kind || KIND_VALUES](object); // Then see if an object implements own. } else if (object[Symbol.iterator]) { return object[Symbol.iterator](); // And fallback to generic with entries. } else { return GenericIterators[kind || KIND_ENTRIES](object); } } Object.assign(enumerate, { /** * Export constants */ KIND_KEYS, KIND_VALUES, KIND_ENTRIES, /** * Convenient explicit iterators for special kinds. */ keys(object) { return enumerate(object, KIND_KEYS); }, values(object) { return enumerate(object, KIND_VALUES); }, entries(object) { return enumerate(object, KIND_ENTRIES); }, generic: GenericIterators.entries }); module.exports = enumerate;PK �n[��Fx� � Style.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var getStyleProperty = require("./getStyleProperty"); /** * @param {DOMNode} element [description] * @param {string} name Overflow style property name. * @return {boolean} True if the supplied ndoe is scrollable. */ function _isNodeScrollable(element, name) { var overflow = Style.get(element, name); return overflow === 'auto' || overflow === 'scroll'; } /** * Utilities for querying and mutating style properties. */ var Style = { /** * Gets the style property for the supplied node. This will return either the * computed style, if available, or the declared style. * * @param {DOMNode} node * @param {string} name Style property name. * @return {?string} Style property value. */ get: getStyleProperty, /** * Determines the nearest ancestor of a node that is scrollable. * * NOTE: This can be expensive if used repeatedly or on a node nested deeply. * * @param {?DOMNode} node Node from which to start searching. * @return {?DOMWindow|DOMElement} Scroll parent of the supplied node. */ getScrollParent: function getScrollParent(node) { if (!node) { return null; } var ownerDocument = node.ownerDocument; while (node && node !== ownerDocument.body) { if (_isNodeScrollable(node, 'overflow') || _isNodeScrollable(node, 'overflowY') || _isNodeScrollable(node, 'overflowX')) { return node; } node = node.parentNode; } return ownerDocument.defaultView || ownerDocument.parentWindow; } }; module.exports = Style;PK �n[� e� � containsNode.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ var isTextNode = require("./isTextNode"); /*eslint-disable no-bitwise */ /** * Checks if a given DOM node contains or is another DOM node. */ function containsNode(outerNode, innerNode) { if (!outerNode || !innerNode) { return false; } else if (outerNode === innerNode) { return true; } else if (isTextNode(outerNode)) { return false; } else if (isTextNode(innerNode)) { return containsNode(outerNode, innerNode.parentNode); } else if ('contains' in outerNode) { return outerNode.contains(innerNode); } else if (outerNode.compareDocumentPosition) { return !!(outerNode.compareDocumentPosition(innerNode) & 16); } else { return false; } } module.exports = containsNode;PK �n[e[ � � Style.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule Style * @typechecks */ var getStyleProperty = require("./getStyleProperty"); /** * @param {DOMNode} element [description] * @param {string} name Overflow style property name. * @return {boolean} True if the supplied ndoe is scrollable. */ function _isNodeScrollable(element, name) { var overflow = Style.get(element, name); return overflow === 'auto' || overflow === 'scroll'; } /** * Utilities for querying and mutating style properties. */ var Style = { /** * Gets the style property for the supplied node. This will return either the * computed style, if available, or the declared style. * * @param {DOMNode} node * @param {string} name Style property name. * @return {?string} Style property value. */ get: getStyleProperty, /** * Determines the nearest ancestor of a node that is scrollable. * * NOTE: This can be expensive if used repeatedly or on a node nested deeply. * * @param {?DOMNode} node Node from which to start searching. * @return {?DOMWindow|DOMElement} Scroll parent of the supplied node. */ getScrollParent: function (node) { if (!node) { return null; } var ownerDocument = node.ownerDocument; while (node && node !== ownerDocument.body) { if (_isNodeScrollable(node, 'overflow') || _isNodeScrollable(node, 'overflowY') || _isNodeScrollable(node, 'overflowX')) { return node; } node = node.parentNode; } return ownerDocument.defaultView || ownerDocument.parentWindow; } }; module.exports = Style;PK �n[�Dq� � countDistinct.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ 'use strict'; var Set = require("./Set"); var emptyFunction = require("./emptyFunction"); /** * Returns the count of distinct elements selected from an array. */ function countDistinct(iter, selector) { selector = selector || emptyFunction.thatReturnsArgument; var set = new Set(); var _iteratorNormalCompletion = true; var _didIteratorError = false; var _iteratorError = undefined; try { for (var _iterator = iter[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { var val = _step.value; set.add(selector(val)); } } catch (err) { _didIteratorError = true; _iteratorError = err; } finally { try { if (!_iteratorNormalCompletion && _iterator["return"] != null) { _iterator["return"](); } } finally { if (_didIteratorError) { throw _iteratorError; } } } return set.size; } module.exports = countDistinct;PK �n[�w�W8 8 TokenizeUtil.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks * @stub * */ 'use strict'; // \u00a1-\u00b1\u00b4-\u00b8\u00ba\u00bb\u00bf // is latin supplement punctuation except fractions and superscript // numbers // \u2010-\u2027\u2030-\u205e // is punctuation from the general punctuation block: // weird quotes, commas, bullets, dashes, etc. // \u30fb\u3001\u3002\u3008-\u3011\u3014-\u301f // is CJK punctuation // \uff1a-\uff1f\uff01-\uff0f\uff3b-\uff40\uff5b-\uff65 // is some full-width/half-width punctuation // \u2E2E\u061f\u066a-\u066c\u061b\u060c\u060d\uFD3e\uFD3F // is some Arabic punctuation marks // \u1801\u0964\u104a\u104b // is misc. other language punctuation marks var PUNCTUATION = '[.,+*?$|#{}()\'\\^\\-\\[\\]\\\\\\/!@%"~=<>_:;' + "\u30FB\u3001\u3002\u3008-\u3011\u3014-\u301F\uFF1A-\uFF1F\uFF01-\uFF0F" + "\uFF3B-\uFF40\uFF5B-\uFF65\u2E2E\u061F\u066A-\u066C\u061B\u060C\u060D" + "\uFD3E\uFD3F\u1801\u0964\u104A\u104B\u2010-\u2027\u2030-\u205E" + "\xA1-\xB1\xB4-\xB8\xBA\xBB\xBF]"; module.exports = { getPunctuation: function getPunctuation() { return PUNCTUATION; } };PK �n[�N�4� � URI.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule URI * @flow */ 'use strict'; class URI { _uri: string; constructor(uri: string) { this._uri = uri; } toString(): string { return this._uri; } } module.exports = URI;PK �n[ ��Dg g createArrayFromMixed.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var invariant = require("./invariant"); /** * Convert array-like objects to arrays. * * This API assumes the caller knows the contents of the data type. For less * well defined inputs use createArrayFromMixed. * * @param {object|function|filelist} obj * @return {array} */ function toArray(obj) { var length = obj.length; // Some browsers builtin objects can report typeof 'function' (e.g. NodeList // in old versions of Safari). !(!Array.isArray(obj) && (typeof obj === 'object' || typeof obj === 'function')) ? process.env.NODE_ENV !== "production" ? invariant(false, 'toArray: Array-like object expected') : invariant(false) : void 0; !(typeof length === 'number') ? process.env.NODE_ENV !== "production" ? invariant(false, 'toArray: Object needs a length property') : invariant(false) : void 0; !(length === 0 || length - 1 in obj) ? process.env.NODE_ENV !== "production" ? invariant(false, 'toArray: Object should have keys for indices') : invariant(false) : void 0; !(typeof obj.callee !== 'function') ? process.env.NODE_ENV !== "production" ? invariant(false, 'toArray: Object can\'t be `arguments`. Use rest params ' + '(function(...args) {}) or Array.from() instead.') : invariant(false) : void 0; // Old IE doesn't give collections access to hasOwnProperty. Assume inputs // without method will throw during the slice call and skip straight to the // fallback. if (obj.hasOwnProperty) { try { return Array.prototype.slice.call(obj); } catch (e) {// IE < 9 does not support Array#slice on collections objects } } // Fall back to copying key by key. This assumes all keys have a value, // so will not preserve sparsely populated inputs. var ret = Array(length); for (var ii = 0; ii < length; ii++) { ret[ii] = obj[ii]; } return ret; } /** * Perform a heuristic test to determine if an object is "array-like". * * A monk asked Joshu, a Zen master, "Has a dog Buddha nature?" * Joshu replied: "Mu." * * This function determines if its argument has "array nature": it returns * true if the argument is an actual array, an `arguments' object, or an * HTMLCollection (e.g. node.childNodes or node.getElementsByTagName()). * * It will return false for other array-like objects like Filelist. * * @param {*} obj * @return {boolean} */ function hasArrayNature(obj) { return (// not null/false !!obj && ( // arrays are objects, NodeLists are functions in Safari typeof obj == 'object' || typeof obj == 'function') && // quacks like an array 'length' in obj && // not window !('setInterval' in obj) && // no DOM node should be considered an array-like // a 'select' element has 'length' and 'item' properties on IE8 typeof obj.nodeType != 'number' && ( // a real array Array.isArray(obj) || // arguments 'callee' in obj || // HTMLCollection/NodeList 'item' in obj) ); } /** * Ensure that the argument is an array by wrapping it in an array if it is not. * Creates a copy of the argument if it is already an array. * * This is mostly useful idiomatically: * * var createArrayFromMixed = require('createArrayFromMixed'); * * function takesOneOrMoreThings(things) { * things = createArrayFromMixed(things); * ... * } * * This allows you to treat `things' as an array, but accept scalars in the API. * * If you need to convert an array-like object, like `arguments`, into an array * use toArray instead. * * @param {*} obj * @return {array} */ function createArrayFromMixed(obj) { if (!hasArrayNature(obj)) { return [obj]; } else if (Array.isArray(obj)) { return obj.slice(); } else { return toArray(obj); } } module.exports = createArrayFromMixed;PK �n[Y��5 �5 UnicodeBidi.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks * */ /** * Basic (stateless) API for text direction detection * * Part of our implementation of Unicode Bidirectional Algorithm (UBA) * Unicode Standard Annex #9 (UAX9) * http://www.unicode.org/reports/tr9/ */ 'use strict'; var UnicodeBidiDirection = require("./UnicodeBidiDirection"); var invariant = require("./invariant"); /** * RegExp ranges of characters with a *Strong* Bidi_Class value. * * Data is based on DerivedBidiClass.txt in UCD version 7.0.0. * * NOTE: For performance reasons, we only support Unicode's * Basic Multilingual Plane (BMP) for now. */ var RANGE_BY_BIDI_TYPE = { L: "A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u01BA\u01BB" + "\u01BC-\u01BF\u01C0-\u01C3\u01C4-\u0293\u0294\u0295-\u02AF\u02B0-\u02B8" + "\u02BB-\u02C1\u02D0-\u02D1\u02E0-\u02E4\u02EE\u0370-\u0373\u0376-\u0377" + "\u037A\u037B-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1" + "\u03A3-\u03F5\u03F7-\u0481\u0482\u048A-\u052F\u0531-\u0556\u0559" + "\u055A-\u055F\u0561-\u0587\u0589\u0903\u0904-\u0939\u093B\u093D" + "\u093E-\u0940\u0949-\u094C\u094E-\u094F\u0950\u0958-\u0961\u0964-\u0965" + "\u0966-\u096F\u0970\u0971\u0972-\u0980\u0982-\u0983\u0985-\u098C" + "\u098F-\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD" + "\u09BE-\u09C0\u09C7-\u09C8\u09CB-\u09CC\u09CE\u09D7\u09DC-\u09DD" + "\u09DF-\u09E1\u09E6-\u09EF\u09F0-\u09F1\u09F4-\u09F9\u09FA\u0A03" + "\u0A05-\u0A0A\u0A0F-\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32-\u0A33" + "\u0A35-\u0A36\u0A38-\u0A39\u0A3E-\u0A40\u0A59-\u0A5C\u0A5E\u0A66-\u0A6F" + "\u0A72-\u0A74\u0A83\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0" + "\u0AB2-\u0AB3\u0AB5-\u0AB9\u0ABD\u0ABE-\u0AC0\u0AC9\u0ACB-\u0ACC\u0AD0" + "\u0AE0-\u0AE1\u0AE6-\u0AEF\u0AF0\u0B02-\u0B03\u0B05-\u0B0C\u0B0F-\u0B10" + "\u0B13-\u0B28\u0B2A-\u0B30\u0B32-\u0B33\u0B35-\u0B39\u0B3D\u0B3E\u0B40" + "\u0B47-\u0B48\u0B4B-\u0B4C\u0B57\u0B5C-\u0B5D\u0B5F-\u0B61\u0B66-\u0B6F" + "\u0B70\u0B71\u0B72-\u0B77\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95" + "\u0B99-\u0B9A\u0B9C\u0B9E-\u0B9F\u0BA3-\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9" + "\u0BBE-\u0BBF\u0BC1-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCC\u0BD0\u0BD7" + "\u0BE6-\u0BEF\u0BF0-\u0BF2\u0C01-\u0C03\u0C05-\u0C0C\u0C0E-\u0C10" + "\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C41-\u0C44\u0C58-\u0C59\u0C60-\u0C61" + "\u0C66-\u0C6F\u0C7F\u0C82-\u0C83\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8" + "\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CBE\u0CBF\u0CC0-\u0CC4\u0CC6" + "\u0CC7-\u0CC8\u0CCA-\u0CCB\u0CD5-\u0CD6\u0CDE\u0CE0-\u0CE1\u0CE6-\u0CEF" + "\u0CF1-\u0CF2\u0D02-\u0D03\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D" + "\u0D3E-\u0D40\u0D46-\u0D48\u0D4A-\u0D4C\u0D4E\u0D57\u0D60-\u0D61" + "\u0D66-\u0D6F\u0D70-\u0D75\u0D79\u0D7A-\u0D7F\u0D82-\u0D83\u0D85-\u0D96" + "\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0DCF-\u0DD1\u0DD8-\u0DDF" + "\u0DE6-\u0DEF\u0DF2-\u0DF3\u0DF4\u0E01-\u0E30\u0E32-\u0E33\u0E40-\u0E45" + "\u0E46\u0E4F\u0E50-\u0E59\u0E5A-\u0E5B\u0E81-\u0E82\u0E84\u0E87-\u0E88" + "\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7" + "\u0EAA-\u0EAB\u0EAD-\u0EB0\u0EB2-\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6" + "\u0ED0-\u0ED9\u0EDC-\u0EDF\u0F00\u0F01-\u0F03\u0F04-\u0F12\u0F13\u0F14" + "\u0F15-\u0F17\u0F1A-\u0F1F\u0F20-\u0F29\u0F2A-\u0F33\u0F34\u0F36\u0F38" + "\u0F3E-\u0F3F\u0F40-\u0F47\u0F49-\u0F6C\u0F7F\u0F85\u0F88-\u0F8C" + "\u0FBE-\u0FC5\u0FC7-\u0FCC\u0FCE-\u0FCF\u0FD0-\u0FD4\u0FD5-\u0FD8" + "\u0FD9-\u0FDA\u1000-\u102A\u102B-\u102C\u1031\u1038\u103B-\u103C\u103F" + "\u1040-\u1049\u104A-\u104F\u1050-\u1055\u1056-\u1057\u105A-\u105D\u1061" + "\u1062-\u1064\u1065-\u1066\u1067-\u106D\u106E-\u1070\u1075-\u1081" + "\u1083-\u1084\u1087-\u108C\u108E\u108F\u1090-\u1099\u109A-\u109C" + "\u109E-\u109F\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FB\u10FC" + "\u10FD-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288" + "\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5" + "\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1360-\u1368" + "\u1369-\u137C\u1380-\u138F\u13A0-\u13F4\u1401-\u166C\u166D-\u166E" + "\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EB-\u16ED\u16EE-\u16F0" + "\u16F1-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1735-\u1736" + "\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17B6\u17BE-\u17C5" + "\u17C7-\u17C8\u17D4-\u17D6\u17D7\u17D8-\u17DA\u17DC\u17E0-\u17E9" + "\u1810-\u1819\u1820-\u1842\u1843\u1844-\u1877\u1880-\u18A8\u18AA" + "\u18B0-\u18F5\u1900-\u191E\u1923-\u1926\u1929-\u192B\u1930-\u1931" + "\u1933-\u1938\u1946-\u194F\u1950-\u196D\u1970-\u1974\u1980-\u19AB" + "\u19B0-\u19C0\u19C1-\u19C7\u19C8-\u19C9\u19D0-\u19D9\u19DA\u1A00-\u1A16" + "\u1A19-\u1A1A\u1A1E-\u1A1F\u1A20-\u1A54\u1A55\u1A57\u1A61\u1A63-\u1A64" + "\u1A6D-\u1A72\u1A80-\u1A89\u1A90-\u1A99\u1AA0-\u1AA6\u1AA7\u1AA8-\u1AAD" + "\u1B04\u1B05-\u1B33\u1B35\u1B3B\u1B3D-\u1B41\u1B43-\u1B44\u1B45-\u1B4B" + "\u1B50-\u1B59\u1B5A-\u1B60\u1B61-\u1B6A\u1B74-\u1B7C\u1B82\u1B83-\u1BA0" + "\u1BA1\u1BA6-\u1BA7\u1BAA\u1BAE-\u1BAF\u1BB0-\u1BB9\u1BBA-\u1BE5\u1BE7" + "\u1BEA-\u1BEC\u1BEE\u1BF2-\u1BF3\u1BFC-\u1BFF\u1C00-\u1C23\u1C24-\u1C2B" + "\u1C34-\u1C35\u1C3B-\u1C3F\u1C40-\u1C49\u1C4D-\u1C4F\u1C50-\u1C59" + "\u1C5A-\u1C77\u1C78-\u1C7D\u1C7E-\u1C7F\u1CC0-\u1CC7\u1CD3\u1CE1" + "\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF2-\u1CF3\u1CF5-\u1CF6\u1D00-\u1D2B" + "\u1D2C-\u1D6A\u1D6B-\u1D77\u1D78\u1D79-\u1D9A\u1D9B-\u1DBF\u1E00-\u1F15" + "\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D" + "\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC" + "\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u200E" + "\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D" + "\u2124\u2126\u2128\u212A-\u212D\u212F-\u2134\u2135-\u2138\u2139" + "\u213C-\u213F\u2145-\u2149\u214E\u214F\u2160-\u2182\u2183-\u2184" + "\u2185-\u2188\u2336-\u237A\u2395\u249C-\u24E9\u26AC\u2800-\u28FF" + "\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2C7B\u2C7C-\u2C7D\u2C7E-\u2CE4" + "\u2CEB-\u2CEE\u2CF2-\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F" + "\u2D70\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE" + "\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u3005\u3006\u3007" + "\u3021-\u3029\u302E-\u302F\u3031-\u3035\u3038-\u303A\u303B\u303C" + "\u3041-\u3096\u309D-\u309E\u309F\u30A1-\u30FA\u30FC-\u30FE\u30FF" + "\u3105-\u312D\u3131-\u318E\u3190-\u3191\u3192-\u3195\u3196-\u319F" + "\u31A0-\u31BA\u31F0-\u31FF\u3200-\u321C\u3220-\u3229\u322A-\u3247" + "\u3248-\u324F\u3260-\u327B\u327F\u3280-\u3289\u328A-\u32B0\u32C0-\u32CB" + "\u32D0-\u32FE\u3300-\u3376\u337B-\u33DD\u33E0-\u33FE\u3400-\u4DB5" + "\u4E00-\u9FCC\uA000-\uA014\uA015\uA016-\uA48C\uA4D0-\uA4F7\uA4F8-\uA4FD" + "\uA4FE-\uA4FF\uA500-\uA60B\uA60C\uA610-\uA61F\uA620-\uA629\uA62A-\uA62B" + "\uA640-\uA66D\uA66E\uA680-\uA69B\uA69C-\uA69D\uA6A0-\uA6E5\uA6E6-\uA6EF" + "\uA6F2-\uA6F7\uA722-\uA76F\uA770\uA771-\uA787\uA789-\uA78A\uA78B-\uA78E" + "\uA790-\uA7AD\uA7B0-\uA7B1\uA7F7\uA7F8-\uA7F9\uA7FA\uA7FB-\uA801" + "\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA823-\uA824\uA827\uA830-\uA835" + "\uA836-\uA837\uA840-\uA873\uA880-\uA881\uA882-\uA8B3\uA8B4-\uA8C3" + "\uA8CE-\uA8CF\uA8D0-\uA8D9\uA8F2-\uA8F7\uA8F8-\uA8FA\uA8FB\uA900-\uA909" + "\uA90A-\uA925\uA92E-\uA92F\uA930-\uA946\uA952-\uA953\uA95F\uA960-\uA97C" + "\uA983\uA984-\uA9B2\uA9B4-\uA9B5\uA9BA-\uA9BB\uA9BD-\uA9C0\uA9C1-\uA9CD" + "\uA9CF\uA9D0-\uA9D9\uA9DE-\uA9DF\uA9E0-\uA9E4\uA9E6\uA9E7-\uA9EF" + "\uA9F0-\uA9F9\uA9FA-\uA9FE\uAA00-\uAA28\uAA2F-\uAA30\uAA33-\uAA34" + "\uAA40-\uAA42\uAA44-\uAA4B\uAA4D\uAA50-\uAA59\uAA5C-\uAA5F\uAA60-\uAA6F" + "\uAA70\uAA71-\uAA76\uAA77-\uAA79\uAA7A\uAA7B\uAA7D\uAA7E-\uAAAF\uAAB1" + "\uAAB5-\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADC\uAADD\uAADE-\uAADF" + "\uAAE0-\uAAEA\uAAEB\uAAEE-\uAAEF\uAAF0-\uAAF1\uAAF2\uAAF3-\uAAF4\uAAF5" + "\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E" + "\uAB30-\uAB5A\uAB5B\uAB5C-\uAB5F\uAB64-\uAB65\uABC0-\uABE2\uABE3-\uABE4" + "\uABE6-\uABE7\uABE9-\uABEA\uABEB\uABEC\uABF0-\uABF9\uAC00-\uD7A3" + "\uD7B0-\uD7C6\uD7CB-\uD7FB\uE000-\uF8FF\uF900-\uFA6D\uFA70-\uFAD9" + "\uFB00-\uFB06\uFB13-\uFB17\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFF6F\uFF70" + "\uFF71-\uFF9D\uFF9E-\uFF9F\uFFA0-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF" + "\uFFD2-\uFFD7\uFFDA-\uFFDC", R: "\u0590\u05BE\u05C0\u05C3\u05C6\u05C8-\u05CF\u05D0-\u05EA\u05EB-\u05EF" + "\u05F0-\u05F2\u05F3-\u05F4\u05F5-\u05FF\u07C0-\u07C9\u07CA-\u07EA" + "\u07F4-\u07F5\u07FA\u07FB-\u07FF\u0800-\u0815\u081A\u0824\u0828" + "\u082E-\u082F\u0830-\u083E\u083F\u0840-\u0858\u085C-\u085D\u085E" + "\u085F-\u089F\u200F\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB37\uFB38-\uFB3C" + "\uFB3D\uFB3E\uFB3F\uFB40-\uFB41\uFB42\uFB43-\uFB44\uFB45\uFB46-\uFB4F", AL: "\u0608\u060B\u060D\u061B\u061C\u061D\u061E-\u061F\u0620-\u063F\u0640" + "\u0641-\u064A\u066D\u066E-\u066F\u0671-\u06D3\u06D4\u06D5\u06E5-\u06E6" + "\u06EE-\u06EF\u06FA-\u06FC\u06FD-\u06FE\u06FF\u0700-\u070D\u070E\u070F" + "\u0710\u0712-\u072F\u074B-\u074C\u074D-\u07A5\u07B1\u07B2-\u07BF" + "\u08A0-\u08B2\u08B3-\u08E3\uFB50-\uFBB1\uFBB2-\uFBC1\uFBC2-\uFBD2" + "\uFBD3-\uFD3D\uFD40-\uFD4F\uFD50-\uFD8F\uFD90-\uFD91\uFD92-\uFDC7" + "\uFDC8-\uFDCF\uFDF0-\uFDFB\uFDFC\uFDFE-\uFDFF\uFE70-\uFE74\uFE75" + "\uFE76-\uFEFC\uFEFD-\uFEFE" }; var REGEX_STRONG = new RegExp('[' + RANGE_BY_BIDI_TYPE.L + RANGE_BY_BIDI_TYPE.R + RANGE_BY_BIDI_TYPE.AL + ']'); var REGEX_RTL = new RegExp('[' + RANGE_BY_BIDI_TYPE.R + RANGE_BY_BIDI_TYPE.AL + ']'); /** * Returns the first strong character (has Bidi_Class value of L, R, or AL). * * @param str A text block; e.g. paragraph, table cell, tag * @return A character with strong bidi direction, or null if not found */ function firstStrongChar(str) { var match = REGEX_STRONG.exec(str); return match == null ? null : match[0]; } /** * Returns the direction of a block of text, based on the direction of its * first strong character (has Bidi_Class value of L, R, or AL). * * @param str A text block; e.g. paragraph, table cell, tag * @return The resolved direction */ function firstStrongCharDir(str) { var strongChar = firstStrongChar(str); if (strongChar == null) { return UnicodeBidiDirection.NEUTRAL; } return REGEX_RTL.exec(strongChar) ? UnicodeBidiDirection.RTL : UnicodeBidiDirection.LTR; } /** * Returns the direction of a block of text, based on the direction of its * first strong character (has Bidi_Class value of L, R, or AL), or a fallback * direction, if no strong character is found. * * This function is supposed to be used in respect to Higher-Level Protocol * rule HL1. (http://www.unicode.org/reports/tr9/#HL1) * * @param str A text block; e.g. paragraph, table cell, tag * @param fallback Fallback direction, used if no strong direction detected * for the block (default = NEUTRAL) * @return The resolved direction */ function resolveBlockDir(str, fallback) { fallback = fallback || UnicodeBidiDirection.NEUTRAL; if (!str.length) { return fallback; } var blockDir = firstStrongCharDir(str); return blockDir === UnicodeBidiDirection.NEUTRAL ? fallback : blockDir; } /** * Returns the direction of a block of text, based on the direction of its * first strong character (has Bidi_Class value of L, R, or AL), or a fallback * direction, if no strong character is found. * * NOTE: This function is similar to resolveBlockDir(), but uses the global * direction as the fallback, so it *always* returns a Strong direction, * making it useful for integration in places that you need to make the final * decision, like setting some CSS class. * * This function is supposed to be used in respect to Higher-Level Protocol * rule HL1. (http://www.unicode.org/reports/tr9/#HL1) * * @param str A text block; e.g. paragraph, table cell * @param strongFallback Fallback direction, used if no strong direction * detected for the block (default = global direction) * @return The resolved Strong direction */ function getDirection(str, strongFallback) { if (!strongFallback) { strongFallback = UnicodeBidiDirection.getGlobalDir(); } !UnicodeBidiDirection.isStrong(strongFallback) ? process.env.NODE_ENV !== "production" ? invariant(false, 'Fallback direction must be a strong direction') : invariant(false) : void 0; return resolveBlockDir(str, strongFallback); } /** * Returns true if getDirection(arguments...) returns LTR. * * @param str A text block; e.g. paragraph, table cell * @param strongFallback Fallback direction, used if no strong direction * detected for the block (default = global direction) * @return True if the resolved direction is LTR */ function isDirectionLTR(str, strongFallback) { return getDirection(str, strongFallback) === UnicodeBidiDirection.LTR; } /** * Returns true if getDirection(arguments...) returns RTL. * * @param str A text block; e.g. paragraph, table cell * @param strongFallback Fallback direction, used if no strong direction * detected for the block (default = global direction) * @return True if the resolved direction is RTL */ function isDirectionRTL(str, strongFallback) { return getDirection(str, strongFallback) === UnicodeBidiDirection.RTL; } var UnicodeBidi = { firstStrongChar: firstStrongChar, firstStrongCharDir: firstStrongCharDir, resolveBlockDir: resolveBlockDir, getDirection: getDirection, isDirectionLTR: isDirectionLTR, isDirectionRTL: isDirectionRTL }; module.exports = UnicodeBidi;PK �n[�/� � countDistinct.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule countDistinct * @flow */ 'use strict'; var Set = require("./Set"); var emptyFunction = require("./emptyFunction"); /** * Returns the count of distinct elements selected from an array. */ function countDistinct<T1, T2>(iter: Iterable<T1>, selector: (item: T1) => T2): number { selector = selector || emptyFunction.thatReturnsArgument; var set = new Set(); for (var val of iter) { set.add(selector(val)); } return set.size; } module.exports = countDistinct;PK �n[�iO�6 �6 UnicodeBidi.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule UnicodeBidi * @typechecks * @flow */ /** * Basic (stateless) API for text direction detection * * Part of our implementation of Unicode Bidirectional Algorithm (UBA) * Unicode Standard Annex #9 (UAX9) * http://www.unicode.org/reports/tr9/ */ 'use strict'; const UnicodeBidiDirection = require("./UnicodeBidiDirection"); const invariant = require("./invariant"); import type { BidiDirection } from "./UnicodeBidiDirection"; /** * RegExp ranges of characters with a *Strong* Bidi_Class value. * * Data is based on DerivedBidiClass.txt in UCD version 7.0.0. * * NOTE: For performance reasons, we only support Unicode's * Basic Multilingual Plane (BMP) for now. */ const RANGE_BY_BIDI_TYPE = { L: 'A-Za-z\u00AA\u00B5\u00BA\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u01BA\u01BB' + '\u01BC-\u01BF\u01C0-\u01C3\u01C4-\u0293\u0294\u0295-\u02AF\u02B0-\u02B8' + '\u02BB-\u02C1\u02D0-\u02D1\u02E0-\u02E4\u02EE\u0370-\u0373\u0376-\u0377' + '\u037A\u037B-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1' + '\u03A3-\u03F5\u03F7-\u0481\u0482\u048A-\u052F\u0531-\u0556\u0559' + '\u055A-\u055F\u0561-\u0587\u0589\u0903\u0904-\u0939\u093B\u093D' + '\u093E-\u0940\u0949-\u094C\u094E-\u094F\u0950\u0958-\u0961\u0964-\u0965' + '\u0966-\u096F\u0970\u0971\u0972-\u0980\u0982-\u0983\u0985-\u098C' + '\u098F-\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD' + '\u09BE-\u09C0\u09C7-\u09C8\u09CB-\u09CC\u09CE\u09D7\u09DC-\u09DD' + '\u09DF-\u09E1\u09E6-\u09EF\u09F0-\u09F1\u09F4-\u09F9\u09FA\u0A03' + '\u0A05-\u0A0A\u0A0F-\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32-\u0A33' + '\u0A35-\u0A36\u0A38-\u0A39\u0A3E-\u0A40\u0A59-\u0A5C\u0A5E\u0A66-\u0A6F' + '\u0A72-\u0A74\u0A83\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0' + '\u0AB2-\u0AB3\u0AB5-\u0AB9\u0ABD\u0ABE-\u0AC0\u0AC9\u0ACB-\u0ACC\u0AD0' + '\u0AE0-\u0AE1\u0AE6-\u0AEF\u0AF0\u0B02-\u0B03\u0B05-\u0B0C\u0B0F-\u0B10' + '\u0B13-\u0B28\u0B2A-\u0B30\u0B32-\u0B33\u0B35-\u0B39\u0B3D\u0B3E\u0B40' + '\u0B47-\u0B48\u0B4B-\u0B4C\u0B57\u0B5C-\u0B5D\u0B5F-\u0B61\u0B66-\u0B6F' + '\u0B70\u0B71\u0B72-\u0B77\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95' + '\u0B99-\u0B9A\u0B9C\u0B9E-\u0B9F\u0BA3-\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9' + '\u0BBE-\u0BBF\u0BC1-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCC\u0BD0\u0BD7' + '\u0BE6-\u0BEF\u0BF0-\u0BF2\u0C01-\u0C03\u0C05-\u0C0C\u0C0E-\u0C10' + '\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C41-\u0C44\u0C58-\u0C59\u0C60-\u0C61' + '\u0C66-\u0C6F\u0C7F\u0C82-\u0C83\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8' + '\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CBE\u0CBF\u0CC0-\u0CC4\u0CC6' + '\u0CC7-\u0CC8\u0CCA-\u0CCB\u0CD5-\u0CD6\u0CDE\u0CE0-\u0CE1\u0CE6-\u0CEF' + '\u0CF1-\u0CF2\u0D02-\u0D03\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D' + '\u0D3E-\u0D40\u0D46-\u0D48\u0D4A-\u0D4C\u0D4E\u0D57\u0D60-\u0D61' + '\u0D66-\u0D6F\u0D70-\u0D75\u0D79\u0D7A-\u0D7F\u0D82-\u0D83\u0D85-\u0D96' + '\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0DCF-\u0DD1\u0DD8-\u0DDF' + '\u0DE6-\u0DEF\u0DF2-\u0DF3\u0DF4\u0E01-\u0E30\u0E32-\u0E33\u0E40-\u0E45' + '\u0E46\u0E4F\u0E50-\u0E59\u0E5A-\u0E5B\u0E81-\u0E82\u0E84\u0E87-\u0E88' + '\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7' + '\u0EAA-\u0EAB\u0EAD-\u0EB0\u0EB2-\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6' + '\u0ED0-\u0ED9\u0EDC-\u0EDF\u0F00\u0F01-\u0F03\u0F04-\u0F12\u0F13\u0F14' + '\u0F15-\u0F17\u0F1A-\u0F1F\u0F20-\u0F29\u0F2A-\u0F33\u0F34\u0F36\u0F38' + '\u0F3E-\u0F3F\u0F40-\u0F47\u0F49-\u0F6C\u0F7F\u0F85\u0F88-\u0F8C' + '\u0FBE-\u0FC5\u0FC7-\u0FCC\u0FCE-\u0FCF\u0FD0-\u0FD4\u0FD5-\u0FD8' + '\u0FD9-\u0FDA\u1000-\u102A\u102B-\u102C\u1031\u1038\u103B-\u103C\u103F' + '\u1040-\u1049\u104A-\u104F\u1050-\u1055\u1056-\u1057\u105A-\u105D\u1061' + '\u1062-\u1064\u1065-\u1066\u1067-\u106D\u106E-\u1070\u1075-\u1081' + '\u1083-\u1084\u1087-\u108C\u108E\u108F\u1090-\u1099\u109A-\u109C' + '\u109E-\u109F\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FB\u10FC' + '\u10FD-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288' + '\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5' + '\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1360-\u1368' + '\u1369-\u137C\u1380-\u138F\u13A0-\u13F4\u1401-\u166C\u166D-\u166E' + '\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EB-\u16ED\u16EE-\u16F0' + '\u16F1-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1735-\u1736' + '\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17B6\u17BE-\u17C5' + '\u17C7-\u17C8\u17D4-\u17D6\u17D7\u17D8-\u17DA\u17DC\u17E0-\u17E9' + '\u1810-\u1819\u1820-\u1842\u1843\u1844-\u1877\u1880-\u18A8\u18AA' + '\u18B0-\u18F5\u1900-\u191E\u1923-\u1926\u1929-\u192B\u1930-\u1931' + '\u1933-\u1938\u1946-\u194F\u1950-\u196D\u1970-\u1974\u1980-\u19AB' + '\u19B0-\u19C0\u19C1-\u19C7\u19C8-\u19C9\u19D0-\u19D9\u19DA\u1A00-\u1A16' + '\u1A19-\u1A1A\u1A1E-\u1A1F\u1A20-\u1A54\u1A55\u1A57\u1A61\u1A63-\u1A64' + '\u1A6D-\u1A72\u1A80-\u1A89\u1A90-\u1A99\u1AA0-\u1AA6\u1AA7\u1AA8-\u1AAD' + '\u1B04\u1B05-\u1B33\u1B35\u1B3B\u1B3D-\u1B41\u1B43-\u1B44\u1B45-\u1B4B' + '\u1B50-\u1B59\u1B5A-\u1B60\u1B61-\u1B6A\u1B74-\u1B7C\u1B82\u1B83-\u1BA0' + '\u1BA1\u1BA6-\u1BA7\u1BAA\u1BAE-\u1BAF\u1BB0-\u1BB9\u1BBA-\u1BE5\u1BE7' + '\u1BEA-\u1BEC\u1BEE\u1BF2-\u1BF3\u1BFC-\u1BFF\u1C00-\u1C23\u1C24-\u1C2B' + '\u1C34-\u1C35\u1C3B-\u1C3F\u1C40-\u1C49\u1C4D-\u1C4F\u1C50-\u1C59' + '\u1C5A-\u1C77\u1C78-\u1C7D\u1C7E-\u1C7F\u1CC0-\u1CC7\u1CD3\u1CE1' + '\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF2-\u1CF3\u1CF5-\u1CF6\u1D00-\u1D2B' + '\u1D2C-\u1D6A\u1D6B-\u1D77\u1D78\u1D79-\u1D9A\u1D9B-\u1DBF\u1E00-\u1F15' + '\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D' + '\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC' + '\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u200E' + '\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D' + '\u2124\u2126\u2128\u212A-\u212D\u212F-\u2134\u2135-\u2138\u2139' + '\u213C-\u213F\u2145-\u2149\u214E\u214F\u2160-\u2182\u2183-\u2184' + '\u2185-\u2188\u2336-\u237A\u2395\u249C-\u24E9\u26AC\u2800-\u28FF' + '\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2C7B\u2C7C-\u2C7D\u2C7E-\u2CE4' + '\u2CEB-\u2CEE\u2CF2-\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F' + '\u2D70\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE' + '\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u3005\u3006\u3007' + '\u3021-\u3029\u302E-\u302F\u3031-\u3035\u3038-\u303A\u303B\u303C' + '\u3041-\u3096\u309D-\u309E\u309F\u30A1-\u30FA\u30FC-\u30FE\u30FF' + '\u3105-\u312D\u3131-\u318E\u3190-\u3191\u3192-\u3195\u3196-\u319F' + '\u31A0-\u31BA\u31F0-\u31FF\u3200-\u321C\u3220-\u3229\u322A-\u3247' + '\u3248-\u324F\u3260-\u327B\u327F\u3280-\u3289\u328A-\u32B0\u32C0-\u32CB' + '\u32D0-\u32FE\u3300-\u3376\u337B-\u33DD\u33E0-\u33FE\u3400-\u4DB5' + '\u4E00-\u9FCC\uA000-\uA014\uA015\uA016-\uA48C\uA4D0-\uA4F7\uA4F8-\uA4FD' + '\uA4FE-\uA4FF\uA500-\uA60B\uA60C\uA610-\uA61F\uA620-\uA629\uA62A-\uA62B' + '\uA640-\uA66D\uA66E\uA680-\uA69B\uA69C-\uA69D\uA6A0-\uA6E5\uA6E6-\uA6EF' + '\uA6F2-\uA6F7\uA722-\uA76F\uA770\uA771-\uA787\uA789-\uA78A\uA78B-\uA78E' + '\uA790-\uA7AD\uA7B0-\uA7B1\uA7F7\uA7F8-\uA7F9\uA7FA\uA7FB-\uA801' + '\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA823-\uA824\uA827\uA830-\uA835' + '\uA836-\uA837\uA840-\uA873\uA880-\uA881\uA882-\uA8B3\uA8B4-\uA8C3' + '\uA8CE-\uA8CF\uA8D0-\uA8D9\uA8F2-\uA8F7\uA8F8-\uA8FA\uA8FB\uA900-\uA909' + '\uA90A-\uA925\uA92E-\uA92F\uA930-\uA946\uA952-\uA953\uA95F\uA960-\uA97C' + '\uA983\uA984-\uA9B2\uA9B4-\uA9B5\uA9BA-\uA9BB\uA9BD-\uA9C0\uA9C1-\uA9CD' + '\uA9CF\uA9D0-\uA9D9\uA9DE-\uA9DF\uA9E0-\uA9E4\uA9E6\uA9E7-\uA9EF' + '\uA9F0-\uA9F9\uA9FA-\uA9FE\uAA00-\uAA28\uAA2F-\uAA30\uAA33-\uAA34' + '\uAA40-\uAA42\uAA44-\uAA4B\uAA4D\uAA50-\uAA59\uAA5C-\uAA5F\uAA60-\uAA6F' + '\uAA70\uAA71-\uAA76\uAA77-\uAA79\uAA7A\uAA7B\uAA7D\uAA7E-\uAAAF\uAAB1' + '\uAAB5-\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADC\uAADD\uAADE-\uAADF' + '\uAAE0-\uAAEA\uAAEB\uAAEE-\uAAEF\uAAF0-\uAAF1\uAAF2\uAAF3-\uAAF4\uAAF5' + '\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E' + '\uAB30-\uAB5A\uAB5B\uAB5C-\uAB5F\uAB64-\uAB65\uABC0-\uABE2\uABE3-\uABE4' + '\uABE6-\uABE7\uABE9-\uABEA\uABEB\uABEC\uABF0-\uABF9\uAC00-\uD7A3' + '\uD7B0-\uD7C6\uD7CB-\uD7FB\uE000-\uF8FF\uF900-\uFA6D\uFA70-\uFAD9' + '\uFB00-\uFB06\uFB13-\uFB17\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFF6F\uFF70' + '\uFF71-\uFF9D\uFF9E-\uFF9F\uFFA0-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF' + '\uFFD2-\uFFD7\uFFDA-\uFFDC', R: '\u0590\u05BE\u05C0\u05C3\u05C6\u05C8-\u05CF\u05D0-\u05EA\u05EB-\u05EF' + '\u05F0-\u05F2\u05F3-\u05F4\u05F5-\u05FF\u07C0-\u07C9\u07CA-\u07EA' + '\u07F4-\u07F5\u07FA\u07FB-\u07FF\u0800-\u0815\u081A\u0824\u0828' + '\u082E-\u082F\u0830-\u083E\u083F\u0840-\u0858\u085C-\u085D\u085E' + '\u085F-\u089F\u200F\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB37\uFB38-\uFB3C' + '\uFB3D\uFB3E\uFB3F\uFB40-\uFB41\uFB42\uFB43-\uFB44\uFB45\uFB46-\uFB4F', AL: '\u0608\u060B\u060D\u061B\u061C\u061D\u061E-\u061F\u0620-\u063F\u0640' + '\u0641-\u064A\u066D\u066E-\u066F\u0671-\u06D3\u06D4\u06D5\u06E5-\u06E6' + '\u06EE-\u06EF\u06FA-\u06FC\u06FD-\u06FE\u06FF\u0700-\u070D\u070E\u070F' + '\u0710\u0712-\u072F\u074B-\u074C\u074D-\u07A5\u07B1\u07B2-\u07BF' + '\u08A0-\u08B2\u08B3-\u08E3\uFB50-\uFBB1\uFBB2-\uFBC1\uFBC2-\uFBD2' + '\uFBD3-\uFD3D\uFD40-\uFD4F\uFD50-\uFD8F\uFD90-\uFD91\uFD92-\uFDC7' + '\uFDC8-\uFDCF\uFDF0-\uFDFB\uFDFC\uFDFE-\uFDFF\uFE70-\uFE74\uFE75' + '\uFE76-\uFEFC\uFEFD-\uFEFE' }; const REGEX_STRONG = new RegExp('[' + RANGE_BY_BIDI_TYPE.L + RANGE_BY_BIDI_TYPE.R + RANGE_BY_BIDI_TYPE.AL + ']'); const REGEX_RTL = new RegExp('[' + RANGE_BY_BIDI_TYPE.R + RANGE_BY_BIDI_TYPE.AL + ']'); /** * Returns the first strong character (has Bidi_Class value of L, R, or AL). * * @param str A text block; e.g. paragraph, table cell, tag * @return A character with strong bidi direction, or null if not found */ function firstStrongChar(str: string): ?string { const match = REGEX_STRONG.exec(str); return match == null ? null : match[0]; } /** * Returns the direction of a block of text, based on the direction of its * first strong character (has Bidi_Class value of L, R, or AL). * * @param str A text block; e.g. paragraph, table cell, tag * @return The resolved direction */ function firstStrongCharDir(str: string): BidiDirection { const strongChar = firstStrongChar(str); if (strongChar == null) { return UnicodeBidiDirection.NEUTRAL; } return REGEX_RTL.exec(strongChar) ? UnicodeBidiDirection.RTL : UnicodeBidiDirection.LTR; } /** * Returns the direction of a block of text, based on the direction of its * first strong character (has Bidi_Class value of L, R, or AL), or a fallback * direction, if no strong character is found. * * This function is supposed to be used in respect to Higher-Level Protocol * rule HL1. (http://www.unicode.org/reports/tr9/#HL1) * * @param str A text block; e.g. paragraph, table cell, tag * @param fallback Fallback direction, used if no strong direction detected * for the block (default = NEUTRAL) * @return The resolved direction */ function resolveBlockDir(str: string, fallback: ?BidiDirection): BidiDirection { fallback = fallback || UnicodeBidiDirection.NEUTRAL; if (!str.length) { return fallback; } const blockDir = firstStrongCharDir(str); return blockDir === UnicodeBidiDirection.NEUTRAL ? fallback : blockDir; } /** * Returns the direction of a block of text, based on the direction of its * first strong character (has Bidi_Class value of L, R, or AL), or a fallback * direction, if no strong character is found. * * NOTE: This function is similar to resolveBlockDir(), but uses the global * direction as the fallback, so it *always* returns a Strong direction, * making it useful for integration in places that you need to make the final * decision, like setting some CSS class. * * This function is supposed to be used in respect to Higher-Level Protocol * rule HL1. (http://www.unicode.org/reports/tr9/#HL1) * * @param str A text block; e.g. paragraph, table cell * @param strongFallback Fallback direction, used if no strong direction * detected for the block (default = global direction) * @return The resolved Strong direction */ function getDirection(str: string, strongFallback: ?BidiDirection): BidiDirection { if (!strongFallback) { strongFallback = UnicodeBidiDirection.getGlobalDir(); } invariant(UnicodeBidiDirection.isStrong(strongFallback), 'Fallback direction must be a strong direction'); return resolveBlockDir(str, strongFallback); } /** * Returns true if getDirection(arguments...) returns LTR. * * @param str A text block; e.g. paragraph, table cell * @param strongFallback Fallback direction, used if no strong direction * detected for the block (default = global direction) * @return True if the resolved direction is LTR */ function isDirectionLTR(str: string, strongFallback: ?BidiDirection): boolean { return getDirection(str, strongFallback) === UnicodeBidiDirection.LTR; } /** * Returns true if getDirection(arguments...) returns RTL. * * @param str A text block; e.g. paragraph, table cell * @param strongFallback Fallback direction, used if no strong direction * detected for the block (default = global direction) * @return True if the resolved direction is RTL */ function isDirectionRTL(str: string, strongFallback: ?BidiDirection): boolean { return getDirection(str, strongFallback) === UnicodeBidiDirection.RTL; } const UnicodeBidi = { firstStrongChar: firstStrongChar, firstStrongCharDir: firstStrongCharDir, resolveBlockDir: resolveBlockDir, getDirection: getDirection, isDirectionLTR: isDirectionLTR, isDirectionRTL: isDirectionRTL }; module.exports = UnicodeBidi;PK �n[��Q( ( _shouldPolyfillES6Collection.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @preventMunge * */ /** * Checks whether a collection name (e.g. "Map" or "Set") has a native polyfill * that is safe to be used. */ function shouldPolyfillES6Collection(collectionName) { var Collection = global[collectionName]; if (Collection == null) { return true; } // The iterator protocol depends on `Symbol.iterator`. If a collection is // implemented, but `Symbol` is not, it's going to break iteration because // we'll be using custom "@@iterator" instead, which is not implemented on // native collections. if (typeof global.Symbol !== 'function') { return true; } var proto = Collection.prototype; // These checks are adapted from es6-shim: https://fburl.com/34437854 // NOTE: `isCallableWithoutNew` and `!supportsSubclassing` are not checked // because they make debugging with "break on exceptions" difficult. return Collection == null || typeof Collection !== 'function' || typeof proto.clear !== 'function' || new Collection().size !== 0 || typeof proto.keys !== 'function' || typeof proto.forEach !== 'function'; } module.exports = shouldPolyfillES6Collection;PK �n[�/�( ( UnicodeBidiDirection.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks * */ /** * Constants to represent text directionality * * Also defines a *global* direciton, to be used in bidi algorithms as a * default fallback direciton, when no better direction is found or provided. * * NOTE: Use `setGlobalDir()`, or update `initGlobalDir()`, to set the initial * global direction value based on the application. * * Part of the implementation of Unicode Bidirectional Algorithm (UBA) * Unicode Standard Annex #9 (UAX9) * http://www.unicode.org/reports/tr9/ */ 'use strict'; var invariant = require("./invariant"); var NEUTRAL = 'NEUTRAL'; // No strong direction var LTR = 'LTR'; // Left-to-Right direction var RTL = 'RTL'; // Right-to-Left direction var globalDir = null; // == Helpers == /** * Check if a directionality value is a Strong one */ function isStrong(dir) { return dir === LTR || dir === RTL; } /** * Get string value to be used for `dir` HTML attribute or `direction` CSS * property. */ function getHTMLDir(dir) { !isStrong(dir) ? process.env.NODE_ENV !== "production" ? invariant(false, '`dir` must be a strong direction to be converted to HTML Direction') : invariant(false) : void 0; return dir === LTR ? 'ltr' : 'rtl'; } /** * Get string value to be used for `dir` HTML attribute or `direction` CSS * property, but returns null if `dir` has same value as `otherDir`. * `null`. */ function getHTMLDirIfDifferent(dir, otherDir) { !isStrong(dir) ? process.env.NODE_ENV !== "production" ? invariant(false, '`dir` must be a strong direction to be converted to HTML Direction') : invariant(false) : void 0; !isStrong(otherDir) ? process.env.NODE_ENV !== "production" ? invariant(false, '`otherDir` must be a strong direction to be converted to HTML Direction') : invariant(false) : void 0; return dir === otherDir ? null : getHTMLDir(dir); } // == Global Direction == /** * Set the global direction. */ function setGlobalDir(dir) { globalDir = dir; } /** * Initialize the global direction */ function initGlobalDir() { setGlobalDir(LTR); } /** * Get the global direction */ function getGlobalDir() { if (!globalDir) { this.initGlobalDir(); } !globalDir ? process.env.NODE_ENV !== "production" ? invariant(false, 'Global direction not set.') : invariant(false) : void 0; return globalDir; } var UnicodeBidiDirection = { // Values NEUTRAL: NEUTRAL, LTR: LTR, RTL: RTL, // Helpers isStrong: isStrong, getHTMLDir: getHTMLDir, getHTMLDirIfDifferent: getHTMLDirIfDifferent, // Global Direction setGlobalDir: setGlobalDir, initGlobalDir: initGlobalDir, getGlobalDir: getGlobalDir }; module.exports = UnicodeBidiDirection;PK �n["��� � UserAgent.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule UserAgent */ 'use strict'; const UserAgentData = require("./UserAgentData"); const VersionRange = require("./VersionRange"); const mapObject = require("./mapObject"); const memoizeStringOnly = require("./memoizeStringOnly"); /** * Checks to see whether `name` and `version` satisfy `query`. * * @param {string} name Name of the browser, device, engine or platform * @param {?string} version Version of the browser, engine or platform * @param {string} query Query of form "Name [range expression]" * @param {?function} normalizer Optional pre-processor for range expression * @return {boolean} */ function compare(name, version, query, normalizer) { // check for exact match with no version if (name === query) { return true; } // check for non-matching names if (!query.startsWith(name)) { return false; } // full comparison with version let range = query.slice(name.length); if (version) { range = normalizer ? normalizer(range) : range; return VersionRange.contains(range, version); } return false; } /** * Normalizes `version` by stripping any "NT" prefix, but only on the Windows * platform. * * Mimics the stripping performed by the `UserAgentWindowsPlatform` PHP class. * * @param {string} version * @return {string} */ function normalizePlatformVersion(version) { if (UserAgentData.platformName === 'Windows') { return version.replace(/^\s*NT/, ''); } return version; } /** * Provides client-side access to the authoritative PHP-generated User Agent * information supplied by the server. */ const UserAgent = { /** * Check if the User Agent browser matches `query`. * * `query` should be a string like "Chrome" or "Chrome > 33". * * Valid browser names include: * * - ACCESS NetFront * - AOL * - Amazon Silk * - Android * - BlackBerry * - BlackBerry PlayBook * - Chrome * - Chrome for iOS * - Chrome frame * - Facebook PHP SDK * - Facebook for iOS * - Firefox * - IE * - IE Mobile * - Mobile Safari * - Motorola Internet Browser * - Nokia * - Openwave Mobile Browser * - Opera * - Opera Mini * - Opera Mobile * - Safari * - UIWebView * - Unknown * - webOS * - etc... * * An authoritative list can be found in the PHP `BrowserDetector` class and * related classes in the same file (see calls to `new UserAgentBrowser` here: * https://fburl.com/50728104). * * @note Function results are memoized * * @param {string} query Query of the form "Name [range expression]" * @return {boolean} */ isBrowser(query) { return compare(UserAgentData.browserName, UserAgentData.browserFullVersion, query); }, /** * Check if the User Agent browser uses a 32 or 64 bit architecture. * * @note Function results are memoized * * @param {string} query Query of the form "32" or "64". * @return {boolean} */ isBrowserArchitecture(query) { return compare(UserAgentData.browserArchitecture, null, query); }, /** * Check if the User Agent device matches `query`. * * `query` should be a string like "iPhone" or "iPad". * * Valid device names include: * * - Kindle * - Kindle Fire * - Unknown * - iPad * - iPhone * - iPod * - etc... * * An authoritative list can be found in the PHP `DeviceDetector` class and * related classes in the same file (see calls to `new UserAgentDevice` here: * https://fburl.com/50728332). * * @note Function results are memoized * * @param {string} query Query of the form "Name" * @return {boolean} */ isDevice(query) { return compare(UserAgentData.deviceName, null, query); }, /** * Check if the User Agent rendering engine matches `query`. * * `query` should be a string like "WebKit" or "WebKit >= 537". * * Valid engine names include: * * - Gecko * - Presto * - Trident * - WebKit * - etc... * * An authoritative list can be found in the PHP `RenderingEngineDetector` * class related classes in the same file (see calls to `new * UserAgentRenderingEngine` here: https://fburl.com/50728617). * * @note Function results are memoized * * @param {string} query Query of the form "Name [range expression]" * @return {boolean} */ isEngine(query) { return compare(UserAgentData.engineName, UserAgentData.engineVersion, query); }, /** * Check if the User Agent platform matches `query`. * * `query` should be a string like "Windows" or "iOS 5 - 6". * * Valid platform names include: * * - Android * - BlackBerry OS * - Java ME * - Linux * - Mac OS X * - Mac OS X Calendar * - Mac OS X Internet Account * - Symbian * - SymbianOS * - Windows * - Windows Mobile * - Windows Phone * - iOS * - iOS Facebook Integration Account * - iOS Facebook Social Sharing UI * - webOS * - Chrome OS * - etc... * * An authoritative list can be found in the PHP `PlatformDetector` class and * related classes in the same file (see calls to `new UserAgentPlatform` * here: https://fburl.com/50729226). * * @note Function results are memoized * * @param {string} query Query of the form "Name [range expression]" * @return {boolean} */ isPlatform(query) { return compare(UserAgentData.platformName, UserAgentData.platformFullVersion, query, normalizePlatformVersion); }, /** * Check if the User Agent platform is a 32 or 64 bit architecture. * * @note Function results are memoized * * @param {string} query Query of the form "32" or "64". * @return {boolean} */ isPlatformArchitecture(query) { return compare(UserAgentData.platformArchitecture, null, query); } }; module.exports = mapObject(UserAgent, memoizeStringOnly);PK �n[� �2� � UnicodeBidiDirection.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule UnicodeBidiDirection * @typechecks * @flow */ /** * Constants to represent text directionality * * Also defines a *global* direciton, to be used in bidi algorithms as a * default fallback direciton, when no better direction is found or provided. * * NOTE: Use `setGlobalDir()`, or update `initGlobalDir()`, to set the initial * global direction value based on the application. * * Part of the implementation of Unicode Bidirectional Algorithm (UBA) * Unicode Standard Annex #9 (UAX9) * http://www.unicode.org/reports/tr9/ */ 'use strict'; const invariant = require("./invariant"); export type BidiDirection = 'LTR' | 'RTL' | 'NEUTRAL'; export type HTMLDir = 'ltr' | 'rtl'; const NEUTRAL = 'NEUTRAL'; // No strong direction const LTR = 'LTR'; // Left-to-Right direction const RTL = 'RTL'; // Right-to-Left direction let globalDir: ?BidiDirection = null; // == Helpers == /** * Check if a directionality value is a Strong one */ function isStrong(dir: BidiDirection): boolean { return dir === LTR || dir === RTL; } /** * Get string value to be used for `dir` HTML attribute or `direction` CSS * property. */ function getHTMLDir(dir: BidiDirection): HTMLDir { invariant(isStrong(dir), '`dir` must be a strong direction to be converted to HTML Direction'); return dir === LTR ? 'ltr' : 'rtl'; } /** * Get string value to be used for `dir` HTML attribute or `direction` CSS * property, but returns null if `dir` has same value as `otherDir`. * `null`. */ function getHTMLDirIfDifferent(dir: BidiDirection, otherDir: BidiDirection): ?HTMLDir { invariant(isStrong(dir), '`dir` must be a strong direction to be converted to HTML Direction'); invariant(isStrong(otherDir), '`otherDir` must be a strong direction to be converted to HTML Direction'); return dir === otherDir ? null : getHTMLDir(dir); } // == Global Direction == /** * Set the global direction. */ function setGlobalDir(dir: BidiDirection): void { globalDir = dir; } /** * Initialize the global direction */ function initGlobalDir(): void { setGlobalDir(LTR); } /** * Get the global direction */ function getGlobalDir(): BidiDirection { if (!globalDir) { this.initGlobalDir(); } invariant(globalDir, 'Global direction not set.'); return globalDir; } const UnicodeBidiDirection = { // Values NEUTRAL, LTR, RTL, // Helpers isStrong, getHTMLDir, getHTMLDirIfDifferent, // Global Direction setGlobalDir, initGlobalDir, getGlobalDir }; module.exports = UnicodeBidiDirection;PK �n[�G�( ( UserAgentData.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ /** * Usage note: * This module makes a best effort to export the same data we would internally. * At Facebook we use a server-generated module that does the parsing and * exports the data for the client to use. We can't rely on a server-side * implementation in open source so instead we make use of an open source * library to do the heavy lifting and then make some adjustments as necessary. * It's likely there will be some differences. Some we can smooth over. * Others are going to be harder. */ 'use strict'; var UAParser = require("ua-parser-js"); var UNKNOWN = 'Unknown'; var PLATFORM_MAP = { 'Mac OS': 'Mac OS X' }; /** * Convert from UAParser platform name to what we expect. */ function convertPlatformName(name) { return PLATFORM_MAP[name] || name; } /** * Get the version number in parts. This is very naive. We actually get major * version as a part of UAParser already, which is generally good enough, but * let's get the minor just in case. */ function getBrowserVersion(version) { if (!version) { return { major: '', minor: '' }; } var parts = version.split('.'); return { major: parts[0], minor: parts[1] }; } /** * Get the UA data fom UAParser and then convert it to the format we're * expecting for our APIS. */ var parser = new UAParser(); var results = parser.getResult(); // Do some conversion first. var browserVersionData = getBrowserVersion(results.browser.version); var uaData = { browserArchitecture: results.cpu.architecture || UNKNOWN, browserFullVersion: results.browser.version || UNKNOWN, browserMinorVersion: browserVersionData.minor || UNKNOWN, browserName: results.browser.name || UNKNOWN, browserVersion: results.browser.major || UNKNOWN, deviceName: results.device.model || UNKNOWN, engineName: results.engine.name || UNKNOWN, engineVersion: results.engine.version || UNKNOWN, platformArchitecture: results.cpu.architecture || UNKNOWN, platformName: convertPlatformName(results.os.name) || UNKNOWN, platformVersion: results.os.version || UNKNOWN, platformFullVersion: results.os.version || UNKNOWN }; module.exports = uaData;PK �n[ �{� UnicodeBidiService.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks * */ /** * Stateful API for text direction detection * * This class can be used in applications where you need to detect the * direction of a sequence of text blocks, where each direction shall be used * as the fallback direction for the next one. * * NOTE: A default direction, if not provided, is set based on the global * direction, as defined by `UnicodeBidiDirection`. * * == Example == * ``` * var UnicodeBidiService = require('UnicodeBidiService'); * * var bidiService = new UnicodeBidiService(); * * ... * * bidiService.reset(); * for (var para in paragraphs) { * var dir = bidiService.getDirection(para); * ... * } * ``` * * Part of our implementation of Unicode Bidirectional Algorithm (UBA) * Unicode Standard Annex #9 (UAX9) * http://www.unicode.org/reports/tr9/ */ 'use strict'; function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } var UnicodeBidi = require("./UnicodeBidi"); var UnicodeBidiDirection = require("./UnicodeBidiDirection"); var invariant = require("./invariant"); var UnicodeBidiService = /*#__PURE__*/ function () { /** * Stateful class for paragraph direction detection * * @param defaultDir Default direction of the service */ function UnicodeBidiService(defaultDir) { _defineProperty(this, "_defaultDir", void 0); _defineProperty(this, "_lastDir", void 0); if (!defaultDir) { defaultDir = UnicodeBidiDirection.getGlobalDir(); } else { !UnicodeBidiDirection.isStrong(defaultDir) ? process.env.NODE_ENV !== "production" ? invariant(false, 'Default direction must be a strong direction (LTR or RTL)') : invariant(false) : void 0; } this._defaultDir = defaultDir; this.reset(); } /** * Reset the internal state * * Instead of creating a new instance, you can just reset() your instance * everytime you start a new loop. */ var _proto = UnicodeBidiService.prototype; _proto.reset = function reset() { this._lastDir = this._defaultDir; }; /** * Returns the direction of a block of text, and remembers it as the * fall-back direction for the next paragraph. * * @param str A text block, e.g. paragraph, table cell, tag * @return The resolved direction */ _proto.getDirection = function getDirection(str) { this._lastDir = UnicodeBidi.getDirection(str, this._lastDir); return this._lastDir; }; return UnicodeBidiService; }(); module.exports = UnicodeBidiService;PK �n[�u�- - equalsSet.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule equalsSet * @flow * @typechecks */ 'use strict'; import type Set from "./Set"; var everySet = require("./everySet"); /** * Checks if two sets are equal */ function equalsSet<T>(one: Set<T>, two: Set<T>): boolean { if (one.size !== two.size) { return false; } return everySet(one, value => two.has(value)); } module.exports = equalsSet;PK �n[Z�]C@ @ groupArray.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ 'use strict'; /** * Groups all items in the array using the specified function. An object will * be returned where the keys are the group names, and the values are arrays of * all the items in that group. * * @param {array} array * @param {function} fn Should return a string with a group name * @return {object} items grouped using fn */ function groupArray(array, fn) { var ret = {}; for (var ii = 0; ii < array.length; ii++) { var result = fn.call(array, array[ii], ii); if (!ret[result]) { ret[result] = []; } ret[result].push(array[ii]); } return ret; } module.exports = groupArray;PK �n[0��D� � sprintf.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ /** * Simple function for formatting strings. * * Replaces placeholders with values passed as extra arguments * * @param {string} format the base string * @param ...args the values to insert * @return {string} the replaced string */ function sprintf(format) { for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) { args[_key - 1] = arguments[_key]; } var index = 0; return format.replace(/%s/g, function (match) { return args[index++]; }); } module.exports = sprintf;PK �n[Sxxc c $ _shouldPolyfillES6Collection.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule _shouldPolyfillES6Collection * @preventMunge * @flow */ /** * Checks whether a collection name (e.g. "Map" or "Set") has a native polyfill * that is safe to be used. */ function shouldPolyfillES6Collection(collectionName: string): boolean { const Collection = global[collectionName]; if (Collection == null) { return true; } // The iterator protocol depends on `Symbol.iterator`. If a collection is // implemented, but `Symbol` is not, it's going to break iteration because // we'll be using custom "@@iterator" instead, which is not implemented on // native collections. if (typeof global.Symbol !== 'function') { return true; } const proto = Collection.prototype; // These checks are adapted from es6-shim: https://fburl.com/34437854 // NOTE: `isCallableWithoutNew` and `!supportsSubclassing` are not checked // because they make debugging with "break on exceptions" difficult. return Collection == null || typeof Collection !== 'function' || typeof proto.clear !== 'function' || new Collection().size !== 0 || typeof proto.keys !== 'function' || typeof proto.forEach !== 'function'; } module.exports = shouldPolyfillES6Collection;PK �n[�C�^ ^ groupArray.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule groupArray * @typechecks */ 'use strict'; /** * Groups all items in the array using the specified function. An object will * be returned where the keys are the group names, and the values are arrays of * all the items in that group. * * @param {array} array * @param {function} fn Should return a string with a group name * @return {object} items grouped using fn */ function groupArray(array, fn) { var ret = {}; for (var ii = 0; ii < array.length; ii++) { var result = fn.call(array, array[ii], ii); if (!ret[result]) { ret[result] = []; } ret[result].push(array[ii]); } return ret; } module.exports = groupArray;PK �n[��(� � warning.jsnu �Iw�� /** * Copyright (c) 2014-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ 'use strict'; var emptyFunction = require("./emptyFunction"); /** * Similar to invariant but only logs a warning if the condition is not met. * This can be used to log issues in development environments in critical * paths. Removing the logging code for production environments will keep the * same logic and follow the same code paths. */ function printWarning(format) { for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) { args[_key - 1] = arguments[_key]; } var argIndex = 0; var message = 'Warning: ' + format.replace(/%s/g, function () { return args[argIndex++]; }); if (typeof console !== 'undefined') { console.error(message); } try { // --- Welcome to debugging React --- // This error was thrown as a convenience so that you can use this stack // to find the callsite that caused this warning to fire. throw new Error(message); } catch (x) {} } var warning = process.env.NODE_ENV !== "production" ? function (condition, format) { if (format === undefined) { throw new Error('`warning(condition, format, ...args)` requires a warning ' + 'message argument'); } if (!condition) { for (var _len2 = arguments.length, args = new Array(_len2 > 2 ? _len2 - 2 : 0), _key2 = 2; _key2 < _len2; _key2++) { args[_key2 - 2] = arguments[_key2]; } printWarning.apply(void 0, [format].concat(args)); } } : emptyFunction; module.exports = warning;PK �n[�/IA` ` cancelAnimationFramePolyfill.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ /** * Here is the native and polyfill version of cancelAnimationFrame. * Please don't use it directly and use cancelAnimationFrame module instead. */ var cancelAnimationFrame = global.cancelAnimationFrame || global.webkitCancelAnimationFrame || global.mozCancelAnimationFrame || global.oCancelAnimationFrame || global.msCancelAnimationFrame || global.clearTimeout; module.exports = cancelAnimationFrame;PK �n[��6� � hyphenate.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var _uppercasePattern = /([A-Z])/g; /** * Hyphenates a camelcased string, for example: * * > hyphenate('backgroundColor') * < "background-color" * * For CSS style names, use `hyphenateStyleName` instead which works properly * with all vendor prefixes, including `ms`. * * @param {string} string * @return {string} */ function hyphenate(string) { return string.replace(_uppercasePattern, '-$1').toLowerCase(); } module.exports = hyphenate;PK �n[('� � � performance.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ 'use strict'; var ExecutionEnvironment = require("./ExecutionEnvironment"); var performance; if (ExecutionEnvironment.canUseDOM) { performance = window.performance || window.msPerformance || window.webkitPerformance; } module.exports = performance || {};PK �n[�#(� � $ cancelAnimationFramePolyfill.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule cancelAnimationFramePolyfill */ /** * Here is the native and polyfill version of cancelAnimationFrame. * Please don't use it directly and use cancelAnimationFrame module instead. */ const cancelAnimationFrame = global.cancelAnimationFrame || global.webkitCancelAnimationFrame || global.mozCancelAnimationFrame || global.oCancelAnimationFrame || global.msCancelAnimationFrame || global.clearTimeout; module.exports = cancelAnimationFrame;PK �n[BJ� isEmail.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule isEmail */ // good approximation of RFC 2822 // http://www.regular-expressions.info/email.html var re = /^[\w!#\$%&'\*\+\/\=\?\^`\{\|\}~\-]+(:?\.[\w!#\$%&'\*\+\/\=\?\^`\{\|\}~\-]+)*@(?:[a-z0-9](?:[a-z0-9\-]*[a-z0-9])?\.)+[a-z0-9](?:[a-z0-9\-]*[a-z0-9])?$/i; function isEmail(email) { return re.test(email); } module.exports = isEmail;PK �n[�GXJJ J createArrayFromMixed.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule createArrayFromMixed * @typechecks */ const invariant = require("./invariant"); /** * Convert array-like objects to arrays. * * This API assumes the caller knows the contents of the data type. For less * well defined inputs use createArrayFromMixed. * * @param {object|function|filelist} obj * @return {array} */ function toArray(obj) { const length = obj.length; // Some browsers builtin objects can report typeof 'function' (e.g. NodeList // in old versions of Safari). invariant(!Array.isArray(obj) && (typeof obj === 'object' || typeof obj === 'function'), 'toArray: Array-like object expected'); invariant(typeof length === 'number', 'toArray: Object needs a length property'); invariant(length === 0 || length - 1 in obj, 'toArray: Object should have keys for indices'); invariant(typeof obj.callee !== 'function', 'toArray: Object can\'t be `arguments`. Use rest params ' + '(function(...args) {}) or Array.from() instead.'); // Old IE doesn't give collections access to hasOwnProperty. Assume inputs // without method will throw during the slice call and skip straight to the // fallback. if (obj.hasOwnProperty) { try { return Array.prototype.slice.call(obj); } catch (e) {// IE < 9 does not support Array#slice on collections objects } } // Fall back to copying key by key. This assumes all keys have a value, // so will not preserve sparsely populated inputs. const ret = Array(length); for (let ii = 0; ii < length; ii++) { ret[ii] = obj[ii]; } return ret; } /** * Perform a heuristic test to determine if an object is "array-like". * * A monk asked Joshu, a Zen master, "Has a dog Buddha nature?" * Joshu replied: "Mu." * * This function determines if its argument has "array nature": it returns * true if the argument is an actual array, an `arguments' object, or an * HTMLCollection (e.g. node.childNodes or node.getElementsByTagName()). * * It will return false for other array-like objects like Filelist. * * @param {*} obj * @return {boolean} */ function hasArrayNature(obj) { return (// not null/false !!obj && ( // arrays are objects, NodeLists are functions in Safari typeof obj == 'object' || typeof obj == 'function') && // quacks like an array 'length' in obj && // not window !('setInterval' in obj) && // no DOM node should be considered an array-like // a 'select' element has 'length' and 'item' properties on IE8 typeof obj.nodeType != 'number' && ( // a real array Array.isArray(obj) || // arguments 'callee' in obj || // HTMLCollection/NodeList 'item' in obj) ); } /** * Ensure that the argument is an array by wrapping it in an array if it is not. * Creates a copy of the argument if it is already an array. * * This is mostly useful idiomatically: * * var createArrayFromMixed = require('createArrayFromMixed'); * * function takesOneOrMoreThings(things) { * things = createArrayFromMixed(things); * ... * } * * This allows you to treat `things' as an array, but accept scalars in the API. * * If you need to convert an array-like object, like `arguments`, into an array * use toArray instead. * * @param {*} obj * @return {array} */ function createArrayFromMixed(obj) { if (!hasArrayNature(obj)) { return [obj]; } else if (Array.isArray(obj)) { return obj.slice(); } else { return toArray(obj); } } module.exports = createArrayFromMixed;PK �n[us�� � isEmpty.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ 'use strict'; /* eslint-disable fb-www/typeof-undefined */ /* eslint-disable no-unused-vars */ var invariant = require("./invariant"); /** * Checks if a value is empty. */ function isEmpty(value) { if (Array.isArray(value)) { return value.length === 0; } else if (typeof value === 'object') { if (value) { !(!isIterable(value) || value.size === undefined) ? process.env.NODE_ENV !== "production" ? invariant(false, 'isEmpty() does not support iterable collections.') : invariant(false) : void 0; for (var _ in value) { return false; } } return true; } else { return !value; } } function isIterable(value) { if (typeof Symbol === 'undefined') { return false; } return value[Symbol.iterator]; } module.exports = isEmpty;PK �n[Y}T�� � createNodesFromMarkup.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ /*eslint-disable fb-www/unsafe-html*/ var ExecutionEnvironment = require("./ExecutionEnvironment"); var createArrayFromMixed = require("./createArrayFromMixed"); var getMarkupWrap = require("./getMarkupWrap"); var invariant = require("./invariant"); /** * Dummy container used to render all markup. */ var dummyNode = ExecutionEnvironment.canUseDOM ? document.createElement('div') : null; /** * Pattern used by `getNodeName`. */ var nodeNamePattern = /^\s*<(\w+)/; /** * Extracts the `nodeName` of the first element in a string of markup. * * @param {string} markup String of markup. * @return {?string} Node name of the supplied markup. */ function getNodeName(markup) { var nodeNameMatch = markup.match(nodeNamePattern); return nodeNameMatch && nodeNameMatch[1].toLowerCase(); } /** * Creates an array containing the nodes rendered from the supplied markup. The * optionally supplied `handleScript` function will be invoked once for each * <script> element that is rendered. If no `handleScript` function is supplied, * an exception is thrown if any <script> elements are rendered. * * @param {string} markup A string of valid HTML markup. * @param {?function} handleScript Invoked once for each rendered <script>. * @return {array<DOMElement|DOMTextNode>} An array of rendered nodes. */ function createNodesFromMarkup(markup, handleScript) { var node = dummyNode; !!!dummyNode ? process.env.NODE_ENV !== "production" ? invariant(false, 'createNodesFromMarkup dummy not initialized') : invariant(false) : void 0; var nodeName = getNodeName(markup); var wrap = nodeName && getMarkupWrap(nodeName); if (wrap) { node.innerHTML = wrap[1] + markup + wrap[2]; var wrapDepth = wrap[0]; while (wrapDepth--) { node = node.lastChild; } } else { node.innerHTML = markup; } var scripts = node.getElementsByTagName('script'); if (scripts.length) { !handleScript ? process.env.NODE_ENV !== "production" ? invariant(false, 'createNodesFromMarkup(...): Unexpected <script> element rendered.') : invariant(false) : void 0; createArrayFromMixed(scripts).forEach(handleScript); } var nodes = Array.from(node.childNodes); while (node.lastChild) { node.removeChild(node.lastChild); } return nodes; } module.exports = createNodesFromMarkup;PK �n[���x� � hyphenate.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule hyphenate * @typechecks */ const _uppercasePattern = /([A-Z])/g; /** * Hyphenates a camelcased string, for example: * * > hyphenate('backgroundColor') * < "background-color" * * For CSS style names, use `hyphenateStyleName` instead which works properly * with all vendor prefixes, including `ms`. * * @param {string} string * @return {string} */ function hyphenate(string) { return string.replace(_uppercasePattern, '-$1').toLowerCase(); } module.exports = hyphenate;PK �n[1�n&� � createNodesFromMarkup.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule createNodesFromMarkup * @typechecks */ /*eslint-disable fb-www/unsafe-html*/ const ExecutionEnvironment = require("./ExecutionEnvironment"); const createArrayFromMixed = require("./createArrayFromMixed"); const getMarkupWrap = require("./getMarkupWrap"); const invariant = require("./invariant"); /** * Dummy container used to render all markup. */ const dummyNode = ExecutionEnvironment.canUseDOM ? document.createElement('div') : null; /** * Pattern used by `getNodeName`. */ const nodeNamePattern = /^\s*<(\w+)/; /** * Extracts the `nodeName` of the first element in a string of markup. * * @param {string} markup String of markup. * @return {?string} Node name of the supplied markup. */ function getNodeName(markup) { const nodeNameMatch = markup.match(nodeNamePattern); return nodeNameMatch && nodeNameMatch[1].toLowerCase(); } /** * Creates an array containing the nodes rendered from the supplied markup. The * optionally supplied `handleScript` function will be invoked once for each * <script> element that is rendered. If no `handleScript` function is supplied, * an exception is thrown if any <script> elements are rendered. * * @param {string} markup A string of valid HTML markup. * @param {?function} handleScript Invoked once for each rendered <script>. * @return {array<DOMElement|DOMTextNode>} An array of rendered nodes. */ function createNodesFromMarkup(markup, handleScript) { let node = dummyNode; invariant(!!dummyNode, 'createNodesFromMarkup dummy not initialized'); const nodeName = getNodeName(markup); const wrap = nodeName && getMarkupWrap(nodeName); if (wrap) { node.innerHTML = wrap[1] + markup + wrap[2]; let wrapDepth = wrap[0]; while (wrapDepth--) { node = node.lastChild; } } else { node.innerHTML = markup; } const scripts = node.getElementsByTagName('script'); if (scripts.length) { invariant(handleScript, 'createNodesFromMarkup(...): Unexpected <script> element rendered.'); createArrayFromMixed(scripts).forEach(handleScript); } const nodes = Array.from(node.childNodes); while (node.lastChild) { node.removeChild(node.lastChild); } return nodes; } module.exports = createNodesFromMarkup;PK �n[�-g� � isEmpty.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule isEmpty * @flow */ 'use strict'; /* eslint-disable fb-www/typeof-undefined */ /* eslint-disable no-unused-vars */ const invariant = require("./invariant"); /** * Checks if a value is empty. */ function isEmpty(value: mixed): boolean { if (Array.isArray(value)) { return value.length === 0; } else if (typeof value === 'object') { if (value) { invariant(!isIterable(value) || value.size === undefined, 'isEmpty() does not support iterable collections.'); for (const _ in value) { return false; } } return true; } else { return !value; } } function isIterable(value: any): boolean { if (typeof Symbol === 'undefined') { return false; } return value[Symbol.iterator]; } module.exports = isEmpty;PK �n[�� distinctArray.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule distinctArray * @flow */ var Set = require("./Set"); /** * Returns the distinct elements of an iterable. The result is an array whose * elements are ordered by first occurrence. */ function distinctArray<T>(xs: Iterable<T>): Array<T> { return Array.from(new Set(xs).values()); } module.exports = distinctArray;PK �n[!�� isEventSupported.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ 'use strict'; var ExecutionEnvironment = require("./ExecutionEnvironment"); var useHasFeature; if (ExecutionEnvironment.canUseDOM) { useHasFeature = document.implementation && document.implementation.hasFeature && // always returns true in newer browsers as per the standard. // @see http://dom.spec.whatwg.org/#dom-domimplementation-hasfeature document.implementation.hasFeature('', '') !== true; } /** * Checks if an event is supported in the current execution environment. * * NOTE: This will not work correctly for non-generic events such as `change`, * `reset`, `load`, `error`, and `select`. * * Borrows from Modernizr. * * @param {string} eventNameSuffix Event name, e.g. "click". * @param {?boolean} capture Check if the capture phase is supported. * @return {boolean} True if the event is supported. * @internal * @license Modernizr 3.0.0pre (Custom Build) | MIT */ function isEventSupported(eventNameSuffix, capture) { if (!ExecutionEnvironment.canUseDOM || capture && !('addEventListener' in document)) { return false; } var eventName = 'on' + eventNameSuffix; var isSupported = eventName in document; if (!isSupported) { var element = document.createElement('div'); element.setAttribute(eventName, 'return;'); isSupported = typeof element[eventName] === 'function'; } if (!isSupported && useHasFeature && eventNameSuffix === 'wheel') { // This is the only way to test support for the `wheel` event in IE9+. isSupported = document.implementation.hasFeature('Events.wheel', '3.0'); } return isSupported; } module.exports = isEventSupported;PK �n[��rX� � emptyFunction.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule emptyFunction * @flow */ export type FunctionReturning<+T> = (...args: $ReadOnlyArray<mixed>) => T; export type EmptyFunctionType = { thatReturns: <T>(x: T) => FunctionReturning<T>, thatReturnsFalse: FunctionReturning<false>, thatReturnsTrue: FunctionReturning<true>, thatReturnsNull: FunctionReturning<null>, thatReturnsThis: FunctionReturning<mixed>, thatReturnsArgument: <T>(x: T) => T, (...args: $ReadOnlyArray<mixed>): void, }; function makeEmptyFunction<T>(arg: T): (...args: Array<any>) => T { return function () { return arg; }; } /** * This function accepts and discards inputs; it has no side effects. This is * primarily useful idiomatically for overridable function endpoints which * always need to be callable, since JS lacks a null-call idiom ala Cocoa. */ const emptyFunction = function () {}; emptyFunction.thatReturns = makeEmptyFunction; emptyFunction.thatReturnsFalse = makeEmptyFunction(false); emptyFunction.thatReturnsTrue = makeEmptyFunction(true); emptyFunction.thatReturnsNull = makeEmptyFunction(null); emptyFunction.thatReturnsThis = function () { return this; }; emptyFunction.thatReturnsArgument = function (arg) { return arg; }; module.exports = (emptyFunction: EmptyFunctionType);PK �n[��r3 3 isEventSupported.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule isEventSupported */ 'use strict'; var ExecutionEnvironment = require("./ExecutionEnvironment"); var useHasFeature; if (ExecutionEnvironment.canUseDOM) { useHasFeature = document.implementation && document.implementation.hasFeature && // always returns true in newer browsers as per the standard. // @see http://dom.spec.whatwg.org/#dom-domimplementation-hasfeature document.implementation.hasFeature('', '') !== true; } /** * Checks if an event is supported in the current execution environment. * * NOTE: This will not work correctly for non-generic events such as `change`, * `reset`, `load`, `error`, and `select`. * * Borrows from Modernizr. * * @param {string} eventNameSuffix Event name, e.g. "click". * @param {?boolean} capture Check if the capture phase is supported. * @return {boolean} True if the event is supported. * @internal * @license Modernizr 3.0.0pre (Custom Build) | MIT */ function isEventSupported(eventNameSuffix, capture) { if (!ExecutionEnvironment.canUseDOM || capture && !('addEventListener' in document)) { return false; } var eventName = 'on' + eventNameSuffix; var isSupported = eventName in document; if (!isSupported) { var element = document.createElement('div'); element.setAttribute(eventName, 'return;'); isSupported = typeof element[eventName] === 'function'; } if (!isSupported && useHasFeature && eventNameSuffix === 'wheel') { // This is the only way to test support for the `wheel` event in IE9+. isSupported = document.implementation.hasFeature('Events.wheel', '3.0'); } return isSupported; } module.exports = isEventSupported;PK �n[Q�� � equalsIterable.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule equalsIterable * @flow */ 'use strict'; const enumerate = require("./enumerate"); /** * Checks if two iterables are equal. A custom areEqual function may be provided * as an optional third argument. */ function equalsIterable<T>(one: Iterable<T>, two: Iterable<T>, areEqual?: ?(one: T, two: T) => boolean): boolean { if (one === two) { return true; } // We might be able to short circuit by using the size or length fields. var oneSize = maybeGetSize(one); var twoSize = maybeGetSize(two); if (oneSize != null && twoSize != null && oneSize !== twoSize) { return false; } // Otherwise use the iterators to check equality. Here we cannot use for-of // because we need to advance the iterators at the same time. var oneIterator = enumerate(one); var oneItem = oneIterator.next(); var twoIterator = enumerate(two); var twoItem = twoIterator.next(); var safeAreEqual = areEqual || referenceEquality; while (!(oneItem.done || twoItem.done)) { if (!safeAreEqual(oneItem.value, twoItem.value)) { return false; } oneItem = oneIterator.next(); twoItem = twoIterator.next(); } return oneItem.done === twoItem.done; } function maybeGetSize(o: any): ?number { if (o == null) { return null; } if (typeof o.size === 'number') { return o.size; } if (typeof o.length === 'number') { return o.length; } return null; } function referenceEquality<T>(one: T, two: T): boolean { return one === two; } module.exports = equalsIterable;PK �n[ ���� � keyOf.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ /** * Allows extraction of a minified key. Let's the build system minify keys * without losing the ability to dynamically use key strings as values * themselves. Pass in an object with a single key/val pair and it will return * you the string key of that single record. Suppose you want to grab the * value for a key 'className' inside of an object. Key/val minification may * have aliased that key to be 'xa12'. keyOf({className: null}) will return * 'xa12' in that case. Resolve keys you want to use once at startup time, then * reuse those resolutions. */ var keyOf = function keyOf(oneKeyObj) { var key; for (key in oneKeyObj) { if (!oneKeyObj.hasOwnProperty(key)) { continue; } return key; } return null; }; module.exports = keyOf;PK �n[2hD�� � everyObject.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @typechecks */ 'use strict'; var hasOwnProperty = Object.prototype.hasOwnProperty; /** * Executes the provided `callback` once for each enumerable own property in the * object until it finds one where callback returns a falsy value. If such a * property is found, `everyObject` immediately returns false. Otherwise, it * returns true. * * The `callback` is invoked with three arguments: * * - the property value * - the property name * - the object being traversed * * Properties that are added after the call to `everyObject` will not be * visited by `callback`. If the values of existing properties are changed, the * value passed to `callback` will be the value at the time `everyObject` * visits them. Properties that are deleted before being visited are not * visited. */ function everyObject(object, callback, context) { for (var name in object) { if (hasOwnProperty.call(object, name)) { if (!callback.call(context, object[name], name, object)) { return false; } } } return true; } module.exports = everyObject;PK �n[�i� � keyOf.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule keyOf */ /** * Allows extraction of a minified key. Let's the build system minify keys * without losing the ability to dynamically use key strings as values * themselves. Pass in an object with a single key/val pair and it will return * you the string key of that single record. Suppose you want to grab the * value for a key 'className' inside of an object. Key/val minification may * have aliased that key to be 'xa12'. keyOf({className: null}) will return * 'xa12' in that case. Resolve keys you want to use once at startup time, then * reuse those resolutions. */ var keyOf = function (oneKeyObj) { var key; for (key in oneKeyObj) { if (!oneKeyObj.hasOwnProperty(key)) { continue; } return key; } return null; }; module.exports = keyOf;PK �n[�7a a everyObject.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule everyObject * @flow * @typechecks */ 'use strict'; var hasOwnProperty = Object.prototype.hasOwnProperty; /** * Executes the provided `callback` once for each enumerable own property in the * object until it finds one where callback returns a falsy value. If such a * property is found, `everyObject` immediately returns false. Otherwise, it * returns true. * * The `callback` is invoked with three arguments: * * - the property value * - the property name * - the object being traversed * * Properties that are added after the call to `everyObject` will not be * visited by `callback`. If the values of existing properties are changed, the * value passed to `callback` will be the value at the time `everyObject` * visits them. Properties that are deleted before being visited are not * visited. */ function everyObject(object: ?Object, callback: (value: any, name: string, object: Object) => any, context?: any): boolean { for (var name in object) { if (hasOwnProperty.call(object, name)) { if (!callback.call(context, object[name], name, object)) { return false; } } } return true; } module.exports = everyObject;PK �n[ݔ��( ( mapObject.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ 'use strict'; var hasOwnProperty = Object.prototype.hasOwnProperty; /** * Executes the provided `callback` once for each enumerable own property in the * object and constructs a new object from the results. The `callback` is * invoked with three arguments: * * - the property value * - the property name * - the object being traversed * * Properties that are added after the call to `mapObject` will not be visited * by `callback`. If the values of existing properties are changed, the value * passed to `callback` will be the value at the time `mapObject` visits them. * Properties that are deleted before being visited are not visited. * * @grep function objectMap() * @grep function objMap() * * @param {?object} object * @param {function} callback * @param {*} context * @return {?object} */ function mapObject(object, callback, context) { if (!object) { return null; } var result = {}; for (var name in object) { if (hasOwnProperty.call(object, name)) { result[name] = callback.call(context, object[name], name, object); } } return result; } module.exports = mapObject;PK �n[��75 5 everySet.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule everySet * @flow * @typechecks */ 'use strict'; import type Set from "./Set"; /** * The everySet() method tests whether all elements in the given Set pass the * test implemented by the provided function. */ function everySet<T>(set: Set<T>, callback: (value: T, key: T, set: Set<T>) => boolean, context?: any): boolean { var iterator = set.entries(); var current = iterator.next(); while (!current.done) { var entry = current.value; if (!callback.call(context, entry[1], entry[0], set)) { return false; } current = iterator.next(); } return true; } module.exports = everySet;PK �n[�"M�� � performance.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule performance * @typechecks */ 'use strict'; var ExecutionEnvironment = require("./ExecutionEnvironment"); var performance; if (ExecutionEnvironment.canUseDOM) { performance = window.performance || window.msPerformance || window.webkitPerformance; } module.exports = performance || {};PK �n[��.&5 5 fetch.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ 'use strict'; // This hopefully supports the React Native case, which is already bringing along // its own fetch polyfill. That should exist on `global`. If that doesn't exist // then we'll try to ponyfill, which might not work correctly in all environments. if (global.fetch) { module.exports = global.fetch.bind(global); } else { module.exports = require("cross-fetch"); }PK �n[x��"E E mapObject.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule mapObject */ 'use strict'; var hasOwnProperty = Object.prototype.hasOwnProperty; /** * Executes the provided `callback` once for each enumerable own property in the * object and constructs a new object from the results. The `callback` is * invoked with three arguments: * * - the property value * - the property name * - the object being traversed * * Properties that are added after the call to `mapObject` will not be visited * by `callback`. If the values of existing properties are changed, the value * passed to `callback` will be the value at the time `mapObject` visits them. * Properties that are deleted before being visited are not visited. * * @grep function objectMap() * @grep function objMap() * * @param {?object} object * @param {function} callback * @param {*} context * @return {?object} */ function mapObject(object, callback, context) { if (!object) { return null; } var result = {}; for (var name in object) { if (hasOwnProperty.call(object, name)) { result[name] = callback.call(context, object[name], name, object); } } return result; } module.exports = mapObject;PK �n[���N N fetch.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule fetch */ 'use strict'; // This hopefully supports the React Native case, which is already bringing along // its own fetch polyfill. That should exist on `global`. If that doesn't exist // then we'll try to ponyfill, which might not work correctly in all environments. if (global.fetch) { module.exports = global.fetch.bind(global); } else { module.exports = require("cross-fetch"); }PK �n[�` ` maxBy.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ var minBy = require("./minBy"); var compareNumber = function compareNumber(a, b) { return a - b; }; /** * Returns the maximum element as measured by a scoring function f. Returns the * first such element if there are ties. */ function maxBy(as, f, compare) { compare = compare || compareNumber; return minBy(as, f, function (u, v) { return compare(v, u); }); } module.exports = maxBy;PK �n[���$W W fetchWithRetries.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks * */ 'use strict'; var Promise = require("./Promise"); function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; } var ExecutionEnvironment = require("./ExecutionEnvironment"); var sprintf = require("./sprintf"); var fetch = require("./fetch"); var warning = require("./warning"); var DEFAULT_TIMEOUT = 15000; var DEFAULT_RETRIES = [1000, 3000]; /** * Makes a POST request to the server with the given data as the payload. * Automatic retries are done based on the values in `retryDelays`. */ function fetchWithRetries(uri, initWithRetries) { var _ref = initWithRetries || {}, fetchTimeout = _ref.fetchTimeout, retryDelays = _ref.retryDelays, init = _objectWithoutPropertiesLoose(_ref, ["fetchTimeout", "retryDelays"]); var _fetchTimeout = fetchTimeout != null ? fetchTimeout : DEFAULT_TIMEOUT; var _retryDelays = retryDelays != null ? retryDelays : DEFAULT_RETRIES; var requestsAttempted = 0; var requestStartTime = 0; return new Promise(function (resolve, reject) { /** * Sends a request to the server that will timeout after `fetchTimeout`. * If the request fails or times out a new request might be scheduled. */ function sendTimedRequest() { requestsAttempted++; requestStartTime = Date.now(); var isRequestAlive = true; var request = fetch(uri, init); var requestTimeout = setTimeout(function () { isRequestAlive = false; if (shouldRetry(requestsAttempted)) { process.env.NODE_ENV !== "production" ? warning(false, 'fetchWithRetries: HTTP timeout, retrying.') : void 0; retryRequest(); } else { reject(new Error(sprintf('fetchWithRetries(): Failed to get response from server, ' + 'tried %s times.', requestsAttempted))); } }, _fetchTimeout); request.then(function (response) { clearTimeout(requestTimeout); if (isRequestAlive) { // We got a response, we can clear the timeout. if (response.status >= 200 && response.status < 300) { // Got a response code that indicates success, resolve the promise. resolve(response); } else if (shouldRetry(requestsAttempted)) { // Fetch was not successful, retrying. // TODO(#7595849): Only retry on transient HTTP errors. process.env.NODE_ENV !== "production" ? warning(false, 'fetchWithRetries: HTTP error, retrying.') : void 0, retryRequest(); } else { // Request was not successful, giving up. var error = new Error(sprintf('fetchWithRetries(): Still no successful response after ' + '%s retries, giving up.', requestsAttempted)); error.response = response; reject(error); } } })["catch"](function (error) { clearTimeout(requestTimeout); if (shouldRetry(requestsAttempted)) { retryRequest(); } else { reject(error); } }); } /** * Schedules another run of sendTimedRequest based on how much time has * passed between the time the last request was sent and now. */ function retryRequest() { var retryDelay = _retryDelays[requestsAttempted - 1]; var retryStartTime = requestStartTime + retryDelay; // Schedule retry for a configured duration after last request started. setTimeout(sendTimedRequest, retryStartTime - Date.now()); } /** * Checks if another attempt should be done to send a request to the server. */ function shouldRetry(attempt) { return ExecutionEnvironment.canUseDOM && attempt <= _retryDelays.length; } sendTimedRequest(); }); } module.exports = fetchWithRetries;PK �n[� �p p isInternationalPhoneNumber.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * Simple client-side validation of international phone numbers */ var US_NUMBER_RE = /^1\(?\d{3}\)?\d{7}$/; var NORWAY_NUMBER_RE = /^47\d{8}$/; var INTL_NUMBER_RE = /^\d{1,4}\(?\d{2,3}\)?\d{4,}$/; function isInternationalPhoneNumber(number) { number = number.replace(/[\-\s]+/g, '') // strip all spaces and hyphens .replace(/^\+?0{0,2}/, ''); // strip up to 2 leading 0s and + if (number.startsWith('0')) { return false; } if (number.startsWith('1')) { return US_NUMBER_RE.test(number); } if (number.startsWith('47')) { return NORWAY_NUMBER_RE.test(number); } return INTL_NUMBER_RE.test(number); } module.exports = isInternationalPhoneNumber;PK �n[�M�mm m fetchWithRetries.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule fetchWithRetries * @typechecks * @flow */ 'use strict'; const ExecutionEnvironment = require("./ExecutionEnvironment"); const sprintf = require("./sprintf"); const fetch = require("./fetch"); const warning = require("./warning"); export type InitWithRetries = { body?: mixed, cache?: ?string, credentials?: ?string, fetchTimeout?: ?number, headers?: mixed, method?: ?string, mode?: ?string, retryDelays?: ?Array<number>, }; const DEFAULT_TIMEOUT = 15000; const DEFAULT_RETRIES = [1000, 3000]; /** * Makes a POST request to the server with the given data as the payload. * Automatic retries are done based on the values in `retryDelays`. */ function fetchWithRetries(uri: string, initWithRetries?: ?InitWithRetries): Promise<any> { const { fetchTimeout, retryDelays, ...init } = initWithRetries || {}; const _fetchTimeout = fetchTimeout != null ? fetchTimeout : DEFAULT_TIMEOUT; const _retryDelays = retryDelays != null ? retryDelays : DEFAULT_RETRIES; let requestsAttempted = 0; let requestStartTime = 0; return new Promise((resolve, reject) => { /** * Sends a request to the server that will timeout after `fetchTimeout`. * If the request fails or times out a new request might be scheduled. */ function sendTimedRequest(): void { requestsAttempted++; requestStartTime = Date.now(); let isRequestAlive = true; const request = fetch(uri, init); const requestTimeout = setTimeout(() => { isRequestAlive = false; if (shouldRetry(requestsAttempted)) { warning(false, 'fetchWithRetries: HTTP timeout, retrying.'); retryRequest(); } else { reject(new Error(sprintf('fetchWithRetries(): Failed to get response from server, ' + 'tried %s times.', requestsAttempted))); } }, _fetchTimeout); request.then(response => { clearTimeout(requestTimeout); if (isRequestAlive) { // We got a response, we can clear the timeout. if (response.status >= 200 && response.status < 300) { // Got a response code that indicates success, resolve the promise. resolve(response); } else if (shouldRetry(requestsAttempted)) { // Fetch was not successful, retrying. // TODO(#7595849): Only retry on transient HTTP errors. warning(false, 'fetchWithRetries: HTTP error, retrying.'), retryRequest(); } else { // Request was not successful, giving up. const error: any = new Error(sprintf('fetchWithRetries(): Still no successful response after ' + '%s retries, giving up.', requestsAttempted)); error.response = response; reject(error); } } }).catch(error => { clearTimeout(requestTimeout); if (shouldRetry(requestsAttempted)) { retryRequest(); } else { reject(error); } }); } /** * Schedules another run of sendTimedRequest based on how much time has * passed between the time the last request was sent and now. */ function retryRequest(): void { const retryDelay = _retryDelays[requestsAttempted - 1]; const retryStartTime = requestStartTime + retryDelay; // Schedule retry for a configured duration after last request started. setTimeout(sendTimedRequest, retryStartTime - Date.now()); } /** * Checks if another attempt should be done to send a request to the server. */ function shouldRetry(attempt: number): boolean { return ExecutionEnvironment.canUseDOM && attempt <= _retryDelays.length; } sendTimedRequest(); }); } module.exports = fetchWithRetries;PK �n[#^ �� � maxBy.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule maxBy * @flow */ var minBy = require("./minBy"); var compareNumber = (a, b) => a - b; /** * Returns the maximum element as measured by a scoring function f. Returns the * first such element if there are ties. */ function maxBy<A, B>(as: Iterable<A>, f: (a: A) => B, compare?: ?(u: B, v: B) => number): ?A { compare = compare || (compareNumber: any); return minBy(as, f, (u, v) => (compare: any)(v, u)); } module.exports = maxBy;PK �n[���x x filterObject.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ 'use strict'; var hasOwnProperty = Object.prototype.hasOwnProperty; /** * Executes the provided `callback` once for each enumerable own property in the * object and constructs a new object of all the values for which `callback` * returns a true value. The `callback` is invoked with three arguments: * * - the property value * - the property name * - the object being traversed * * Properties that are added after the call to `filterObject` will not be * visited by `callback`. If the values of existing properties are changed, the * value passed to `callback` will be the value at the time `filterObject` * visits them. Properties that are deleted before being visited are not * visited. * * @grep function objectFilter() * @grep function objFilter() * * @param {?object} object * @param {function} callback * @param {*} context * @return {?object} */ function filterObject(object, callback, context) { if (!object) { return null; } var result = {}; for (var name in object) { if (hasOwnProperty.call(object, name) && callback.call(context, object[name], name, object)) { result[name] = object[name]; } } return result; } module.exports = filterObject;PK �n[�F�I; ; memoizeStringOnly.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @typechecks static-only */ 'use strict'; /** * Memoizes the return value of a function that accepts one string argument. */ function memoizeStringOnly(callback) { var cache = {}; return function (string) { if (!cache.hasOwnProperty(string)) { cache[string] = callback.call(this, string); } return cache[string]; }; } module.exports = memoizeStringOnly;PK �n[B�N� � filterObject.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule filterObject */ 'use strict'; var hasOwnProperty = Object.prototype.hasOwnProperty; /** * Executes the provided `callback` once for each enumerable own property in the * object and constructs a new object of all the values for which `callback` * returns a true value. The `callback` is invoked with three arguments: * * - the property value * - the property name * - the object being traversed * * Properties that are added after the call to `filterObject` will not be * visited by `callback`. If the values of existing properties are changed, the * value passed to `callback` will be the value at the time `filterObject` * visits them. Properties that are deleted before being visited are not * visited. * * @grep function objectFilter() * @grep function objFilter() * * @param {?object} object * @param {function} callback * @param {*} context * @return {?object} */ function filterObject(object, callback, context) { if (!object) { return null; } var result = {}; for (var name in object) { if (hasOwnProperty.call(object, name) && callback.call(context, object[name], name, object)) { result[name] = object[name]; } } return result; } module.exports = filterObject;PK �n[!�p�� � memoizeStringOnly.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule memoizeStringOnly * @flow * @typechecks static-only */ 'use strict'; /** * Memoizes the return value of a function that accepts one string argument. */ function memoizeStringOnly<T>(callback: (s: string) => T): (s: string) => T { const cache = {}; return function (string) { if (!cache.hasOwnProperty(string)) { cache[string] = callback.call(this, string); } return cache[string]; }; } module.exports = memoizeStringOnly;PK �n[U���g g flatMapArray.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @typechecks */ var push = Array.prototype.push; /** * Applies a function to every item in an array and concatenates the resulting * arrays into a single flat array. * * @param {array} array * @param {function} fn * @return {array} */ function flatMapArray(array, fn) { var ret = []; for (var ii = 0; ii < array.length; ii++) { var result = fn.call(array, array[ii], ii); if (Array.isArray(result)) { push.apply(ret, result); } else if (result != null) { throw new TypeError('flatMapArray: Callback must return an array or null, ' + 'received "' + result + '" instead'); } } return ret; } module.exports = flatMapArray;PK �n[��o: : minBy.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ var compareNumber = function compareNumber(a, b) { return a - b; }; /** * Returns the minimum element as measured by a scoring function f. Returns the * first such element if there are ties. */ function minBy(as, f, compare) { compare = compare || compareNumber; var minA = undefined; var minB = undefined; var seenFirst = false; var _iteratorNormalCompletion = true; var _didIteratorError = false; var _iteratorError = undefined; try { for (var _iterator = as[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { var a = _step.value; var b = f(a); if (!seenFirst || compare(b, minB) < 0) { minA = a; minB = b; seenFirst = true; } } } catch (err) { _didIteratorError = true; _iteratorError = err; } finally { try { if (!_iteratorNormalCompletion && _iterator["return"] != null) { _iterator["return"](); } } finally { if (_didIteratorError) { throw _iteratorError; } } } return minA; } module.exports = minBy;PK �n[,7��� � flatMapArray.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule flatMapArray * @flow * @typechecks */ var push = Array.prototype.push; /** * Applies a function to every item in an array and concatenates the resulting * arrays into a single flat array. * * @param {array} array * @param {function} fn * @return {array} */ function flatMapArray<TValue, TNext>(array: Array<TValue>, fn: (value: TValue, index: number) => Array<TNext>): Array<TNext> { var ret = []; for (var ii = 0; ii < array.length; ii++) { var result = fn.call(array, array[ii], ii); if (Array.isArray(result)) { push.apply(ret, result); } else if (result != null) { throw new TypeError('flatMapArray: Callback must return an array or null, ' + 'received "' + result + '" instead'); } } return ret; } module.exports = flatMapArray;PK �n[ǺU~$ $ minBy.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule minBy * @flow */ var compareNumber = (a, b) => a - b; /** * Returns the minimum element as measured by a scoring function f. Returns the * first such element if there are ties. */ function minBy<A, B>(as: Iterable<A>, f: (a: A) => B, compare?: ?(u: B, v: B) => number): ?A { compare = compare || (compareNumber: any); var minA = undefined; var minB = undefined; var seenFirst = false; for (var a of as) { var b = f(a); if (!seenFirst || compare(b, (minB: any)) < 0) { minA = a; minB = b; seenFirst = true; } } return minA; } module.exports = minBy;PK �n[��Yq� � flattenArray.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks * */ /** * Returns a flattened array that represents the DFS traversal of the supplied * input array. For example: * * var deep = ["a", ["b", "c"], "d", {"e": [1, 2]}, [["f"], "g"]]; * var flat = flattenArray(deep); * console.log(flat); * > ["a", "b", "c", "d", {"e": [1, 2]}, "f", "g"]; * * @see https://github.com/jonschlinkert/arr-flatten * @copyright 2014-2015 Jon Schlinkert * @license MIT */ function flattenArray(array) { var result = []; flatten(array, result); return result; } function flatten(array, result) { var length = array.length; var ii = 0; while (length--) { var current = array[ii++]; if (Array.isArray(current)) { flatten(current, result); } else { result.push(current); } } } module.exports = flattenArray;PK �n[G�Tz$ $ monitorCodeUse.jsnu �Iw�� /** * Copyright (c) 2014-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ 'use strict'; var invariant = require("./invariant"); /** * Provides open-source compatible instrumentation for monitoring certain API * uses before we're ready to issue a warning or refactor. It accepts an event * name which may only contain the characters [a-z0-9_] and an optional data * object with further information. */ function monitorCodeUse(eventName, data) { !(eventName && !/[^a-z0-9_]/.test(eventName)) ? process.env.NODE_ENV !== "production" ? invariant(false, 'You must provide an eventName using only the characters [a-z0-9_]') : invariant(false) : void 0; } module.exports = monitorCodeUse;PK �n[ �,C C flattenArray.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule flattenArray * @typechecks * @flow */ /** * Returns a flattened array that represents the DFS traversal of the supplied * input array. For example: * * var deep = ["a", ["b", "c"], "d", {"e": [1, 2]}, [["f"], "g"]]; * var flat = flattenArray(deep); * console.log(flat); * > ["a", "b", "c", "d", {"e": [1, 2]}, "f", "g"]; * * @see https://github.com/jonschlinkert/arr-flatten * @copyright 2014-2015 Jon Schlinkert * @license MIT */ function flattenArray(array: Array<any>): Array<any> { const result = []; flatten(array, result); return result; } function flatten(array: Array<any>, result: Array<any>): void { let length = array.length; let ii = 0; while (length--) { const current = array[ii++]; if (Array.isArray(current)) { flatten(current, result); } else { result.push(current); } } } module.exports = flattenArray;PK �n[���v v performanceNow.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var performance = require("./performance"); var loadTime = Date.now(); /** * Detect if we can use `window.performance.now()` and gracefully fallback to * `Date.now()` if it doesn't exist. We need to support Firefox < 15 for now * because of Facebook's testing infrastructure. */ module.exports = performance.now ? function () { return performance.now(); } : function () { return Date.now() - loadTime; };PK �n[5kҶ@ @ focusNode.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ 'use strict'; /** * @param {DOMElement} node input/textarea to focus */ function focusNode(node) { // IE8 can throw "Can't move focus to the control because it is invisible, // not enabled, or of a type that does not accept the focus." for all kinds of // reasons that are too expensive and fragile to test. try { node.focus(); } catch (e) {} } module.exports = focusNode;PK �n[�s �� � monitorCodeUse.js.flownu �Iw�� /** * Copyright (c) 2014-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule monitorCodeUse */ 'use strict'; var invariant = require("./invariant"); /** * Provides open-source compatible instrumentation for monitoring certain API * uses before we're ready to issue a warning or refactor. It accepts an event * name which may only contain the characters [a-z0-9_] and an optional data * object with further information. */ function monitorCodeUse(eventName, data) { invariant(eventName && !/[^a-z0-9_]/.test(eventName), 'You must provide an eventName using only the characters [a-z0-9_]'); } module.exports = monitorCodeUse;PK �n[� U�] ] focusNode.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule focusNode */ 'use strict'; /** * @param {DOMElement} node input/textarea to focus */ function focusNode(node) { // IE8 can throw "Can't move focus to the control because it is invisible, // not enabled, or of a type that does not accept the focus." for all kinds of // reasons that are too expensive and fragile to test. try { node.focus(); } catch (e) {} } module.exports = focusNode;PK �n[�ֳ> > normalizeWheel.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ 'use strict'; var UserAgent = require("./UserAgent"); var isEventSupported = require("./isEventSupported"); // Reasonable defaults var PIXEL_STEP = 10; var LINE_HEIGHT = 40; var PAGE_HEIGHT = 800; /** * Mouse wheel (and 2-finger trackpad) support on the web sucks. It is * complicated, thus this doc is long and (hopefully) detailed enough to answer * your questions. * * If you need to react to the mouse wheel in a predictable way, this code is * like your bestest friend. * hugs * * * As of today, there are 4 DOM event types you can listen to: * * 'wheel' -- Chrome(31+), FF(17+), IE(9+) * 'mousewheel' -- Chrome, IE(6+), Opera, Safari * 'MozMousePixelScroll' -- FF(3.5 only!) (2010-2013) -- don't bother! * 'DOMMouseScroll' -- FF(0.9.7+) since 2003 * * So what to do? The is the best: * * normalizeWheel.getEventType(); * * In your event callback, use this code to get sane interpretation of the * deltas. This code will return an object with properties: * * spinX -- normalized spin speed (use for zoom) - x plane * spinY -- " - y plane * pixelX -- normalized distance (to pixels) - x plane * pixelY -- " - y plane * * Wheel values are provided by the browser assuming you are using the wheel to * scroll a web page by a number of lines or pixels (or pages). Values can vary * significantly on different platforms and browsers, forgetting that you can * scroll at different speeds. Some devices (like trackpads) emit more events * at smaller increments with fine granularity, and some emit massive jumps with * linear speed or acceleration. * * This code does its best to normalize the deltas for you: * * - spin is trying to normalize how far the wheel was spun (or trackpad * dragged). This is super useful for zoom support where you want to * throw away the chunky scroll steps on the PC and make those equal to * the slow and smooth tiny steps on the Mac. Key data: This code tries to * resolve a single slow step on a wheel to 1. * * - pixel is normalizing the desired scroll delta in pixel units. You'll * get the crazy differences between browsers, but at least it'll be in * pixels! * * - positive value indicates scrolling DOWN/RIGHT, negative UP/LEFT. This * should translate to positive value zooming IN, negative zooming OUT. * This matches the newer 'wheel' event. * * Why are there spinX, spinY (or pixels)? * * - spinX is a 2-finger side drag on the trackpad, and a shift + wheel turn * with a mouse. It results in side-scrolling in the browser by default. * * - spinY is what you expect -- it's the classic axis of a mouse wheel. * * - I dropped spinZ/pixelZ. It is supported by the DOM 3 'wheel' event and * probably is by browsers in conjunction with fancy 3D controllers .. but * you know. * * Implementation info: * * Examples of 'wheel' event if you scroll slowly (down) by one step with an * average mouse: * * OS X + Chrome (mouse) - 4 pixel delta (wheelDelta -120) * OS X + Safari (mouse) - N/A pixel delta (wheelDelta -12) * OS X + Firefox (mouse) - 0.1 line delta (wheelDelta N/A) * Win8 + Chrome (mouse) - 100 pixel delta (wheelDelta -120) * Win8 + Firefox (mouse) - 3 line delta (wheelDelta -120) * * On the trackpad: * * OS X + Chrome (trackpad) - 2 pixel delta (wheelDelta -6) * OS X + Firefox (trackpad) - 1 pixel delta (wheelDelta N/A) * * On other/older browsers.. it's more complicated as there can be multiple and * also missing delta values. * * The 'wheel' event is more standard: * * http://www.w3.org/TR/DOM-Level-3-Events/#events-wheelevents * * The basics is that it includes a unit, deltaMode (pixels, lines, pages), and * deltaX, deltaY and deltaZ. Some browsers provide other values to maintain * backward compatibility with older events. Those other values help us * better normalize spin speed. Example of what the browsers provide: * * | event.wheelDelta | event.detail * ------------------+------------------+-------------- * Safari v5/OS X | -120 | 0 * Safari v5/Win7 | -120 | 0 * Chrome v17/OS X | -120 | 0 * Chrome v17/Win7 | -120 | 0 * IE9/Win7 | -120 | undefined * Firefox v4/OS X | undefined | 1 * Firefox v4/Win7 | undefined | 3 * */ function normalizeWheel( /*object*/ event) /*object*/ { var sX = 0, sY = 0, // spinX, spinY pX = 0, pY = 0; // pixelX, pixelY // Legacy if ('detail' in event) { sY = event.detail; } if ('wheelDelta' in event) { sY = -event.wheelDelta / 120; } if ('wheelDeltaY' in event) { sY = -event.wheelDeltaY / 120; } if ('wheelDeltaX' in event) { sX = -event.wheelDeltaX / 120; } // side scrolling on FF with DOMMouseScroll if ('axis' in event && event.axis === event.HORIZONTAL_AXIS) { sX = sY; sY = 0; } pX = sX * PIXEL_STEP; pY = sY * PIXEL_STEP; if ('deltaY' in event) { pY = event.deltaY; } if ('deltaX' in event) { pX = event.deltaX; } if ((pX || pY) && event.deltaMode) { if (event.deltaMode == 1) { // delta in LINE units pX *= LINE_HEIGHT; pY *= LINE_HEIGHT; } else { // delta in PAGE units pX *= PAGE_HEIGHT; pY *= PAGE_HEIGHT; } } // Fall-back if spin cannot be determined if (pX && !sX) { sX = pX < 1 ? -1 : 1; } if (pY && !sY) { sY = pY < 1 ? -1 : 1; } return { spinX: sX, spinY: sY, pixelX: pX, pixelY: pY }; } /** * The best combination if you prefer spinX + spinY normalization. It favors * the older DOMMouseScroll for Firefox, as FF does not include wheelDelta with * 'wheel' event, making spin speed determination impossible. */ normalizeWheel.getEventType = function () /*string*/ { return UserAgent.isBrowser('Firefox') ? 'DOMMouseScroll' : isEventSupported('wheel') ? 'wheel' : 'mousewheel'; }; module.exports = normalizeWheel;PK �n[>6{m m forEachObject.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ 'use strict'; var hasOwnProperty = Object.prototype.hasOwnProperty; /** * Executes the provided `callback` once for each enumerable own property in the * object. The `callback` is invoked with three arguments: * * - the property value * - the property name * - the object being traversed * * Properties that are added after the call to `forEachObject` will not be * visited by `callback`. If the values of existing properties are changed, the * value passed to `callback` will be the value at the time `forEachObject` * visits them. Properties that are deleted before being visited are not * visited. * * @param {?object} object * @param {function} callback * @param {*} context */ function forEachObject(object, callback, context) { for (var name in object) { if (hasOwnProperty.call(object, name)) { callback.call(context, object[name], name, object); } } } module.exports = forEachObject;PK �n[�t�E� � " isInternationalPhoneNumber.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule isInternationalPhoneNumber * * Simple client-side validation of international phone numbers */ const US_NUMBER_RE = /^1\(?\d{3}\)?\d{7}$/; const NORWAY_NUMBER_RE = /^47\d{8}$/; const INTL_NUMBER_RE = /^\d{1,4}\(?\d{2,3}\)?\d{4,}$/; function isInternationalPhoneNumber(number) { number = number.replace(/[\-\s]+/g, '') // strip all spaces and hyphens .replace(/^\+?0{0,2}/, ''); // strip up to 2 leading 0s and + if (number.startsWith('0')) { return false; } if (number.startsWith('1')) { return US_NUMBER_RE.test(number); } if (number.startsWith('47')) { return NORWAY_NUMBER_RE.test(number); } return INTL_NUMBER_RE.test(number); } module.exports = isInternationalPhoneNumber;PK �n[�>i� � forEachObject.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule forEachObject * @typechecks */ 'use strict'; var hasOwnProperty = Object.prototype.hasOwnProperty; /** * Executes the provided `callback` once for each enumerable own property in the * object. The `callback` is invoked with three arguments: * * - the property value * - the property name * - the object being traversed * * Properties that are added after the call to `forEachObject` will not be * visited by `callback`. If the values of existing properties are changed, the * value passed to `callback` will be the value at the time `forEachObject` * visits them. Properties that are deleted before being visited are not * visited. * * @param {?object} object * @param {function} callback * @param {*} context */ function forEachObject(object, callback, context) { for (var name in object) { if (hasOwnProperty.call(object, name)) { callback.call(context, object[name], name, object); } } } module.exports = forEachObject;PK �n[ �r�j j normalizeWheel.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule normalizeWheel * @typechecks */ 'use strict'; const UserAgent = require("./UserAgent"); const isEventSupported = require("./isEventSupported"); // Reasonable defaults const PIXEL_STEP = 10; const LINE_HEIGHT = 40; const PAGE_HEIGHT = 800; /** * Mouse wheel (and 2-finger trackpad) support on the web sucks. It is * complicated, thus this doc is long and (hopefully) detailed enough to answer * your questions. * * If you need to react to the mouse wheel in a predictable way, this code is * like your bestest friend. * hugs * * * As of today, there are 4 DOM event types you can listen to: * * 'wheel' -- Chrome(31+), FF(17+), IE(9+) * 'mousewheel' -- Chrome, IE(6+), Opera, Safari * 'MozMousePixelScroll' -- FF(3.5 only!) (2010-2013) -- don't bother! * 'DOMMouseScroll' -- FF(0.9.7+) since 2003 * * So what to do? The is the best: * * normalizeWheel.getEventType(); * * In your event callback, use this code to get sane interpretation of the * deltas. This code will return an object with properties: * * spinX -- normalized spin speed (use for zoom) - x plane * spinY -- " - y plane * pixelX -- normalized distance (to pixels) - x plane * pixelY -- " - y plane * * Wheel values are provided by the browser assuming you are using the wheel to * scroll a web page by a number of lines or pixels (or pages). Values can vary * significantly on different platforms and browsers, forgetting that you can * scroll at different speeds. Some devices (like trackpads) emit more events * at smaller increments with fine granularity, and some emit massive jumps with * linear speed or acceleration. * * This code does its best to normalize the deltas for you: * * - spin is trying to normalize how far the wheel was spun (or trackpad * dragged). This is super useful for zoom support where you want to * throw away the chunky scroll steps on the PC and make those equal to * the slow and smooth tiny steps on the Mac. Key data: This code tries to * resolve a single slow step on a wheel to 1. * * - pixel is normalizing the desired scroll delta in pixel units. You'll * get the crazy differences between browsers, but at least it'll be in * pixels! * * - positive value indicates scrolling DOWN/RIGHT, negative UP/LEFT. This * should translate to positive value zooming IN, negative zooming OUT. * This matches the newer 'wheel' event. * * Why are there spinX, spinY (or pixels)? * * - spinX is a 2-finger side drag on the trackpad, and a shift + wheel turn * with a mouse. It results in side-scrolling in the browser by default. * * - spinY is what you expect -- it's the classic axis of a mouse wheel. * * - I dropped spinZ/pixelZ. It is supported by the DOM 3 'wheel' event and * probably is by browsers in conjunction with fancy 3D controllers .. but * you know. * * Implementation info: * * Examples of 'wheel' event if you scroll slowly (down) by one step with an * average mouse: * * OS X + Chrome (mouse) - 4 pixel delta (wheelDelta -120) * OS X + Safari (mouse) - N/A pixel delta (wheelDelta -12) * OS X + Firefox (mouse) - 0.1 line delta (wheelDelta N/A) * Win8 + Chrome (mouse) - 100 pixel delta (wheelDelta -120) * Win8 + Firefox (mouse) - 3 line delta (wheelDelta -120) * * On the trackpad: * * OS X + Chrome (trackpad) - 2 pixel delta (wheelDelta -6) * OS X + Firefox (trackpad) - 1 pixel delta (wheelDelta N/A) * * On other/older browsers.. it's more complicated as there can be multiple and * also missing delta values. * * The 'wheel' event is more standard: * * http://www.w3.org/TR/DOM-Level-3-Events/#events-wheelevents * * The basics is that it includes a unit, deltaMode (pixels, lines, pages), and * deltaX, deltaY and deltaZ. Some browsers provide other values to maintain * backward compatibility with older events. Those other values help us * better normalize spin speed. Example of what the browsers provide: * * | event.wheelDelta | event.detail * ------------------+------------------+-------------- * Safari v5/OS X | -120 | 0 * Safari v5/Win7 | -120 | 0 * Chrome v17/OS X | -120 | 0 * Chrome v17/Win7 | -120 | 0 * IE9/Win7 | -120 | undefined * Firefox v4/OS X | undefined | 1 * Firefox v4/Win7 | undefined | 3 * */ function normalizeWheel( /*object*/ event) /*object*/ { let sX = 0, sY = 0, // spinX, spinY pX = 0, pY = 0; // pixelX, pixelY // Legacy if ('detail' in event) { sY = event.detail; } if ('wheelDelta' in event) { sY = -event.wheelDelta / 120; } if ('wheelDeltaY' in event) { sY = -event.wheelDeltaY / 120; } if ('wheelDeltaX' in event) { sX = -event.wheelDeltaX / 120; } // side scrolling on FF with DOMMouseScroll if ('axis' in event && event.axis === event.HORIZONTAL_AXIS) { sX = sY; sY = 0; } pX = sX * PIXEL_STEP; pY = sY * PIXEL_STEP; if ('deltaY' in event) { pY = event.deltaY; } if ('deltaX' in event) { pX = event.deltaX; } if ((pX || pY) && event.deltaMode) { if (event.deltaMode == 1) { // delta in LINE units pX *= LINE_HEIGHT; pY *= LINE_HEIGHT; } else { // delta in PAGE units pX *= PAGE_HEIGHT; pY *= PAGE_HEIGHT; } } // Fall-back if spin cannot be determined if (pX && !sX) { sX = pX < 1 ? -1 : 1; } if (pY && !sY) { sY = pY < 1 ? -1 : 1; } return { spinX: sX, spinY: sY, pixelX: pX, pixelY: pY }; } /** * The best combination if you prefer spinX + spinY normalization. It favors * the older DOMMouseScroll for Firefox, as FF does not include wheelDelta with * 'wheel' event, making spin speed determination impossible. */ normalizeWheel.getEventType = function () /*string*/ { return UserAgent.isBrowser('Firefox') ? 'DOMMouseScroll' : isEventSupported('wheel') ? 'wheel' : 'mousewheel'; }; module.exports = normalizeWheel;PK �n[n��|� � getActiveElement.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ /* eslint-disable fb-www/typeof-undefined */ /** * Same as document.activeElement but wraps in a try-catch block. In IE it is * not safe to call document.activeElement if there is nothing focused. * * The activeElement will be null only if the document or document body is not * yet defined. * * @param {?DOMDocument} doc Defaults to current document. * @return {?DOMElement} */ function getActiveElement(doc) /*?DOMElement*/ { doc = doc || (typeof document !== 'undefined' ? document : undefined); if (typeof doc === 'undefined') { return null; } try { return doc.activeElement || doc.body; } catch (e) { return doc.body; } } module.exports = getActiveElement;PK �n[ � � � isNode.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ /** * @param {*} object The object to check. * @return {boolean} Whether or not the object is a DOM node. */ function isNode(object) { var doc = object ? object.ownerDocument || object : document; var defaultView = doc.defaultView || window; return !!(object && (typeof defaultView.Node === 'function' ? object instanceof defaultView.Node : typeof object === 'object' && typeof object.nodeType === 'number' && typeof object.nodeName === 'string')); } module.exports = isNode;PK �n[�ۼ� � getActiveElement.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule getActiveElement * @typechecks */ /* eslint-disable fb-www/typeof-undefined */ /** * Same as document.activeElement but wraps in a try-catch block. In IE it is * not safe to call document.activeElement if there is nothing focused. * * The activeElement will be null only if the document or document body is not * yet defined. * * @param {?DOMDocument} doc Defaults to current document. * @return {?DOMElement} */ function getActiveElement(doc) /*?DOMElement*/ { doc = doc || (typeof document !== 'undefined' ? document : undefined); if (typeof doc === 'undefined') { return null; } try { return doc.activeElement || doc.body; } catch (e) { return doc.body; } } module.exports = getActiveElement;PK �n[w��a� � removeFromArray.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks * */ /** * Removes an element from an array. */ function removeFromArray(array, element) { var index = array.indexOf(element); if (index !== -1) { array.splice(index, 1); } } module.exports = removeFromArray;PK �n[�t�/V V getByPath.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @typechecks */ 'use strict'; /** * Get a value from an object based on the given path * * Usage example: * * var obj = { * a : { * b : 123 * } * }; * * var result = getByPath(obj, ['a', 'b']); // 123 * * You may also specify the path using an object with a path field * * var result = getByPath(obj, {path: ['a', 'b']}); // 123 * * If the path doesn't exist undefined will be returned * * var result = getByPath(obj, ['x', 'y', 'z']); // undefined */ function getByPath(root /*?Object | Error*/ , path, fallbackValue) { var current = root; for (var i = 0; i < path.length; i++) { var segment = path[i]; // Use 'in' to check entire prototype chain since immutable js records // use prototypes if (current && segment in current) { current = current[segment]; } else { return fallbackValue; } } return current; } module.exports = getByPath;PK �n[�u�?t t nullthrows.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ var nullthrows = function nullthrows(x) { if (x != null) { return x; } throw new Error("Got unexpected null or undefined"); }; module.exports = nullthrows;PK �n[�B)� � getByPath.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule getByPath * @flow * @typechecks */ 'use strict'; /** * Get a value from an object based on the given path * * Usage example: * * var obj = { * a : { * b : 123 * } * }; * * var result = getByPath(obj, ['a', 'b']); // 123 * * You may also specify the path using an object with a path field * * var result = getByPath(obj, {path: ['a', 'b']}); // 123 * * If the path doesn't exist undefined will be returned * * var result = getByPath(obj, ['x', 'y', 'z']); // undefined */ function getByPath(root /*?Object | Error*/ : any, path: Array<string>, fallbackValue?: any): any { let current = root; for (let i = 0; i < path.length; i++) { const segment = path[i]; // Use 'in' to check entire prototype chain since immutable js records // use prototypes if (current && segment in current) { current = current[segment]; } else { return fallbackValue; } } return current; } module.exports = getByPath;PK �n[�={�� � isNode.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule isNode * @typechecks */ /** * @param {*} object The object to check. * @return {boolean} Whether or not the object is a DOM node. */ function isNode(object) { var doc = object ? object.ownerDocument || object : document; var defaultView = doc.defaultView || window; return !!(object && (typeof defaultView.Node === 'function' ? object instanceof defaultView.Node : typeof object === 'object' && typeof object.nodeType === 'number' && typeof object.nodeName === 'string')); } module.exports = isNode;PK �n[���} } getDocumentScrollElement.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ 'use strict'; var isWebkit = typeof navigator !== 'undefined' && navigator.userAgent.indexOf('AppleWebKit') > -1; /** * Gets the element with the document scroll properties such as `scrollLeft` and * `scrollHeight`. This may differ across different browsers. * * NOTE: The return value can be null if the DOM is not yet ready. * * @param {?DOMDocument} doc Defaults to current document. * @return {?DOMElement} */ function getDocumentScrollElement(doc) { doc = doc || document; if (doc.scrollingElement) { return doc.scrollingElement; } return !isWebkit && doc.compatMode === 'CSS1Compat' ? doc.documentElement : doc.body; } module.exports = getDocumentScrollElement;PK �n[�5n8O O hyphenateStyleName.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ 'use strict'; var hyphenate = require("./hyphenate"); var msPattern = /^ms-/; /** * Hyphenates a camelcased CSS property name, for example: * * > hyphenateStyleName('backgroundColor') * < "background-color" * > hyphenateStyleName('MozTransition') * < "-moz-transition" * > hyphenateStyleName('msTransition') * < "-ms-transition" * * As Modernizr suggests (http://modernizr.com/docs/#prefixed), an `ms` prefix * is converted to `-ms-`. * * @param {string} string * @return {string} */ function hyphenateStyleName(string) { return hyphenate(string).replace(msPattern, '-ms-'); } module.exports = hyphenateStyleName;PK �n[�tu� � getDocumentScrollElement.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule getDocumentScrollElement * @typechecks */ 'use strict'; const isWebkit = typeof navigator !== 'undefined' && navigator.userAgent.indexOf('AppleWebKit') > -1; /** * Gets the element with the document scroll properties such as `scrollLeft` and * `scrollHeight`. This may differ across different browsers. * * NOTE: The return value can be null if the DOM is not yet ready. * * @param {?DOMDocument} doc Defaults to current document. * @return {?DOMElement} */ function getDocumentScrollElement(doc) { doc = doc || document; if (doc.scrollingElement) { return doc.scrollingElement; } return !isWebkit && doc.compatMode === 'CSS1Compat' ? doc.documentElement : doc.body; } module.exports = getDocumentScrollElement;PK �n[����� � isTextNode.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var isNode = require("./isNode"); /** * @param {*} object The object to check. * @return {boolean} Whether or not the object is a DOM text node. */ function isTextNode(object) { return isNode(object) && object.nodeType == 3; } module.exports = isTextNode;PK �n[˭r�� � getElementPosition.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var getElementRect = require("./getElementRect"); /** * Gets an element's position in pixels relative to the viewport. The returned * object represents the position of the element's top left corner. * * @param {DOMElement} element * @return {object} */ function getElementPosition(element) { var rect = getElementRect(element); return { x: rect.left, y: rect.top, width: rect.right - rect.left, height: rect.bottom - rect.top }; } module.exports = getElementPosition;PK �n[���� � isTextNode.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule isTextNode * @typechecks */ const isNode = require("./isNode"); /** * @param {*} object The object to check. * @return {boolean} Whether or not the object is a DOM text node. */ function isTextNode(object) { return isNode(object) && object.nodeType == 3; } module.exports = isTextNode;PK �n[���� � getElementPosition.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule getElementPosition * @typechecks */ const getElementRect = require("./getElementRect"); /** * Gets an element's position in pixels relative to the viewport. The returned * object represents the position of the element's top left corner. * * @param {DOMElement} element * @return {object} */ function getElementPosition(element) { const rect = getElementRect(element); return { x: rect.left, y: rect.top, width: rect.right - rect.left, height: rect.bottom - rect.top }; } module.exports = getElementPosition;PK �n[LI ̈ � nullthrows.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule nullthrows * @flow */ var nullthrows = function <T>(x: ?T): T { if (x != null) { return x; } throw new Error("Got unexpected null or undefined"); }; module.exports = nullthrows;PK �n[}S�-8 8 getElementRect.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var containsNode = require("./containsNode"); /** * Gets an element's bounding rect in pixels relative to the viewport. * * @param {DOMElement} elem * @return {object} */ function getElementRect(elem) { var docElem = elem.ownerDocument.documentElement; // FF 2, Safari 3 and Opera 9.5- do not support getBoundingClientRect(). // IE9- will throw if the element is not in the document. if (!('getBoundingClientRect' in elem) || !containsNode(docElem, elem)) { return { left: 0, right: 0, top: 0, bottom: 0 }; } // Subtracts clientTop/Left because IE8- added a 2px border to the // <html> element (see http://fburl.com/1493213). IE 7 in // Quicksmode does not report clientLeft/clientTop so there // will be an unaccounted offset of 2px when in quirksmode var rect = elem.getBoundingClientRect(); return { left: Math.round(rect.left) - docElem.clientLeft, right: Math.round(rect.right) - docElem.clientLeft, top: Math.round(rect.top) - docElem.clientTop, bottom: Math.round(rect.bottom) - docElem.clientTop }; } module.exports = getElementRect;PK �n[�Bز � joinClasses.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @typechecks static-only */ 'use strict'; /** * Combines multiple className strings into one. */ function joinClasses(className) { var newClassName = className || ''; var argLength = arguments.length; if (argLength > 1) { for (var index = 1; index < argLength; index++) { var nextClass = arguments[index]; if (nextClass) { newClassName = (newClassName ? newClassName + ' ' : '') + nextClass; } } } return newClassName; } module.exports = joinClasses;PK �n[u���Q Q getElementRect.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule getElementRect * @typechecks */ const containsNode = require("./containsNode"); /** * Gets an element's bounding rect in pixels relative to the viewport. * * @param {DOMElement} elem * @return {object} */ function getElementRect(elem) { const docElem = elem.ownerDocument.documentElement; // FF 2, Safari 3 and Opera 9.5- do not support getBoundingClientRect(). // IE9- will throw if the element is not in the document. if (!('getBoundingClientRect' in elem) || !containsNode(docElem, elem)) { return { left: 0, right: 0, top: 0, bottom: 0 }; } // Subtracts clientTop/Left because IE8- added a 2px border to the // <html> element (see http://fburl.com/1493213). IE 7 in // Quicksmode does not report clientLeft/clientTop so there // will be an unaccounted offset of 2px when in quirksmode const rect = elem.getBoundingClientRect(); return { left: Math.round(rect.left) - docElem.clientLeft, right: Math.round(rect.right) - docElem.clientLeft, top: Math.round(rect.top) - docElem.clientTop, bottom: Math.round(rect.bottom) - docElem.clientTop }; } module.exports = getElementRect;PK �n[�mls� � partitionArray.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks * */ /** * Partitions an array given a predicate. All elements satisfying the predicate * are part of the first returned array, and all elements that don't are in the * second. */ function partitionArray(array, predicate, context) { var first = []; var second = []; array.forEach(function (element, index) { if (predicate.call(context, element, index, array)) { first.push(element); } else { second.push(element); } }); return [first, second]; } module.exports = partitionArray;PK �n[á*Y Y getMarkupWrap.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ /*eslint-disable fb-www/unsafe-html */ var ExecutionEnvironment = require("./ExecutionEnvironment"); var invariant = require("./invariant"); /** * Dummy container used to detect which wraps are necessary. */ var dummyNode = ExecutionEnvironment.canUseDOM ? document.createElement('div') : null; /** * Some browsers cannot use `innerHTML` to render certain elements standalone, * so we wrap them, render the wrapped nodes, then extract the desired node. * * In IE8, certain elements cannot render alone, so wrap all elements ('*'). */ var shouldWrap = {}; var selectWrap = [1, '<select multiple="true">', '</select>']; var tableWrap = [1, '<table>', '</table>']; var trWrap = [3, '<table><tbody><tr>', '</tr></tbody></table>']; var svgWrap = [1, '<svg xmlns="http://www.w3.org/2000/svg">', '</svg>']; var markupWrap = { '*': [1, '?<div>', '</div>'], 'area': [1, '<map>', '</map>'], 'col': [2, '<table><tbody></tbody><colgroup>', '</colgroup></table>'], 'legend': [1, '<fieldset>', '</fieldset>'], 'param': [1, '<object>', '</object>'], 'tr': [2, '<table><tbody>', '</tbody></table>'], 'optgroup': selectWrap, 'option': selectWrap, 'caption': tableWrap, 'colgroup': tableWrap, 'tbody': tableWrap, 'tfoot': tableWrap, 'thead': tableWrap, 'td': trWrap, 'th': trWrap }; // Initialize the SVG elements since we know they'll always need to be wrapped // consistently. If they are created inside a <div> they will be initialized in // the wrong namespace (and will not display). var svgElements = ['circle', 'clipPath', 'defs', 'ellipse', 'g', 'image', 'line', 'linearGradient', 'mask', 'path', 'pattern', 'polygon', 'polyline', 'radialGradient', 'rect', 'stop', 'text', 'tspan']; svgElements.forEach(function (nodeName) { markupWrap[nodeName] = svgWrap; shouldWrap[nodeName] = true; }); /** * Gets the markup wrap configuration for the supplied `nodeName`. * * NOTE: This lazily detects which wraps are necessary for the current browser. * * @param {string} nodeName Lowercase `nodeName`. * @return {?array} Markup wrap configuration, if applicable. */ function getMarkupWrap(nodeName) { !!!dummyNode ? process.env.NODE_ENV !== "production" ? invariant(false, 'Markup wrapping node not initialized') : invariant(false) : void 0; if (!markupWrap.hasOwnProperty(nodeName)) { nodeName = '*'; } if (!shouldWrap.hasOwnProperty(nodeName)) { if (nodeName === '*') { dummyNode.innerHTML = '<link />'; } else { dummyNode.innerHTML = '<' + nodeName + '></' + nodeName + '>'; } shouldWrap[nodeName] = !dummyNode.firstChild; } return shouldWrap[nodeName] ? markupWrap[nodeName] : null; } module.exports = getMarkupWrap;PK �n[ � �� � joinClasses.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule joinClasses * @flow * @typechecks static-only */ 'use strict'; /** * Combines multiple className strings into one. */ function joinClasses(className: mixed): string { let newClassName = ((className: any): string) || ''; const argLength = arguments.length; if (argLength > 1) { for (let index = 1; index < argLength; index++) { const nextClass = arguments[index]; if (nextClass) { newClassName = (newClassName ? newClassName + ' ' : '') + nextClass; } } } return newClassName; } module.exports = joinClasses;PK �n[�F�* * getMarkupWrap.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule getMarkupWrap */ /*eslint-disable fb-www/unsafe-html */ const ExecutionEnvironment = require("./ExecutionEnvironment"); const invariant = require("./invariant"); /** * Dummy container used to detect which wraps are necessary. */ const dummyNode = ExecutionEnvironment.canUseDOM ? document.createElement('div') : null; /** * Some browsers cannot use `innerHTML` to render certain elements standalone, * so we wrap them, render the wrapped nodes, then extract the desired node. * * In IE8, certain elements cannot render alone, so wrap all elements ('*'). */ const shouldWrap = {}; const selectWrap = [1, '<select multiple="true">', '</select>']; const tableWrap = [1, '<table>', '</table>']; const trWrap = [3, '<table><tbody><tr>', '</tr></tbody></table>']; const svgWrap = [1, '<svg xmlns="http://www.w3.org/2000/svg">', '</svg>']; const markupWrap = { '*': [1, '?<div>', '</div>'], 'area': [1, '<map>', '</map>'], 'col': [2, '<table><tbody></tbody><colgroup>', '</colgroup></table>'], 'legend': [1, '<fieldset>', '</fieldset>'], 'param': [1, '<object>', '</object>'], 'tr': [2, '<table><tbody>', '</tbody></table>'], 'optgroup': selectWrap, 'option': selectWrap, 'caption': tableWrap, 'colgroup': tableWrap, 'tbody': tableWrap, 'tfoot': tableWrap, 'thead': tableWrap, 'td': trWrap, 'th': trWrap }; // Initialize the SVG elements since we know they'll always need to be wrapped // consistently. If they are created inside a <div> they will be initialized in // the wrong namespace (and will not display). const svgElements = ['circle', 'clipPath', 'defs', 'ellipse', 'g', 'image', 'line', 'linearGradient', 'mask', 'path', 'pattern', 'polygon', 'polyline', 'radialGradient', 'rect', 'stop', 'text', 'tspan']; svgElements.forEach(nodeName => { markupWrap[nodeName] = svgWrap; shouldWrap[nodeName] = true; }); /** * Gets the markup wrap configuration for the supplied `nodeName`. * * NOTE: This lazily detects which wraps are necessary for the current browser. * * @param {string} nodeName Lowercase `nodeName`. * @return {?array} Markup wrap configuration, if applicable. */ function getMarkupWrap(nodeName) { invariant(!!dummyNode, 'Markup wrapping node not initialized'); if (!markupWrap.hasOwnProperty(nodeName)) { nodeName = '*'; } if (!shouldWrap.hasOwnProperty(nodeName)) { if (nodeName === '*') { dummyNode.innerHTML = '<link />'; } else { dummyNode.innerHTML = '<' + nodeName + '></' + nodeName + '>'; } shouldWrap[nodeName] = !dummyNode.firstChild; } return shouldWrap[nodeName] ? markupWrap[nodeName] : null; } module.exports = getMarkupWrap;PK �n[s��nU U partitionArray.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule partitionArray * @typechecks * @flow */ /** * Partitions an array given a predicate. All elements satisfying the predicate * are part of the first returned array, and all elements that don't are in the * second. */ function partitionArray<Tv>(array: Array<Tv>, predicate: (value: Tv, index: number, array: Array<Tv>) => boolean, context?: any): [Array<Tv>, Array<Tv>] { var first = []; var second = []; array.forEach((element, index) => { if (predicate.call(context, element, index, array)) { first.push(element); } else { second.push(element); } }); return [first, second]; } module.exports = partitionArray;PK �n[�) |D D getScrollPosition.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ 'use strict'; var getDocumentScrollElement = require("./getDocumentScrollElement"); var getUnboundedScrollPosition = require("./getUnboundedScrollPosition"); /** * Gets the scroll position of the supplied element or window. * * The return values are bounded. This means that if the scroll position is * negative or exceeds the element boundaries (which is possible using inertial * scrolling), you will get zero or the maximum scroll position, respectively. * * If you need the unbound scroll position, use `getUnboundedScrollPosition`. * * @param {DOMWindow|DOMElement} scrollable * @return {object} Map with `x` and `y` keys. */ function getScrollPosition(scrollable) { var documentScrollElement = getDocumentScrollElement(scrollable.ownerDocument || scrollable.document); if (scrollable.Window && scrollable instanceof scrollable.Window) { scrollable = documentScrollElement; } var scrollPosition = getUnboundedScrollPosition(scrollable); var viewport = scrollable === documentScrollElement ? scrollable.ownerDocument.documentElement : scrollable; var xMax = scrollable.scrollWidth - viewport.clientWidth; var yMax = scrollable.scrollHeight - viewport.clientHeight; scrollPosition.x = Math.max(0, Math.min(scrollPosition.x, xMax)); scrollPosition.y = Math.max(0, Math.min(scrollPosition.y, yMax)); return scrollPosition; } module.exports = getScrollPosition;PK �n[t�>xp p keyMirror.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks static-only * */ 'use strict'; var invariant = require("./invariant"); /** * Constructs an enumeration with keys equal to their value. * * For example: * * var COLORS = keyMirror({blue: null, red: null}); * var myColor = COLORS.blue; * var isColorValid = !!COLORS[myColor]; * * The last line could not be performed if the values of the generated enum were * not equal to their keys. * * Input: {key1: val1, key2: val2} * Output: {key1: key1, key2: key2} * * @param {object} obj * @return {object} */ var keyMirror = function keyMirror(obj) { var ret = {}; var key; !(obj instanceof Object && !Array.isArray(obj)) ? process.env.NODE_ENV !== "production" ? invariant(false, 'keyMirror(...): Argument must be an object.') : invariant(false) : void 0; for (key in obj) { if (!obj.hasOwnProperty(key)) { continue; } ret[key] = key; } return ret; }; module.exports = keyMirror;PK �n[�`��w w getScrollPosition.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule getScrollPosition * @typechecks */ 'use strict'; const getDocumentScrollElement = require("./getDocumentScrollElement"); const getUnboundedScrollPosition = require("./getUnboundedScrollPosition"); /** * Gets the scroll position of the supplied element or window. * * The return values are bounded. This means that if the scroll position is * negative or exceeds the element boundaries (which is possible using inertial * scrolling), you will get zero or the maximum scroll position, respectively. * * If you need the unbound scroll position, use `getUnboundedScrollPosition`. * * @param {DOMWindow|DOMElement} scrollable * @return {object} Map with `x` and `y` keys. */ function getScrollPosition(scrollable) { const documentScrollElement = getDocumentScrollElement(scrollable.ownerDocument || scrollable.document); if (scrollable.Window && scrollable instanceof scrollable.Window) { scrollable = documentScrollElement; } const scrollPosition = getUnboundedScrollPosition(scrollable); const viewport = scrollable === documentScrollElement ? scrollable.ownerDocument.documentElement : scrollable; const xMax = scrollable.scrollWidth - viewport.clientWidth; const yMax = scrollable.scrollHeight - viewport.clientHeight; scrollPosition.x = Math.max(0, Math.min(scrollPosition.x, xMax)); scrollPosition.y = Math.max(0, Math.min(scrollPosition.y, yMax)); return scrollPosition; } module.exports = getScrollPosition;PK �n[���ך � partitionObject.jsnu �Iw�� /** * Copyright 2015-present Facebook. All Rights Reserved. * * @typechecks * */ 'use strict'; var forEachObject = require("./forEachObject"); /** * Partitions an object given a predicate. All elements satisfying the predicate * are part of the first returned object, and all elements that don't are in the * second. */ function partitionObject(object, callback, context) { var first = {}; var second = {}; forEachObject(object, function (value, key) { if (callback.call(context, value, key, object)) { first[key] = value; } else { second[key] = value; } }); return [first, second]; } module.exports = partitionObject;PK �n[ʽ��� � getStyleProperty.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var camelize = require("./camelize"); var hyphenate = require("./hyphenate"); function asString(value) /*?string*/ { return value == null ? value : String(value); } function getStyleProperty( /*DOMNode*/ node, /*string*/ name) /*?string*/ { var computedStyle; // W3C Standard if (window.getComputedStyle) { // In certain cases such as within an iframe in FF3, this returns null. computedStyle = window.getComputedStyle(node, null); if (computedStyle) { return asString(computedStyle.getPropertyValue(hyphenate(name))); } } // Safari if (document.defaultView && document.defaultView.getComputedStyle) { computedStyle = document.defaultView.getComputedStyle(node, null); // A Safari bug causes this to return null for `display: none` elements. if (computedStyle) { return asString(computedStyle.getPropertyValue(hyphenate(name))); } if (name === 'display') { return 'none'; } } // Internet Explorer if (node.currentStyle) { if (name === 'float') { return asString(node.currentStyle.cssFloat || node.currentStyle.styleFloat); } return asString(node.currentStyle[camelize(name)]); } return asString(node.style && node.style[camelize(name)]); } module.exports = getStyleProperty;PK �n[���^ ^ keyMirror.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule keyMirror * @typechecks static-only * @flow */ 'use strict'; var invariant = require("./invariant"); /** * Constructs an enumeration with keys equal to their value. * * For example: * * var COLORS = keyMirror({blue: null, red: null}); * var myColor = COLORS.blue; * var isColorValid = !!COLORS[myColor]; * * The last line could not be performed if the values of the generated enum were * not equal to their keys. * * Input: {key1: val1, key2: val2} * Output: {key1: key1, key2: key2} * * @param {object} obj * @return {object} */ var keyMirror = function <T: {}>(obj: T): $ObjMapi<T, <K>(K) => K> { var ret = {}; var key; invariant(obj instanceof Object && !Array.isArray(obj), 'keyMirror(...): Argument must be an object.'); for (key in obj) { if (!obj.hasOwnProperty(key)) { continue; } ret[key] = key; } return ret; }; module.exports = keyMirror;PK �n[�cH� � getStyleProperty.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule getStyleProperty * @typechecks */ const camelize = require("./camelize"); const hyphenate = require("./hyphenate"); function asString(value) /*?string*/ { return value == null ? value : String(value); } function getStyleProperty( /*DOMNode*/ node, /*string*/ name) /*?string*/ { let computedStyle; // W3C Standard if (window.getComputedStyle) { // In certain cases such as within an iframe in FF3, this returns null. computedStyle = window.getComputedStyle(node, null); if (computedStyle) { return asString(computedStyle.getPropertyValue(hyphenate(name))); } } // Safari if (document.defaultView && document.defaultView.getComputedStyle) { computedStyle = document.defaultView.getComputedStyle(node, null); // A Safari bug causes this to return null for `display: none` elements. if (computedStyle) { return asString(computedStyle.getPropertyValue(hyphenate(name))); } if (name === 'display') { return 'none'; } } // Internet Explorer if (node.currentStyle) { if (name === 'float') { return asString(node.currentStyle.cssFloat || node.currentStyle.styleFloat); } return asString(node.currentStyle[camelize(name)]); } return asString(node.style && node.style[camelize(name)]); } module.exports = getStyleProperty;PK �n[V��y y hyphenateStyleName.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule hyphenateStyleName * @typechecks */ 'use strict'; const hyphenate = require("./hyphenate"); const msPattern = /^ms-/; /** * Hyphenates a camelcased CSS property name, for example: * * > hyphenateStyleName('backgroundColor') * < "background-color" * > hyphenateStyleName('MozTransition') * < "-moz-transition" * > hyphenateStyleName('msTransition') * < "-ms-transition" * * As Modernizr suggests (http://modernizr.com/docs/#prefixed), an `ms` prefix * is converted to `-ms-`. * * @param {string} string * @return {string} */ function hyphenateStyleName(string) { return hyphenate(string).replace(msPattern, '-ms-'); } module.exports = hyphenateStyleName;PK �n[� �� � getUnboundedScrollPosition.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ 'use strict'; /** * Gets the scroll position of the supplied element or window. * * The return values are unbounded, unlike `getScrollPosition`. This means they * may be negative or exceed the element boundaries (which is possible using * inertial scrolling). * * @param {DOMWindow|DOMElement} scrollable * @return {object} Map with `x` and `y` keys. */ function getUnboundedScrollPosition(scrollable) { if (scrollable.Window && scrollable instanceof scrollable.Window) { return { x: scrollable.pageXOffset || scrollable.document.documentElement.scrollLeft, y: scrollable.pageYOffset || scrollable.document.documentElement.scrollTop }; } return { x: scrollable.scrollLeft, y: scrollable.scrollTop }; } module.exports = getUnboundedScrollPosition;PK �n[�� invariant.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ 'use strict'; var validateFormat = process.env.NODE_ENV !== "production" ? function (format) { if (format === undefined) { throw new Error('invariant(...): Second argument must be a string.'); } } : function (format) {}; /** * Use invariant() to assert state which your program assumes to be true. * * Provide sprintf-style format (only %s is supported) and arguments to provide * information about what broke and what you were expecting. * * The invariant message will be stripped in production, but the invariant will * remain to ensure logic does not differ in production. */ function invariant(condition, format) { for (var _len = arguments.length, args = new Array(_len > 2 ? _len - 2 : 0), _key = 2; _key < _len; _key++) { args[_key - 2] = arguments[_key]; } validateFormat(format); if (!condition) { var error; if (format === undefined) { error = new Error('Minified exception occurred; use the non-minified dev environment ' + 'for the full error message and additional helpful warnings.'); } else { var argIndex = 0; error = new Error(format.replace(/%s/g, function () { return String(args[argIndex++]); })); error.name = 'Invariant Violation'; } error.framesToPop = 1; // Skip invariant's own stack frame. throw error; } } module.exports = invariant;PK �n[�73�- - resolveImmediate.jsnu �Iw�� "use strict"; var Promise = require("./Promise"); /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * */ var resolvedPromise = Promise.resolve(); /** * An alternative to setImmediate based on Promise. */ function resolveImmediate(callback) { resolvedPromise.then(callback)["catch"](throwNext); } function throwNext(error) { setTimeout(function () { throw error; }, 0); } module.exports = resolveImmediate;PK �n[�_�� " getUnboundedScrollPosition.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule getUnboundedScrollPosition * @typechecks */ 'use strict'; /** * Gets the scroll position of the supplied element or window. * * The return values are unbounded, unlike `getScrollPosition`. This means they * may be negative or exceed the element boundaries (which is possible using * inertial scrolling). * * @param {DOMWindow|DOMElement} scrollable * @return {object} Map with `x` and `y` keys. */ function getUnboundedScrollPosition(scrollable) { if (scrollable.Window && scrollable instanceof scrollable.Window) { return { x: scrollable.pageXOffset || scrollable.document.documentElement.scrollLeft, y: scrollable.pageYOffset || scrollable.document.documentElement.scrollTop }; } return { x: scrollable.scrollLeft, y: scrollable.scrollTop }; } module.exports = getUnboundedScrollPosition;PK �n[/���� � keyMirrorRecursive.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * weak * @typechecks */ 'use strict'; var invariant = require("./invariant"); /** * Constructs an enumeration with keys equal to their value. If the value is an * object, the method is run recursively, including the parent key as a suffix. * An optional prefix can be provided that will be prepended to each value. * * For example: * * var ACTIONS = keyMirror({FOO: null, BAR: { BAZ: null, BOZ: null }}}); * ACTIONS.BAR.BAZ = 'BAR.BAZ'; * * Input: {key1: null, key2: { nested1: null, nested2: null }}} * Output: {key1: key1, key2: { nested1: nested1, nested2: nested2 }}} * * var CONSTANTS = keyMirror({FOO: {BAR: null}}, 'NameSpace'); * console.log(CONSTANTS.FOO.BAR); // NameSpace.FOO.BAR */ function keyMirrorRecursive(obj, prefix) { return keyMirrorRecursiveInternal(obj, prefix); } function keyMirrorRecursiveInternal( /*object*/ obj, /*?string*/ prefix) /*object*/ { var ret = {}; var key; !isObject(obj) ? process.env.NODE_ENV !== "production" ? invariant(false, 'keyMirrorRecursive(...): Argument must be an object.') : invariant(false) : void 0; for (key in obj) { if (!obj.hasOwnProperty(key)) { continue; } var val = obj[key]; var newPrefix = prefix ? prefix + '.' + key : key; if (isObject(val)) { val = keyMirrorRecursiveInternal(val, newPrefix); } else { val = newPrefix; } ret[key] = val; } return ret; } function isObject(obj) /*boolean*/ { return obj instanceof Object && !Array.isArray(obj); } module.exports = keyMirrorRecursive;PK �n[��A�� � getVendorPrefixedName.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ var ExecutionEnvironment = require("./ExecutionEnvironment"); var UserAgent = require("./UserAgent"); var camelize = require("./camelize"); var invariant = require("./invariant"); var memoized = {}; var prefixes = ['Webkit', 'ms', 'Moz', 'O']; var prefixRegex = new RegExp('^(' + prefixes.join('|') + ')'); var testStyle = ExecutionEnvironment.canUseDOM ? document.createElement('div').style : {}; function getWithPrefix(name) { for (var i = 0; i < prefixes.length; i++) { var prefixedName = prefixes[i] + name; if (prefixedName in testStyle) { return prefixedName; } } return null; } function guessVendorPrefixedNameFromUserAgent(name) { switch (name) { case 'lineClamp': if (UserAgent.isEngine('WebKit >= 315.14.2')) { return 'WebkitLineClamp'; } return null; default: return null; } } /** * @param {string} property Name of a css property to check for. * @return {?string} property name supported in the browser, or null if not * supported. */ function getVendorPrefixedName(property) { var name = camelize(property); if (memoized[name] === undefined) { var capitalizedName = name.charAt(0).toUpperCase() + name.slice(1); if (prefixRegex.test(capitalizedName)) { !false ? process.env.NODE_ENV !== "production" ? invariant(false, 'getVendorPrefixedName must only be called with unprefixed' + 'CSS property names. It was called with %s', property) : invariant(false) : void 0; } if (ExecutionEnvironment.canUseDOM) { memoized[name] = name in testStyle ? name : getWithPrefix(capitalizedName); } else { memoized[name] = guessVendorPrefixedNameFromUserAgent(name); } } return memoized[name]; } module.exports = getVendorPrefixedName;PK �n[��(�� � invariant.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule invariant * @flow */ 'use strict'; declare var __DEV__: boolean; const validateFormat = __DEV__ ? function (format: mixed): void { if (format === undefined) { throw new Error('invariant(...): Second argument must be a string.'); } } : function (format: mixed): void {}; /** * Use invariant() to assert state which your program assumes to be true. * * Provide sprintf-style format (only %s is supported) and arguments to provide * information about what broke and what you were expecting. * * The invariant message will be stripped in production, but the invariant will * remain to ensure logic does not differ in production. */ function invariant(condition: mixed, format: string, ...args: Array<mixed>): void { validateFormat(format); if (!condition) { let error; if (format === undefined) { error = new Error('Minified exception occurred; use the non-minified dev environment ' + 'for the full error message and additional helpful warnings.'); } else { let argIndex = 0; error = new Error(format.replace(/%s/g, () => String(args[argIndex++]))); error.name = 'Invariant Violation'; } (error: any).framesToPop = 1; // Skip invariant's own stack frame. throw error; } } module.exports = invariant;PK �n[_�z� � getVendorPrefixedName.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule getVendorPrefixedName * @typechecks */ const ExecutionEnvironment = require("./ExecutionEnvironment"); const UserAgent = require("./UserAgent"); const camelize = require("./camelize"); const invariant = require("./invariant"); const memoized = {}; const prefixes = ['Webkit', 'ms', 'Moz', 'O']; const prefixRegex = new RegExp('^(' + prefixes.join('|') + ')'); const testStyle = ExecutionEnvironment.canUseDOM ? document.createElement('div').style : {}; function getWithPrefix(name) { for (let i = 0; i < prefixes.length; i++) { const prefixedName = prefixes[i] + name; if (prefixedName in testStyle) { return prefixedName; } } return null; } function guessVendorPrefixedNameFromUserAgent(name) { switch (name) { case 'lineClamp': if (UserAgent.isEngine('WebKit >= 315.14.2')) { return 'WebkitLineClamp'; } return null; default: return null; } } /** * @param {string} property Name of a css property to check for. * @return {?string} property name supported in the browser, or null if not * supported. */ function getVendorPrefixedName(property) { const name = camelize(property); if (memoized[name] === undefined) { const capitalizedName = name.charAt(0).toUpperCase() + name.slice(1); if (prefixRegex.test(capitalizedName)) { invariant(false, 'getVendorPrefixedName must only be called with unprefixed' + 'CSS property names. It was called with %s', property); } if (ExecutionEnvironment.canUseDOM) { memoized[name] = name in testStyle ? name : getWithPrefix(capitalizedName); } else { memoized[name] = guessVendorPrefixedNameFromUserAgent(name); } } return memoized[name]; } module.exports = getVendorPrefixedName;PK �n[_��� � keyMirrorRecursive.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule keyMirrorRecursive * @flow weak * @typechecks */ 'use strict'; var invariant = require("./invariant"); /** * Constructs an enumeration with keys equal to their value. If the value is an * object, the method is run recursively, including the parent key as a suffix. * An optional prefix can be provided that will be prepended to each value. * * For example: * * var ACTIONS = keyMirror({FOO: null, BAR: { BAZ: null, BOZ: null }}}); * ACTIONS.BAR.BAZ = 'BAR.BAZ'; * * Input: {key1: null, key2: { nested1: null, nested2: null }}} * Output: {key1: key1, key2: { nested1: nested1, nested2: nested2 }}} * * var CONSTANTS = keyMirror({FOO: {BAR: null}}, 'NameSpace'); * console.log(CONSTANTS.FOO.BAR); // NameSpace.FOO.BAR */ function keyMirrorRecursive<T>(obj: T, prefix?: ?string): T { return keyMirrorRecursiveInternal(obj, prefix); } function keyMirrorRecursiveInternal( /*object*/ obj, /*?string*/ prefix) /*object*/ { var ret = {}; var key; invariant(isObject(obj), 'keyMirrorRecursive(...): Argument must be an object.'); for (key in obj) { if (!obj.hasOwnProperty(key)) { continue; } var val = obj[key]; var newPrefix = prefix ? prefix + '.' + key : key; if (isObject(val)) { val = keyMirrorRecursiveInternal(val, newPrefix); } else { val = newPrefix; } ret[key] = val; } return ret; } function isObject(obj) /*boolean*/ { return obj instanceof Object && !Array.isArray(obj); } module.exports = keyMirrorRecursive;PK �n[�1�� � getViewportDimensions.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @typechecks */ function getViewportWidth() { var width; if (document.documentElement) { width = document.documentElement.clientWidth; } if (!width && document.body) { width = document.body.clientWidth; } return width || 0; } function getViewportHeight() { var height; if (document.documentElement) { height = document.documentElement.clientHeight; } if (!height && document.body) { height = document.body.clientHeight; } return height || 0; } /** * Gets the viewport dimensions including any scrollbars. */ function getViewportDimensions() { return { width: window.innerWidth || getViewportWidth(), height: window.innerHeight || getViewportHeight() }; } /** * Gets the viewport dimensions excluding any scrollbars. */ getViewportDimensions.withoutScrollbars = function () { return { width: getViewportWidth(), height: getViewportHeight() }; }; module.exports = getViewportDimensions;PK �n[B�� isEmail.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ // good approximation of RFC 2822 // http://www.regular-expressions.info/email.html var re = /^[\w!#\$%&'\*\+\/\=\?\^`\{\|\}~\-]+(:?\.[\w!#\$%&'\*\+\/\=\?\^`\{\|\}~\-]+)*@(?:[a-z0-9](?:[a-z0-9\-]*[a-z0-9])?\.)+[a-z0-9](?:[a-z0-9\-]*[a-z0-9])?$/i; function isEmail(email) { return re.test(email); } module.exports = isEmail;PK �n[_�Wp p setImmediate.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ 'use strict'; // setimmediate adds setImmediate to the global. We want to make sure we export // the actual function. require("setimmediate"); module.exports = global.setImmediate;PK �n[\�њ* * getViewportDimensions.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule getViewportDimensions * @flow * @typechecks */ type ViewportDimensions = { width: number, height: number, }; function getViewportWidth(): number { let width; if (document.documentElement) { width = document.documentElement.clientWidth; } if (!width && document.body) { width = document.body.clientWidth; } return width || 0; } function getViewportHeight(): number { let height; if (document.documentElement) { height = document.documentElement.clientHeight; } if (!height && document.body) { height = document.body.clientHeight; } return height || 0; } /** * Gets the viewport dimensions including any scrollbars. */ function getViewportDimensions(): ViewportDimensions { return { width: window.innerWidth || getViewportWidth(), height: window.innerHeight || getViewportHeight() }; } /** * Gets the viewport dimensions excluding any scrollbars. */ getViewportDimensions.withoutScrollbars = function (): ViewportDimensions { return { width: getViewportWidth(), height: getViewportHeight() }; }; module.exports = getViewportDimensions;PK �n[�T�1 1 someSet.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule someSet * @flow * @typechecks */ 'use strict'; import type Set from "./Set"; /** * The someSet() method tests whether some elements in the given Set pass the * test implemented by the provided function. */ function someSet<T>(set: Set<T>, callback: (value: T, key: T, set: Set<T>) => boolean, context?: any): boolean { var iterator = set.entries(); var current = iterator.next(); while (!current.done) { var entry = current.value; if (callback.call(context, entry[1], entry[0], set)) { return true; } current = iterator.next(); } return false; } module.exports = someSet;PK �n[>� �� � someSet.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @typechecks */ 'use strict'; /** * The someSet() method tests whether some elements in the given Set pass the * test implemented by the provided function. */ function someSet(set, callback, context) { var iterator = set.entries(); var current = iterator.next(); while (!current.done) { var entry = current.value; if (callback.call(context, entry[1], entry[0], set)) { return true; } current = iterator.next(); } return false; } module.exports = someSet;PK �n[��%� � nativeRequestAnimationFrame.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ var nativeRequestAnimationFrame = global.requestAnimationFrame || global.webkitRequestAnimationFrame || global.mozRequestAnimationFrame || global.oRequestAnimationFrame || global.msRequestAnimationFrame; module.exports = nativeRequestAnimationFrame;PK �n["��G� � # nativeRequestAnimationFrame.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule nativeRequestAnimationFrame */ const nativeRequestAnimationFrame = global.requestAnimationFrame || global.webkitRequestAnimationFrame || global.mozRequestAnimationFrame || global.oRequestAnimationFrame || global.msRequestAnimationFrame; module.exports = nativeRequestAnimationFrame;PK �n[�<C�Y Y partitionObject.js.flownu �Iw�� /** * Copyright 2015-present Facebook. All Rights Reserved. * * @providesModule partitionObject * @typechecks * @flow */ 'use strict'; var forEachObject = require("./forEachObject"); /** * Partitions an object given a predicate. All elements satisfying the predicate * are part of the first returned object, and all elements that don't are in the * second. */ function partitionObject<Tv>(object: { [key: string]: Tv }, callback: (value: Tv, key: string, object: { [key: string]: Tv }) => boolean, context?: any): [{ [key: string]: Tv }, { [key: string]: Tv }] { var first = {}; var second = {}; forEachObject(object, (value, key) => { if (callback.call(context, value, key, object)) { first[key] = value; } else { second[key] = value; } }); return [first, second]; } module.exports = partitionObject;PK �n[�]�X X partitionObjectByKey.jsnu �Iw�� /** * Copyright 2015-present Facebook. All Rights Reserved. * * @typechecks * */ 'use strict'; var partitionObject = require("./partitionObject"); /** * Partitions the enumerable properties of an object into two objects, given a * whitelist `Set` for the first object. This is comparable to * `whitelistObjectKeys`, but eventually keeping all the keys. Returns a tuple * of objects `[first, second]`. */ function partitionObjectByKey(source, whitelist) { return partitionObject(source, function (_, key) { return whitelist.has(key); }); } module.exports = partitionObjectByKey;PK �n[����� � partitionObjectByKey.js.flownu �Iw�� /** * Copyright 2015-present Facebook. All Rights Reserved. * * @providesModule partitionObjectByKey * @typechecks * @flow */ 'use strict'; import type Set from "./Set"; var partitionObject = require("./partitionObject"); /** * Partitions the enumerable properties of an object into two objects, given a * whitelist `Set` for the first object. This is comparable to * `whitelistObjectKeys`, but eventually keeping all the keys. Returns a tuple * of objects `[first, second]`. */ function partitionObjectByKey(source: Object, whitelist: Set<string>): [Object, Object] { return partitionObject(source, (_, key) => whitelist.has(key)); } module.exports = partitionObjectByKey;PK �n[�� Ee e performanceNow.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule performanceNow * @typechecks */ const performance = require("./performance"); const loadTime = Date.now(); /** * Detect if we can use `window.performance.now()` and gracefully fallback to * `Date.now()` if it doesn't exist. We need to support Firefox < 15 for now * because of Facebook's testing infrastructure. */ module.exports = performance.now ? () => performance.now() : () => Date.now() - loadTime;PK �n[�c��� � removeFromArray.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule removeFromArray * @typechecks * @flow */ /** * Removes an element from an array. */ function removeFromArray<T>(array: Array<T>, element: T): void { var index = array.indexOf(element); if (index !== -1) { array.splice(index, 1); } } module.exports = removeFromArray;PK �n[��j requestAnimationFrame.jsnu �Iw�� "use strict"; /** * Copyright (c) 2014-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ module.exports = require("./requestAnimationFramePolyfill");PK �n[���. requestAnimationFrame.js.flownu �Iw�� /** * Copyright (c) 2014-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule requestAnimationFrame */ module.exports = require("./requestAnimationFramePolyfill");PK �n[���� requestAnimationFramePolyfill.jsnu �Iw�� "use strict"; /** * Copyright (c) 2014-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ var emptyFunction = require("./emptyFunction"); var nativeRequestAnimationFrame = require("./nativeRequestAnimationFrame"); var lastTime = 0; var requestAnimationFrame = nativeRequestAnimationFrame || function (callback) { var currTime = Date.now(); var timeDelay = Math.max(0, 16 - (currTime - lastTime)); lastTime = currTime + timeDelay; return global.setTimeout(function () { callback(Date.now()); }, timeDelay); }; // Works around a rare bug in Safari 6 where the first request is never invoked. requestAnimationFrame(emptyFunction); module.exports = requestAnimationFrame;PK �n[�? ? % requestAnimationFramePolyfill.js.flownu �Iw�� /** * Copyright (c) 2014-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule requestAnimationFramePolyfill */ var emptyFunction = require("./emptyFunction"); var nativeRequestAnimationFrame = require("./nativeRequestAnimationFrame"); var lastTime = 0; var requestAnimationFrame = nativeRequestAnimationFrame || function (callback) { var currTime = Date.now(); var timeDelay = Math.max(0, 16 - (currTime - lastTime)); lastTime = currTime + timeDelay; return global.setTimeout(function () { callback(Date.now()); }, timeDelay); }; // Works around a rare bug in Safari 6 where the first request is never invoked. requestAnimationFrame(emptyFunction); module.exports = requestAnimationFrame;PK �n[U���, , resolveImmediate.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule resolveImmediate * @flow */ const resolvedPromise = Promise.resolve(); /** * An alternative to setImmediate based on Promise. */ function resolveImmediate(callback: () => any): void { resolvedPromise.then(callback).catch(throwNext); } function throwNext(error) { setTimeout(() => { throw error; }, 0); } module.exports = resolveImmediate;PK �n[�m�ΐ � setImmediate.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule setImmediate */ 'use strict'; // setimmediate adds setImmediate to the global. We want to make sure we export // the actual function. require("setimmediate"); module.exports = global.setImmediate;PK �n[ȿ �O O shallowEqual.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks * */ /*eslint-disable no-self-compare */ 'use strict'; var hasOwnProperty = Object.prototype.hasOwnProperty; /** * inlined Object.is polyfill to avoid requiring consumers ship their own * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is */ function is(x, y) { // SameValue algorithm if (x === y) { // Steps 1-5, 7-10 // Steps 6.b-6.e: +0 != -0 // Added the nonzero y check to make Flow happy, but it is redundant return x !== 0 || y !== 0 || 1 / x === 1 / y; } else { // Step 6.a: NaN == NaN return x !== x && y !== y; } } /** * Performs equality by iterating through keys on an object and returning false * when any key has values which are not strictly equal between the arguments. * Returns true when the values of all keys are strictly equal. */ function shallowEqual(objA, objB) { if (is(objA, objB)) { return true; } if (typeof objA !== 'object' || objA === null || typeof objB !== 'object' || objB === null) { return false; } var keysA = Object.keys(objA); var keysB = Object.keys(objB); if (keysA.length !== keysB.length) { return false; } // Test for A's keys different from B. for (var i = 0; i < keysA.length; i++) { if (!hasOwnProperty.call(objB, keysA[i]) || !is(objA[keysA[i]], objB[keysA[i]])) { return false; } } return true; } module.exports = shallowEqual;PK �n[H�� � � shallowEqual.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule shallowEqual * @typechecks * @flow */ /*eslint-disable no-self-compare */ 'use strict'; const hasOwnProperty = Object.prototype.hasOwnProperty; /** * inlined Object.is polyfill to avoid requiring consumers ship their own * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is */ function is(x: mixed, y: mixed): boolean { // SameValue algorithm if (x === y) { // Steps 1-5, 7-10 // Steps 6.b-6.e: +0 != -0 // Added the nonzero y check to make Flow happy, but it is redundant return x !== 0 || y !== 0 || 1 / x === 1 / y; } else { // Step 6.a: NaN == NaN return x !== x && y !== y; } } /** * Performs equality by iterating through keys on an object and returning false * when any key has values which are not strictly equal between the arguments. * Returns true when the values of all keys are strictly equal. */ function shallowEqual(objA: mixed, objB: mixed): boolean { if (is(objA, objB)) { return true; } if (typeof objA !== 'object' || objA === null || typeof objB !== 'object' || objB === null) { return false; } const keysA = Object.keys(objA); const keysB = Object.keys(objB); if (keysA.length !== keysB.length) { return false; } // Test for A's keys different from B. for (let i = 0; i < keysA.length; i++) { if (!hasOwnProperty.call(objB, keysA[i]) || !is(objA[keysA[i]], objB[keysA[i]])) { return false; } } return true; } module.exports = shallowEqual;PK �n[�$��� � someObject.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @typechecks */ 'use strict'; var hasOwnProperty = Object.prototype.hasOwnProperty; /** * Executes the provided `callback` once for each enumerable own property in the * object until it finds one where callback returns a truthy value. If such a * property is found, `someObject` immediately returns true. Otherwise, it * returns false. * * The `callback` is invoked with three arguments: * * - the property value * - the property name * - the object being traversed * * Properties that are added after the call to `someObject` will not be * visited by `callback`. If the values of existing properties are changed, the * value passed to `callback` will be the value at the time `someObject` * visits them. Properties that are deleted before being visited are not * visited. */ function someObject(object, callback, context) { for (var name in object) { if (hasOwnProperty.call(object, name)) { if (callback.call(context, object[name], name, object)) { return true; } } } return false; } module.exports = someObject;PK �n[,�r[ [ someObject.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule someObject * @flow * @typechecks */ 'use strict'; var hasOwnProperty = Object.prototype.hasOwnProperty; /** * Executes the provided `callback` once for each enumerable own property in the * object until it finds one where callback returns a truthy value. If such a * property is found, `someObject` immediately returns true. Otherwise, it * returns false. * * The `callback` is invoked with three arguments: * * - the property value * - the property name * - the object being traversed * * Properties that are added after the call to `someObject` will not be * visited by `callback`. If the values of existing properties are changed, the * value passed to `callback` will be the value at the time `someObject` * visits them. Properties that are deleted before being visited are not * visited. */ function someObject(object: ?Object, callback: (value: any, name: string, object: Object) => any, context?: any): boolean { for (var name in object) { if (hasOwnProperty.call(object, name)) { if (callback.call(context, object[name], name, object)) { return true; } } } return false; } module.exports = someObject;PK �n[���_ _ sprintf.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule sprintf * @typechecks */ /** * Simple function for formatting strings. * * Replaces placeholders with values passed as extra arguments * * @param {string} format the base string * @param ...args the values to insert * @return {string} the replaced string */ function sprintf(format, ...args) { let index = 0; return format.replace(/%s/g, match => args[index++]); } module.exports = sprintf;PK �n[<��B B translateDOMPositionXY.jsnu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @typechecks */ 'use strict'; var BrowserSupportCore = require("./BrowserSupportCore"); var getVendorPrefixedName = require("./getVendorPrefixedName"); var TRANSFORM = getVendorPrefixedName('transform'); var BACKFACE_VISIBILITY = getVendorPrefixedName('backfaceVisibility'); var translateDOMPositionXY = function () { if (BrowserSupportCore.hasCSSTransforms()) { var ua = global.window ? global.window.navigator.userAgent : 'UNKNOWN'; var isSafari = /Safari\//.test(ua) && !/Chrome\//.test(ua); // It appears that Safari messes up the composition order // of GPU-accelerated layers // (see bug https://bugs.webkit.org/show_bug.cgi?id=61824). // Use 2D translation instead. if (!isSafari && BrowserSupportCore.hasCSS3DTransforms()) { return function ( /*object*/ style, /*number*/ x, /*number*/ y) { style[TRANSFORM] = 'translate3d(' + x + 'px,' + y + 'px,0)'; style[BACKFACE_VISIBILITY] = 'hidden'; }; } else { return function ( /*object*/ style, /*number*/ x, /*number*/ y) { style[TRANSFORM] = 'translate(' + x + 'px,' + y + 'px)'; }; } } else { return function ( /*object*/ style, /*number*/ x, /*number*/ y) { style.left = x + 'px'; style.top = y + 'px'; }; } }(); module.exports = translateDOMPositionXY;PK �n[��<�z z translateDOMPositionXY.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule translateDOMPositionXY * @typechecks */ 'use strict'; const BrowserSupportCore = require("./BrowserSupportCore"); const getVendorPrefixedName = require("./getVendorPrefixedName"); const TRANSFORM = getVendorPrefixedName('transform'); const BACKFACE_VISIBILITY = getVendorPrefixedName('backfaceVisibility'); const translateDOMPositionXY = function () { if (BrowserSupportCore.hasCSSTransforms()) { const ua = global.window ? global.window.navigator.userAgent : 'UNKNOWN'; const isSafari = /Safari\//.test(ua) && !/Chrome\//.test(ua); // It appears that Safari messes up the composition order // of GPU-accelerated layers // (see bug https://bugs.webkit.org/show_bug.cgi?id=61824). // Use 2D translation instead. if (!isSafari && BrowserSupportCore.hasCSS3DTransforms()) { return function ( /*object*/ style, /*number*/ x, /*number*/ y) { style[TRANSFORM] = 'translate3d(' + x + 'px,' + y + 'px,0)'; style[BACKFACE_VISIBILITY] = 'hidden'; }; } else { return function ( /*object*/ style, /*number*/ x, /*number*/ y) { style[TRANSFORM] = 'translate(' + x + 'px,' + y + 'px)'; }; } } else { return function ( /*object*/ style, /*number*/ x, /*number*/ y) { style.left = x + 'px'; style.top = y + 'px'; }; } }(); module.exports = translateDOMPositionXY;PK �n[� �&D D warning.js.flownu �Iw�� /** * Copyright (c) 2014-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule warning */ 'use strict'; declare var __DEV__: boolean; var emptyFunction = require("./emptyFunction"); /** * Similar to invariant but only logs a warning if the condition is not met. * This can be used to log issues in development environments in critical * paths. Removing the logging code for production environments will keep the * same logic and follow the same code paths. */ function printWarning(format, ...args) { var argIndex = 0; var message = 'Warning: ' + format.replace(/%s/g, () => args[argIndex++]); if (typeof console !== 'undefined') { console.error(message); } try { // --- Welcome to debugging React --- // This error was thrown as a convenience so that you can use this stack // to find the callsite that caused this warning to fire. throw new Error(message); } catch (x) {} } var warning = __DEV__ ? function (condition, format, ...args) { if (format === undefined) { throw new Error('`warning(condition, format, ...args)` requires a warning ' + 'message argument'); } if (!condition) { printWarning(format, ...args); } } : emptyFunction; module.exports = warning;PK �n[�s�7� � xhrSimpleDataSerializer.jsnu �Iw�� "use strict"; /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * */ function xhrSimpleDataSerializer(data) { var uri = []; var key; for (key in data) { uri.push(encodeURIComponent(key) + '=' + encodeURIComponent(data[key])); } return uri.join('&'); } module.exports = xhrSimpleDataSerializer;PK �n[!' � � xhrSimpleDataSerializer.js.flownu �Iw�� /** * Copyright (c) 2013-present, Facebook, Inc. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * @providesModule xhrSimpleDataSerializer */ function xhrSimpleDataSerializer(data) { var uri = []; var key; for (key in data) { uri.push(encodeURIComponent(key) + '=' + encodeURIComponent(data[key])); } return uri.join('&'); } module.exports = xhrSimpleDataSerializer;PK �n[�!��� � deep-extend.jsnu �Iw�� /*! * @description Recursive object extending * @author Viacheslav Lotsmanov <lotsmanov89@gmail.com> * @license MIT * * The MIT License (MIT) * * Copyright (c) 2013-2018 Viacheslav Lotsmanov * * Permission is hereby granted, free of charge, to any person obtaining a copy of * this software and associated documentation files (the "Software"), to deal in * the Software without restriction, including without limitation the rights to * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of * the Software, and to permit persons to whom the Software is furnished to do so, * subject to the following conditions: * * The above copyright notice and this permission notice shall be included in all * copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ 'use strict'; function isSpecificValue(val) { return ( val instanceof Buffer || val instanceof Date || val instanceof RegExp ) ? true : false; } function cloneSpecificValue(val) { if (val instanceof Buffer) { var x = Buffer.alloc ? Buffer.alloc(val.length) : new Buffer(val.length); val.copy(x); return x; } else if (val instanceof Date) { return new Date(val.getTime()); } else if (val instanceof RegExp) { return new RegExp(val); } else { throw new Error('Unexpected situation'); } } /** * Recursive cloning array. */ function deepCloneArray(arr) { var clone = []; arr.forEach(function (item, index) { if (typeof item === 'object' && item !== null) { if (Array.isArray(item)) { clone[index] = deepCloneArray(item); } else if (isSpecificValue(item)) { clone[index] = cloneSpecificValue(item); } else { clone[index] = deepExtend({}, item); } } else { clone[index] = item; } }); return clone; } function safeGetProperty(object, property) { return property === '__proto__' ? undefined : object[property]; } /** * Extening object that entered in first argument. * * Returns extended object or false if have no target object or incorrect type. * * If you wish to clone source object (without modify it), just use empty new * object as first argument, like this: * deepExtend({}, yourObj_1, [yourObj_N]); */ var deepExtend = module.exports = function (/*obj_1, [obj_2], [obj_N]*/) { if (arguments.length < 1 || typeof arguments[0] !== 'object') { return false; } if (arguments.length < 2) { return arguments[0]; } var target = arguments[0]; // convert arguments to array and cut off target object var args = Array.prototype.slice.call(arguments, 1); var val, src, clone; args.forEach(function (obj) { // skip argument if isn't an object, is null, or is an array if (typeof obj !== 'object' || obj === null || Array.isArray(obj)) { return; } Object.keys(obj).forEach(function (key) { src = safeGetProperty(target, key); // source value val = safeGetProperty(obj, key); // new value // recursion prevention if (val === target) { return; /** * if new value isn't object then just overwrite by new value * instead of extending. */ } else if (typeof val !== 'object' || val === null) { target[key] = val; return; // just clone arrays (and recursive clone objects inside) } else if (Array.isArray(val)) { target[key] = deepCloneArray(val); return; // custom cloning and overwrite for specific objects } else if (isSpecificValue(val)) { target[key] = cloneSpecificValue(val); return; // overwrite by new value if source isn't object or array } else if (typeof src !== 'object' || src === null || Array.isArray(src)) { target[key] = deepExtend({}, val); return; // source value and new value is objects both, extending... } else { target[key] = deepExtend(src, val); return; } }); }); return target; }; PK Un[��9�� � shimCall.jsnu �Iw�� 'use strict'; /* * cls-bluebird * Function to shim `Promise.prototype.call` */ // Modules var shimmer = require('shimmer'); // Exports var hasOwnProperty = Object.prototype.hasOwnProperty; /** * Patch `call` method to run callbacks in current CLS context. * * @param {Function} Promise - Bluebird Promise constructor to patch * @param {Object} ns - CLS namespace to bind callbacks to * @returns {undefined} */ module.exports = function(Promise, ns) { // Patch method shimmer.wrap(Promise.prototype, 'call', function(callOriginal) { return function() { // Temporarily wrap `this._then` to bind the object method to current CLS context // (`this.call()` will call `this._then()` synchronously) var _thenOriginal = this._then, ownProperty = hasOwnProperty.call(this, '_then'); this._then = function() { // Unwrap `this._then` if (ownProperty) { this._then = _thenOriginal; } else { delete this._then; } // Bind function that will be called to call object method to CLS context arguments[0] = ns.bind(arguments[0]); // Run original `this._then` method return _thenOriginal.apply(this, arguments); }; // Call original `call` method return callOriginal.apply(this, arguments); }; }); }; PK Un[�A�:� � shimCoroutine.jsnu �Iw�� 'use strict'; /* * cls-bluebird * Function to shim `Promise.coroutine` * * Works by binding the `.next()` and `.throw()` methods of generator to CLS context * at time when coroutine is executed. * * In bluebird v3.x, running the coroutine internally calls `.lastly()` if cancellation is enabled. * To prevent unnecessary binding of the `.lastly()` callback to CLS context, this patch * temporarily disables the patch on `Promise.prototype.lastly`. * NB This patch could break if bluebird internals change, but this is covered by the tests. */ // Modules var shimmer = require('shimmer'); // Exports /** * Patch `Promise.coroutine` or `Promise.spawn` to maintain current CLS context after all `yield` statements. * * @param {string} methodName - method name (either 'coroutine' or 'spawn') * @param {Function} Promise - Bluebird Promise constructor to patch * @param {Object} ns - CLS namespace to bind callbacks to * @returns {undefined} */ module.exports = function(methodName, Promise, ns, v3) { var lastlyPatched = Promise.prototype.lastly, lastlyOriginal = Promise.prototype.lastly.__original; // Patch method shimmer.wrap(Promise, methodName, function(original) { return function(generatorFunction, options) { // NB If `generatorFunction` is not a function, do not alter it. // Pass value directly to bluebird which will throw an error. if (typeof generatorFunction === 'function') { // Create proxy generator function var generatorFunctionOriginal = generatorFunction; generatorFunction = function() { // Create generator from generator function var generator = generatorFunctionOriginal.apply(this, arguments); // Bind `.next()`, '.throw()' and `.return()` to current CLS context. // NB CLS context is from when coroutine is called, not when created. ['next', 'throw', 'return'].forEach(function(name) { if (typeof generator[name] === 'function') generator[name] = ns.bind(generator[name]); }); return generator; }; } // Temporarily remove patch from `Promise.prototype.lastly` in bluebird v3 // to avoid unnecessary binding to CLS context. var self = this; if (methodName === 'spawn' && v3) { return tempPatchLastly(function() { return original.call(self, generatorFunction, options); }); } var fn = original.call(this, generatorFunction, options); if (methodName === 'coroutine' && v3) { return function() { var self = this, args = arguments; return tempPatchLastly(function() { return fn.apply(self, args); }); }; } return fn; }; }); function tempPatchLastly(fn) { Promise.prototype.lastly = lastlyOriginal; var res = fn(); Promise.prototype.lastly = lastlyPatched; return res; } }; PK Un[C{�8 8 shimMethod.jsnu �Iw�� 'use strict'; /* * cls-bluebird * Function to shim an object method to retain CLS context */ // Modules var shimmer = require('shimmer'); // Exports /** * Patch method to run callbacks in current CLS context. * * @param {Object} obj - Object on which to find method * @param {string} methodName - method name * @param {Array} args - Array of indexes of arguments which are callbacks * (negative numbers count from end e.g. -1 is last argument, -2 is penultimate) * @param {Object} ns - CLS namespace to bind callbacks to * @returns {undefined} */ module.exports = function(obj, methodName, args, ns) { // Skip non-existent methods if (!obj[methodName]) return; // Patch method shimmer.wrap(obj, methodName, function(original) { return function() { for (var i = 0; i < args.length; i++) { var argIndex = args[i]; if (argIndex < 0) argIndex += arguments.length; var callback = arguments[argIndex]; if (typeof callback === 'function') arguments[argIndex] = ns.bind(callback); } return original.apply(this, arguments); }; }); }; PK Un[ou�� � shimOnCancel.jsnu �Iw�� 'use strict'; /* * cls-bluebird * Function to shim `Promise.prototype._resolveFromExecutor` * in order to patch `onCancel` handler in `new Promise()`. */ // Modules var shimmer = require('shimmer'); // Exports /** * Patch `_resolveFromExecutor` proto method to run `onCancel` callbacks in current CLS context. * * @param {Function} Promise - Bluebird Promise constructor to patch * @param {Object} ns - CLS namespace to bind callbacks to * @returns {undefined} */ module.exports = function(Promise, ns) { // Patch method shimmer.wrap(Promise.prototype, '_resolveFromExecutor', function(_resolveFromExecutorOriginal) { return function(executor) { // Patch executor var executorPatched = function() { var onCancel = arguments[2]; if (onCancel) { // Patch onCancel function arguments[2] = function(fn) { // Bind onCancel handler to current CLS context if (typeof fn === 'function') fn = ns.bind(fn); return onCancel.call(this, fn); }; } return executor.apply(this, arguments); }; // Call original method return _resolveFromExecutorOriginal.call(this, executorPatched); }; }); }; PK Un[� �� shimUsing.jsnu �Iw�� 'use strict'; /* * cls-bluebird * Function to shim `Promise.using` * * `Promise.using()` calls `.then()` and `.lastly` internally which leads to * unnecessary CLS context binding with a naive patch. * * This custom patch intercepts calls to `Promise.all()` (v3) or `Promise.settle()` (v2) * within `Promise.using()` and patches the resulting promise's `.then`/`.lastly` methods * so they do not bind callbacks to CLS context. * * NB This patch could break if bluebird internals change, but this is covered by the tests. */ // Modules var shimmer = require('shimmer'); // Exports /** * Patch `Promise.using` method to run callbacks in current CLS context. * * @param {Function} Promise - Bluebird Promise constructor to patch * @param {Object} ns - CLS namespace to bind callbacks to * @param {boolean} v3 - `true` if bluebird being patched is v3.x * @returns {undefined} */ module.exports = function(Promise, ns, v3) { (v3 ? patchV3 : patchV2)(Promise, ns); }; // Patch for `Promise.using()` in bluebird v3 function patchV3(Promise, ns) { var thenOriginal = Promise.prototype.then.__original, lastlyOriginal = Promise.prototype.lastly.__original; // Patch method shimmer.wrap(Promise, 'using', function(usingOriginal) { return function() { // Bind `using` callback (last arg) var argIndex = arguments.length - 1, callback = arguments[argIndex]; if (typeof callback === 'function') arguments[argIndex] = ns.bind(callback); // Temporarily patch `Promise.all()` shimmer.wrap(Promise, 'all', function(allOriginal) { return function(promises) { // Remove temporary patch on `Promise.all()` Promise.all = allOriginal; // Call original `Promise.all()` var p = allOriginal.call(this, promises); // Patch `.then()` method on this promise to not bind callbacks p.then = function() { var p = thenOriginal.apply(this, arguments); // Patch `.lastly()` method on this promise to not bind callbacks p.lastly = lastlyOriginal; return p; }; return p; }; }); // Call original `Promise.using()` method return usingOriginal.apply(this, arguments); }; }); } // Patch for `Promise.using()` in bluebird v2 function patchV2(Promise, ns) { var thenOriginal = Promise.prototype.then.__original; // Patch method shimmer.wrap(Promise, 'using', function(usingOriginal) { return function() { // Bind `using` callback (last arg) var argIndex = arguments.length - 1, callback = arguments[argIndex]; if (typeof callback === 'function') arguments[argIndex] = ns.bind(callback); // Temporarily patch `Promise.settle()` shimmer.wrap(Promise, 'settle', function(settleOriginal) { return function(resources) { // Remove temporary patch on `Promise.settle()` Promise.settle = settleOriginal; // Call original `Promise.settle()` var p = settleOriginal.call(this, resources); // Patch `.then()` method on this promise to not bind callbacks p.then = function() { var p = thenOriginal.apply(this, arguments); // Patch `.then()` method on this promise to not bind callbacks p.then = thenOriginal; return p; }; return p; }; }); // Call original `Promise.using()` method return usingOriginal.apply(this, arguments); }; }); } PK ��g[p�-� � defaultMemoize.jsnu �Iw�� PK ��g[��Q�� � � index.jsnu �Iw�� PK ��g[A�M� �+ addStyleUrl.jsnu �Iw�� PK ��g[_0�$�( �( �/ addStyles.jsnu �Iw�� PK ��g[�< G� � �X urls.jsnu �Iw�� PK u~h[J[� =a =a �d bn.jsnu �Iw�� PK �~h[��� ,� captains.jsnu �Iw�� PK �~h[]��# �# z� configure.jsnu �Iw�� PK �~h[�\j2 2 m� defaults.jsnu �Iw�� PK �~h[G�߸ � wrap.jsnu �Iw�� PK �~h[�ۄ � write.jsnu �Iw�� PK ̄j[o��q� � W retry.jsnu �Iw�� PK ̄j[�9��I I � retry_operation.jsnu �Iw�� PK An[��kU U ! bom-handling.jsnu �Iw�� PK An[� �}�! �! �% extend-node.jsnu �Iw�� PK An[��b�� � �G index.d.tsnu �Iw�� PK An[�'�(; ; �K streams.jsnu �Iw�� PK �n[*� �� � hY __mocks__/ErrorUtils.jsnu �Iw�� PK �n[]5�� � �[ __mocks__/base62.jsnu �Iw�� PK �n[i� � �\ __mocks__/crc32.jsnu �Iw�� PK �n[0Ǐx� � ^ __mocks__/fetch.jsnu �Iw�� PK �n[�:�� � *` __mocks__/fetchWithRetries.jsnu �Iw�� PK �n[�X�* c __mocks__/nullthrows.jsnu �Iw�� PK �n[�cT T ud TouchEventUtils.jsnu �Iw�� PK �n[�=F# # i BrowserSupportCore.jsnu �Iw�� PK �n[ ���M M sm TokenizeUtil.js.flownu �Iw�� PK �n[�s � � s BrowserSupportCore.js.flownu �Iw�� PK �n[�� Ew crc32.jsnu �Iw�� PK �n[���6 6 �� CSSCore.jsnu �Iw�� PK �n[�fJI I �� UserAgentData.js.flownu �Iw�� PK �n[�:� �� CSSCore.js.flownu �Iw�� PK �n[��E�( �( հ VersionRange.jsnu �Iw�� PK �n[��h h �� CircularBuffer.jsnu �Iw�� PK �n[��f` ` �� TouchEventUtils.js.flownu �Iw�� PK �n[n_�Zv v 7� CircularBuffer.js.flownu �Iw�� PK �n[�=:� � �� URI.jsnu �Iw�� PK �n[�x�F� � �� equalsSet.jsnu �Iw�� PK �n[X���3 3 �� DOMMouseMoveTracker.jsnu �Iw�� PK �n[! �V V x� UnicodeCJK.jsnu �Iw�� PK �n[���" " DOMMouseMoveTracker.js.flownu �Iw�� PK �n[� ��& �& x VersionRange.js.flownu �Iw�� PK �n[�n�� � �D DataTransfer.jsnu �Iw�� PK �n[Q<��A A �W areEqual.js.flownu �Iw�� PK �n[�J�� � qc DataTransfer.js.flownu �Iw�� PK �n[3�+ + Eu crc32.js.flownu �Iw�� PK �n[��k@~ ~ �� Deferred.jsnu �Iw�� PK �n[;�:�� � f� areEqual.jsnu �Iw�� PK �n[��? �� Deferred.js.flownu �Iw�� PK �n[�ܮ? Ѡ base62.jsnu �Iw�� PK �n[���8 8 � ErrorUtils.jsnu �Iw�� PK �n[�R*P; ; �� base62.js.flownu �Iw�� PK �n[���� � ErrorUtils.js.flownu �Iw�� PK �n[b��E E d� camelize.jsnu �Iw�� PK �n[G���� � � EventListener.jsnu �Iw�� PK �n[u� � � � UnicodeBidiService.js.flownu �Iw�� PK �n[����� � ܿ EventListener.js.flownu �Iw�� PK �n[ᓙ�� � �� UnicodeCJK.js.flownu �Iw�� PK �n[X��[� � �� ExecutionEnvironment.jsnu �Iw�� PK �n[��ao �� UnicodeHangulKorean.jsnu �Iw�� PK �n[`ı�� � �� ExecutionEnvironment.js.flownu �Iw�� PK �n[�#�1 1 �� cx.js.flownu �Iw�� PK �n[�`�� [� Heap.jsnu �Iw�� PK �n[K<G G � cssVar.jsnu �Iw�� PK �n[���2 Heap.js.flownu �Iw�� PK �n[���T T t camelize.js.flownu �Iw�� PK �n[�&�q� � IntegerBufferSet.jsnu �Iw�� PK �n[��y�S S F/ UnicodeHangulKorean.js.flownu �Iw�� PK �n[���� � �A IntegerBufferSet.js.flownu �Iw�� PK �n[�-� �W cssVar.js.flownu �Iw�� PK �n[�9� � 'Z Keys.jsnu �Iw�� PK �n[J�:iH H V\ cx.jsnu �Iw�� PK �n[�� �a Keys.js.flownu �Iw�� PK �n[��}�T T d debounceCore.js.flownu �Iw�� PK �n[^xR� � �k Locale.jsnu �Iw�� PK �n[�3?j j �m camelizeStyleName.jsnu �Iw�� PK �n[��� � sq Locale.js.flownu �Iw�� PK �n[�c�`� � �s debounceCore.jsnu �Iw�� PK �n[����� � �{ Map.jsnu �Iw�� PK �n[9|�� � �| distinctArray.jsnu �Iw�� PK �n[��� � �~ Map.js.flownu �Iw�� PK �n[�86� � (� clamp.js.flownu �Iw�� PK �n[*�l�~ ~ _� PhotosMimeType.jsnu �Iw�� PK �n[8Q�j � UnicodeUtils.jsnu �Iw�� PK �n[��o@t t b� PhotosMimeType.js.flownu �Iw�� PK �n[T��� � � UnicodeUtils.js.flownu �Iw�� PK �n[ � � N� PrefixIntervalTree.jsnu �Iw�� PK �n[���p p �� UnicodeUtilsExtra.jsnu �Iw�� PK �n[wےȏ � 5� PrefixIntervalTree.js.flownu �Iw�� PK �n[�),� � � emptyFunction.jsnu �Iw�� PK �n[�� � � Promise.jsnu �Iw�� PK �n[NbT.� � 6 camelizeStyleName.js.flownu �Iw�� PK �n[��� � Promise.js.flownu �Iw�� PK �n[��P� � J clamp.jsnu �Iw�� PK �n[#=�bz z M Promise.native.jsnu �Iw�� PK �n[h�:o� � UnicodeUtilsExtra.js.flownu �Iw�� PK �n[�N��w w - Promise.native.js.flownu �Iw�� PK �n[q�� �! compactArray.jsnu �Iw�� PK �n[m��� 5$ PromiseMap.jsnu �Iw�� PK �n[����V V w+ compactArray.js.flownu �Iw�� PK �n[;}��� � . PromiseMap.js.flownu �Iw�� PK �n[� 4 concatAllArray.jsnu �Iw�� PK �n[ [��� � \7 ReactWheelHandler.jsnu �Iw�� PK �n[1�P� 6C UserAgent.jsnu �Iw�� PK �n[$��� � �[ everySet.jsnu �Iw�� PK �n[���� n^ ReactWheelHandler.js.flownu �Iw�� PK �n[Ԙ�K K �i emptyObject.jsnu �Iw�� PK �n[��� � ^k Scroll.jsnu �Iw�� PK �n[-��B� � 6u containsNode.js.flownu �Iw�� PK �n[��� � Dy Scroll.js.flownu �Iw�� PK �n[���l l � emptyObject.js.flownu �Iw�� PK �n[�ӽ�� � ˄ Set.jsnu �Iw�� PK �n[ADE, , �� equalsIterable.jsnu �Iw�� PK �n[��� � b� Set.js.flownu �Iw�� PK �n[S1r� �� enumerate.jsnu �Iw�� PK �n[����� � ի SiteData.jsnu �Iw�� PK �n[�M�' ' �� concatAllArray.js.flownu �Iw�� PK �n[|�(� � k� SiteData.js.flownu �Iw�� PK �n[;�ӛ� � �� enumerate.js.flownu �Iw�� PK �n[��Fx� � �� Style.jsnu �Iw�� PK �n[� e� � �� containsNode.jsnu �Iw�� PK �n[e[ � � y� Style.js.flownu �Iw�� PK �n[�Dq� � �� countDistinct.jsnu �Iw�� PK �n[�w�W8 8 c� TokenizeUtil.jsnu �Iw�� PK �n[�N�4� � �� URI.js.flownu �Iw�� PK �n[ ��Dg g �� createArrayFromMixed.jsnu �Iw�� PK �n[Y��5 �5 J� UnicodeBidi.jsnu �Iw�� PK �n[�/� � 50 countDistinct.js.flownu �Iw�� PK �n[�iO�6 �6 #3 UnicodeBidi.js.flownu �Iw�� PK �n[��Q( ( j _shouldPolyfillES6Collection.jsnu �Iw�� PK �n[�/�( ( yo UnicodeBidiDirection.jsnu �Iw�� PK �n["��� � �z UserAgent.js.flownu �Iw�� PK �n[� �2� � Ӓ UnicodeBidiDirection.js.flownu �Iw�� PK �n[�G�( ( ͝ UserAgentData.jsnu �Iw�� PK �n[ �{� 5� UnicodeBidiService.jsnu �Iw�� PK �n[�u�- - � equalsSet.js.flownu �Iw�� PK �n[Z�]C@ @ � groupArray.jsnu �Iw�� PK �n[0��D� � j� sprintf.jsnu �Iw�� PK �n[Sxxc c $ �� _shouldPolyfillES6Collection.js.flownu �Iw�� PK �n[�C�^ ^ Z� groupArray.js.flownu �Iw�� PK �n[��(� � �� warning.jsnu �Iw�� PK �n[�/IA` ` �� cancelAnimationFramePolyfill.jsnu �Iw�� PK �n[��6� � j� hyphenate.jsnu �Iw�� PK �n[('� � � G� performance.jsnu �Iw�� PK �n[�#(� � $ R� cancelAnimationFramePolyfill.js.flownu �Iw�� PK �n[BJ� )� isEmail.js.flownu �Iw�� PK �n[�GXJJ J �� createArrayFromMixed.js.flownu �Iw�� PK �n[us�� � � isEmpty.jsnu �Iw�� PK �n[Y}T�� � +� createNodesFromMarkup.jsnu �Iw�� PK �n[���x� � a� hyphenate.js.flownu �Iw�� PK �n[1�n&� � S� createNodesFromMarkup.js.flownu �Iw�� PK �n[�-g� � $ isEmpty.js.flownu �Iw�� PK �n[�� - distinctArray.js.flownu �Iw�� PK �n[!�� { isEventSupported.jsnu �Iw�� PK �n[��rX� � � emptyFunction.js.flownu �Iw�� PK �n[��r3 3 � isEventSupported.js.flownu �Iw�� PK �n[Q�� � 8 equalsIterable.js.flownu �Iw�� PK �n[ ���� � 8$ keyOf.jsnu �Iw�� PK �n[2hD�� � A( everyObject.jsnu �Iw�� PK �n[�i� � q- keyOf.js.flownu �Iw�� PK �n[�7a a �1 everyObject.js.flownu �Iw�� PK �n[ݔ��( ( (7 mapObject.jsnu �Iw�� PK �n[��75 5 �< everySet.js.flownu �Iw�� PK �n[�"M�� � @ performance.js.flownu �Iw�� PK �n[��.&5 5 0B fetch.jsnu �Iw�� PK �n[x��"E E �D mapObject.js.flownu �Iw�� PK �n[���N N #J fetch.js.flownu �Iw�� PK �n[�` ` �L maxBy.jsnu �Iw�� PK �n[���$W W FO fetchWithRetries.jsnu �Iw�� PK �n[� �p p �_ isInternationalPhoneNumber.jsnu �Iw�� PK �n[�M�mm m �c fetchWithRetries.js.flownu �Iw�� PK �n[#^ �� � Rs maxBy.js.flownu �Iw�� PK �n[���x x v filterObject.jsnu �Iw�� PK �n[�F�I; ; �{ memoizeStringOnly.jsnu �Iw�� PK �n[B�N� � G~ filterObject.js.flownu �Iw�� PK �n[!�p�� � #� memoizeStringOnly.js.flownu �Iw�� PK �n[U���g g �� flatMapArray.jsnu �Iw�� PK �n[��o: : �� minBy.jsnu �Iw�� PK �n[,7��� � � flatMapArray.js.flownu �Iw�� PK �n[ǺU~$ $ /� minBy.js.flownu �Iw�� PK �n[��Yq� � �� flattenArray.jsnu �Iw�� PK �n[G�Tz$ $ monitorCodeUse.jsnu �Iw�� PK �n[ �,C C '� flattenArray.js.flownu �Iw�� PK �n[���v v �� performanceNow.jsnu �Iw�� PK �n[5kҶ@ @ e� focusNode.jsnu �Iw�� PK �n[�s �� � � monitorCodeUse.js.flownu �Iw�� PK �n[� U�] ] � focusNode.js.flownu �Iw�� PK �n[�ֳ> > �� normalizeWheel.jsnu �Iw�� PK �n[>6{m m ;� forEachObject.jsnu �Iw�� PK �n[�t�E� � " �� isInternationalPhoneNumber.js.flownu �Iw�� PK �n[�>i� � �� forEachObject.js.flownu �Iw�� PK �n[ �r�j j �� normalizeWheel.js.flownu �Iw�� PK �n[n��|� � R� getActiveElement.jsnu �Iw�� PK �n[ � � � (� isNode.jsnu �Iw�� PK �n[�ۼ� � � getActiveElement.js.flownu �Iw�� PK �n[w��a� � � removeFromArray.jsnu �Iw�� PK �n[�t�/V V � getByPath.jsnu �Iw�� PK �n[�u�?t t � nullthrows.jsnu �Iw�� PK �n[�B)� � J getByPath.js.flownu �Iw�� PK �n[�={�� � $ isNode.js.flownu �Iw�� PK �n[���} } + getDocumentScrollElement.jsnu �Iw�� PK �n[�5n8O O � hyphenateStyleName.jsnu �Iw�� PK �n[�tu� � � getDocumentScrollElement.js.flownu �Iw�� PK �n[����� � � isTextNode.jsnu �Iw�� PK �n[˭r�� � � getElementPosition.jsnu �Iw�� PK �n[���� � � isTextNode.js.flownu �Iw�� PK �n[���� � � getElementPosition.js.flownu �Iw�� PK �n[LI ̈ � nullthrows.js.flownu �Iw�� PK �n[}S�-8 8 �! getElementRect.jsnu �Iw�� PK �n[�Bز � Q' joinClasses.jsnu �Iw�� PK �n[u���Q Q A* getElementRect.js.flownu �Iw�� PK �n[�mls� � �/ partitionArray.jsnu �Iw�� PK �n[á*Y Y �2 getMarkupWrap.jsnu �Iw�� PK �n[ � �� � �> joinClasses.js.flownu �Iw�� PK �n[�F�* * �A getMarkupWrap.js.flownu �Iw�� PK �n[s��nU U ;M partitionArray.js.flownu �Iw�� PK �n[�) |D D �P getScrollPosition.jsnu �Iw�� PK �n[t�>xp p ^W keyMirror.jsnu �Iw�� PK �n[�`��w w \ getScrollPosition.js.flownu �Iw�� PK �n[���ך � �b partitionObject.jsnu �Iw�� PK �n[ʽ��� � �e getStyleProperty.jsnu �Iw�� PK �n[���^ ^ �k keyMirror.js.flownu �Iw�� PK �n[�cH� � ^p getStyleProperty.js.flownu �Iw�� PK �n[V��y y �v hyphenateStyleName.js.flownu �Iw�� PK �n[� �� � Xz getUnboundedScrollPosition.jsnu �Iw�� PK �n[�� �~ invariant.jsnu �Iw�� PK �n[�73�- - ҄ resolveImmediate.jsnu �Iw�� PK �n[�_�� " B� getUnboundedScrollPosition.js.flownu �Iw�� PK �n[/���� � �� keyMirrorRecursive.jsnu �Iw�� PK �n[��A�� � �� getVendorPrefixedName.jsnu �Iw�� PK �n[��(�� � �� invariant.js.flownu �Iw�� PK �n[_�z� � Š getVendorPrefixedName.js.flownu �Iw�� PK �n[_��� � �� keyMirrorRecursive.js.flownu �Iw�� PK �n[�1�� � �� getViewportDimensions.jsnu �Iw�� PK �n[B�� �� isEmail.jsnu �Iw�� PK �n[_�Wp p � setImmediate.jsnu �Iw�� PK �n[\�њ* * �� getViewportDimensions.js.flownu �Iw�� PK �n[�T�1 1 � someSet.js.flownu �Iw�� PK �n[>� �� � v� someSet.jsnu �Iw�� PK �n[��%� � \� nativeRequestAnimationFrame.jsnu �Iw�� PK �n["��G� � # l� nativeRequestAnimationFrame.js.flownu �Iw�� PK �n[�<C�Y Y �� partitionObject.js.flownu �Iw�� PK �n[�]�X X C� partitionObjectByKey.jsnu �Iw�� PK �n[����� � �� partitionObjectByKey.js.flownu �Iw�� PK �n[�� Ee e �� performanceNow.js.flownu �Iw�� PK �n[�c��� � �� removeFromArray.js.flownu �Iw�� PK �n[��j �� requestAnimationFrame.jsnu �Iw�� PK �n[���. � requestAnimationFrame.js.flownu �Iw�� PK �n[���� q� requestAnimationFramePolyfill.jsnu �Iw�� PK �n[�? ? % �� requestAnimationFramePolyfill.js.flownu �Iw�� PK �n[U���, , r� resolveImmediate.js.flownu �Iw�� PK �n[�m�ΐ � �� setImmediate.js.flownu �Iw�� PK �n[ȿ �O O �� shallowEqual.jsnu �Iw�� PK �n[H�� � � H� shallowEqual.js.flownu �Iw�� PK �n[�$��� � 4� someObject.jsnu �Iw�� PK �n[,�r[ [ ^� someObject.js.flownu �Iw�� PK �n[���_ _ �� sprintf.js.flownu �Iw�� PK �n[<��B B �� translateDOMPositionXY.jsnu �Iw�� PK �n[��<�z z $ translateDOMPositionXY.js.flownu �Iw�� PK �n[� �&D D � warning.js.flownu �Iw�� PK �n[�s�7� � o xhrSimpleDataSerializer.jsnu �Iw�� PK �n[!' � � s xhrSimpleDataSerializer.js.flownu �Iw�� PK �n[�!��� � � deep-extend.jsnu �Iw�� PK Un[��9�� � �' shimCall.jsnu �Iw�� PK Un[�A�:� � �, shimCoroutine.jsnu �Iw�� PK Un[C{�8 8 �7 shimMethod.jsnu �Iw�� PK Un[ou�� � a< shimOnCancel.jsnu �Iw�� PK Un[� �� +A shimUsing.jsnu �Iw�� PK QU wN
| ver. 1.4 |
Github
|
.
| PHP 8.1.33 | Генерация страницы: 0.07 |
proxy
|
phpinfo
|
Настройка