UNPKG

create-expo-cljs-app

Version:

Create a react native application with Expo and Shadow-CLJS!

218 lines (182 loc) 5.88 kB
/** * Copyright (c) Facebook, Inc. and its affiliates. * * This source code is licensed under the MIT license found in the * LICENSE file in the root directory of this source tree. * * * @format */ "use strict"; function _toConsumableArray(arr) { return ( _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread() ); } function _nonIterableSpread() { throw new TypeError( "Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method." ); } function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); } function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && Symbol.iterator in Object(iter)) return Array.from(iter); } function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); } function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; } function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function(sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; } function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function(key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function(key) { Object.defineProperty( target, key, Object.getOwnPropertyDescriptor(source, key) ); }); } } return target; } 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; } const path = require("path"); const url = require("url"); const _require = require("./helpers/js"), isJsModule = _require.isJsModule, wrapModule = _require.wrapModule; const _require2 = require("metro-transform-plugins"), addParamsToDefineCall = _require2.addParamsToDefineCall; function generateModules(sourceModules, graph, options) { const modules = []; for (const module of sourceModules) { if (isJsModule(module)) { // Construct a bundle URL for this specific module only const getURL = extension => { options.clientUrl.pathname = path.relative( options.projectRoot, path.join( path.dirname(module.path), path.basename(module.path, path.extname(module.path)) + "." + extension ) ); return url.format(options.clientUrl); }; const sourceMappingURL = getURL("map"); const sourceURL = getURL("bundle"); const code = prepareModule(module, graph, options) + `\n//# sourceMappingURL=${sourceMappingURL}\n` + `//# sourceURL=${sourceURL}\n`; modules.push({ module: [options.createModuleId(module.path), code], sourceMappingURL, sourceURL }); } } return modules; } function prepareModule(module, graph, options) { const code = wrapModule( module, _objectSpread( _objectSpread({}, options), {}, { dev: true } ) ); const inverseDependencies = getInverseDependencies(module.path, graph); // Transform the inverse dependency paths to ids. const inverseDependenciesById = Object.create(null); Object.keys(inverseDependencies).forEach(path => { inverseDependenciesById[options.createModuleId(path)] = inverseDependencies[ path ].map(options.createModuleId); }); return addParamsToDefineCall(code, inverseDependenciesById); } /** * Instead of adding the whole inverseDependncies object into each changed * module (which can be really huge if the dependency graph is big), we only * add the needed inverseDependencies for each changed module (we do this by * traversing upwards the dependency graph). */ function getInverseDependencies(path, graph) { let inverseDependencies = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {}; // Dependency alredy traversed. if (path in inverseDependencies) { return inverseDependencies; } const module = graph.dependencies.get(path); if (!module) { return inverseDependencies; } inverseDependencies[path] = []; for (const inverse of module.inverseDependencies) { inverseDependencies[path].push(inverse); getInverseDependencies(inverse, graph, inverseDependencies); } return inverseDependencies; } function hmrJSBundle(delta, graph, options) { return { added: generateModules(delta.added.values(), graph, options), modified: generateModules(delta.modified.values(), graph, options), deleted: _toConsumableArray(delta.deleted).map(path => options.createModuleId(path) ) }; } module.exports = hmrJSBundle;