1 | "use strict";
|
2 |
|
3 | const {
|
4 | store
|
5 | } = require(`./index`);
|
6 |
|
7 |
|
8 |
|
9 |
|
10 |
|
11 |
|
12 |
|
13 | const getNodes = () => {
|
14 | const nodes = store.getState().nodes;
|
15 |
|
16 | if (nodes) {
|
17 | return Array.from(nodes.values());
|
18 | } else {
|
19 | return [];
|
20 | }
|
21 | };
|
22 |
|
23 | exports.getNodes = getNodes;
|
24 |
|
25 |
|
26 |
|
27 |
|
28 |
|
29 |
|
30 | const getNode = id => store.getState().nodes.get(id);
|
31 |
|
32 | exports.getNode = getNode;
|
33 |
|
34 |
|
35 |
|
36 |
|
37 |
|
38 |
|
39 |
|
40 | const getNodesByType = type => {
|
41 | const nodes = store.getState().nodesByType.get(type);
|
42 |
|
43 | if (nodes) {
|
44 | return Array.from(nodes.values());
|
45 | } else {
|
46 | return [];
|
47 | }
|
48 | };
|
49 |
|
50 | exports.getNodesByType = getNodesByType;
|
51 |
|
52 |
|
53 |
|
54 |
|
55 |
|
56 |
|
57 | const getTypes = () => Array.from(store.getState().nodesByType.keys());
|
58 |
|
59 | exports.getTypes = getTypes;
|
60 |
|
61 |
|
62 |
|
63 |
|
64 |
|
65 |
|
66 |
|
67 |
|
68 | exports.hasNodeChanged = (id, digest) => {
|
69 | const node = store.getState().nodes.get(id);
|
70 |
|
71 | if (!node) {
|
72 | return true;
|
73 | } else {
|
74 | return node.internal.contentDigest !== digest;
|
75 | }
|
76 | };
|
77 |
|
78 |
|
79 |
|
80 |
|
81 |
|
82 |
|
83 |
|
84 |
|
85 |
|
86 | exports.getNodeAndSavePathDependency = (id, path) => {
|
87 | const createPageDependency = require(`./actions/add-page-dependency`);
|
88 |
|
89 | const node = getNode(id);
|
90 | createPageDependency({
|
91 | path,
|
92 | nodeId: id
|
93 | });
|
94 | return node;
|
95 | };
|
96 |
|
97 | exports.saveResolvedNodes = async (nodeTypeNames, resolver) => {
|
98 | for (const typeName of nodeTypeNames) {
|
99 | const nodes = store.getState().nodesByType.get(typeName);
|
100 | const resolvedNodes = new Map();
|
101 |
|
102 | if (nodes) {
|
103 | for (const node of nodes.values()) {
|
104 | const resolved = await resolver(node);
|
105 | resolvedNodes.set(node.id, resolved);
|
106 | }
|
107 |
|
108 | store.dispatch({
|
109 | type: `SET_RESOLVED_NODES`,
|
110 | payload: {
|
111 | key: typeName,
|
112 | nodes: resolvedNodes
|
113 | }
|
114 | });
|
115 | }
|
116 | }
|
117 | };
|
118 |
|
119 |
|
120 |
|
121 |
|
122 |
|
123 |
|
124 |
|
125 |
|
126 |
|
127 | const getResolvedNode = (typeName, id) => {
|
128 | const {
|
129 | nodesByType,
|
130 | resolvedNodesCache
|
131 | } = store.getState();
|
132 | const nodes
|
133 |
|
134 | = nodesByType.get(typeName);
|
135 |
|
136 | if (!nodes) {
|
137 | return null;
|
138 | }
|
139 |
|
140 | let node = nodes.get(id);
|
141 |
|
142 | if (!node) {
|
143 | return null;
|
144 | }
|
145 |
|
146 | const resolvedNodes = resolvedNodesCache.get(typeName);
|
147 |
|
148 | if (resolvedNodes) {
|
149 | node.__gatsby_resolved = resolvedNodes.get(id);
|
150 | }
|
151 |
|
152 | return node;
|
153 | };
|
154 |
|
155 | exports.getResolvedNode = getResolvedNode;
|
156 |
|
157 | const addResolvedNodes = (typeName, arr) => {
|
158 | const {
|
159 | nodesByType,
|
160 | resolvedNodesCache
|
161 | } = store.getState();
|
162 | const nodes
|
163 |
|
164 | = nodesByType.get(typeName);
|
165 |
|
166 | if (!nodes) {
|
167 | return;
|
168 | }
|
169 |
|
170 | const resolvedNodes = resolvedNodesCache.get(typeName);
|
171 | nodes.forEach(node => {
|
172 | if (resolvedNodes) {
|
173 | node.__gatsby_resolved = resolvedNodes.get(node.id);
|
174 | }
|
175 |
|
176 | arr.push(node);
|
177 | });
|
178 | };
|
179 |
|
180 | exports.addResolvedNodes = addResolvedNodes;
|
181 |
|
182 |
|
183 |
|
184 |
|
185 |
|
186 |
|
187 |
|
188 |
|
189 |
|
190 |
|
191 |
|
192 |
|
193 |
|
194 |
|
195 | const ensureIndexByTypedChain = (chain, nodeTypeNames, typedKeyValueIndexes) => {
|
196 | const chained = chain.join(`+`);
|
197 | const nodeTypeNamePrefix = nodeTypeNames.join(`,`) + `/`;
|
198 |
|
199 | const typedKey = nodeTypeNamePrefix + chained;
|
200 | let byKeyValue = typedKeyValueIndexes.get(typedKey);
|
201 |
|
202 | if (byKeyValue) {
|
203 | return;
|
204 | }
|
205 |
|
206 | const {
|
207 | nodes,
|
208 | resolvedNodesCache
|
209 | } = store.getState();
|
210 | byKeyValue = new Map();
|
211 |
|
212 | typedKeyValueIndexes.set(typedKey, byKeyValue);
|
213 | nodes.forEach(node => {
|
214 | if (!nodeTypeNames.includes(node.internal.type)) {
|
215 | return;
|
216 | }
|
217 |
|
218 |
|
219 | if (!node.__gatsby_resolved) {
|
220 | const typeName = node.internal.type;
|
221 | const resolvedNodes = resolvedNodesCache.get(typeName);
|
222 | node.__gatsby_resolved = resolvedNodes === null || resolvedNodes === void 0 ? void 0 : resolvedNodes.get(node.id);
|
223 | }
|
224 |
|
225 | let v = node;
|
226 | let i = 0;
|
227 |
|
228 | while (i < chain.length && v) {
|
229 | const nextProp = chain[i++];
|
230 | v = v[nextProp];
|
231 | }
|
232 |
|
233 | if (typeof v !== `string` && typeof v !== `number` && typeof v !== `boolean` || i !== chain.length) {
|
234 |
|
235 |
|
236 |
|
237 |
|
238 | return;
|
239 | }
|
240 |
|
241 |
|
242 | if (chained === `id`) {
|
243 |
|
244 |
|
245 | byKeyValue.set(v, node);
|
246 | return;
|
247 | }
|
248 |
|
249 | let set = byKeyValue.get(v);
|
250 |
|
251 | if (!set) {
|
252 | set = new Set();
|
253 | byKeyValue.set(v, set);
|
254 | }
|
255 |
|
256 | set.add(node);
|
257 | });
|
258 | };
|
259 |
|
260 | exports.ensureIndexByTypedChain = ensureIndexByTypedChain;
|
261 | /**
|
262 | * Given a ("flat") filter path leading up to "eq", a target value to filter
|
263 | * for, a set of node types, and a pre-generated lookup cache, return the set
|
264 | * of Nodes (or, if the property is `id` just the Node) which pass the filter.
|
265 | * This returns `undefined` if there is Node that passes the filter.
|
266 | *
|
267 | * Basically if the filter was {a: {b: {slug: {eq: "foo/bar"}}}} then it will
|
268 | * return all the nodes that have `node.slug === "foo/bar"`. That usually (but
|
269 | * not always) at most one node for slug, but this filter can apply to anything.
|
270 | *
|
271 | * The only exception is `id`, since internally there can be at most one node
|
272 | * per `id` so there's a minor optimization for that (no need for Sets).
|
273 | *
|
274 | * @param {Array<string>} chain Note: `eq` is assumed to be the leaf prop here
|
275 | * @param {boolean | number | string} value This is the value being filtered for
|
276 | * @param {Array<string>} nodeTypeNames
|
277 | * @param {undefined | Map<string, Map<string | number | boolean, Node>>} typedKeyValueIndexes
|
278 | * This object lives in query/query-runner.js and is passed down runQuery
|
279 | * @returns {Array<Node> | undefined}
|
280 | */
|
281 |
|
282 | const getNodesByTypedChain = (chain, value, nodeTypeNames, typedKeyValueIndexes) => {
|
283 | const key = chain.join(`+`);
|
284 | const typedKey = nodeTypeNames.join(`,`) + `/` + key;
|
285 | let byTypedKey = typedKeyValueIndexes === null || typedKeyValueIndexes === void 0 ? void 0 : typedKeyValueIndexes.get(typedKey);
|
286 | return byTypedKey === null || byTypedKey === void 0 ? void 0 : byTypedKey.get(value);
|
287 | };
|
288 |
|
289 | exports.getNodesByTypedChain = getNodesByTypedChain;
|
290 |
|
\ | No newline at end of file |