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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
|
import options
import streams
import strutils
import tables
import css/cssparser
import css/selectorparser
import css/stylednode
import html/dom
import html/tags
func attrSelectorMatches(elem: Element, sel: Selector): bool =
case sel.rel
of ' ': return sel.attr in elem.attributes
of '=': return elem.attr(sel.attr) == sel.value
of '~': return sel.value in elem.attr(sel.attr).split(Whitespace)
of '|':
let val = elem.attr(sel.attr)
return val == sel.value or sel.value.startsWith(val & '-')
of '^': return elem.attr(sel.attr).startsWith(sel.value)
of '$': return elem.attr(sel.attr).endsWith(sel.value)
of '*': return elem.attr(sel.attr).contains(sel.value)
else: return false
func selectorsMatch*[T: Element|StyledNode](elem: T, selectors: ComplexSelector, felem: T = nil): bool
func selectorsMatch*[T: Element|StyledNode](elem: T, selectors: SelectorList, felem: T = nil): bool =
for slist in selectors:
if elem.selectorsMatch(slist, felem):
return true
return false
func pseudoSelectorMatches[T: Element|StyledNode](elem: T, sel: Selector, felem: T): bool =
let selem = elem
when elem is StyledNode:
let elem = Element(elem.node)
case sel.pseudo.t
of PSEUDO_FIRST_CHILD: return elem.parentNode.firstElementChild == elem
of PSEUDO_LAST_CHILD: return elem.parentNode.lastElementChild == elem
of PSEUDO_ONLY_CHILD: return elem.parentNode.firstElementChild == elem and elem.parentNode.lastElementChild == elem
of PSEUDO_HOVER:
when selem is StyledNode: felem.addDependency(selem, DEPEND_HOVER)
return elem.hover
of PSEUDO_ROOT: return elem == elem.document.html
of PSEUDO_NTH_CHILD:
if sel.pseudo.ofsels.issome and not selem.selectorsMatch(sel.pseudo.ofsels.get, felem):
return false
let A = sel.pseudo.anb.A # step
let B = sel.pseudo.anb.B # start
var i = 1
let parent = when selem is StyledNode: selem.parent
else: selem.parentNode
if parent == nil: return false
for child in parent.children:
when selem is StyledNode:
if not child.isDomElement: continue
if child == selem:
if A == 0:
return i == B
if A < 0:
return (i - B) <= 0 and (i - B) mod A == 0
return (i - B) >= 0 and (i - B) mod A == 0
if sel.pseudo.ofsels.isnone or child.selectorsMatch(sel.pseudo.ofsels.get, felem):
inc i
return false
of PSEUDO_NTH_LAST_CHILD:
if sel.pseudo.ofsels.issome and not selem.selectorsMatch(sel.pseudo.ofsels.get, felem):
return false
let A = sel.pseudo.anb.A # step
let B = sel.pseudo.anb.B # start
var i = 1
let parent = when selem is StyledNode: selem.parent
else: selem.parentNode
if parent == nil: return false
for child in parent.children_rev:
when selem is StyledNode:
if not child.isDomElement: continue
if child == selem:
if A == 0:
return i == B
if A < 0:
return (i - B) <= 0 and (i - B) mod A == 0
return (i - B) >= 0 and (i - B) mod A == 0
if sel.pseudo.ofsels.isnone or child.selectorsMatch(sel.pseudo.ofsels.get, felem):
inc i
return false
of PSEUDO_CHECKED:
when selem is StyledNode: felem.addDependency(selem, DEPEND_CHECKED)
if elem.tagType == TAG_INPUT:
return HTMLInputElement(elem).checked
elif elem.tagType == TAG_OPTION:
return HTMLOptionElement(elem).selected
return false
of PSEUDO_FOCUS:
when selem is StyledNode: felem.addDependency(selem, DEPEND_FOCUS)
return elem.document.focus == elem
of PSEUDO_NOT:
return not selem.selectorsMatch(sel.pseudo.fsels, felem)
of PSEUDO_IS, PSEUDO_WHERE:
return selem.selectorsMatch(sel.pseudo.fsels, felem)
func combinatorSelectorMatches[T: Element|StyledNode](elem: T, sel: Selector, felem: T): bool =
let selem = elem
# combinator without at least two members makes no sense
# actually, combinators with more than two elements are a pretty bad idea
# too. TODO getting rid of them would simplify this function greatly
assert sel.csels.len > 1
if selem.selectorsMatch(sel.csels[^1], felem):
var i = sel.csels.len - 2
case sel.ct
of DESCENDANT_COMBINATOR:
when selem is StyledNode:
var e = elem.parent
else:
var e = elem.parentElement
while e != nil and i >= 0:
if e.selectorsMatch(sel.csels[i], felem):
dec i
when elem is StyledNode:
e = e.parent
else:
e = e.parentElement
of CHILD_COMBINATOR:
when elem is StyledNode:
var e = elem.parent
else:
var e = elem.parentElement
while e != nil and i >= 0:
if not e.selectorsMatch(sel.csels[i], felem):
return false
dec i
when elem is StyledNode:
e = e.parent
else:
e = e.parentElement
of NEXT_SIBLING_COMBINATOR:
var found = false
let parent = when elem is StyledNode: elem.parent
else: elem.parentElement
if parent == nil: return false
for child in parent.children_rev:
when elem is StyledNode:
if not child.isDomElement: continue
if found:
if not child.selectorsMatch(sel.csels[i], felem):
return false
dec i
if i < 0:
return true
if child == elem:
found = true
of SUBSEQ_SIBLING_COMBINATOR:
var found = false
let parent = when selem is StyledNode: selem.parent
else: elem.parentElement
if parent == nil: return false
for child in parent.children_rev:
when selem is StyledNode:
if not child.isDomElement: continue
if child == selem:
found = true
continue
if not found: continue
if child.selectorsMatch(sel.csels[i], felem):
dec i
if i < 0:
return true
return i == -1
return false
func selectorMatches[T: Element|StyledNode](elem: T, sel: Selector, felem: T = nil): bool =
let selem = elem
when elem is StyledNode:
let elem = Element(selem.node)
case sel.t
of TYPE_SELECTOR:
return elem.tagType == sel.tag
of CLASS_SELECTOR:
return sel.class in elem.classList
of ID_SELECTOR:
return sel.id == elem.id
of ATTR_SELECTOR:
return elem.attrSelectorMatches(sel)
of PSEUDO_SELECTOR:
return pseudoSelectorMatches(selem, sel, felem)
of PSELEM_SELECTOR:
return true
of UNIVERSAL_SELECTOR:
return true
of COMBINATOR_SELECTOR:
return combinatorSelectorMatches(selem, sel, felem)
# WARNING for StyledNode, this has the side effect of modifying depends.
#TODO make that an explicit flag or something, also get rid of the Element case
func selectorsMatch*[T: Element|StyledNode](elem: T, selectors: ComplexSelector, felem: T = nil): bool =
let felem = if felem != nil:
felem
else:
elem
for sel in selectors:
if not selectorMatches(elem, sel, felem):
return false
return true
proc querySelectorAll(node: Node, q: string): seq[Element] =
let selectors = parseSelectors(newStringStream(q))
for element in node.elements:
if element.selectorsMatch(selectors):
result.add(element)
doqsa = (proc(node: Node, q: string): seq[Element] = querySelectorAll(node, q))
proc querySelector(node: Node, q: string): Element =
let selectors = parseSelectors(newStringStream(q))
for element in node.elements:
if element.selectorsMatch(selectors):
return element
return nil
doqs = (proc(node: Node, q: string): Element = querySelector(node, q))
|