react-relay 2.0.0-rc.2 → 5.0.0

package/lib/directivesToGraphQL.js

@@ -1,39 +0,0 @@
-/**
- * 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.
- *
- *  strict-local
- * @format
- */
-'use strict';
-
-/**
- * @internal
- *
- * Convert plain object `{name, arguments}` directives to GraphQL directive
- * nodes.
- */
-function directivesToGraphQL(directives) {
-  return directives.map(function (_ref) {
-    var directiveName = _ref.name,
-        args = _ref.args;
-    var concreteArguments = args.map(function (_ref2) {
-      var argName = _ref2.name,
-          value = _ref2.value;
-      var concreteArgument = null;
-
-      if (Array.isArray(value)) {
-        concreteArgument = value.map(require("./QueryBuilder").createCallValue);
-      } else if (value != null) {
-        concreteArgument = require("./QueryBuilder").createCallValue(value);
-      }
-
-      return require("./QueryBuilder").createDirectiveArgument(argName, concreteArgument);
-    });
-    return require("./QueryBuilder").createDirective(directiveName, concreteArguments);
-  });
-}
-
-module.exports = directivesToGraphQL;

package/lib/filterRelayQuery.js

@@ -1,29 +0,0 @@
-/**
- * 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.
- *
- *  strict-local
- * @format
- */
-'use strict';
-
-/**
- * @internal
- *
- * `filterRelayQuery` filters query nodes for which `callback` returns false.
- * This is intended as a generic filter module and therefore contains no special
- * logic for handling requisite or generated fields.
- */
-function filterRelayQuery(node, callback) {
-  if (callback(node)) {
-    return node.clone(node.getChildren().map(function (child) {
-      return filterRelayQuery(child, callback);
-    }));
-  }
-
-  return null;
-}
-
-module.exports = filterRelayQuery;

package/lib/findRelayQueryLeaves.js

@@ -1,293 +0,0 @@
-/**
- * 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';
-
-var _inheritsLoose2 = require("@babel/runtime/helpers/interopRequireDefault")(require("@babel/runtime/helpers/inheritsLoose"));
-
-/**
- * @internal
- *
- * Traverses a query and data in the record store to determine if there are
- * additional nodes that needs to be read from disk cache. If it  ncounters
- * a node that is not in `cachedRecords`, it will queued that node by adding it
- * into the `pendingNodeStates` list. If it encounters a node that was already read
- * but still missing data, then it will short circuit the evaluation since
- * there is no way for us to satisfy this query even with additional data from
- * disk cache and resturn
- */
-function findRelayQueryLeaves(store, cachedRecords, queryNode, dataID, path, rangeCalls) {
-  var finder = new RelayQueryLeavesFinder(store, cachedRecords);
-  var state = {
-    dataID: dataID,
-    missingData: false,
-    path: path,
-    rangeCalls: rangeCalls,
-    rangeInfo: undefined
-  };
-  finder.visit(queryNode, state);
-  return {
-    missingData: state.missingData,
-    pendingNodeStates: finder.getPendingNodeStates()
-  };
-}
-
-var RelayQueryLeavesFinder =
-/*#__PURE__*/
-function (_RelayQueryVisitor) {
-  (0, _inheritsLoose2["default"])(RelayQueryLeavesFinder, _RelayQueryVisitor);
-
-  function RelayQueryLeavesFinder(store) {
-    var _this;
-
-    var cachedRecords = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
-    _this = _RelayQueryVisitor.call(this) || this;
-    _this._store = store;
-    _this._cachedRecords = cachedRecords;
-    _this._pendingNodeStates = [];
-    return _this;
-  }
-
-  var _proto = RelayQueryLeavesFinder.prototype;
-
-  _proto.getPendingNodeStates = function getPendingNodeStates() {
-    return this._pendingNodeStates;
-  };
-  /**
-   * Skip visiting children if missingData is already false.
-   */
-
-
-  _proto.traverse = function traverse(node, state) {
-    var children = node.getChildren();
-
-    for (var ii = 0; ii < children.length; ii++) {
-      if (state.missingData) {
-        return;
-      }
-
-      this.visit(children[ii], state);
-    }
-  };
-
-  _proto.visitFragment = function visitFragment(fragment, state) {
-    var dataID = state.dataID;
-
-    var recordState = this._store.getRecordState(dataID);
-
-    if (recordState === require("./RelayClassicRecordState").UNKNOWN) {
-      this._handleMissingData(fragment, state);
-
-      return;
-    } else if (recordState === require("./RelayClassicRecordState").NONEXISTENT) {
-      return;
-    }
-
-    if (require("./isCompatibleRelayFragmentType")(fragment, this._store.getType(dataID))) {
-      this.traverse(fragment, state);
-    }
-  };
-
-  _proto.visitField = function visitField(field, state) {
-    var _ConnectionInterface$ = require("relay-runtime").ConnectionInterface.get(),
-        EDGES = _ConnectionInterface$.EDGES,
-        PAGE_INFO = _ConnectionInterface$.PAGE_INFO;
-
-    var dataID = state.dataID;
-
-    var recordState = this._store.getRecordState(dataID);
-
-    if (recordState === require("./RelayClassicRecordState").UNKNOWN) {
-      this._handleMissingData(field, state);
-
-      return;
-    } else if (recordState === require("./RelayClassicRecordState").NONEXISTENT) {
-      return;
-    }
-
-    if (state.rangeCalls && !state.rangeInfo) {
-      var metadata = this._store.getRangeMetadata(dataID, state.rangeCalls);
-
-      if (metadata) {
-        state.rangeInfo = metadata;
-      }
-    }
-
-    var rangeInfo = state.rangeInfo;
-
-    if (rangeInfo && field.getSchemaName() === EDGES) {
-      this._visitEdges(field, state);
-    } else if (rangeInfo && field.getSchemaName() === PAGE_INFO) {
-      this._visitPageInfo(field, state);
-    } else if (!field.canHaveSubselections()) {
-      this._visitScalar(field, state);
-    } else if (field.isPlural()) {
-      this._visitPlural(field, state);
-    } else if (field.isConnection()) {
-      this._visitConnection(field, state);
-    } else {
-      this._visitLinkedField(field, state);
-    }
-  };
-
-  _proto._visitScalar = function _visitScalar(field, state) {
-    var fieldData = this._store.getField(state.dataID, field.getStorageKey());
-
-    if (fieldData === undefined) {
-      this._handleMissingData(field, state);
-    }
-  };
-
-  _proto._visitPlural = function _visitPlural(field, state) {
-    var dataIDs = this._store.getLinkedRecordIDs(state.dataID, field.getStorageKey());
-
-    if (dataIDs === undefined) {
-      this._handleMissingData(field, state);
-
-      return;
-    }
-
-    if (dataIDs) {
-      for (var ii = 0; ii < dataIDs.length; ii++) {
-        if (state.missingData) {
-          break;
-        }
-
-        var nextState = {
-          dataID: dataIDs[ii],
-          missingData: false,
-          path: require("./RelayQueryPath").getPath(state.path, field, dataIDs[ii]),
-          rangeCalls: undefined,
-          rangeInfo: undefined
-        };
-        this.traverse(field, nextState);
-        state.missingData = nextState.missingData;
-      }
-    }
-  };
-
-  _proto._visitConnection = function _visitConnection(field, state) {
-    var calls = field.getCallsWithValues();
-
-    var dataID = this._store.getLinkedRecordID(state.dataID, field.getStorageKey());
-
-    if (dataID === undefined) {
-      this._handleMissingData(field, state);
-
-      return;
-    }
-
-    if (dataID) {
-      var nextState = {
-        dataID: dataID,
-        missingData: false,
-        path: require("./RelayQueryPath").getPath(state.path, field, dataID),
-        rangeCalls: calls,
-        rangeInfo: null
-      };
-
-      var metadata = this._store.getRangeMetadata(dataID, calls);
-
-      if (metadata) {
-        nextState.rangeInfo = metadata;
-      }
-
-      this.traverse(field, nextState);
-      state.missingData = state.missingData || nextState.missingData;
-    }
-  };
-
-  _proto._visitEdges = function _visitEdges(field, state) {
-    var rangeInfo = state.rangeInfo; // Doesn't have  `__range__` loaded
-
-    if (!rangeInfo) {
-      this._handleMissingData(field, state);
-
-      return;
-    }
-
-    if (rangeInfo.diffCalls.length) {
-      state.missingData = true;
-      return;
-    }
-
-    var edgeIDs = rangeInfo.requestedEdgeIDs;
-
-    for (var ii = 0; ii < edgeIDs.length; ii++) {
-      if (state.missingData) {
-        break;
-      }
-
-      var nextState = {
-        dataID: edgeIDs[ii],
-        missingData: false,
-        path: require("./RelayQueryPath").getPath(state.path, field, edgeIDs[ii]),
-        rangeCalls: undefined,
-        rangeInfo: undefined
-      };
-      this.traverse(field, nextState);
-      state.missingData = state.missingData || nextState.missingData;
-    }
-  };
-
-  _proto._visitPageInfo = function _visitPageInfo(field, state) {
-    var rangeInfo = state.rangeInfo;
-
-    if (!rangeInfo || !rangeInfo.pageInfo) {
-      this._handleMissingData(field, state);
-
-      return;
-    }
-  };
-
-  _proto._visitLinkedField = function _visitLinkedField(field, state) {
-    var dataID = this._store.getLinkedRecordID(state.dataID, field.getStorageKey());
-
-    if (dataID === undefined) {
-      this._handleMissingData(field, state);
-
-      return;
-    }
-
-    if (dataID) {
-      var nextState = {
-        dataID: dataID,
-        missingData: false,
-        path: require("./RelayQueryPath").getPath(state.path, field, dataID),
-        rangeCalls: undefined,
-        rangeInfo: undefined
-      };
-      this.traverse(field, nextState);
-      state.missingData = state.missingData || nextState.missingData;
-    }
-  };
-
-  _proto._handleMissingData = function _handleMissingData(node, state) {
-    var dataID = state.dataID;
-
-    if (this._cachedRecords.hasOwnProperty(dataID)) {
-      // We have read data for this `dataID` from disk, but
-      // we still don't have data for the relevant field.
-      state.missingData = true;
-    } else {
-      // Store node in `pendingNodeStates` because we have not read data for
-      // this `dataID` from disk.
-      this._pendingNodeStates.push({
-        dataID: dataID,
-        node: node,
-        path: state.path,
-        rangeCalls: state.rangeCalls
-      });
-    }
-  };
-
-  return RelayQueryLeavesFinder;
-}(require("./RelayQueryVisitor"));
-
-module.exports = require("relay-runtime").RelayProfiler.instrument('findRelayQueryLeaves', findRelayQueryLeaves);

package/lib/flattenRelayQuery.js

@@ -1,121 +0,0 @@
-/**
- * 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.
- *
- *  strict-local
- * @format
- */
-'use strict';
-
-var _inheritsLoose2 = require("@babel/runtime/helpers/interopRequireDefault")(require("@babel/runtime/helpers/inheritsLoose"));
-
-/**
- * @internal
- *
- * `flattenRelayQuery(query)` returns a clone of `query` with fields inside of
- * fragments recursively flattened into the nearest ancestor field.
- *
- * The result can be null if `node` only contains empty fragments or fragments
- * that only contain empty fragments.
- */
-function flattenRelayQuery(node, options) {
-  var flattener = new RelayQueryFlattener(options && options.shouldRemoveFragments);
-  var state = {
-    node: node,
-    type: node.getType(),
-    flattenedFieldMap: new Map(),
-    flattenedFragmentMap: new Map()
-  };
-  flattener.traverse(node, state);
-  return toQuery(node, state, !!(options && options.preserveEmptyNodes));
-}
-
-function toQuery(node, _ref, preserveEmptyNodes) {
-  var flattenedFieldMap = _ref.flattenedFieldMap,
-      flattenedFragmentMap = _ref.flattenedFragmentMap;
-  var children = [];
-  var aliases = Array.from(flattenedFieldMap.keys());
-  aliases.forEach(function (alias) {
-    var field = flattenedFieldMap.get(alias);
-
-    if (field) {
-      children.push(toQuery(field.node, field, preserveEmptyNodes));
-    }
-  });
-  Array.from(flattenedFragmentMap.keys()).forEach(function (type) {
-    var fragment = flattenedFragmentMap.get(type);
-
-    if (fragment) {
-      children.push(toQuery(fragment.node, fragment, preserveEmptyNodes));
-    }
-  }); // Pattern nodes may contain non-scalar fields without children that
-  // should not be removed.
-
-  if (preserveEmptyNodes && node.canHaveSubselections() && !children.length) {
-    return node;
-  }
-
-  return node.clone(children);
-}
-
-var RelayQueryFlattener =
-/*#__PURE__*/
-function (_RelayQueryVisitor) {
-  (0, _inheritsLoose2["default"])(RelayQueryFlattener, _RelayQueryVisitor);
-
-  function RelayQueryFlattener(shouldRemoveFragments) {
-    var _this;
-
-    _this = _RelayQueryVisitor.call(this) || this;
-    _this._shouldRemoveFragments = !!shouldRemoveFragments;
-    return _this;
-  }
-
-  var _proto = RelayQueryFlattener.prototype;
-
-  _proto.visitFragment = function visitFragment(node, state) {
-    var type = node.getType();
-
-    if (this._shouldRemoveFragments || type === state.type) {
-      this.traverse(node, state);
-      return;
-    }
-
-    var flattenedFragment = state.flattenedFragmentMap.get(type);
-
-    if (!flattenedFragment) {
-      flattenedFragment = {
-        node: node,
-        type: type,
-        flattenedFieldMap: new Map(),
-        flattenedFragmentMap: new Map()
-      };
-      state.flattenedFragmentMap.set(type, flattenedFragment);
-    }
-
-    this.traverse(node, flattenedFragment);
-  };
-
-  _proto.visitField = function visitField(node, state) {
-    var hash = node.getShallowHash();
-    var flattenedField = state.flattenedFieldMap.get(hash);
-
-    if (!flattenedField) {
-      flattenedField = {
-        node: node,
-        type: node.getType(),
-        flattenedFieldMap: new Map(),
-        flattenedFragmentMap: new Map()
-      };
-      state.flattenedFieldMap.set(hash, flattenedField);
-    }
-
-    this.traverse(node, flattenedField);
-  };
-
-  return RelayQueryFlattener;
-}(require("./RelayQueryVisitor"));
-
-module.exports = require("relay-runtime").RelayProfiler.instrument('flattenRelayQuery', flattenRelayQuery);

package/lib/flattenSplitRelayQueries.js

@@ -1,44 +0,0 @@
-/**
- * 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';
-
-var _toConsumableArray2 = require("@babel/runtime/helpers/interopRequireDefault")(require("@babel/runtime/helpers/toConsumableArray"));
-
-/**
- * Flattens the nested structure returned by `splitDeferredRelayQueries`.
- *
- * Right now our internals discard the information about the relationship
- * between the queries that is encoded in the nested structure.
- *
- * @internal
- */
-function flattenSplitRelayQueries(splitQueries) {
-  var flattenedQueries = [];
-  var queue = [splitQueries];
-
-  while (queue.length) {
-    splitQueries = queue.shift();
-    var _splitQueries = splitQueries,
-        required = _splitQueries.required,
-        deferred = _splitQueries.deferred;
-
-    if (required) {
-      flattenedQueries.push(required);
-    }
-
-    if (deferred.length) {
-      queue.push.apply(queue, (0, _toConsumableArray2["default"])(deferred));
-    }
-  }
-
-  return flattenedQueries;
-}
-
-module.exports = flattenSplitRelayQueries;

package/lib/forEachRootCallArg.js

@@ -1,40 +0,0 @@
-/**
- * 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.
- *
- *  strict-local
- * @format
- */
-'use strict';
-
-/**
- * @internal
- *
- * Iterates over the identifying arguments in the supplied root call.
- * If the identifying value is null or undefined, the supplied callback will be
- * invoked once.
- */
-function forEachRootCallArg(query, callback) {
-  !!query.getBatchCall() ? process.env.NODE_ENV !== "production" ? require("fbjs/lib/invariant")(false, 'forEachRootCallArg(): Cannot iterate over batch call variables.') : require("fbjs/lib/invariant")(false) : void 0;
-
-  function each(identifyingArgValue, fn) {
-    if (Array.isArray(identifyingArgValue)) {
-      identifyingArgValue.forEach(function (value) {
-        return each(value, fn);
-      });
-    } else {
-      fn({
-        identifyingArgValue: identifyingArgValue,
-        identifyingArgKey: identifyingArgValue == null ? null : typeof identifyingArgValue === 'string' ? identifyingArgValue : require("./stableStringify")(identifyingArgValue)
-      });
-    }
-  }
-
-  var identifyingArg = query.getIdentifyingArg();
-  var identifyingArgValue = identifyingArg && identifyingArg.value || null;
-  each(identifyingArgValue, callback);
-}
-
-module.exports = forEachRootCallArg;

package/lib/fromGraphQL.js

@@ -1,48 +0,0 @@
-/**
- * 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.
- *
- *  strict-local
- * @format
- */
-'use strict';
-
-/**
- * @internal
- *
- * Converts GraphQL nodes to RelayQuery nodes.
- */
-var fromGraphQL = {
-  Field: function Field(query) {
-    var node = createNode(query, require("./RelayQuery").Field);
-    !(node instanceof require("./RelayQuery").Field) ? process.env.NODE_ENV !== "production" ? require("fbjs/lib/invariant")(false, 'fromGraphQL.Field(): Expected a GraphQL field node.') : require("fbjs/lib/invariant")(false) : void 0;
-    return node;
-  },
-  Fragment: function Fragment(query) {
-    var node = createNode(query, require("./RelayQuery").Fragment);
-    !(node instanceof require("./RelayQuery").Fragment) ? process.env.NODE_ENV !== "production" ? require("fbjs/lib/invariant")(false, 'fromGraphQL.Fragment(): Expected a GraphQL fragment node.') : require("fbjs/lib/invariant")(false) : void 0;
-    return node;
-  },
-  Query: function Query(query) {
-    var node = createNode(query, require("./RelayQuery").Root);
-    !(node instanceof require("./RelayQuery").Root) ? process.env.NODE_ENV !== "production" ? require("fbjs/lib/invariant")(false, 'fromGraphQL.Query(): Expected a root node.') : require("fbjs/lib/invariant")(false) : void 0;
-    return node;
-  },
-  Operation: function Operation(query) {
-    var node = createNode(query, require("./RelayQuery").Operation);
-    !(node instanceof require("./RelayQuery").Operation) ? process.env.NODE_ENV !== "production" ? require("fbjs/lib/invariant")(false, 'fromGraphQL.Operation(): Expected a mutation/subscription node.') : require("fbjs/lib/invariant")(false) : void 0;
-    return node;
-  }
-};
-
-function createNode(query, desiredType) {
-  var variables = {};
-
-  var route = require("./RelayMetaRoute").get('$fromGraphQL');
-
-  return desiredType.create(query, route, variables);
-}
-
-module.exports = fromGraphQL;

package/lib/generateClientEdgeID.js

@@ -1,22 +0,0 @@
-/**
- * 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.
- *
- *  strict
- * @format
- */
-'use strict';
-/**
- * Generate an edge client id for edges on connections based on the range it
- * belongs to and the node it contains.
- *
- * @internal
- */
-
-function generateClientEdgeID(rangeID, nodeID) {
-  return 'client:' + rangeID + ':' + nodeID;
-}
-
-module.exports = generateClientEdgeID;

package/lib/generateClientID.js

@@ -1,27 +0,0 @@
-/**
- * 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.
- *
- *  strict-local
- * @format
- */
-'use strict';
-
-var _clientID = 1;
-
-var _prefix = 'client:' + require("fbjs/lib/crc32")('' + require("fbjs/lib/performanceNow")());
-/**
- * Generate a unique clientID for GraphQL data objects that do not already have
- * an ID or their ID = null
- *
- * @internal
- */
-
-
-function generateClientID() {
-  return _prefix + _clientID++;
-}
-
-module.exports = generateClientID;

package/lib/generateConcreteFragmentID.js

@@ -1,30 +0,0 @@
-/**
- * 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.
- *
- *  strict-local
- * @format
- */
-'use strict';
-
-// Static ids always end with `:<HASH>` where HASH is an alphanumeric transform
-// of an auto-incrementing index. A double-colon is used to distinguish between
-// client ids and static ids that happen to hash to `:client`.
-var SUFFIX = '::client';
-var _nextFragmentID = 0;
-/**
- * The "concrete fragment id" uniquely identifies a Relay.QL`fragment ...`
- * within the source code of an application and will remain the same across
- * runs of a particular version of an application.
- *
- * This function can be used to generate a unique id for fragments constructed
- * at runtime and is guaranteed not to conflict with statically created ids.
- */
-
-function generateConcreteFragmentID() {
-  return require("fbjs/lib/base62")(_nextFragmentID++) + SUFFIX;
-}
-
-module.exports = generateConcreteFragmentID;