-
Notifications
You must be signed in to change notification settings - Fork 2
/
cssDealer.go
348 lines (335 loc) · 8.7 KB
/
cssDealer.go
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
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
package cssSelector
import (
"golang.org/x/net/html"
"strings"
"regexp"
"strconv"
// "fmt"
)
//Given a node and a css query expresion,return a slice of node
func Query(node *html.Node,cssExpression string)(res []*html.Node){
res=[]*html.Node{}
//preDeal make it standard Formate
cssExpression=preDeal(cssExpression)
//Split into groups and query them
groups:=getGroups(cssExpression)
for _,group:=range groups{
if group!=""{
res=append(res,QueryFromCssGroup(node,group)...)
}
}
return res
}
//Given a node and a cssGroup query expression,return a slice of node
func QueryFromCssGroup(node *html.Node,cssGroup string)(res []*html.Node){
atoms,joiners:=getAtomsAndJoiners(cssGroup)
rangeSlice:=[]*html.Node{node}
return queryFromAtomAndJoiners(rangeSlice,atoms,joiners)
}
func queryFromAtomAndJoiners(nodes []*html.Node,atoms,joiners []string)[]*html.Node{
tmp:=[]*html.Node{}
if atoms==nil||len(atoms)==0{
return nodes
}
for _,node:=range nodes{
res:=queryFromCssAtom(node,atoms[0])
tmp=append(tmp,res...)
}
tmp1:=[]*html.Node{}
if joiners!=nil&&len(joiners)>0{
for _,n:=range tmp{
switch(joiners[0]){
case " ":{
tmp1=append(tmp1,n)
}
case "+":{
tmp1=append(tmp1,n.NextSibling)
}
case ">":{
tmp1=append(tmp1,ChildElements(n)...)
}
case "~":{
tmp1=append(tmp1,BehindElements(n)...)
}
}
}
return queryFromAtomAndJoiners(tmp1,atoms[1:],joiners[1:])
}else{
return tmp
}
}
//Deal a css query expression,so that is can be analyzed correctlly
func preDeal(cssExpression string)string{
fp:=regexp.MustCompile(`\s+`)
p1:=fp.ReplaceAllLiteralString(cssExpression," ")
fp1:=regexp.MustCompile(`\s?([+>,~])\s?`)
p1=fp1.ReplaceAllString(p1,"$1")
p1=strings.Trim(p1," ")
return p1
}
//Split a css query expression into several groups
func getGroups(cssStdExpression string)[]string{
return strings.Split(cssStdExpression,",")
}
//Analyze a css query group,Split it into a slice of css query atom and a slice of joiner
func getAtomsAndJoiners(cssGroupExpression string)(atoms,atomJioners []string){
// joinMap:=map[string]string{"+":"下一个",">":"子元素"," ":"内的","~","后面的"}
atomeReg:=regexp.MustCompile(`([+> ~])`)
atoms=atomeReg.Split(cssGroupExpression,-1)
atomJioners=atomeReg.FindAllString(cssGroupExpression,-1)
return
}
//Given a node and css atom query expression and return a slice of node
func queryFromCssAtom(node *html.Node,cssAtom string)(res []*html.Node){
res=[]*html.Node{}
attrReg:=regexp.MustCompile(`^(\w+)?(\[(\w+)([\^\$\*]?=)"([0-9a-zA-Z_-]+)"\])+$`)
orderReg:=regexp.MustCompile(`^(\w+)?:(((\w+)-)+\w+)\((\d+)\)$`)
switch{
case cssAtom=="*":{
return Traversal(node,AttrFilter{})
}
case strings.HasPrefix(cssAtom,"#"):{
return Traversal(node,AttrFilter{AttrCondis:[]AttrCondtion{AttrCondtion{"id","=",cssAtom[1:]}}})
}
case strings.HasPrefix(cssAtom,"."):{
return Traversal(node,AttrFilter{AttrCondis:[]AttrCondtion{AttrCondtion{"class","*=",cssAtom[1:]}}})
}
case strings.HasSuffix(cssAtom,":first-child"):{
ns:=Traversal(node,OrderFilter{Order:1,PositiveSequense:true})
for _,n:=range ns{
if n.DataAtom.String()==strings.TrimSuffix(cssAtom,":first-child"){
res=append(res,n)
}
}
return res
}
case strings.HasSuffix(cssAtom,":last-child"):{
ns:=Traversal(node,OrderFilter{Order:1})
for _,n:=range ns{
if n.DataAtom.String()==strings.TrimSuffix(cssAtom,":last-child"){
res=append(res,n)
}
}
return res
}
case strings.HasSuffix(cssAtom,":first-of-type"):{
return Traversal(node,OrderFilter{Name: strings.TrimSuffix(cssAtom,":first-of-type"),Order:1,PositiveSequense:true})
}
case strings.HasSuffix(cssAtom,":last-of-type"):{
return Traversal(node,OrderFilter{Name: strings.TrimSuffix(cssAtom,":last-of-type"),Order:1})
}
case strings.HasSuffix(cssAtom,":only-child"):{
if node.NextSibling==nil&&node.NextSibling==nil&&strings.TrimSuffix(cssAtom,":only-child")==node.Data{
res=append(res,node)
}
return res
}
case strings.HasSuffix(cssAtom,":empty"):{
if node.FirstChild==nil&&strings.TrimSuffix(cssAtom,":empty")==node.Data{
res=append(res,node)
}
return res
}
case orderReg.MatchString(cssAtom):{
gs:=orderReg.FindStringSubmatch(cssAtom)
onum,_:=strconv.Atoi(gs[5])
onumber:=uint(onum)
switch gs[2]{
case "nth-child":{
ns:=Traversal(node,OrderFilter{Order:onumber,PositiveSequense:true})
for _,n:=range ns{
if n.Data==gs[1]{
res=append(res,n)
}
}
return res
}
case "nth-last-child":{
ns:=Traversal(node,OrderFilter{Order:onumber})
for _,n:=range ns{
if n.Data==gs[1]{
res=append(res,n)
}
}
return res
}
case "nth-of-type":{
return Traversal(node,OrderFilter{Name:gs[1],Order:onumber,PositiveSequense:true})
}
case "nth-last-of-type":{
return Traversal(node,OrderFilter{Name:gs[1],Order:onumber})
}
}
return
}
case attrReg.MatchString(cssAtom):{
tN:=attrReg.FindStringSubmatch(cssAtom)[1]
cssAtom=cssAtom[len(tN):]
cssAtom=cssAtom[1:len(cssAtom)-1]
attrs:=strings.Split(cssAtom,"][")
attrFilter:=AttrFilter{Name:tN,AttrCondis:[]AttrCondtion{}}
attrExpReg:=regexp.MustCompile(`^(\w+)(([\^\$\*]?=)"([0-9a-zA-Z_-]+)")?$`)
for _,attr:=range attrs{
if attrExpReg.MatchString(attr){
gs:=attrExpReg.FindStringSubmatch(attr)
attrFilter.AttrCondis=append(attrFilter.AttrCondis,AttrCondtion{Name:gs[1],Operator:gs[3],Value:gs[4]})
}
}
return Traversal(node,attrFilter)
}
default:{
return Traversal(node,AttrFilter{Name:cssAtom})
}
}
}
//Given a node and Filter implementation and return a slice of node.
func Traversal(node *html.Node,filter Filter)(res []*html.Node){
res=[]*html.Node{}
if node==nil{
return
}
if filter.Accept(node){
res=append(res,node)
}
firstChild:=node.FirstChild
if firstChild!=nil{
res=append(res,Traversal(firstChild,filter)...)
for next:=firstChild.NextSibling;next!=nil;next=next.NextSibling{
res=append(res,Traversal(next,filter)...)
}
}
return res
}
type AttrFilter struct{
Name string
AttrCondis []AttrCondtion
}
func (af AttrFilter)Accept(node *html.Node)bool{
if node==nil{
return false
}
if af.Name!=""&&node.DataAtom.String()!=af.Name{
return false
}
attrMap:=Attribute2Map(node.Attr)
if af.AttrCondis!=nil{
for _,attrCondi:=range af.AttrCondis{
if val,ok:=attrMap[attrCondi.Name];!ok{
return false
}else{
switch(attrCondi.Operator){
case "^=":{
if !strings.HasPrefix(val,attrCondi.Value){
return false
}
}
case "$=":{
if !strings.HasSuffix(val,attrCondi.Value){
return false
}
}
case "*=":{
if !strings.Contains(val,attrCondi.Value){
return false
}
}
case "=":{
if val!=attrCondi.Value{
return false
}
}
}
}
}
}
return true
}
type OrderFilter struct{
Name string
Order uint
PositiveSequense bool
}
func (of OrderFilter)Accept(node *html.Node)bool{
if node.Type!=html.ElementNode{
return false
}
var o uint=1
if of.PositiveSequense{
if of.Name!=""{
for prev:=node.PrevSibling;prev!=nil;prev=prev.PrevSibling{
if prev.Type==html.ElementNode&&node.DataAtom.String()==of.Name{
o++
}
}
}else{
for prev:=node.PrevSibling;prev!=nil;prev=prev.PrevSibling{
if prev.Type==html.ElementNode{
o++
}
}
}
}else{
if of.Name!=""{
for next:=node.NextSibling;next!=nil;next=next.NextSibling{
if next.Type==html.ElementNode&&node.DataAtom.String()==of.Name{
o++
}
}
}else{
for next:=node.NextSibling;next!=nil;next=next.NextSibling{
if next.Type==html.ElementNode{
o++
}
}
}
}
return o==of.Order
}
type AttrCondtion struct{
Name ,Operator ,Value string
}
type Filter interface{
Accept(node *html.Node)bool
}
func Attribute2Map(attrs []html.Attribute)map[string]string{
attrMap:=map[string]string{}
if attrs!=nil{
for _,attr:=range attrs{
attrMap[attr.Key]=attr.Val
}
}
return attrMap
}
//Get all child node of the param node
func ChildElements(node *html.Node)[]*html.Node{
res:=[]*html.Node{}
if node.FirstChild!=nil{
for next:=node.FirstChild;next!=nil;next=next.NextSibling{
if next.Type==html.ElementNode{
res=append(res,next)
}
}
}
return res
}
//Get all elements node behind the param node
func BehindElements(node *html.Node)[]*html.Node{
res:=[]*html.Node{}
for next:=node.NextSibling;next!=nil;next=next.NextSibling{
if next.Type==html.ElementNode{
res=append(res,next)
}
}
return res
}
func InnerText(node *html.Node)string{
text:=""
for n:=node.FirstChild;n!=nil;n=n.NextSibling{
if n.Type==html.TextNode{
text+=" "+n.Data
}else{
text+=" "+InnerText(n)
}
}
return text
}