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
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
|
#!/usr/bin/python
# -*- coding: utf-8 -*-
"""
BSXPath.py: XPathEvaluator Extension for BeautifulSoup
"""
__version__ = '0.01e' # based on JavaScript-XPath 0.1.11 (c) 2007 Cybozu Labs, Inc. (http://coderepos.org/share/wiki/JavaScript-XPath)
__date__ = '2009-04-12'
__license__ = 'MIT-style license'
__author__ = 'furyu' # http://furyu.tea-nifty.com/annex/
# http://d.hatena.ne.jp/furyu-tei/
"""
Usage:
from BSXPath import BSXPathEvaluator,XPathResult
#*** PREPARATION (create object)
document = BSXPathEvaluator(<html>) # BSXPathEvaluator is sub-class of BeautifulSoup
# html: HTML (text string)
#*** BASIC OPERATIONS
result = document.evaluate(<expression>,<node>,None,<type>,None)
# expression: XPath expression
# node : base context-node(document is document-root)
# type : XPathResult.<name>
# name : ANY_TYPE, NUMBER_TYPE, STRING_TYPE, BOOLEAN_TYPE, UNORDERED_NODE_ITERATOR_TYPE, ORDERED_NODE_ITERATOR_TYPE
# UNORDERED_NODE_SNAPSHOT_TYPE, ORDERED_NODE_SNAPSHOT_TYPE, ANY_UNORDERED_NODE_TYPE, FIRST_ORDERED_NODE_TYPE
# (*) 3rd(resolver) and 5th(result) arguments are not implemented
length = result.snapshotLength
node = result.snapshotItem(<number>)
#*** USEFUL WRAPPER-FUNCTIONS
nodes = document.getItemList(<expression>[,<node>])
first = document.getFirstItem(<expression>[,<node>])
# expression: XPath expression
# node(optional): base context-node(default: document(document-root))
Examples:
from BSXPath import BSXPathEvaluator,XPathResult
html = '<html><head><title>Hello, DOM 3 XPath!</title></head><body><h1>Hello, DOM 3 XPath!</h1><p>This is XPathEvaluator Extension for BeautifulSoup.</p><p>This is based on JavaScript-XPath!</p></body>'
document = BSXPathEvaluator(html)
result = document.evaluate('//h1/text()[1]',document,None,XPathResult.STRING_TYPE,None)
print result.stringValue
# Hello, DOM 3 XPath!
result = document.evaluate('//h1',document,None,XPathResult.ORDERED_NODE_SNAPSHOT_TYPE,None)
print result.snapshotLength
# 1
print result.snapshotItem(0)
# <h1>Hello, DOM 3 XPath!</h1>
nodes = document.getItemList('//p')
print len(nodes)
# 2
print nodes
# [<p>This is XPathEvaluator Extension for BeautifulSoup.</p>, <p>This is based on JavaScript-XPath!</p>]
first = document.getFirstItem('//p')
print first
# <p>This is XPathEvaluator Extension for BeautifulSoup.</p>
Notice:
- This is based on JavaScript-XPath (c) 2007 Cybozu Labs, Inc. (http://coderepos.org/share/wiki/JavaScript-XPath)
- Required:
- Python 2.5+
- BeautifulSoup 3.0.7+(recommended) or 3.1.0+
"""
import re,types,math,datetime
#import logging
from BeautifulSoup import *
try:
if DEFAULT_OUTPUT_ENCODING:
pass
except:
DEFAULT_OUTPUT_ENCODING='utf-8'
#***** Optional Parameters
USE_NODE_CACHE=True
USE_NODE_INDEX=True
#***** General Functions
def throwError(str):
raise ValueError, str
def typeof(obj):
if isinstance(obj,bool):
return 'boolean'
if isinstance(obj,int) or isinstance(obj,float):
return 'number'
if isinstance(obj,basestring):
return 'string'
if isinstance(obj,types.FunctionType):
return 'function'
return 'object'
def isNaN(obj):
if isinstance(obj,int) or isinstance(obj,float):
return False
if not isinstance(obj,basestring):
return True
if obj.isdigit():
return False
try:
float(obj)
return False
except:
return True
def toNumber(obj):
if isinstance(obj,int) or isinstance(obj,float):
return obj
if isinstance(obj,basestring):
if obj.isdigit():
return int(obj)
try:
return float(obj)
except:
return obj
return obj
def toBoolean(obj):
return bool(obj)
def toString(obj):
if isinstance(obj,bool):
return u'true' if obj else u'false'
if isinstance(obj,str) or isinstance(obj,int) or isinstance(obj,float):
return unicode(obj)
return obj
#***** General Classes
class ExtDict(dict):
def __getattr__(self,name):
try:
attr=super(ExtDict,self).__getattr__(name)
except:
if not self.has_key(name):
raise AttributeError,name
attr=self.get(name)
return attr
#***** Common Definitions
indent_space=' '
#{ // Regular Expressions
re_has_ualpha=re.compile(r'(?![0-9])[\w]')
re_seqspace=re.compile(r'\s+')
re_firstspace=re.compile(r'^\s')
re_lastspace=re.compile(r'\s$')
#} // end of Regular Expressions
#{ // NodeTypeDOM
NodeTypeDOM=ExtDict({
'ANY_NODE' :0
, 'ELEMENT_NODE' :1
, 'ATTRIBUTE_NODE' :2
, 'TEXT_NODE' :3
, 'CDATA_SECTION_NODE' :4
, 'ENTITY_REFERENCE_NODE' :5
, 'ENTITY_NODE' :6
, 'PROCESSING_INSTRUCTION_NODE':7
, 'COMMENT_NODE' :8
, 'DOCUMENT_NODE' :9
, 'DOCUMENT_TYPE_NODE' :10
, 'DOCUMENT_FRAGMENT_NODE' :11
, 'NOTATION_NODE' :12
})
NodeTypeBS=ExtDict({
'BSXPathEvaluator' :NodeTypeDOM.DOCUMENT_NODE
, 'NavigableString' :NodeTypeDOM.TEXT_NODE
, 'CData' :NodeTypeDOM.CDATA_SECTION_NODE
, 'ProcessingInstruction':NodeTypeDOM.PROCESSING_INSTRUCTION_NODE
, 'Comment' :NodeTypeDOM.COMMENT_NODE
, 'Declaration' :NodeTypeDOM.ANY_NODE
, 'Tag' :NodeTypeDOM.ELEMENT_NODE
})
#} // end of NodeTypeDOM
#{ // NodeUtil
def makeNodeUtils():
re_type_document_type=re.compile(r'^DOCTYPE\s')
re_type_entity =re.compile(r'^ENTITY\s')
re_type_notation =re.compile(r'^NOTATION\s')
#re_processing_instruction=re.compile(r'^(.*?)\s+(.*?)\?*$')
re_processing_instruction=re.compile(r'^(.*?)(\s+.*?)\?*$')
re_declaration_name=re.compile(r'^([^\s]+)\s+([\%]?)\s*([^\s]+)\s')
def makeNU_BS():
def _nodeType(node):
if getattr(node,'nodeType',None)==NodeTypeDOM.ATTRIBUTE_NODE:
return node.nodeType
nodeType=NodeTypeBS.get(node.__class__.__name__)
if nodeType==NodeTypeDOM.ANY_NODE:
str=NavigableString.encode(node,DEFAULT_OUTPUT_ENCODING)
if re_type_document_type.search(str):
nodeType=NodeTypeDOM.DOCUMENT_TYPE_NODE
elif re_type_entity.search(str):
nodeType=NodeTypeDOM.ENTITY_NODE
elif re_type_notation.search(str):
nodeType=NodeTypeDOM.NOTATION_NODE
return nodeType
def _nodeName(node):
if getattr(node,'nodeType',None)==NodeTypeDOM.ATTRIBUTE_NODE:
return node.nodeName.lower()
nodeType=_nodeType(node)
if nodeType==NodeTypeDOM.DOCUMENT_NODE:
return '#document'
elif nodeType==NodeTypeDOM.TEXT_NODE:
return '#text'
elif nodeType==NodeTypeDOM.CDATA_SECTION_NODE:
return '#cdata-section'
elif nodeType==NodeTypeDOM.PROCESSING_INSTRUCTION_NODE:
mrslt=re_processing_instruction.search(NavigableString.encode(node,DEFAULT_OUTPUT_ENCODING))
if mrslt:
return mrslt.group(1)
else:
return NavigableString.encode(node,DEFAULT_OUTPUT_ENCODING)
elif nodeType==NodeTypeDOM.COMMENT_NODE:
return '#comment'
elif nodeType==NodeTypeDOM.DOCUMENT_TYPE_NODE or nodeType==NodeTypeDOM.ENTITY_NODE or nodeType==NodeTypeDOM.NOTATION_NODE:
mrslt=re_declaration_name.search(NavigableString.encode(node,DEFAULT_OUTPUT_ENCODING))
if mrslt:
return mrslt.group(2)
else:
return NavigableString.encode(node,DEFAULT_OUTPUT_ENCODING)
else:
return node.name.lower()
def _nodeValue(node):
if getattr(node,'nodeType',None)==NodeTypeDOM.ATTRIBUTE_NODE:
return node.nodeValue
nodeType=_nodeType(node)
if nodeType==NodeTypeDOM.CDATA_SECTION_NODE or \
nodeType==NodeTypeDOM.COMMENT_NODE or \
nodeType==NodeTypeDOM.TEXT_NODE:
return NavigableString.encode(node, DEFAULT_OUTPUT_ENCODING)
if nodeType==NodeTypeDOM.PROCESSING_INSTRUCTION_NODE:
mrslt=re_processing_instruction.search(NavigableString.encode(node,DEFAULT_OUTPUT_ENCODING))
if mrslt:
return mrslt.group(2)
else:
return None
return None
def _nodeAttrValue(node,attrName):
if getattr(node,'nodeType',None)==NodeTypeDOM.ATTRIBUTE_NODE:
return None
nodeType=_nodeType(node)
if nodeType!=NodeTypeDOM.ELEMENT_NODE:
return None
return node.get(attrName)
def _parentNode(node):
if getattr(node,'nodeType',None)==NodeTypeDOM.ATTRIBUTE_NODE:
return node.parentNode
return node.parent
def _ownerDocument(node):
owner=getattr(node,'_owner',None)
if owner:
return owner
if getattr(node,'nodeType',None)==NodeTypeDOM.ATTRIBUTE_NODE:
owner=node.parentNode
else:
owner=node
while True:
parent=owner.parent
if not parent:
break
owner=parent
try:
node._owner=owner
except:
pass
return owner
def pairwise(iterable):
itnext = iter(iterable).next
while True:
yield itnext(), itnext()
def _attributes(node):
if _nodeType(node)==NodeTypeDOM.ELEMENT_NODE:
#return node._getAttrMap()
if not getattr(node,'attrMap'):
node.attrMap=dict(pairwise(node.attrs))
return node.attrMap
else:
return None
def _contains(node,cnode):
if _nodeType(node)==NodeTypeDOM.ATTRIBUTE_NODE: node=node.parentNode
if _nodeType(cnode)==NodeTypeDOM.ATTRIBUTE_NODE: cnode=cnode.parentNode
return node in cnode.findParents()
def _preceding(node,cnode):
if _nodeType(node)==NodeTypeDOM.ATTRIBUTE_NODE: node=node.parentNode
if _nodeType(cnode)==NodeTypeDOM.ATTRIBUTE_NODE: cnode=cnode.parentNode
#return cnode in node.findAllPrevious()
return cnode in node.findPreviousSiblings()
def _following(node,cnode):
if _nodeType(node)==NodeTypeDOM.ATTRIBUTE_NODE: node=node.parentNode
if _nodeType(cnode)==NodeTypeDOM.ATTRIBUTE_NODE: cnode=cnode.parentNode
#return cnode in node.findAllNext()
return cnode in node.findNextSiblings()
def d_getattr(self,name):
raise AttributeError,name
#{ // ExtPageElement
class ExtPageElement:
def __getattr__(self,name):
if name=='nodeType': return _nodeType(self)
if name=='nodeName': return _nodeName(self)
if name=='nodeValue': return _nodeValue(self)
if name=='parentNode': return _parentNode(self)
if name=='ownerDocument': return _ownerDocument(self)
if name=='attributes': return _attributes(self)
if name=='get': return self.get
if name=='contains': return self.contains
if name=='preceding': return self.preceding
if name=='following': return self.following
d_getattr(self,name)
def get(self,key,default=None):
return _nodeAttrValue(self,key)
def contains(self,cnode):
return _contains(self,cnode)
def preceding(self,cnode):
return _preceding(self,cnode)
def following(self,cnode):
return _following(self,cnode)
PageElement.__bases__+=(ExtPageElement,)
BeautifulSoup.__bases__+=(ExtPageElement,)
NavigableString.__bases__+=(ExtPageElement,)
CData.__bases__+=(ExtPageElement,)
ProcessingInstruction.__bases__+=(ExtPageElement,)
Comment.__bases__+=(ExtPageElement,)
Declaration.__bases__+=(ExtPageElement,)
Tag.__bases__+=(ExtPageElement,)
#} // ExtPageElement
#{ // _extBeautifulSoup
def _extBeautifulSoup():
o_getattr=getattr(BeautifulSoup,'__getattr__',d_getattr)
def e_getattr(self,name):
if name=='nodeType': return NodeTypeDOM.DOCUMENT_NODE
if name=='nodeName': return '#document'
if name=='nodeValue': return None
if name=='parentNode': return None
if name=='ownerDocument': return None
if name=='attributes': return None
return o_getattr(self,name)
BeautifulSoup.__getattr__=e_getattr
_extBeautifulSoup()
#} // _extBeautifulSoup
#{ // _extNavigableString
def _extNavigableString():
o_getattr=getattr(NavigableString,'__getattr__',d_getattr)
def e_getattr(self,name):
if name=='nodeType': return NodeTypeDOM.TEXT_NODE
if name=='nodeName': return '#text'
if name=='nodeValue': return NavigableString.encode(self,DEFAULT_OUTPUT_ENCODING)
if name=='parentNode': return self.parent
if name=='ownerDocument': return _ownerDocument(self)
if name=='attributes': return None
return o_getattr(self,name)
NavigableString.__getattr__=e_getattr
_extNavigableString()
#} // _extNavigableString
#{ // _extCData
def _extCData():
o_getattr=getattr(CData,'__getattr__',d_getattr)
def e_getattr(self,name):
if name=='nodeType': return NodeTypeDOM.CDATA_SECTION_NODE
if name=='nodeName': return '#cdata-section'
if name=='nodeValue': return NavigableString.encode(self,DEFAULT_OUTPUT_ENCODING)
if name=='parentNode': return self.parent
if name=='ownerDocument': return _ownerDocument(self)
if name=='attributes': return None
return o_getattr(self,name)
CData.__getattr__=e_getattr
_extCData()
#} // _extCData
#{ // _extProcessingInstruction
def _extProcessingInstruction():
o_getattr=getattr(ProcessingInstruction,'__getattr__',d_getattr)
def e_getattr(self,name):
if name=='nodeType': return NodeTypeDOM.PROCESSING_INSTRUCTION_NODE
if name=='nodeName':
mrslt=re_processing_instruction.search(NavigableString.encode(self,DEFAULT_OUTPUT_ENCODING))
return mrslt.group(1) if mrslt else NavigableString.encode(self,DEFAULT_OUTPUT_ENCODING)
if name=='nodeValue':
mrslt=re_processing_instruction.search(NavigableString.encode(self,DEFAULT_OUTPUT_ENCODING))
return mrslt.group(2) if mrslt else None
if name=='parentNode': return self.parent
if name=='ownerDocument': return _ownerDocument(self)
if name=='attributes': return None
return o_getattr(self,name)
ProcessingInstruction.__getattr__=e_getattr
_extProcessingInstruction()
#} // _extProcessingInstruction
#{ // _extComment
def _extComment():
o_getattr=getattr(Comment,'__getattr__',d_getattr)
def e_getattr(self,name):
if name=='nodeType': return NodeTypeDOM.COMMENT_NODE
if name=='nodeName': return '#comment'
if name=='nodeValue': return NavigableString.encode(self, DEFAULT_OUTPUT_ENCODING)
if name=='parentNode': return self.parent
if name=='ownerDocument': return _ownerDocument(self)
if name=='attributes': return None
return o_getattr(self,name)
Comment.__getattr__=e_getattr
_extComment()
#} // _extComment
#{ // _extDeclaration
def _extDeclaration():
o_getattr=getattr(Declaration,'__getattr__',d_getattr)
def e_getattr(self,name):
if name=='nodeType':
str=NavigableString.encode(self,DEFAULT_OUTPUT_ENCODING)
if re_type_document_type.search(str):
return NodeTypeDOM.DOCUMENT_TYPE_NODE
elif re_type_entity.search(str):
return NodeTypeDOM.ENTITY_NODE
elif re_type_notation.search(str):
return NodeTypeDOM.NOTATION_NODE
else:
return NodeTypeDOM.ANY_NODE
if name=='nodeName':
mrslt=re_declaration_name.search(NavigableString.encode(self,DEFAULT_OUTPUT_ENCODING))
return mrslt.group(2) if mrslt else NavigableString.encode(self,DEFAULT_OUTPUT_ENCODING)
if name=='nodeValue': return None
if name=='parentNode': return self.parent
if name=='ownerDocument': return _ownerDocument(self)
if name=='attributes': return None
return o_getattr(self,name)
Declaration.__getattr__=e_getattr
_extDeclaration()
#} // _extDeclaration
#{ // _extTag
def _extTag():
o_getattr=getattr(Tag,'__getattr__',d_getattr)
def e_getattr(self,name):
if name=='nodeType': return NodeTypeDOM.ELEMENT_NODE
if name=='nodeName': return self.name.lower()
if name=='nodeValue': return None
if name=='parentNode': return self.parent
if name=='ownerDocument': return _ownerDocument(self)
if name=='attributes': return self._getAttrMap()
return o_getattr(self,name)
Tag.__getattr__=e_getattr
_extTag()
#} // _extTag
def _it_deepNodes(node):
child_next=iter(getattr(node,'contents',[])).next
while True:
child=child_next()
yield child
for gchild in _it_deepNodes(child):
yield gchild
return ExtDict({
'nodeType' :_nodeType
, 'nodeName' :_nodeName
, 'nodeValue' :_nodeValue
, 'nodeAttrValue':_nodeAttrValue
, 'parentNode' :_parentNode
, 'ownerDocument':_ownerDocument
, 'attributes' :_attributes
, 'contains' :_contains
, 'preceding' :_preceding
, 'following' :_following
, 'it_deepNodes' :_it_deepNodes
})
return
def makeNU():
def _to(valueType,node):
if typeof(node)=='string':
result=node
else:
nodeType=node.nodeType
if nodeType==NodeTypeDOM.ATTRIBUTE_NODE:
result=node.nodeValue
else:
strings=[]
for _node in NodeUtilBS.it_deepNodes(node):
if _node.nodeType==NodeTypeDOM.TEXT_NODE:
strings.append(unicode(_node))
result=''.join(strings)
if valueType=='number':
return toNumber(result)
elif valueType=='boolean':
return toBoolean(result)
else:
return result
def _attrMatch(node,attrName,attrValue):
if not attrName or \
not attrValue and node.get(attrName) or \
(attrValue and node.get(attrName)==attrValue):
return True
else:
return False
def _getDescendantNodes(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
if prevNodeset:
prevNodeset.delDescendant(node,prevIndex)
if USE_NODE_CACHE:
_cachemap=getattr(node,'_cachemap',None)
if not _cachemap:
_cachemap=node._cachemap=ExtDict({'attrib':ExtDict({}),'all':None,'tag':ExtDict({})})
if attrValue and attrName:
_cm=_cachemap.attrib
_anmap=_cm.get(attrName)
if not _anmap:
_anmap=_cm[attrName]=ExtDict({})
nodes=_anmap.get(attrValue)
if not nodes:
nodes=_anmap[attrValue]=[]
if getattr(node,'findAll',None):
nodes.extend(node.findAll(attrs={attrName:attrValue}))
for elm in nodes:
if test.match(elm):
nodeset.push(elm)
elif getattr(test,'notOnlyElement',None):
nodes=_cachemap.all
if not nodes:
nodes=_cachemap.all=[]
for elm in NodeUtilBS.it_deepNodes(node):
nodes.append(elm)
for elm in nodes:
if NodeUtil.attrMatch(elm,attrName,attrValue) and test.match(elm):
nodeset.push(elm)
else:
nodeType=node.nodeType
if nodeType==NodeTypeDOM.ELEMENT_NODE or nodeType==NodeTypeDOM.DOCUMENT_NODE:
_cm=_cachemap.tag
name=getattr(test,'name',None)
if not name or name=='*':
nodes=_cm.get('*')
if not nodes:
nodes=_cm['*']=node.findAll()
else:
nodes=_cm.get(name)
if not nodes:
nodes=_cm[name]=node.findAll([name])
for elm in nodes:
if NodeUtil.attrMatch(elm,attrName,attrValue):
nodeset.push(elm)
else: # USE_NODE_CACHE is False
if attrValue and attrName:
if getattr(node,'findAll',None):
for elm in node.findAll(attrs={attrName:attrValue}):
if test.match(elm):
nodeset.push(elm)
elif getattr(test,'notOnlyElement',None):
for elm in NodeUtilBS.it_deepNodes(node):
if NodeUtil.attrMatch(elm,attrName,attrValue) and test.match(elm):
nodeset.push(elm)
else:
nodeType=node.nodeType
if nodeType==NodeTypeDOM.ELEMENT_NODE or nodeType==NodeTypeDOM.DOCUMENT_NODE:
name=getattr(test,'name',None)
if not name or name=='*':
nodes=node.findAll()
else:
nodes=node.findAll([name])
for elm in nodes:
if NodeUtil.attrMatch(elm,attrName,attrValue):
nodeset.push(elm)
return nodeset
def _getChildNodes(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
contents=getattr(node,'contents',[])
for elm in contents:
if NodeUtil.attrMatch(elm,attrName,attrValue) and test.match(elm):
nodeset.push(elm)
return nodeset
return ExtDict({
'to' :_to
, 'attrMatch' :_attrMatch
, 'getDescendantNodes':_getDescendantNodes
, 'getChildNodes' :_getChildNodes
})
return (makeNU_BS(),makeNU())
(NodeUtilBS,NodeUtil)=makeNodeUtils()
#} // end of NodeUtil
#***** Application Classes
#{ // Lexer
class Lexer(object):
def __init__(self,source):
tokens=self.tokens=[]
def anlz_token(mrslt):
token=mrslt.group()
if not self.re_strip.search(token):
tokens.append(token)
return token
self.re_token.sub(anlz_token,source,count=0)
self.index=0
def peek(self,i=0):
token=self.tokens[self.index+i] if self.index+i<len(self.tokens) else None
return token
def next(self):
token=self.tokens[self.index] if self.index<len(self.tokens) else None
self.index+=1
return token
def back(self):
self.index-=1
token=self.tokens[self.index] if self.index<len(self.tokens) else None
def empty(self):
return (len(self.tokens)<=self.index)
re_token=re.compile(r'\$?(?:(?![0-9-])[\w-]+:)?(?![0-9-])[\w-]+|\/\/|\.\.|::|\d+(?:\.\d*)?|\.\d+|"[^"]*"|\'[^\']*\'|[!<>]=|(?![0-9-])[\w-]+:\*|\s+|.')
re_strip=re.compile(r'^\s')
#} // end of Lexer
#{ // Ctx
class Ctx(object):
def __init__(self,node,position=1,last=1):
self.node=node
self.position=position
self.last=last
#} // end of Ctx
#{ // AttributeWrapper
class AttributeWrapper(object):
def __init__(self,name,value,parent):
self.nodeType=NodeTypeDOM.ATTRIBUTE_NODE
self.nodeName=name
self.nodeValue=value
self.parentNode=parent
self.ownerElement=parent
def get(self,key,default=None):
return None
def contains(self,cnode):
return NodeUtilBS.contains(self,cnode)
def preceding(self,cnode):
return NodeUtilBS.preceding(self,cnode)
def following(self,cnode):
return NodeUtilBS.following(self,cnode)
def __str__(self,encoding=DEFAULT_OUTPUT_ENCODING):
if encoding:
return self.nodeValue.encode(encoding)
else:
return self.nodeValue
def __unicode__(self):
return str(self).decode(DEFAULT_OUTPUT_ENCODING)
@classmethod
def getAttributeWrapper(cls,name,value,parent):
_mapattr=getattr(parent,'_mapattr',None)
if not _mapattr:
_mapattr=parent._mapattr=ExtDict({})
if _mapattr.get(name):
return _mapattr[name]
_mapattr[name]=cls(name,value,parent)
return _mapattr[name]
#} // end of AttributeWrapper
#{ // BaseExpr
class BaseExpr(object):
def __init__(self):
pass
def number(self,ctx):
exrs=self.evaluate(ctx)
if getattr(exrs,'isNodeSet',None):
result=exrs.number()
else:
result=toNumber(exrs)
return result
def string(self,ctx):
exrs=self.evaluate(ctx)
if getattr(exrs,'isNodeSet',None):
result=exrs.string()
else:
result=toString(exrs)
return result
def bool(self,ctx):
exrs=self.evaluate(ctx)
if getattr(exrs,'isNodeSet',None):
result=exrs.bool()
else:
result=toBoolean(exrs)
return result
#} // end of BaseExpr
#{ // BaseExprHasPredicates
class BaseExprHasPredicates(BaseExpr):
def __init__(self):
pass
def evaluatePredicates(self,nodeset,start=0):
reverse=getattr(self,'reverse',False)
predicates=getattr(self,'predicates',[])
nodeset.sort()
l0=len(predicates)
for i in range(start,l0):
predicate=predicates[i]
deleteIndexes=[]
nodes=nodeset.list()
l1=len(nodes)
for j in range(0,l1):
position=(l1-j) if reverse else (j+1)
exrs=predicate.evaluate(Ctx(nodes[j],position,l1))
if typeof(exrs)=='number':
exrs=(position==exrs)
elif typeof(exrs)=='string':
exrs=False if exrs=='' else True
elif typeof(exrs)=='object':
exrs=exrs.bool()
if not exrs:
deleteIndexes.append(j)
r=range(0,len(deleteIndexes))
r.sort(reverse=True)
for j in r:
nodeset._del(deleteIndexes[j])
return nodeset
@classmethod
def parsePredicates(cls,lexer,expr):
while lexer.peek()=='[':
lexer.next()
if lexer.empty():
throwError(u'missing predicate expr')
predicate=BinaryExpr.parse(lexer)
expr.predicate(predicate)
if lexer.empty():
throwError(u'unclosed predicate expr')
if lexer.next() != ']':
lexer.back()
throwError(u'bad token: %s' % (lexer.next()))
#} // end of BaseExprHasPredicates
#{ // BinaryExpr
class BinaryExpr(BaseExpr):
def __init__(self,op,left,right):
self.op=op
self.left=left
self.right=right
self.dataType=BinaryExpr.ops[op][2]
(lneedContextPosition,rneedContextPosition)=(getattr(left,'needContextPosition',None),getattr(right,'needContextPosition',None))
(lneedContextNode,rneedContextNode)=(getattr(left,'needContextNode',None),getattr(right,'needContextNode',None))
self.needContextPosition=lneedContextPosition or rneedContextPosition
self.needContextNode=lneedContextNode or rneedContextNode
if op=='=':
(ldatatype,rdatatype)=(getattr(left,'datatype',None),getattr(right,'datatype',None))
(lqattr,rqattr)=(getattr(left,'quickAttr',None),getattr(right,'quickAttr',None))
if not rneedContextNode and not rneedContextPosition and rdatatype!='nodeset' and rdatatype!='void' and lqattr:
self.quickAttr=True
self.attrName=left.attrName
self.attrValueExpr=right
elif not lneedContextNode and not lneedContextPosition and ldatatype!='nodeset' and ldatatype!='void' and rqattr:
self.quickAttr=True
self.attrName=right.attrName
self.attrValueExpr=left
def evaluate(self,ctx):
result=BinaryExpr.ops[self.op][1](self.left,self.right,ctx)
return result
def show(self,indent=''):
t=''
t+=indent+'binary: '+self.op+'\n'
indent+=indent_space
t+=self.left.show(indent)
t+=self.right.show(indent)
return t
# --- Local Functions
@staticmethod
def _compare(op,comp,left,right,ctx):
left=left.evaluate(ctx)
right=right.evaluate(ctx)
if getattr(left,'isNodeSet',None) and getattr(right,'isNodeSet',None):
lnodes=left.list()
rnodes=right.list()
for lnode in lnodes:
for rnode in rnodes:
if comp(NodeUtil.to('string',lnode),NodeUtil.to('string',rnode)):
return True
return False
if getattr(left,'isNodeSet',None) or getattr(right,'isNodeSet',None):
if getattr(left,'isNodeSet',None):
(nodeset,primitive)=(left,right)
else:
(nodeset,primitive)=(right,left)
nodes=nodeset.list()
type=typeof(primitive)
for node in nodes:
if comp(NodeUtil.to(type,node),primitive):
return True
return False
if op=='=' or op=='!=':
if typeof(left)=='boolean' or typeof(right)=='boolean':
return comp(toBoolean(left),toBoolean(right))
if typeof(left)=='number' or typeof(right)=='number':
return comp(toNumber(left),toNumber(right))
return comp(left,right)
return comp(toNumber(left),toNumber(right))
def _div(left,right,ctx):
l=left.number(ctx)
r=right.number(ctx)
if typeof(l)!='number' or typeof(r)!='number': return 'NaN'
if r==0:
sign=int(getattr(left,'op','+')+'1')*int(getattr(right,'op','+')+'1')
if l==0: return 'NaN'
elif sign<0: return '-Infinity'
else: return 'Infinity'
n=float(l) / float(r)
n1=int(n)
return n1 if n1==n else n
def _mod(left,right,ctx):
l=left.number(ctx)
r=right.number(ctx)
if typeof(l)!='number' or typeof(r)!='number': return 'NaN'
if r==0:
if l==0: return 'NaN'
else: return 0
return l % r
def _mul(left,right,ctx):
l=left.number(ctx)
r=right.number(ctx)
if typeof(l)!='number' or typeof(r)!='number': return 'NaN'
n=l * r
n1=int(n)
return n1 if n1==n else n
def _add(left,right,ctx):
l=left.number(ctx)
r=right.number(ctx)
if typeof(l)!='number' or typeof(r)!='number': return 'NaN'
n=l + r
n1=int(n)
return n1 if n1==n else n
def _sub(left,right,ctx):
l=left.number(ctx)
r=right.number(ctx)
if typeof(l)!='number' or typeof(r)!='number': return 'NaN'
n=l - r
n1=int(n)
return n1 if n1==n else n
def _lt(left,right,ctx):
return BinaryExpr._compare('<',(lambda a,b:a<b),left,right,ctx)
def _gt(left,right,ctx):
return BinaryExpr._compare('>',(lambda a,b:a>b),left,right,ctx)
def _le(left,right,ctx):
return BinaryExpr._compare('<=',(lambda a,b:a<=b),left,right,ctx)
def _ge(left,right,ctx):
return BinaryExpr._compare('>=',(lambda a,b:a>=b),left,right,ctx)
def _eq(left,right,ctx):
return BinaryExpr._compare('=',(lambda a,b:a==b),left,right,ctx)
def _ne(left,right,ctx):
return BinaryExpr._compare('!=',(lambda a,b:a!=b),left,right,ctx)
def _and(left,right,ctx):
return left.bool(ctx) & right.bool(ctx)
def _or(left,right,ctx):
return left.bool(ctx) | right.bool(ctx)
ops=ExtDict({
'div':[6,_div,'number' ]
, 'mod':[6,_mod,'number' ]
, '*' :[6,_mul,'number' ]
, '+' :[5,_add,'number' ]
, '-' :[5,_sub,'number' ]
, '<' :[4,_lt ,'boolean']
, '>' :[4,_gt ,'boolean']
, '<=' :[4,_le ,'boolean']
, '>=' :[4,_ge ,'boolean']
, '=' :[3,_eq ,'boolean']
, '!=' :[3,_ne ,'boolean']
, 'and':[2,_and,'boolean']
, 'or' :[1,_or ,'boolean']
})
@classmethod
def parse(cls,lexer):
ops=cls.ops
stack=[]
index=lexer.index
while True:
if lexer.empty():
throwError(u'missing right expression')
expr=UnaryExpr.parse(lexer)
op=lexer.next()
if not op:
break
info=ops.get(op)
precedence=info and info[0]
if not precedence:
lexer.back()
break
while 0<len(stack) and precedence<=ops[stack[len(stack)-1]][0]:
expr=BinaryExpr(stack.pop(),stack.pop(),expr)
stack.extend([expr,op])
while 0<len(stack):
expr=BinaryExpr(stack.pop(),stack.pop(),expr)
return expr
#} // end of BinaryExpr
#{ // UnaryExpr
class UnaryExpr(BaseExpr):
def __init__(self,op,expr):
self.op=op
self.expr=expr
self.needContextPosition=getattr(expr,'needContextPosition',None)
self.needContextNode=getattr(expr,'needContextNode',None)
self.datatype='number'
def evaluate(self,ctx):
result=-self.expr.number(ctx)
return result
def show(self,indent=''):
t=''
t+=indent+'unary: '+self.op+'\n'
indent+=indent_space
t+=self.expr.show(indent)
return t
ops=ExtDict({
'-':1
})
@classmethod
def parse(cls,lexer):
ops=cls.ops
if ops.get(lexer.peek()):
return cls(lexer.next(),cls.parse(lexer))
else:
return UnionExpr.parse(lexer)
#} // end of UnaryExpr
#{ // UnionExpr
class UnionExpr(BaseExpr):
def __init__(self):
self.paths=[]
self.datatype='nodeset'
def evaluate(self,ctx):
paths=self.paths
nodeset=NodeSet()
for path in paths:
exrs=path.evaluate(ctx)
if not getattr(exrs,'isNodeSet',None):
throwError(u'PathExpr must be nodeset')
nodeset.merge(exrs)
return nodeset
def path(self,path):
self.paths.append(path)
if getattr(path,'needContextPosition',None):
self.needContextPosition=True
if getattr(path,'needContextNode',None):
self.needContextNode=True
def show(self,indent=''):
t=''
t+=indent+'union: '+'\n'
indent+=indent_space
for path in self.paths:
t+=path.show(indent)
return t
ops=ExtDict({
'|':1
})
@classmethod
def parse(cls,lexer):
ops=cls.ops
expr=PathExpr.parse(lexer)
if not ops.get(lexer.peek()):
return expr
union=UnionExpr()
union.path(expr)
while True:
if not ops.get(lexer.next()):
break
if lexer.empty():
throwError(u'missing next union location path')
union.path(PathExpr.parse(lexer))
lexer.back()
return union
#} // end of UnionExpr
#{ // PathExpr
class PathExpr(BaseExpr):
def __init__(self,filter):
self.filter=filter
self.steps=[]
self.datatype=filter.datatype
self.needContextPosition=filter.needContextPosition
self.needContextNode=filter.needContextNode
def evaluate(self,ctx):
nodeset=self.filter.evaluate(ctx)
if not getattr(nodeset,'isNodeSet',None):
throwException('Filter nodeset must be nodeset type')
for _step in self.steps:
if nodeset.length<=0:
break
step=_step[1] # _step=[op,step]
reverse=step.reverse
iter=nodeset.iterator(reverse)
prevNodeset=nodeset
nodeset=None
needContextPosition=getattr(step,'needContextPosition',None)
axis=step.axis
if not needContextPosition and axis=='following':
node=iter()
while True:
next=iter()
if not next:
break
if not node.contains(next):
break
node=next
nodeset=step.evaluate(Ctx(node))
elif not needContextPosition and axis=='preceding':
node=iter()
nodeset=step.evaluate(Ctx(node))
else:
node=iter()
j=0
nodeset=step.evaluate(Ctx(node),False,prevNodeset,j)
while True:
node=iter()
if not node:
break
j+=1
nodeset.merge(step.evaluate(Ctx(node),False,prevNodeset,j))
return nodeset
def step(self,op,step):
step.op=op
self.steps.append([op,step])
self.quickAttr=False
if len(self.steps)==1:
if op=='/' and step.axis=='attribute':
test=step.test
if not getattr(test,'notOnlyElement',None) and test.name!='*':
self.quickAttr=True
self.attrName=test.name
def show(self,indent=''):
t=''
t+=indent+'path: '+'\n'
indent+=indent_space
t+=indent+'filter:'+'\n'
t+=self.filter.show(indent+indent_space)
if 0<len(self.steps):
t+=indent+'steps:'+'\n'
indent+=indent_space
for _step in self.steps:
t+=indent+'operator: '+step[0]+'\n'
t+=_step[1].show(indent) # _step=[op,step]
return t
ops=ExtDict({
'//':1
, '/': 1
})
@classmethod
def parse(cls,lexer):
ops=cls.ops
if ops.get(lexer.peek()):
op=lexer.next()
token=lexer.peek()
if op=='/' and lexer.empty() or (token!='.' and token!='..' and token!='@' and token!='*' and not re_has_ualpha.search(token)):
return FilterExpr.root()
path=PathExpr(FilterExpr.root()) # RootExpr
if lexer.empty():
throwError(u'missing next location step')
expr=Step.parse(lexer)
path.step(op,expr)
else:
expr=FilterExpr.parse(lexer)
if not expr:
expr=Step.parse(lexer)
path=PathExpr(FilterExpr.context())
path.step('/',expr)
elif not ops.get(lexer.peek()):
return expr
else:
path=PathExpr(expr)
while True:
if not ops.get(lexer.peek()):
break
op=lexer.next()
if lexer.empty():
throwError(u'missing next location step')
path.step(op,Step.parse(lexer))
return path
#} // end of PathExpr
#{ // FilterExpr
class FilterExpr(BaseExprHasPredicates):
def __init__(self,primary):
self.primary=primary
self.predicates=[]
self.datatype=primary.datatype
self.needContextPosition=primary.needContextPosition
self.needContextNode=primary.needContextNode
def evaluate(self,ctx):
nodeset=self.primary.evaluate(ctx)
if not getattr(nodeset,'isNodeSet',None):
if 0<len(self.predicates):
throwError(u'Primary result must be nodeset type if filter have predicate expression')
return nodeset
return self.evaluatePredicates(nodeset)
def predicate(self,predicate):
self.predicates.append(predicate)
def show(self,indent=''):
t=''
t+=indent+'filter: '+'\n'
indent+=indent_space
t+=self.primary.show(indent+indent_space)
if 0<len(self.predicates):
t+=indent+'predicates:'+'\n'
indent+=indent_space
for predicate in self.predicates:
t+=predicate.show(indent)
return t
@classmethod
def root(cls):
return FunctionCall('root-node')
@classmethod
def context(cls):
return FunctionCall('context-node')
@classmethod
def parse(cls,lexer):
token=lexer.peek()
ch=token[0:1]
if ch=='$':
expr=VariableReference.parse(lexer)
elif ch=='(':
lexer.next()
expr=BinaryExpr.parse(lexer)
if lexer.empty():
throwError(u'unclosed "("')
if lexer.next()!=')':
lexer.back()
throwError(u'bad token: %s' % (lexer.next()))
elif ch=='"' or ch=="'":
expr=Literal.parse(lexer)
else:
if not isNaN(token):
expr=Number.parse(lexer)
elif NodeType.types.get(token):
return None
elif re_has_ualpha.search(ch) and lexer.peek(1)=='(':
expr=FunctionCall.parse(lexer)
else:
return None
if lexer.peek()!='[':
return expr
filter=FilterExpr(expr)
BaseExprHasPredicates.parsePredicates(lexer,filter)
return filter
#} // end of FilterExpr
#{ // Step
class Step(BaseExprHasPredicates):
def __init__(self,axis,test):
self.axis=axis
self.reverse=self.axises[axis][0]
self.func=self.axises[axis][1]
self.test=test
self.predicates=[]
self._quickAttr=self.axises[axis][2]
self.quickAttr=False
self.needContextPosition=False
def evaluate(self,ctx,special=False,prevNodeset=None,prevIndex=None):
node=ctx.node
reverse=False
if not special and getattr(self,'op',None)=='//':
if not self.needContextPosition and self.axis=='child':
if getattr(self,'quickAttr',None):
attrValueExpr=getattr(self,'attrValueExpr',None)
attrValue=attrValueExpr.string(ctx) if attrValueExpr else None
nodeset=NodeUtil.getDescendantNodes(self.test,node,NodeSet(),self.attrName,attrValue,prevNodeset,prevIndex)
nodeset=self.evaluatePredicates(nodeset,1)
else:
nodeset=NodeUtil.getDescendantNodes(self.test,node,NodeSet(),None,None,prevNodeset,prevIndex)
nodeset=self.evaluatePredicates(nodeset)
else:
step=Step('descendant-or-self',NodeType('node'))
nodes=step.evaluate(ctx,False,prevNodeset,prevIndex).list()
nodeset=None
step.op='/'
for _node in nodes:
if not nodeset:
nodeset=self.evaluate(Ctx(_node),True,None,None)
else:
nodeset.merge(self.evaluate(Ctx(_node),True,None,None))
nodeset=nodeset or NodeSet()
else:
if getattr(self,'needContextPosition',None):
prevNodeset=None
prevIndex=None
if getattr(self,'quickAttr',None):
attrValueExpr=getattr(self,'attrValueExpr',None)
attrValue=attrValueExpr.string(ctx) if attrValueExpr else None
nodeset=self.func(self.test,node,NodeSet(),self.attrName,attrValue,prevNodeset,prevIndex)
nodeset=self.evaluatePredicates(nodeset,1)
else:
nodeset=self.func(self.test,node,NodeSet(),None,None,prevNodeset,prevIndex)
nodeset=self.evaluatePredicates(nodeset)
if prevNodeset:
prevNodeset.doDel()
return nodeset
def predicate(self,predicate):
self.predicates.append(predicate)
datatype=getattr(predicate,'datatype',None)
if getattr(predicate,'needContextPosition',None) or datatype=='number' or datatype=='void':
self.needContextPosition=True
if getattr(self,'_quickAttr',None) and len(self.predicates)==1 and getattr(predicate,'quickAttr',None):
attrName=predicate.attrName
self.attrName=attrName
self.attrValueExpr=getattr(predicate,'attrValueExpr',None)
self.quickAttr=True
def show(self,indent=''):
t=''
t+=indent+'step: '+'\n'
indent+=indent_space
if self.axis:
t+=indent+'axis: '+self.axis+'\n'
t+=self.test.show(indent)
if 0<len(self.predicates):
t+=indent+'predicates:'+'\n'
indent+=indent_space
for predicate in self.predicates:
t+=predicate.show(indent)
return t
# --- Local Functions
def _ancestor(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
while True:
node=node.parentNode
if not node:
break
if prevNodeset and node.nodeType==NodeTypeDOM.ELEMENT_NODE:
prevNodeset.reserveDelByNode(node,prevIndex,True)
if test.match(node):
nodeset.unshift(node)
return nodeset
def _ancestorOrSelf(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
while True:
if prevNodeset and node.nodeType==NodeTypeDOM.ELEMENT_NODE:
prevNodeset.reserveDelByNode(node,prevIndex,True)
if test.match(node):
nodeset.unshift(node)
node=node.parentNode
if not node:
break
return nodeset
def _attribute(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
attrs=node.attributes
if attrs:
if getattr(test,'notOnlyElement',None) and test.type==NodeTypeDOM.ANY_NODE or test.name=='*':
for name in attrs.keys():
#nodeset.push(AttributeWrapper(name,attrs[name],node))
nodeset.push(AttributeWrapper.getAttributeWrapper(name,attrs[name],node))
else:
attr=attrs.get(test.name)
if attr!=None:
#nodeset.push(AttributeWrapper(test.name,attr,node))
nodeset.push(AttributeWrapper.getAttributeWrapper(test.name,attr,node))
return nodeset
def _child(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
return NodeUtil.getChildNodes(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex)
def _descendant(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
return NodeUtil.getDescendantNodes(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex)
def _descendantOrSelf(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
if NodeUtil.attrMatch(node,attrName,attrValue) and test.match(node):
nodeset.push(node)
return NodeUtil.getDescendantNodes(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex)
def _following(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
while True:
child=node
while True:
child=child.nextSibling
if not child:
break
if NodeUtil.attrMatch(child,attrName,attrValue) and test.match(child):
nodeset.push(child)
nodeset=NodeUtil.getDescendantNodes(test,child,nodeset,attrName,attrValue,None,None)
node=node.parentNode
if not node:
break
return nodeset
def _followingSibling(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
while True:
node=node.nextSibling
if not node:
break
if prevNodeset and node.nodeType==NodeTypeDOM.ELEMENT_NODE:
prevNodeset.reserveDelByNode(node,prevIndex)
if test.match(node):
nodeset.push(node)
return nodeset;
def _namespace(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
# not implemented
return nodeset
def _parent(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
nodeType=node.nodeType
if nodeType==NodeTypeDOM.DOCUMENT_NODE:
return nodeset
if nodeType==NodeTypeDOM.ATTRIBUTE_NODE:
nodeset.push(node.ownerElement)
return nodeset
node=node.parentNode
if test.match(node):
nodeset.push(node)
return nodeset
def _preceding(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
parents=[]
while True:
parents.insert(0,node)
node=node.parentNode
if not node:
break
for node in parents[1:]:
siblings=[]
while True:
node=node.previousSibling
if not node:
break
siblings.insert(0,node)
for node in siblings:
if NodeUtil.attrMatch(node,attrName,attrValue) and test.match(node):
nodeset.push(node)
nodeset=NodeUtil.getDescendantNodes(test,node,nodeset,attrName,attrValue,None,None)
return nodeset
def _precedingSibling(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
while True:
node=node.previousSibling
if not node:
break
if prevNodeset and node.nodeType==NodeTypeDOM.ELEMENT_NODE:
prevNodeset.reserveDelByNode(node,prevIndex,True)
if test.match(node):
nodeset.unshift(node)
return nodeset
def _self(test,node,nodeset,attrName,attrValue,prevNodeset,prevIndex):
if test.match(node):
nodeset.push(node)
return nodeset
axises=ExtDict({
'ancestor' :[True ,_ancestor ,False]
, 'ancestor-or-self' :[True ,_ancestorOrSelf ,False]
, 'attribute' :[False,_attribute ,False]
, 'child' :[False,_child,True ,False]
, 'descendant' :[False,_descendant ,True ]
, 'descendant-or-self':[False,_descendantOrSelf,True ]
, 'following' :[False,_following ,True ]
, 'following-sibling' :[False,_followingSibling,False]
, 'namespace' :[False,_namespace ,False]
, 'parent' :[False,_parent ,False]
, 'preceding' :[True ,_preceding ,True ]
, 'preceding-sibling' :[True ,_precedingSibling,False]
, 'self' :[False,_self ,False]
})
@classmethod
def _cself(cls):
return cls('self',NodeType('node'))
@classmethod
def parent(cls):
return cls('parent',NodeType('node'))
@classmethod
def parse(cls,lexer):
(parent,_cself,axises)=(cls.parent,cls._cself,cls.axises)
if lexer.peek()=='.':
step=_cself()
lexer.next()
elif lexer.peek()=='..':
step=parent()
lexer.next()
else:
if lexer.peek()=='@':
axis='attribute'
lexer.next()
if lexer.empty():
throwError(u'missing attribute name')
else:
if lexer.peek(1)=='::':
ch=lexer.peek()[0:1]
if not re_has_ualpha.search(ch):
throwError(u'bad token: %s' % (lexer.next()))
axis=lexer.next()
lexer.next()
if not axises.get(axis):
throwError(u'invalid axis: %s' % (axis))
if lexer.empty():
throwError(u'missing node name')
else:
axis='child'
token=lexer.peek()
ch=token[0:1]
if not re_has_ualpha.search(ch):
if token=='*':
test=NameTest.parse(lexer)
else:
throwError(u'bad token: %s' % (lexer.next()))
else:
if lexer.peek(1)=='(':
if not NodeType.types.get(token):
throwError(u'invalid node type: %s' % (token))
test=NodeType.parse(lexer)
else:
test=NameTest.parse(lexer)
step=Step(axis,test)
BaseExprHasPredicates.parsePredicates(lexer,step)
return step
#} // end of Step
#{ // NodeType
class NodeType(BaseExpr):
def __init__(self,name,literal=None):
self.name=name
self.literal=literal
self.type=NodeType.typeNums.get(name,NodeType.typeNums.node)
self.notOnlyElement=True
def match(self,node):
return self.type==NodeTypeDOM.ANY_NODE or self.type==node.nodeType
def show(self,indent=''):
t=''
t+=indent+'nodetype: '+toString(self.type)+'\n'
if self.literal:
indent+=indent_space
t+=self.literal.show(indent)
return t
types=ExtDict({
'comment' :1
, 'text' :1
, 'processing-instruction':1
, 'node' :1
})
typeNums=ExtDict({
'comment' :NodeTypeDOM.COMMENT_NODE
, 'text' :NodeTypeDOM.TEXT_NODE
, 'processing-instruction':NodeTypeDOM.PROCESSING_INSTRUCTION_NODE
, 'node' :NodeTypeDOM.ANY_NODE
})
@classmethod
def parse(cls,lexer):
type=lexer.next()
lexer.next()
if lexer.empty():
throwError(u'bad nodetype')
ch=lexer.peek()[0:1]
literal=None
if ch=='"' or ch=="'":
literal=Literal.parse(lexer)
if lexer.empty():
throwError(u'bad nodetype')
if lexer.next()!=')':
lexer.back()
throwError(u'bad token: %s' % (lexer.next()))
return cls(type,literal)
#} // end of NodeType
#{ // NameTest
class NameTest(BaseExpr):
def __init__(self,name):
self.name=name.lower()
def match(self,node):
type=node.nodeType
if type==NodeTypeDOM.ELEMENT_NODE or type==NodeTypeDOM.ATTRIBUTE_NODE:
if self.name=='*' or self.name==node.nodeName:
return True
return False
def show(self,indent=''):
t=''
t+=indent+'nametest: '+self.name+'\n'
return t
@classmethod
def parse(cls,lexer):
if lexer.peek()!= '*' and lexer.peek(1)==':' and lexer.peek(2)=='*':
return cls(lexer.next()+lexer.next()+lexer.next())
return cls(lexer.next())
#} // end of NameTest
#{ // VariableReference
class VariableReference(BaseExpr):
def __init__(self,name):
self.name=name[1:]
self.datatype='void'
def show(self,indent=''):
t=''
t+=indent+'variable: '+self.name+'\n'
return t
@classmethod
def parse(cls,lexer):
token=lexer.next()
if len(token)<2:
throwError(u'unnamed variable reference')
return cls(token)
#} // end of VariableReference
#{ // Literal
class Literal(BaseExpr):
def __init__(self,text):
self.text=text[1:-1]
self.datatype='string'
def evaluate(self,ctx):
result=self.text
return result
def show(self,indent=''):
t=''
t+=indent+'literal: '+self.text+'\n'
return t
@classmethod
def parse(cls,lexer):
token=lexer.next()
if len(token)<2:
throwError(u'unclosed literal string')
return cls(token)
#} // end of Literal
#{ // Number
class Number(BaseExpr):
def __init__(self,digit):
self.digit=toNumber(digit)
self.datatype='number'
def evaluate(self,ctx):
result=self.digit
return result
def show(self,indent=''):
t=''
t+=indent+'number: '+toString(self.digit)+'\n'
return t
@classmethod
def parse(cls,lexer):
return cls(lexer.next())
#} // end of Number
#{ // FunctionCall
class FunctionCall(BaseExpr):
def __init__(self,name):
info=self.funcs.get(name)
if not info:
throwError(u'%s is not a function' % (name))
self.name=name
self.func=info[0]
self.args=[]
self.datatype=info[1]
self.needContextPosition=True if info[2] else False
self.needContextNodeInfo=info[3]
self.needContextNode=self.needContextNodeInfo[0] if 0<len(self.needContextNodeInfo) else False
def evaluate(self,ctx):
result=self.func(ctx,*self.args)
return result
def arg(self,arg):
self.args.append(arg)
if getattr(arg,'needContextPosition',None):
self.needContextPosition=True
args=self.args
if getattr(arg,'needContextNode',None):
#args.needContextNode=True
self.needContextNode=True
#self.needContextNode=args.needContextNode or self.needContextNodeInfo[len(args)]
if not getattr(self,'needContextNode',None) and len(args)<len(self.needContextNodeInfo):
self.needContextNode=self.needContextNodeInfo[len(args)]
def show(self,indent=''):
t=''
t+=indent+'function: '+self.name+'\n'
indent+=indent_space
if 0<len(self.args):
t+=indent+'arguments: '+'\n'
indent+=indent_space
for arg in self.args:
t+=arg.show(indent)
return t
# --- Local Functions
def _contextNode(self,*arguments):
if len(arguments)!=0:
throwError(u'Function context-node expects ()')
nodeset=NodeSet()
nodeset.push(self.node)
return nodeset
def _rootNode(self,*arguments):
if len(arguments)!=0:
throwError(u'Function root-node expects ()')
nodeset=NodeSet()
ctxn=self.node
if ctxn.nodeType==NodeTypeDOM.DOCUMENT_NODE:
nodeset.push(ctxn)
else:
nodeset.push(ctxn.ownerDocument)
return nodeset
def _last(self,*arguments):
if len(arguments)!=0:
throwError(u'Function last expects ()')
return self.last
def _position(self,*arguments):
if len(arguments)!=0:
throwError(u'Function position expects ()')
return self.position
def _count(self,*arguments):
if len(arguments)!=1:
throwError(u'Function count expects (nodeset)')
nodeset=arguments[0].evaluate(self)
if not nodeset.isNodeSet:
throwError(u'Function count expects (nodeset)')
return nodeset.length
def _id(self,*arguments):
if len(arguments)!=1:
throwError(u'Function id expects (object)')
s=arguments[0]
ctxn=self.node
if ctxn.nodeType==NodeTypeDOM.DOCUMENT_NODE:
doc=ctxn
else:
doc=ctxn.ownerDocument
s=s.string(self)
ids=re_seqspace.split(s)
nodeset=NodeSet()
for id in ids:
for elm in doc.findAll(id=id):
nodeset.push(elm)
nodeset.isSorted=False
return nodeset
def _localName(self,*arguments):
alen=len(arguments)
if alen<0 or 1<alen:
throwError(u'Function local-name expects (nodeset?)')
if alen==0:
node=self.node
else:
nodeset=arguments[0]
nodeset=nodeset.evaluate(self)
if getattr(nodeset,'isNodeSet',None):
node=nodeset.first()
return ''+node.nodeName
def _name(self,*arguments):
# not implemented
return FunctionCall.funcs['local-name'][0](self,*arguments)
def _namespaceUri(self,*arguments):
# not implemented
return ''
def _string(self,*arguments):
alen=len(arguments)
if alen==0:
s=NodeUtil.to('string',self.node)
elif alen==1:
s=arguments[0]
s=s.string(self)
else:
throwError(u'Function string expects (object?)')
return s
def _concat(self,*arguments):
if len(arguments)<2:
throwError('Function concat expects (string, string[, ...])')
t=''
for argument in arguments:
t+=argument.string(self)
return t
def _startsWith(self,*arguments):
if len(arguments)!=2:
throwError('Function starts-with expects (string, string)')
(s1,s2)=(arguments[0],arguments[1])
s1=s1.string(self)
s2=s2.string(self)
#if s2 in s1 and s1.index(s2)==0:
# return True
#else:
# return False
if s1.find(s2)==0:
return True
else:
return False
def _contains(self,*arguments):
if len(arguments)!=2:
throwError('Function contains expects (string, string)')
(s1,s2)=(arguments[0],arguments[1])
s1=s1.string(self)
s2=s2.string(self)
#if s2 in s1:
# return True
#else:
# return False
n=s1.find(s2)
if n<0:
return False
else:
return True
def _substring(self,*arguments):
alen=len(arguments)
if alen<2 or 3<alen:
throwError(u'Function substring expects (string, string)')
(s,n1)=(arguments[0],arguments[1])
s=s.string(self)
n1=n1.number(self)
if alen==2:
n2=len(s)-n1+1
elif alen==3:
n2=arguments[2]
n2=n2.number(self)
if n1=='NaN' or n2=='NaN' or n1=='-Infinity' or n2=='-Infinity' or n1=='Infinity':
return u''
# n1,n2:origin=1 a1,a2:origin=0
n1=int(round(n1))
a1=n1-1
if a1<0: a1=0
if n2=='Infinity':
return s[a1:]
else:
n2=int(round(n2))
a2=n1+n2-1
return s[a1:a2]
def _substringBefore(self,*arguments):
if len(arguments)!=2:
throwError('Function substring-before expects (string, string)')
(s1,s2)=(arguments[0],arguments[1])
s1=s1.string(self)
s2=s2.string(self)
#if s2 in s1:
# n=s1.index(s2)
#else:
# return ''
n=s1.find(s2)
if n<0:
return ''
return s1[:n]
def _substringAfter(self,*arguments):
if len(arguments)!=2:
throwError('Function substring-after expects (string, string)')
(s1,s2)=(arguments[0],arguments[1])
s1=s1.string(self)
s2=s2.string(self)
#if s2 in s1:
# n=s1.index(s2)
#else:
# return ''
n=s1.find(s2)
if n<0:
return ''
return s1[n+len(s2):]
def _substringLength(self,*arguments):
alen=len(arguments)
if alen==0:
s=NodeUtil.to('string',self.node)
elif alen==1:
s=arguments[0]
s=s.string(self)
else:
throwError(u'Function string-length expects (string?)')
return len(s)
def _normalizeSpace(self,*arguments):
alen=len(arguments)
if alen==0:
s=NodeUtil.to('string',self.node)
elif alen==1:
s=arguments[0]
s=s.string(self)
else:
throwError(u'Function normalize-space expects (string?)')
return re_lastspace.sub('',re_firstspace.sub('',re_seqspace.sub(' ',s)))
def _translate(self,*arguments):
if len(arguments)!=3:
throwError('Function translate expects (string, string, string)')
(s1,s2,s3)=(arguments[0],arguments[1],arguments[2])
s1=s1.string(self)
s2=s2.string(self)
s3=s3.string(self)
_map={}
for i in range(0,len(s2)):
ch=s2[i]
if not _map.get(ch):
_map[ch]=s3[i] if i<len(s3) else ''
t=''
for ch in s1:
replace=_map.get(ch)
t+=replace if replace!=None else ch
return t
def _boolean(self,*arguments):
if len(arguments)!=1:
throwError(u'Function not expects (object)')
b=arguments[0]
b=b.bool(self)
return b
def _not(self,*arguments):
if len(arguments)!=1:
throwError(u'Function not expects (object)')
b=arguments[0]
b=b.bool(self)
return not b
def _true(self,*arguments):
if len(arguments)!=0:
throwError(u'Function false expects ()')
return True
def _false(self,*arguments):
if len(arguments)!=0:
throwError(u'Function false expects ()')
return False
def _lang(self,*arguments):
# not implemented
return False
def _number(self,*arguments):
alen=len(arguments)
if alen==0:
n=NodeUtil.to('number',self.node)
elif alen==1:
n=arguments[0]
n=n.number(self)
else:
throwError(u'Function number expects (object?)')
if isinstance(n,int):
return n
elif isinstance(n,float):
n1=int(n)
return n1 if n1==n else n
else:
return 'NaN'
def _sum(self,*arguments):
if len(arguments)!=1:
throwError(u'Function sum expects (nodeset)')
nodeset=arguments[0]
nodeset=nodeset.evaluate(self)
if not getattr(nodeset,'isNodeSet',None):
throwError(u'Function sum expects (nodeset)')
nodes=nodeset.list()
n=0
for node in nodes:
n+=NodeUtil.to('number',node)
return n
def _floor(self,*arguments):
if len(arguments)!=1:
throwError(u'Function floor expects (number)')
n=arguments[0]
n=n.number(self)
return int(math.floor(n))
def _ceiling(self,*arguments):
if len(arguments)!=1:
throwError(u'Function ceiling expects (number)')
n=arguments[0]
n=n.number(self)
return int(math.ceil(n))
def _round(self,*arguments):
if len(arguments)!=1:
throwError(u'Function round expects (number)')
n=arguments[0]
n=n.number(self)
return int(round(n))
funcs=ExtDict({
'context-node' :[_contextNode ,'nodeset',False,[True]]
, 'root-node' :[_rootNode ,'nodeset',False,[]]
, 'last' :[_last ,'number' ,True ,[]]
, 'position' :[_position ,'number' ,True ,[]]
, 'count' :[_count ,'number' ,False,[]]
, 'id' :[_id ,'nodeset',False,[]]
, 'local-name' :[_localName ,'string' ,False,[True ,False]]
, 'name' :[_name ,'string' ,False,[True ,False]]
, 'namespace-uri' :[_namespaceUri ,'string' ,False,[True ,False]]
, 'string' :[_string ,'string' ,False,[True ,False]]
, 'concat' :[_concat ,'string' ,False,[]]
, 'starts-with' :[_startsWith ,'boolean',False,[]]
, 'contains' :[_contains ,'boolean',False,[]]
, 'substring' :[_substring ,'string' ,False,[]]
, 'substring-before':[_substringBefore,'string' ,False,[]]
, 'substring-after' :[_substringAfter ,'string' ,False,[]]
, 'string-length' :[_substringLength,'number' ,False,[True ,False]]
, 'normalize-space' :[_normalizeSpace ,'string' ,False,[True ,False]]
, 'translate' :[_translate ,'string' ,False,[]]
, 'boolean' :[_boolean ,'boolean',False,[]]
, 'not' :[_not ,'boolean',False,[]]
, 'true' :[_true ,'boolean',False,[]]
, 'false' :[_false ,'boolean',False,[]]
, 'lang' :[_lang ,'boolean',False,[]]
, 'number' :[_number ,'number' ,False,[True ,False]]
, 'sum' :[_sum ,'number' ,False,[]]
, 'floor' :[_floor ,'number' ,False,[]]
, 'ceiling' :[_ceiling ,'number' ,False,[]]
, 'round' :[_round ,'number' ,False,[]]
})
@classmethod
def parse(cls,lexer):
func=cls(lexer.next())
lexer.next()
while lexer.peek()!=')':
if lexer.empty():
throwError(u'missing function argument list')
expr=BinaryExpr.parse(lexer)
func.arg(expr)
if lexer.peek()!=',':
break
lexer.next()
if lexer.empty():
throwError(u'unclosed function argument list')
if lexer.next()!=')':
lexer.back()
throwError(u'bad token: %s' % (lexer.next()))
return func
#} // end of FunctionCall
#{ // NodeSet
class NodeSet(object):
def __init__(self):
self.length=0
self.nodes=[]
self.seen={}
self.idIndexMap=None
self.reserveDels=[]
self.isNodeSet=True
self.isSorted=True
self.sortOff=False
self.only=None
def merge(self,nodeset):
self.isSorted=False
if getattr(nodeset,'only',None):
return self.push(nodeset.only)
if getattr(self,'only',None):
only=self.only
self.only=None
self.push(only)
self.length-=1
map(self._add,nodeset.nodes)
def sort(self):
if getattr(self,'only',None):
return
if getattr(self,'sortOff',None):
return
if getattr(self,'isSorted',None):
return
self.isSorted=True
self.idIndexMap=None
nodes=self.nodes
def _comp(a,b):
if a.nodeType==NodeTypeDOM.ATTRIBUTE_NODE: a=a.parentNode
if b.nodeType==NodeTypeDOM.ATTRIBUTE_NODE: b=b.parentNode
if a==b:
return 0
(node1,node2)=(a,b)
(ancestor1,ancestor2)=(a,b)
(deep1,deep2)=(0,0)
while True:
ancestor1=ancestor1.parentNode
if not ancestor1:
break
deep1+=1
while True:
ancestor2=ancestor2.parentNode
if not ancestor2:
break
deep2+=1
if deep1>deep2:
while deep1!=deep2:
deep1-=1
node1=node1.parentNode
if node1==node2:
return 1
elif deep2>deep1:
while deep2!=deep1:
deep2-=1
node2=node2.parentNode
if node1==node2:
return -1
while True:
ancestor1=node1.parentNode
ancestor2=node2.parentNode
if ancestor1==ancestor2:
break
node1=ancestor1
node2=ancestor2
while True:
node1=node1.nextSibling
if not node1:
break
if node1==node2:
return -1
return 1
def index_comp(a,b):
if a.nodeType==NodeTypeDOM.ATTRIBUTE_NODE: a=a.parentNode
if b.nodeType==NodeTypeDOM.ATTRIBUTE_NODE: b=b.parentNode
return cmp(a._sortindex,b._sortindex)
if USE_NODE_INDEX:
nodes.sort(index_comp)
else:
nodes.sort(_comp)
def reserveDelByNodeID(self,id,offset,reverse):
_map=self.createIdIndexMap()
index=_map.get(id)
if index:
if reverse and index<(self.length-offset-1) or not reverse and offset<index:
self.reserveDels.append(index)
def reserveDelByNode(self,node,offset,reverse=False):
self.reserveDelByNodeID(self.NodeID.get(node),offset,reverse)
def doDel(self):
if len(self.reserveDels)<=0:
return
map(self._del,sorted(self.reserveDels,lambda x,y:cmp(y,x)))
self.reserveDels=[]
self.idIndexMap=None
def createIdIndexMap(self):
if getattr(self,'idIndexMap',None):
return self.idIndexMap
else:
_map=self.idIndexMap={}
nodes=self.nodes
for i in range(0,len(nodes)):
node=nodes[i]
id=self.NodeID.get(node)
_map[id]=i
return _map
def _del(self,index):
self.length-=1
if getattr(self,'only',None):
self.only=None
else:
node=self.nodes[index]
if getattr(self,'_first',None)==node:
self._first=None
self._firstSourceIndex=None
self._firstSubIndex=None
del(self.seen[self.NodeID.get(node)])
del(self.nodes[index])
def delDescendant(self,elm,offset):
if getattr(self,'only',None):
return
nodeType=elm.nodeType
if nodeType!=NodeTypeDOM.ELEMENT_NODE and nodeType!=NodeTypeDOM.DOCUMENT_NODE:
return
nodes=self.nodes
i=offset+1
while i<len(nodes):
if elm.contains(nodes[i]):
self._del(i)
i-=1
i+=1
def _add(self,node,reverse=False):
seen=self.seen
id=self.NodeID.get(node)
if seen.get(id):
return
seen[id]=True
self.length+=1
if reverse:
self.nodes.insert(0,node)
else:
self.nodes.append(node)
def unshift(self,node):
if self.length<=0:
self.length+=1
self.only=node
return
if getattr(self,'only',None):
only=self.only
self.only=None
self.unshift(only)
self.length-=1
return self._add(node,True)
def push(self,node):
if self.length<=0:
self.length+=1
self.only=node
return
if getattr(self,'only',None):
only=self.only
self.only=None
self.push(only)
self.length-=1
return self._add(node)
def first(self):
if getattr(self,'only',None):
return self.only
if 0<len(self.nodes):
self.sort()
return self.nodes[0]
else:
return None
def list(self):
if getattr(self,'only',None):
return [self.only]
self.sort()
return self.nodes
def string(self):
node=self.only or self.first()
return NodeUtil.to('string',node) if node else ''
def bool(self):
return toBoolean(self.length or self.only)
def number(self):
return toNumber(self.string())
def iterator(self,reverse=False):
self.sort()
_info=ExtDict({
'nodeset':self
, 'count':0
})
if not reverse:
calcIndex=(lambda x,y:x)
else:
calcIndex=(lambda x,y:y.length-x-1)
def iter():
nodeset=_info.nodeset
index=calcIndex(_info.count,nodeset)
_info['count']+=1
if getattr(nodeset,'only',None) and index==0:
return nodeset.only
return nodeset.nodes[index] if 0<=index and index<len(nodeset.nodes) else None
return iter
class nodeID(object):
def __init__(self):
self.uuid=1
def get(self,node):
id=getattr(node,'__bsxpath_id__',None)
if id:
return id
id=node.__bsxpath_id__=self.uuid
self.uuid+=1
return id
NodeID=nodeID()
#} // end of NodeSet
#{ // XPathEvaluator
class XPathResult(object):
ANY_TYPE =0
NUMBER_TYPE =1
STRING_TYPE =2
BOOLEAN_TYPE =3
UNORDERED_NODE_ITERATOR_TYPE=4
ORDERED_NODE_ITERATOR_TYPE =5
UNORDERED_NODE_SNAPSHOT_TYPE=6
ORDERED_NODE_SNAPSHOT_TYPE =7
ANY_UNORDERED_NODE_TYPE =8
FIRST_ORDERED_NODE_TYPE =9
def __init__(self,value,type):
if type==XPathResult.ANY_TYPE:
tov=typeof(value)
if tov=='object' : type=self.UNORDERED_NODE_ITERATOR_TYPE
if tov=='boolean': type=self.BOOLEAN_TYPE
if tov=='string' : type=self.STRING_TYPE
if tov=='number' : type=self.NUMBER_TYPE
if type<self.NUMBER_TYPE or self.FIRST_ORDERED_NODE_TYPE<type:
throwError(u'unknown type: %d' %(type))
self.resultType=type
if type==self.NUMBER_TYPE:
self.numberValue=value.number() if getattr(value,'isNodeSet',None) else toNumber(value)
elif type==self.STRING_TYPE:
self.stringValue=value.string() if getattr(value,'isNodeSet',None) else toString(value)
elif type==self.BOOLEAN_TYPE:
self.booleanValue=value.bool() if getattr(value,'isNodeSet',None) else toBoolean(value)
elif type==self.ANY_UNORDERED_NODE_TYPE or type==self.FIRST_ORDERED_NODE_TYPE:
self.singleNodeValue=value.first()
else:
self.nodes=value.list()
self.snapshotLength=value.length
self.index=0
self.invalidIteratorState=False
def iterateNext(self):
node=self.nodes[self.index]
self.index+=1
return node
def snapshotItem(self,i):
return self.nodes[i]
class XPathExpression(object):
def __init__(self,expr,resolver):
if len(expr)<=0:
throwError(u'no expression')
lexer=self.lexer=Lexer(expr)
if lexer.empty():
throwError(u'no expression')
self.expr=BinaryExpr.parse(lexer)
if not lexer.empty():
throwError(u'bad token: %s' % (lexer.next()))
def evaluate(self,node,type):
return XPathResult(self.expr.evaluate(Ctx(node)),type)
class BSXPathEvaluator(BeautifulSoup):
def __init__(self, *args, **kwargs):
BeautifulSoup.__init__(self, *args, **kwargs)
self._string=u'[object HTMLDocument]'
self._fix_table()
self._init_index()
SELF_CLOSING_TAGS=buildTagMap(None,['br','hr','input','img','meta','spacer','frame','base'])
# exclude 'link' for XML
def _init_index(self):
idx=self._sortindex=1
self._cachemap=None
for node in NodeUtilBS.it_deepNodes(self):
idx=node._sortindex=idx+1
for node in self.findAll():
node.attrMap=dict(node.attrs)
def _fix_table(self):
tables=self.findAll('table')
for table in tables:
parent=table.parent
contents=getattr(table,'contents',[])
if len(contents)<=0: continue
(tbody,tr)=(None,None)
node=table.contents[0]
while node:
_next=node.nextSibling
name=getattr(node,'name',None)
if name in ('thead','tbody','tfoot',):
(tbody,tr)=(None,None)
elif name in ('tr',):
tr=None
if not tbody:
tbody=Tag(self,'tbody')
table.insert(table.contents.index(node),tbody)
tbody.append(node)
elif name in ('th','td',):
if not tbody:
tbody=Tag(self,'tbody')
table.insert(table.contents.index(node),tbody)
if not tr:
tr=Tag(self,'tr')
tbody.append(tr)
tr.append(node)
else:
parent.insert(parent.contents.index(table),node)
node=_next
def __str__(self,encoding=DEFAULT_OUTPUT_ENCODING):
return self._string
def __unicode__(self):
return self._string
def decode(self):
return self._string
def createExpression(self,expr,resolver):
return XPathExpression(expr,resolver)
def createNSResolver(self,nodeResolver):
# not implemented
pass
def evaluate(self,expr,context,resolver,type,result):
if not context:
context=self
if isinstance(context,list):
context=context[0]
return self.createExpression(expr,resolver).evaluate(context,type)
def getItemList(self,expr,context=None):
elms=[]
result=self.evaluate(expr,context,None,XPathResult.ORDERED_NODE_SNAPSHOT_TYPE,None)
for i in range(0,result.snapshotLength):
elms.append(result.snapshotItem(i))
return elms
def getFirstItem(self,expr,context=None):
elm=self.evaluate(expr,context,None,XPathResult.FIRST_ORDERED_NODE_TYPE,None).singleNodeValue
return elm
def applyXPath(self,context,expr):
start_t=datetime.datetime.now()
expression=self.createExpression(expr,None)
result=expression.evaluate(context,XPathResult.ANY_TYPE)
time=datetime.datetime.now()-start_t
resultType=result.resultType
if XPathResult.BOOLEAN_TYPE<resultType:
result=expression.evaluate(context,XPathResult.ORDERED_NODE_SNAPSHOT_TYPE)
array=[]
for i in range(0,result.snapshotLength):
array.append(result.snapshotItem(i))
resultItems=array
else:
if resultType==XPathResult.NUMBER_TYPE:
resultItems=result.numberValue
elif resultType==XPathResult.STRING_TYPE:
resultItems=result.stringValue
elif resultType==XPathResult.BOOLEAN_TYPE:
resultItems=result.booleanValue
else:
resultItems=None
return (resultItems,time,resultType)
#} // end of XPathEvaluator
if __name__ == '__main__':
import sys
import optparse
import pdb
options=None
def prn(obj):
def prn_sub(obj,indent):
indent+=u' '
if isinstance(obj,list):
for i in range(0,len(obj)):
print u'[%d]' % (i)
prn_sub(obj[i],indent)
elif isinstance(obj,dict):
for mem in obj:
print u'[%s]' % (mem)
prn_sub(obj[mem],indent)
elif getattr(obj,'nodeType',None) or isinstance(obj,basestring):
str=indent+re.sub(r'([\r?\n])',r'\1'+indent,unicode(obj))
print str
else:
print obj
prn_sub(obj,u'')
def test():
global options
if options.expr:
if options.html:
document=BSXPathEvaluator(options.html)
elif options.file:
fp=open(options.file)
document=BSXPathEvaluator(fp.read())
fp.close()
else:
document=BSXPathEvaluator(sys.stdin.read())
(result,time,resultType)=document.applyXPath(document,options.expr)
prn(result)
else:
optparser.print_help()
optparser=optparse.OptionParser()
optparser.add_option(
'-e','--expr'
, action='store'
, metavar='<expression>'
, help=u'expression: XPATH expression'
, dest='expr'
)
optparser.add_option(
'-t','--html'
, action='store'
, metavar='<text>'
, help=u'text: HTML text'
, dest='html'
)
optparser.add_option(
'-f','--file'
, action='store'
, metavar='<filename>'
, help=u'filename: HTML filename'
, dest='file'
)
optparser.add_option(
'-d','--debug'
, action='store_true'
, help=u'use pdb'
, dest='debug'
)
(options,args)=optparser.parse_args()
if options.debug:
pdb.run('test()')
else:
test()
#[History]
#
# 0.01e: 2009-04-12
# - exclude 'link' tag from SELF_CLOSING_TAGS (for XML)
# - add __str__() and __unicode__() to AttributeWrapper class
#
# 0.01d: 2009-03-28
# - performance improvement: node searching(make attrMap in advance)
#
# 0.01c: 2009-03-28
# - performance improvement: node sorting(indexing) and node search(caching)
#
# 0.01b: 2009-03-27
# - fixed 'singleNodeValue' bug
# result = document.evaluate('//title[1]',document,None,XPathResult.FIRST_ORDERED_NODE_TYPE,None).singleNodeValue
# # returnd 'None', even though first-value exists
#
# 0.01a: 2009-03-27
# - fixed string() bug
# BSXPath.py -e "boolean(//p[contains(string(),\"br\")])" -t "<html><head></head><body><p>text before<br />text after</p></body></html>"
# # returned 'True', even though 'False' is right
# - cope with <table> problems on malformed HTML
# may convert '<table><th></th><td></td></table>' to '<table><tbody><tr><th></th><td></td></tr></tbody></table>' automatically
#
# 0.01 : 2009-03-25
# first release
#
#■ End of BSXPath.py
|
