@warp-drive-mirror/core 5.10.0-alpha.2 → 5.10.0-alpha.21

package/dist/unpkg/prod/configure.js

@@ -1,3 +1,3 @@
-import { M as setupSignals } from "./-private-CdDed4yB.js";
+import { M as registerSignals, N as setupSignals } from "./-private-CrUi_3E_.js";
 
-export { setupSignals };
+export { registerSignals, setupSignals };

package/dist/unpkg/prod/graph/-private.js

@@ -1,6 +1,6 @@
-import { a as setTransient, r as peekTransient, t as getOrSetGlobal } from "../-private-JmhZBKGb.js";
+import { getOrSetGlobal, peekTransient, setTransient } from "../types/-private.js";
 
-//#region src/graph/-private/-utils.ts
+// src/graph/-private/-utils.ts
 /** Retrieves the private {@link Store} instance from a capabilities manager (or any object exposing `_store`). */
 function getStore(wrapper) {
 	return wrapper._store;
@@ -89,8 +89,7 @@ function notifyChange(graph, relationship, channel) {
 	graph.store.notifyChange(resourceKey, "relationships", key, channel);
 }
 
-//#endregion
-//#region src/graph/-private/operations/replace-related-records.ts
+// src/graph/-private/operations/replace-related-records.ts
 function replaceRelatedRecords(graph, op, isRemote) {
 	if (isRemote) replaceRelatedRecordsRemote(graph, op, isRemote);
 	else replaceRelatedRecordsLocal(graph, op, isRemote);
@@ -237,8 +236,7 @@ function flushCanonical(graph, rel, channel) {
 	if (rel.accessed) graph._scheduleLocalSync(rel, channel);
 }
 
-//#endregion
-//#region src/graph/-private/operations/replace-related-record.ts
+// src/graph/-private/operations/replace-related-record.ts
 function replaceRelatedRecord(graph, op, isRemote = false) {
 	const relationship = graph.get(op.record, op.field);
 	if (isRemote) graph._addToTransaction(relationship);
@@ -280,8 +278,7 @@ function replaceRelatedRecord(graph, op, isRemote = false) {
 	} else notifyChange(graph, relationship, "local");
 }
 
-//#endregion
-//#region src/graph/-private/-diff.ts
+// src/graph/-private/-diff.ts
 function _compare(priorLocalState, finalState, finalSet, prevState, prevSet, onAdd, onDel, remoteClearsLocal) {
 	const finalLength = finalState.length;
 	const prevLength = prevState.length;
@@ -452,8 +449,7 @@ function rollbackRelationship(graph, key, field, relationship) {
 	}
 }
 
-//#endregion
-//#region src/graph/-private/-edge-definition.ts
+// src/graph/-private/-edge-definition.ts
 function isLegacyField(field) {
 	return field.kind === "belongsTo" || field.kind === "hasMany";
 }
@@ -609,7 +605,7 @@ function upgradeDefinition(graph, key, propertyName, isImplicit = false) {
 	const inverseType = definition.type;
 	if (definition.inverseKey === null) inverseDefinition = null;
 	else {
-		inverseKey = inverseForRelationship(getStore(storeWrapper), key, propertyName);
+		inverseKey = inverseForRelationship(getStore(storeWrapper), key, meta.name);
 		if (!inverseKey && definition.isPolymorphic && definition.inverseKey) inverseDefinition = {
 			kind: "belongsTo",
 			key: definition.inverseKey,
@@ -621,7 +617,10 @@ function upgradeDefinition(graph, key, propertyName, isImplicit = false) {
 			isPolymorphic: false
 		};
 		else if (!inverseKey) inverseDefinition = null;
-		else inverseDefinition = upgradeMeta(storeWrapper.schema.fields({ type: inverseType }).get(inverseKey));
+		else {
+			inverseDefinition = upgradeMeta(storeWrapper.schema.fields({ type: inverseType }).get(inverseKey));
+			inverseKey = inverseDefinition.key;
+		}
 	}
 	if (!inverseDefinition) {
 		inverseKey = implicitKeyFor(type, propertyName);
@@ -700,8 +699,7 @@ function inverseForRelationship(store, resourceKey, key) {
 	return definition.options.inverse;
 }
 
-//#endregion
-//#region src/graph/-private/-state.ts
+// src/graph/-private/-state.ts
 function createState() {
 	return {
 		hasReceivedData: false,
@@ -714,8 +712,7 @@ function createState() {
 	};
 }
 
-//#endregion
-//#region src/graph/-private/edges/collection.ts
+// src/graph/-private/edges/collection.ts
 /**
 * Stores the graph's internal state for one side of a collection (`hasMany`) relationship.
 */
@@ -752,8 +749,7 @@ function legacyGetCollectionRelationshipData(source, getRemoteState) {
 	return payload;
 }
 
-//#endregion
-//#region src/graph/-private/edges/implicit.ts
+// src/graph/-private/edges/implicit.ts
 /**
 * The relationship definition (schema metadata) backing an {@link ImplicitEdge}, tagging
 * the {@link UpgradedMeta} as belonging to an implicit inverse relationship.
@@ -798,8 +794,7 @@ function createImplicitEdge(definition, identifier) {
 	};
 }
 
-//#endregion
-//#region src/graph/-private/edges/resource.ts
+// src/graph/-private/edges/resource.ts
 function createResourceEdge(definition, identifier) {
 	return {
 		definition,
@@ -825,8 +820,7 @@ function legacyGetResourceRelationshipData(source, getRemoteState) {
 	return payload;
 }
 
-//#endregion
-//#region src/graph/-private/operations/add-to-related-records.ts
+// src/graph/-private/operations/add-to-related-records.ts
 function addToRelatedRecords(graph, op, isRemote) {
 	const { record, value, index } = op;
 	const relationship = graph.get(record, op.field);
@@ -852,8 +846,7 @@ function addRelatedRecord(graph, relationship, record, value, index, isRemote) {
 	if (_add(graph, record, relationship, value, index, isRemote)) addToInverse(graph, value, relationship.definition.inverseKey, record, isRemote);
 }
 
-//#endregion
-//#region src/graph/-private/operations/merge-identifier.ts
+// src/graph/-private/operations/merge-identifier.ts
 function mergeIdentifier(graph, op, relationships) {
 	Object.keys(relationships).forEach((key) => {
 		const rel = relationships[key];
@@ -915,8 +908,7 @@ function mergeImplicit(graph, rel, op) {
 	}
 }
 
-//#endregion
-//#region src/graph/-private/operations/remove-from-related-records.ts
+// src/graph/-private/operations/remove-from-related-records.ts
 function removeFromRelatedRecords(graph, op, isRemote) {
 	const { record, value } = op;
 	const relationship = graph.get(record, op.field);
@@ -941,8 +933,7 @@ function removeRelatedRecord(graph, record, relationship, value, index, isRemote
 	if (_remove(graph, record, relationship, value, index, isRemote)) removeFromInverse(graph, value, relationship.definition.inverseKey, record, isRemote);
 }
 
-//#endregion
-//#region src/graph/-private/normalize-link.ts
+// src/graph/-private/normalize-link.ts
 function _normalizeLink(link) {
 	switch (typeof link) {
 		case "object": return link;
@@ -950,8 +941,7 @@ function _normalizeLink(link) {
 	}
 }
 
-//#endregion
-//#region src/graph/-private/operations/update-relationship.ts
+// src/graph/-private/operations/update-relationship.ts
 function updateRelationshipOperation(graph, op) {
 	const relationship = graph.get(op.record, op.field);
 	const { definition, identifier } = relationship;
@@ -1011,8 +1001,7 @@ function upgradeIdentifiers(arr, cache) {
 	return arr;
 }
 
-//#endregion
-//#region src/graph/-private/graph.ts
+// src/graph/-private/graph.ts
 /**
 * A single edge (relationship field) tracked by the {@link Graph} for a resource. Which kind of edge
 * a field is depends on its relationship definition:
@@ -1589,8 +1578,7 @@ function isReordered(relationship) {
 	return false;
 }
 
-//#endregion
-//#region src/graph/-private.ts
+// src/graph/-private.ts
 /**
 Provides a performance tuned normalized graph for intelligently managing relationships between resources based on identity
 
@@ -1598,6 +1586,8 @@ While this Graph is abstract, it currently is a private implementation required
 
 We intend to make this Graph public API after some additional iteration during the 5.x timeframe, until then all APIs should be considered experimental and unstable, not fit for direct application or 3rd party library usage.
 
+@summary Experimental, private relationship graph used by the {json:api} Cache to track links between resources
+by identity.
 @module
 */
 function isStore(maybeStore) {
@@ -1623,6 +1613,5 @@ function graphFor(store) {
 	return graph;
 }
 
-//#endregion
 export { graphFor, isBelongsTo, peekGraph };
 //# sourceMappingURL=-private.js.map