/
RSTTraversal.js
183 lines (153 loc) · 4.44 KB
/
RSTTraversal.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
import flat from 'array.prototype.flat';
import entries from 'object.entries';
import isSubset from 'is-subset';
import functionName from 'function.prototype.name';
import isRegex from 'is-regex';
import getAdapter from './getAdapter';
export function propsOfNode(node) {
return (node && node.props) || {};
}
export function childrenOfNode(node) {
if (!node) return [];
const adapter = getAdapter();
const adapterHasIsFragment = adapter.isFragment && typeof adapter.isFragment === 'function';
const renderedArray = Array.isArray(node.rendered) ? flat(node.rendered, 1) : [node.rendered];
// React adapters before 16 will not have isFragment
if (!adapterHasIsFragment) {
return renderedArray;
}
return flat(renderedArray.map((currentChild) => {
// If the node is a Fragment, we want to return its children, not the fragment itself
if (adapter.isFragment(currentChild)) {
return childrenOfNode(currentChild);
}
return currentChild;
}), 1);
}
export function hasClassName(node, className) {
let classes = propsOfNode(node).className || '';
classes = String(classes).replace(/\s/g, ' ');
if (isRegex(className)) return className.test(classes);
return ` ${classes} `.indexOf(` ${className} `) > -1;
}
export function treeForEach(tree, fn) {
if (tree) {
fn(tree);
}
childrenOfNode(tree).forEach(node => treeForEach(node, fn));
}
export function treeFilter(tree, fn) {
const results = [];
treeForEach(tree, (node) => {
if (fn(node)) {
results.push(node);
}
});
return results;
}
/**
* To support sibling selectors we need to be able to find
* the siblings of a node. The easiest way to do that is find
* the parent of the node and access its children.
*
* This would be unneeded if the RST spec included sibling pointers
* such as node.nextSibling and node.prevSibling
* @param {*} root
* @param {*} targetNode
*/
export function findParentNode(root, targetNode) {
const results = treeFilter(
root,
(node) => {
if (!node.rendered) {
return false;
}
return childrenOfNode(node).indexOf(targetNode) !== -1;
},
);
return results[0] || null;
}
function pathFilter(path, fn) {
return path.filter(tree => treeFilter(tree, fn).length !== 0);
}
export function pathToNode(node, root) {
const queue = [root];
const path = [];
const hasNode = testNode => node === testNode;
while (queue.length) {
const current = queue.pop();
const children = childrenOfNode(current);
if (current === node) return pathFilter(path, hasNode);
path.push(current);
if (children.length === 0) {
// leaf node. if it isn't the node we are looking for, we pop.
path.pop();
}
queue.push(...children);
}
return null;
}
export function parentsOfNode(node, root) {
return (pathToNode(node, root) || []).reverse();
}
export function nodeHasId(node, id) {
return propsOfNode(node).id === id;
}
const CAN_NEVER_MATCH = {};
function replaceUndefined(v) {
return typeof v !== 'undefined' ? v : CAN_NEVER_MATCH;
}
function replaceUndefinedValues(obj) {
return entries(obj)
.reduce((acc, [k, v]) => ({ ...acc, [k]: replaceUndefined(v) }), {});
}
export function nodeMatchesObjectProps(node, props) {
return isSubset(propsOfNode(node), replaceUndefinedValues(props));
}
function getTextFromHostNode(hostNode) {
if (typeof hostNode === 'string') {
return String(hostNode || '');
}
if (!hostNode) {
return '';
}
return hostNode.textContent || '';
}
function getTextFromRSTNode(node, {
getCustom,
handleHostNodes,
recurse,
}) {
if (node == null) {
return '';
}
if (typeof node === 'string' || typeof node === 'number') {
return String(node);
}
if (getCustom && node.type && typeof node.type === 'function') {
return getCustom(node);
}
if (handleHostNodes && node.nodeType === 'host') {
return handleHostNodes(node);
}
return childrenOfNode(node).map(recurse).join('');
}
export function getTextFromNode(node) {
return getTextFromRSTNode(node, {
recurse: getTextFromNode,
getCustom({ type }) {
return `<${type.displayName || functionName(type)} />`;
},
});
}
export function getTextFromHostNodes(node, adapter) {
return getTextFromRSTNode(node, {
recurse(item) {
return getTextFromHostNodes(item, adapter);
},
handleHostNodes(item) {
const nodes = [].concat(adapter.nodeToHostNode(item, true));
return nodes.map(getTextFromHostNode).join('');
},
});
}