next
Version:
The React Framework
84 lines (83 loc) • 4.34 kB
JavaScript
import { invalidateCacheByRouterState } from './invalidate-cache-by-router-state';
import { fillLazyItemsTillLeafWithHead } from './fill-lazy-items-till-leaf-with-head';
import { createRouterCacheKey } from './create-router-cache-key';
import { PAGE_SEGMENT_KEY } from '../../../shared/lib/segment';
/**
* Common logic for filling cache with new sub tree data.
*/ function fillCacheHelper(newCache, existingCache, flightData, prefetchEntry, fillLazyItems) {
const { segmentPath, seedData: cacheNodeSeedData, tree: treePatch, head } = flightData;
let newCacheNode = newCache;
let existingCacheNode = existingCache;
for(let i = 0; i < segmentPath.length; i += 2){
const parallelRouteKey = segmentPath[i];
const segment = segmentPath[i + 1];
// segmentPath is a repeating tuple of parallelRouteKey and segment
// we know we've hit the last entry we've reached our final pair
const isLastEntry = i === segmentPath.length - 2;
const cacheKey = createRouterCacheKey(segment);
const existingChildSegmentMap = existingCacheNode.parallelRoutes.get(parallelRouteKey);
if (!existingChildSegmentMap) {
continue;
}
let childSegmentMap = newCacheNode.parallelRoutes.get(parallelRouteKey);
if (!childSegmentMap || childSegmentMap === existingChildSegmentMap) {
childSegmentMap = new Map(existingChildSegmentMap);
newCacheNode.parallelRoutes.set(parallelRouteKey, childSegmentMap);
}
const existingChildCacheNode = existingChildSegmentMap.get(cacheKey);
let childCacheNode = childSegmentMap.get(cacheKey);
if (isLastEntry) {
if (cacheNodeSeedData && (!childCacheNode || !childCacheNode.lazyData || childCacheNode === existingChildCacheNode)) {
const incomingSegment = cacheNodeSeedData[0];
const rsc = cacheNodeSeedData[1];
const loading = cacheNodeSeedData[3];
childCacheNode = {
lazyData: null,
// When `fillLazyItems` is false, we only want to fill the RSC data for the layout,
// not the page segment.
rsc: fillLazyItems || incomingSegment !== PAGE_SEGMENT_KEY ? rsc : null,
prefetchRsc: null,
head: null,
prefetchHead: null,
loading,
parallelRoutes: fillLazyItems && existingChildCacheNode ? new Map(existingChildCacheNode.parallelRoutes) : new Map()
};
if (existingChildCacheNode && fillLazyItems) {
invalidateCacheByRouterState(childCacheNode, existingChildCacheNode, treePatch);
}
if (fillLazyItems) {
fillLazyItemsTillLeafWithHead(childCacheNode, existingChildCacheNode, treePatch, cacheNodeSeedData, head, prefetchEntry);
}
childSegmentMap.set(cacheKey, childCacheNode);
}
continue;
}
if (!childCacheNode || !existingChildCacheNode) {
continue;
}
if (childCacheNode === existingChildCacheNode) {
childCacheNode = {
lazyData: childCacheNode.lazyData,
rsc: childCacheNode.rsc,
prefetchRsc: childCacheNode.prefetchRsc,
head: childCacheNode.head,
prefetchHead: childCacheNode.prefetchHead,
parallelRoutes: new Map(childCacheNode.parallelRoutes),
loading: childCacheNode.loading
};
childSegmentMap.set(cacheKey, childCacheNode);
}
// Move deeper into the cache nodes
newCacheNode = childCacheNode;
existingCacheNode = existingChildCacheNode;
}
}
/**
* Fill cache with rsc based on flightDataPath
*/ export function fillCacheWithNewSubTreeData(newCache, existingCache, flightData, prefetchEntry) {
fillCacheHelper(newCache, existingCache, flightData, prefetchEntry, true);
}
export function fillCacheWithNewSubTreeDataButOnlyLoading(newCache, existingCache, flightData, prefetchEntry) {
fillCacheHelper(newCache, existingCache, flightData, prefetchEntry, false);
}
//# sourceMappingURL=fill-cache-with-new-subtree-data.js.map