/
dom.js
183 lines (168 loc) · 5.55 KB
/
dom.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 { generateBuilder } from '../utils/post-builder';
import { trim } from 'content-kit-utils';
import { VALID_MARKUP_SECTION_TAGNAMES } from '../models/markup-section';
import { VALID_MARKUP_TAGNAMES } from '../models/markup';
const ELEMENT_NODE = 1;
const TEXT_NODE = 3;
const ALLOWED_ATTRIBUTES = ['href', 'rel', 'src'];
function isEmptyTextNode(node) {
return node.nodeType === TEXT_NODE && trim(node.textContent) === '';
}
// FIXME we need sorted attributes for deterministic tests. This is not
// a particularly elegant method, since it loops at least 3 times.
function sortAttributes(attributes) {
let keyValueAttributes = [];
let currentKey;
attributes.forEach((keyOrValue, index) => {
if (index % 2 === 0) {
currentKey = keyOrValue;
} else {
keyValueAttributes.push({key:currentKey, value:keyOrValue});
}
});
keyValueAttributes.sort((a,b) => {
return a.key === b.key ? 0 :
a.key > b.key ? 1 : - 1;
});
let sortedAttributes = [];
keyValueAttributes.forEach(({key, value}) => {
sortedAttributes.push(key, value);
});
return sortedAttributes;
}
// FIXME: should probably always return an array
function readAttributes(node) {
var attributes = null;
if (node.hasAttributes()) {
attributes = [];
var i, l;
for (i=0,l=node.attributes.length;i<l;i++) {
if (ALLOWED_ATTRIBUTES.indexOf(node.attributes[i].name) !== -1) {
attributes.push(node.attributes[i].name);
attributes.push(node.attributes[i].value);
}
}
if (attributes.length === 0) {
return null;
} else {
return sortAttributes(attributes);
}
}
return null;
}
function isValidMarkerElement(element) {
return VALID_MARKUP_TAGNAMES.indexOf(element.tagName.toLowerCase()) !== -1;
}
function parseMarkers(section, postBuilder, topNode) {
var markups = [];
var text = null;
var currentNode = topNode;
while (currentNode) {
switch(currentNode.nodeType) {
case ELEMENT_NODE:
if (isValidMarkerElement(currentNode)) {
markups.push(postBuilder.generateMarkup(currentNode.tagName, readAttributes(currentNode)));
}
break;
case TEXT_NODE:
text = (text || '') + currentNode.textContent;
break;
}
if (currentNode.firstChild) {
if (isValidMarkerElement(currentNode) && text !== null) {
section.markers.push(postBuilder.generateMarker(markups.slice(), text));
text = null;
}
currentNode = currentNode.firstChild;
} else if (currentNode.nextSibling) {
if (currentNode === topNode) {
section.markers.push(postBuilder.generateMarker(markups.slice(), text));
break;
} else {
currentNode = currentNode.nextSibling;
if (currentNode.nodeType === ELEMENT_NODE && isValidMarkerElement(currentNode) && text !== null) {
section.markers.push(postBuilder.generateMarker(markups.slice(), text));
text = null;
}
}
} else {
section.markers.push(postBuilder.generateMarker(markups.slice(), text));
while (currentNode && !currentNode.nextSibling && currentNode !== topNode) {
currentNode = currentNode.parentNode;
if (isValidMarkerElement(currentNode)) {
markups.pop();
}
}
text = null;
if (currentNode === topNode) {
break;
} else {
currentNode = currentNode.nextSibling;
if (currentNode === topNode) {
break;
}
}
}
}
}
function NewHTMLParser() {
this.postBuilder = generateBuilder();
}
NewHTMLParser.prototype = {
parseSection: function(previousSection, sectionElement) {
var postBuilder = this.postBuilder;
var section;
switch(sectionElement.nodeType) {
case ELEMENT_NODE:
var tagName = sectionElement.tagName;
// <p> <h2>, etc
if (VALID_MARKUP_SECTION_TAGNAMES.indexOf(tagName.toLowerCase()) !== -1) {
section = postBuilder.generateMarkupSection(tagName, readAttributes(sectionElement));
var node = sectionElement.firstChild;
while (node) {
parseMarkers(section, postBuilder, node);
node = node.nextSibling;
}
// <strong> <b>, etc
} else {
if (previousSection && previousSection.isGenerated) {
section = previousSection;
} else {
section = postBuilder.generateMarkupSection('P', {}, true);
}
parseMarkers(section, postBuilder, sectionElement);
}
break;
case TEXT_NODE:
if (previousSection && previousSection.isGenerated) {
section = previousSection;
} else {
section = postBuilder.generateMarkupSection('P', {}, true);
}
parseMarkers(section, postBuilder, sectionElement);
break;
}
return section;
},
parse: function(postElement) {
var post = this.postBuilder.generatePost();
var i, l, section, previousSection, sectionElement;
// FIXME: Instead of storing isGenerated on sections, and passing
// the previous section to the parser, we could instead do a two-pass
// parse. The first pass identifies sections and gathers a list of
// dom nodes that can be parsed for markers, the second pass parses
// for markers.
for (i=0, l=postElement.childNodes.length;i<l;i++) {
sectionElement = postElement.childNodes[i];
if (!isEmptyTextNode(sectionElement)) {
section = this.parseSection(previousSection, sectionElement);
if (section !== previousSection) {
post.appendSection(section);
previousSection = section;
}
}
}
return post;
}
};
export default NewHTMLParser;