This repository has been archived by the owner on Jul 3, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 4
/
pasmyhtml.pas
1916 lines (1611 loc) · 54.8 KB
/
pasmyhtml.pas
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
(******************************************************************************)
(* libPasMyHTML *)
(* delphi and object pascal wrapper around MyHTML library *)
(* https://github.com/lexborisov/myhtml *)
(* *)
(* Copyright (c) 2019 - 2021 Ivan Semenkov *)
(* https://github.com/isemenkov/libpasmyhtml ivan@semenkov.pro *)
(* Ukraine *)
(******************************************************************************)
(* *)
(* This source is free software; you can redistribute it and/or modify it *)
(* under the terms of the GNU General Public License as published by the Free *)
(* Software Foundation; either version 3 of the License. *)
(* *)
(* This code is distributed in the hope that it will be useful, but WITHOUT *)
(* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *)
(* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for *)
(* more details. *)
(* *)
(* A copy of the GNU General Public License is available on the World Wide *)
(* Web at <http://www.gnu.org/copyleft/gpl.html>. You can also obtain it by *)
(* writing to the Free Software Foundation, Inc., 51 Franklin Street - Fifth *)
(* Floor, Boston, MA 02110-1335, USA. *)
(* *)
(******************************************************************************)
unit pasmyhtml;
{$IFDEF FPC}
{$mode objfpc}{$H+}
{$ENDIF}
{$IFOPT D+}
{$DEFINE DEBUG}
{$ENDIF}
interface
uses
SysUtils, libpasmyhtml, container.list, container.arraylist, utils.functor,
utils.api.cstring;
type
{ TParser }
TParser = class
public
type
{ Start parsing from the next element }
TDocumentParseFrom = (
DOCUMENT_ROOT, { Start parse from document root }
DOCUMENT_HTML, { Start parse from HTML tag element }
DOCUMENT_HEAD, { Start parse from HEAD tag element }
DOCUMENT_BODY { Start parse from BODY tag element }
);
TTag = myhtml_tags_t;
{ Tag node attribute }
{ Class which implements HTML tag attribute and functions to operation
with it }
TTagNodeAttribute = class;
TTagNodeAttributeCompareFunctor = {$IFDEF FPC}specialize{$ENDIF}
TUnsortableFunctor<TTagNodeAttribute>;
TTagNodeAttributeList = {$IFDEF FPC}specialize{$ENDIF}
TList<TTagNodeAttribute, TTagNodeAttributeCompareFunctor>;
{ Tag node }
{ Class implements HTML tag and functions to operation with it }
TTagNode = class;
TTagNodeCompareFunctor = {$IFDEF FPC}specialize{$ENDIF}
TUnsortableFunctor<TTagNode>;
TTagNodeList = {$IFDEF FPC}specialize{$ENDIF}
TArrayList<TTagNode, TTagNodeCompareFunctor>;
{ Filter }
{ HTML tag filter callback }
TTagNodeFilterCallback = function (ANode : TTagNode; AData : Pointer) :
Boolean of object;
{ HTML tag attribute filter callback }
TTagNodeAttributeFilterCallback = function (ANodeAttribute :
TTagNodeAttribute; AData : Pointer) : Boolean of object;
{ Transform }
{ HTML tag node transform callback }
TTagNodeTransformCallback = procedure (ANode : TTagNode; AData : Pointer)
of object;
{ HTML tag attribute transform callback }
TTagNodeAttributeTransformCallback = procedure (ANodeAttribute :
TTagNodeAttribute; AData : Pointer) of object;
{ Custom filter interface }
IFilter = class
protected
function IsEqual (ANode : pmyhtml_tree_node_t) : Boolean; overload;
virtual; abstract;
function IsEqual (ANodeAttribute : pmyhtml_tree_attr_t) : Boolean;
overload; virtual; abstract;
end;
TFilter = class;
TTransform = class;
{ TTagNode }
{ Class implements HTML tag and functions to operation with it }
TTagNode = class
public
type
{ TTagNodeEnumerator }
{ TagNode enumerator }
TTagNodeEnumerator = class
protected
FNode : TTagNode;
FFilter : TFilter;
function GetCurrent : TTagNode; inline;
public
constructor Create (ANode : TTagNode; AFilter : TFilter = nil);
function MoveNext : Boolean; inline;
function GetEnumerator : TTagNodeEnumerator; inline;
property Current : TTagNode read GetCurrent;
end;
{ Get TagNode enumerator }
function GetEnumerator : TTagNodeEnumerator; inline;
{ GetTagNode filtered enumerator }
function Filter (AFilter : TFilter = nil) : TTagNodeEnumerator; inline;
private
FNode : pmyhtml_tree_node_t;
FNodeAttribute : pmyhtml_tree_attr_t;
{ Apply AFilter to ANode element if it is. Return pmyhtml_tree_node_t if
element find or nil }
function FilterNode (ANode : pmyhtml_tree_node_t; AFilter : TFilter) :
pmyhtml_tree_node_t;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Apply AFilter to ANode element if it is. Return pmyhtml_tree_node_t if
element find or nil. Try to find node is reverse direction }
function ReverseFilterNode (ANode : pmyhtml_tree_node_t; AFilter :
TFilter) : pmyhtml_tree_Node_t;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Apply AFilter to AAttribute if it is. Return filtered
pmyhtml_tree_attr_t element if find or nil }
{function FilterAttribute (AAttribute : pmyhtml_tree_attr_t; AFilter :
TFilter) : pmyhtml_tree_attr_t;}
{ Apply AFilter to AAttribute if it is. Return filtered
pmyhtml_tree_attr_t element if find or nil }
{function ReverseFilterAttribute (AAttribute : pmyhtml_tree_attr_t;
AFilter : TFilter) : pmyhtml_tree_attr_t;}
private
{ Return tag id }
function GetTag : TTag;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Return tag text value }
function GetValue : string;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Return node parent if exists, broken node overwise }
function GetParent : TTagNode;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Return TRUE if element is empty }
function GetIsEmpty : Boolean;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Return TRUE if element is self-closed }
function GetIsSelfClose : Boolean;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Get/Set custom data from/to node }
function GetData : Pointer;
{$IFNDEF DEBUG}inline;{$ENDIF}
procedure SetData (AData : Pointer);
{$IFNDEF DEBUG}inline;{$ENDIF}
public
constructor Create (ANode : pmyhtml_tree_node_t);
destructor Destroy; override;
{ Return TRUE if tag element is correct }
function IsOk : Boolean;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ If AFilter is set return first filtered node else return self }
function FirstNode (AFilter : TFilter = nil) : TTagNode;
{ Try to find next element else return nil if isn't }
function NextNode (AFilter : TFilter = nil) : TTagNode;
{ Try to find prev element else return nil if isn't }
function PrevNode (AFilter : TFilter = nil) : TTagNode;
{ For each node (if AFilter is present for filtered nodes, else for each
nodes) apply ATransform callback. If ATransform isn't do nothing }
function EachNode (AFilter : TFilter = nil; ATransform : TTransform
= nil) : TTagNode;
{ Return all AFilter match nodes list. If AFilter is not present return
all nodes list }
function FindAllNodes (AFilter : TFilter = nil) : TTagNodeList;
{ Return first filtered current node children. If AFilter isn't present
return first children node. If node not found return broken node }
function FirstChildrenNode (AFilter : TFilter = nil) : TTagNode;
{ Return last filtered current node children. If AFilter isn't present
return last children node. If node not found retun broken node }
function LastChildrenNode (AFilter : TFilter = nil) : TTagNode;
{ For each filtered current node childrens applies ATransfrom callback.
If ATransform isn't do nothing }
function EachChildrenNode (AFilter : TFilter = nil; ATransform :
TTransform = nil) : TTagNode;
{ Return all current node filtered childrens list. If AFilter is not
present return all children nodes list }
function FindAllChildrenNodes (AFilter : TFilter = nil) : TTagNodeList;
{ Find first node attribute using AFilter if it is else return first
attribute. If node haven't attributes return broken attribute }
function FirstNodeAttribute (AFilter : TFilter = nil) :
TTagNodeAttribute;
{ Find last node attribute using AFilter if it is else return last
attribute. If node haven't attributes return broken attribute }
function LastNodeAttribute (AFilter : TFilter = nil) :
TTagNodeAttribute;
{ Return next node attribute applying AFilter if exists. If node
attribute not exists return broken attribute }
{function NextNodeAttribute (AFilter : TFilter = nil) :
TTagNodeAttribute;}
{ Retunr prev node attribute applying AFilter if exists. If node
attribute not exists return broken attribute }
{function PrevNodeAttribute (AFilter : TFilter = nil) :
TTagNodeAttribute;}
{ For each node node attribute (if AFilter is present for filtered
attributes, else for each node attributes) apply ATransform callback.
If ATransform isn't do nothing }
function EachNodeAttribute (AFilter : TFilter = nil; ATransform :
TTransform = nil) : TTagNode;
{ Find all filtered node attributes. If AFilter isn't return all
attributes }
function FindAllNodeAttributes (AFilter : TFilter = nil) :
TTagNodeAttributeList;
public
{ Return tag id }
property Tag : TTag read GetTag;
{ Return parent node is exists, broken node overwise }
property Parent : TTagNode read GetParent;
{ Return TRUE if element is void }
property IsEmpty : Boolean read GetIsEmpty;
{ Return TRUE if element is self-closed }
property IsSelfClose : Boolean read GetIsSelfClose;
{ Custom data pointer stored in node }
property Data : Pointer read GetData write SetData;
{ Return tag text value }
property Value : string read GetValue;
{ Return tag text value through inside tags. Return all tags
concatinated text values for all nodes }
function ConcatValue (AFilter : TFilter = nil) : string;
{$IFNDEF DEBUG}inline;{$ENDIF}
end;
TStringList = {$IFDEF FPC}specialize{$ENDIF} TArrayList<String,
TCompareFunctorString>;
{ TTagNodeAttribute }
{ Class which implements HTML tag attribute and functions to operation
with it }
TTagNodeAttribute = class
private
FAttribute : pmyhtml_tree_attr_t;
{ Tokenize string by space }
class function StringTokenize (AString : string) : TStringList;
{ Apply AFilter to AAttribute if it is. Return filtered
pmyhtml_tree_attr_t element if find or nil }
function FilterAttribute (AAttribute : pmyhtml_tree_attr_t; AFilter :
TFilter) : pmyhtml_tree_attr_t;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Apply AFilter to AAttribute if it is. Return filtered
pmyhtml_tree_attr_t element if find or nil }
function ReverseFilterAttribute (AAttribute : pmyhtml_tree_attr_t;
AFilter : TFilter) : pmyhtml_tree_attr_t;
{$IFNDEF DEBUG}inline;{$ENDIF}
private
{ Return attribute key }
function GetKey : string; inline;
{ Return attribute value }
function GetValue : string; inline;
{ Return attribute values tokenize by space }
function GetValueList : TStringList;
{ Filters node attribute to forward }
function Filter (AFilter : TFilter) : TTagNodeAttribute;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Filters node attirbute to backward }
function ReverseFilter (AFilter : TFilter) : TTagNodeAttribute;
{$IFNDEF DEBUG}inline;{$ENDIF}
public
constructor Create (AAttribute : pmyhtml_tree_attr_t);
destructor Destroy; override;
{ Check if attribute is correct }
function IsOk : boolean;
{$IFNDEF DEBUG}inline;{$ENDIF}
public
{ Return attribute key }
property Key : string read GetKey;
{ Return attribute value }
property Value : string read GetValue;
{ Return attribute values tokenize by space }
property ValueList : TStringList read GetValueList;
{ Return next node attribute }
function Next (AFilter : TFilter = nil) : TTagNodeAttribute;
{ Return prev node attribute }
function Prev (AFilter : TFilter = nil) : TTagNodeAttribute;
end;
{ TFilter }
{ Class realize filter concept which can be used to find elements }
TFilter = class
public
type
{ TTagIdEqual }
TTagIdEqual = class (IFilter)
private
FTag : TTag;
protected
function IsEqual (ANode : pmyhtml_tree_node_t) : Boolean; overload;
override;
function IsEqual ({%H-}ANodeAttribute : pmyhtml_tree_attr_t) :
Boolean; overload; override;
public
constructor Create (ATag : TTag);
destructor Destroy; override;
end;
{ TTagIdExclude }
TTagIdExclude = class (IFilter)
private
FTag : TTag;
protected
function IsEqual (ANode : pmyhtml_tree_node_t) : Boolean; overload;
override;
function IsEqual ({%H-}ANodeAttribute : pmyhtml_tree_attr_t) :
Boolean; overload; override;
public
constructor Create (ATag : TTag);
destructor Destroy; override;
end;
{ TTagNodeCallback }
TTagNodeEqualCallback = class (IFilter)
private
FCallback : TTagNodeFilterCallback;
FData : Pointer;
protected
function IsEqual (ANode : pmyhtml_tree_node_t) : Boolean; overload;
override;
function IsEqual ({%H-}ANodeAttribute : pmyhtml_tree_attr_t) :
Boolean; overload; override;
public
constructor Create (ACallback : TTagNodeFilterCallback; AData :
Pointer);
destructor Destroy; override;
end;
{ TTagNodeAttributeKeyEqual }
TTagNodeAttributeKeyEqual = class (IFilter)
private
FTagNodeAttributeKey : string;
protected
function IsEqual ({%H-}ANode : pmyhtml_tree_node_t) : Boolean;
overload; override;
function IsEqual (ANodeAttribute : pmyhtml_tree_attr_t) : Boolean;
overload; override;
public
constructor Create (AKey : string);
destructor Destroy; override;
end;
{ TTagNodeAttributeValueEqual }
TTagNodeAttributeValueEqual = class (IFilter)
private
FTagNodeAttributeValue : string;
protected
function IsEqual ({%H-}ANode : pmyhtml_tree_node_t) : Boolean;
overload; override;
function IsEqual (ANodeAttribute : pmyhtml_tree_attr_t) : Boolean;
overload; override;
public
constructor Create (AValue : string);
destructor Destroy; override;
end;
{ TTagNodeAttrbuteEqualCallback }
TTagNodeAttributeEqualCallback = class (IFilter)
private
FTagNodeAttributeCallback : TTagNodeAttributeFilterCallback;
FTagNodeAttributeData : Pointer;
protected
function IsEqual ({%H-}ANode : pmyhtml_tree_node_t) : Boolean;
overload; override;
function IsEqual (ANodeAttribute : pmyhtml_tree_attr_t) : Boolean;
overload; override;
public
constructor Create (ACallback : TTagNodeAttributeFilterCallback;
AData : Pointer);
destructor Destroy; override;
end;
{ TContainsAttributeOnlyValue }
TContainsAttributeOnlyValue = class (IFilter)
private
FKey : string;
FValue : string;
protected
function IsEqual (ANode : pmyhtml_tree_node_t) : Boolean; overload;
override;
function IsEqual ({%H-}ANodeAttribute : pmyhtml_tree_attr_t) :
Boolean; overload; override;
public
constructor Create (AKey : string; AValue : string);
destructor Destroy; override;
end;
{ TNotContainsAttributeOnlyValue }
TNotContainsAttributeOnlyValue = class (IFilter)
private
FFilter : TContainsAttributeOnlyValue;
protected
function IsEqual (ANode : pmyhtml_tree_node_t) : Boolean; overload;
override;
function IsEqual ({%H-}ANodeAttribute : pmyhtml_tree_attr_t) :
Boolean; overload; override;
public
constructor Create (AKey : string; AValue : string);
destructor Destroy; override;
end;
{ TContainsAttributeAllValues }
TContainsAttributeAllValues = class (IFilter)
private
FKey : string;
FTagNodeAttributeValueList : TStringList;
protected
function IsEqual (ANode : pmyhtml_tree_node_t) : Boolean;
overload; override;
function IsEqual ({%H-}ANodeAttribute : pmyhtml_tree_attr_t) :
Boolean; overload; override;
public
constructor Create (AKey : string; AValueList : string); overload;
constructor Create (AKey : string; AValueList : TStringList);
overload;
destructor Destroy; override;
end;
{ TNotContainsAttributeAllValues }
TNotContainsAttributeAllValues = class (IFilter)
private
FKey : string;
FTagNodeAttributeValueList : TStringList;
protected
function IsEqual (ANode : pmyhtml_tree_node_t) : Boolean;
overload; override;
function IsEqual ({%H-}ANodeAttribute : pmyhtml_tree_attr_t) :
Boolean; overload; override;
public
constructor Create (AKey : string; AValueList : string); overload;
constructor Create (AKey : string; AValueList : TStringList);
overload;
destructor Destroy; override;
end;
private
type
TFilterCompareFunctor = {$IFDEF FPC}specialize {$ENDIF}
TUnsortableFunctor<IFilter>;
TFiltersList = {$IFDEF FPC}specialize{$ENDIF} TList<IFilter,
TFilterCompareFunctor>;
private
FFiltersList : TFiltersList;
{ Check if ANode is equal to defined filters list }
function IsEqual (ANode : pmyhtml_tree_node_t = nil) : Boolean;
overload;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Cheif if ANodeAttribute is equal to defined filters list }
function IsEqual (ANodeAttribute : pmyhtml_tree_attr_t = nil) :
Boolean; overload;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Return TRUE if filter isn't empty }
function IsSet : Boolean;
{$IFNDEF DEBUG}inline;{$ENDIF}
public
constructor Create;
destructor Destroy; override;
{ Set custom filter }
function CustomFilter (AFilter : IFilter) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set tag id for filtering }
function Tag (ATag : TTag) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Node tag id not equal ATag }
function ExcludeTag (ATag : TTag) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set tag attribute key for filtering }
{!!! Only for attributes filtrations, not tag nodes }
function AttributeKey (AKey : string) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set tag attribute value for filtering }
{!!! Only for attributes filtrations, not tag nodes }
function AttributeValue (AValue : string) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set attribute key and value for filtering }
{!!! Only for tag nodes filtrations, not attributes }
function AttributeKeyValue (AKey : string; AValue : string) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set class which must be in attribute "class" list }
{ If "class" attribute is exists new class is added in list }
function ContainsClass (AClass : string) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set class which must not be in attribute "class" list }
{ If "class" attribute is exists new class is added in list }
function NotContainsClass (AClass : string) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set class only which must be in attribute }
{ If "class" attribute is exists in list it is rewriting }
function ContainsClassOnly (AClass : string) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set class only which must not be in attribute }
{ If "class" attribute is exists in list it is rewriting }
function NotContainsClassOnly (AClass : string) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set id which must be in attribute "id" list }
{ If "id" attribute is exists new id is added in list }
function ContainsId (AId : string) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set id which must not be in attribute "id" list }
{ If "id" attribute is exists new id is added in list }
function NotContainsId (AId : string) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set id only which must be in attribute }
{ If "id" attribute is exists in list it is rewriting }
function ContainsIdOnly (AId : string) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set id only which must not be in attribute }
{ If "id" attribute is exists in list it is rewriting }
function NotContainsIdOnly (AId : string) : TFilter;
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Set tag filtering callback. Set AData pointer to pass it to callback.
Return self }
function TagNodeCallback (ACallback : TTagNodeFilterCallback; AData :
Pointer = nil) : TFilter;
{ Set tag attribute filtering callback. Set AData pointer to pass it to
callback. Return self }
function TagNodeAttributeCallback (ACallback :
TTagNodeAttributeFilterCallback; AData : Pointer = nil) : TFilter;
end;
{ TTransform }
{ Class provides transform callback wrapper which apply to tag element }
TTransform = class
private
FTagNodeCallback : TTagNodeTransformCallback;
FTagNodeData : Pointer;
FTagNodeAttributeCallback : TTagNodeAttributeTransformCallback;
FTagNodeAttributeData : Pointer;
{ Run transform node callback }
procedure RunNodeCallback (ATagNode : TTagNode);
{$IFNDEF DEBUG}inline;{$ENDIF}
{ Run transform node attribute callback }
procedure RunNodeAttributeCallback (ATagAttribute : TTagNodeAttribute);
{$IFNDEF DEBUG}inline;{$ENDIF}
public
constructor Create;
destructor Destroy; override;
{ Set tag transform callback function. Set AData to pass it to transform
callback. Return self }
function TagNodeTransform (ACallback : TTagNodeTransformCallback;
AData : Pointer = nil) : TTransform;
{ Set tag attribute callback function. Set AData to pass it to transform
callback. Return self }
function TagNodeAttributeTransform (ACallback :
TTagNodeAttributeTransformCallback; AData : Pointer) : TTransform;
end;
private
FHTML : pmyhtml_t;
FTree : pmyhtml_tree_t;
FEncoding : myencoding_t;
FError : myhtml_status_t;
public
constructor Create(
AParserOptions: myhtml_options_t = MyHTML_OPTIONS_PARSE_MODE_SEPARATELY;
AEncoding: myencoding_t = MyENCODING_UTF_8;
AThreadCount: Int64 = 1;
AQueueSize: Int64 = 4096;
AFlags: myhtml_tree_parse_flags_t = MyHTML_TREE_PARSE_FLAGS_CLEAN);
destructor Destroy; override;
{ Document parse }
function Parse (AHTML : string; AParseFrom : TDocumentParseFrom =
DOCUMENT_HTML) : TTagNode;
{ Return if parse has errors }
function HasErrors : Boolean;
{ Return error message if it is, or empty string }
function Error : string;
end;
implementation
{ TParser.TTagNode.TTagNodeEnumerator }
function TParser.TTagNode.TTagNodeEnumerator.GetCurrent: TTagNode;
begin
Result := FNode;
FNode := FNode.NextNode(FFilter);
end;
constructor TParser.TTagNode.TTagNodeEnumerator.Create (ANode: TTagNode;
AFilter: TFilter);
begin
FNode := ANode.NextNode(AFilter);
FFilter := AFilter;
end;
function TParser.TTagNode.TTagNodeEnumerator.MoveNext: Boolean;
begin
Result := FNode.IsOk;
end;
function TParser.TTagNode.TTagNodeEnumerator.GetEnumerator: TTagNodeEnumerator;
begin
Result := Self;
end;
{ TParser.TFilter.TTagIdExclude }
function TParser.TFilter.TTagIdExclude.IsEqual(ANode: pmyhtml_tree_node_t
): Boolean;
begin
Result := (ANode <> nil) and (myhtml_node_tag_id(ANode) <>
myhtml_tag_id_t(FTag));
end;
function TParser.TFilter.TTagIdExclude.IsEqual(
ANodeAttribute: pmyhtml_tree_attr_t): Boolean;
begin
Result := True; { not filtering by attribute }
end;
constructor TParser.TFilter.TTagIdExclude.Create(ATag: TTag);
begin
FTag := ATag;
end;
destructor TParser.TFilter.TTagIdExclude.Destroy;
begin
inherited Destroy;
end;
{ TParser.TFilter.TNotContainsAttributeAllValues }
function TParser.TFilter.TNotContainsAttributeAllValues.IsEqual(
ANode: pmyhtml_tree_node_t): Boolean;
function FindAttribute : pmyhtml_tree_attr_t; {$IFNDEF DEBUG}inline;{$ENDIF}
begin
Result := nil;
if ANode <> nil then
Result := myhtml_attribute_by_key(ANode, API.CString.Create(FKey)
.ToPAnsiChar, Length(FKey));
end;
function CheckAttributeAllValues (AAttribute : pmyhtml_tree_attr_t) : Boolean;
{$IFNDEF DEBUG}inline;{$ENDIF}
var
ValueList : TStringList;
Value : string;
begin
ValueList := TTagNodeAttribute.StringTokenize(myhtml_attribute_value(
AAttribute, nil));
Result := True;
for Value in FTagNodeAttributeValueList do
begin
if ValueList.IndexOf(Value) <> -1 then
begin
Result := False;
Break;
end;
end;
end;
var
NodeAttr : pmyhtml_tree_attr_t;
begin
if FTagNodeAttributeValueList.Length > 0 then
begin
NodeAttr := FindAttribute;
if NodeAttr = nil then
Result := True
else
Result := CheckAttributeAllValues(NodeAttr);
end else
Result := True;
end;
function TParser.TFilter.TNotContainsAttributeAllValues.IsEqual(
ANodeAttribute: pmyhtml_tree_attr_t): Boolean;
begin
Result := True; { not filtering by attribute }
end;
constructor TParser.TFilter.TNotContainsAttributeAllValues.Create(AKey: string;
AValueList: string);
begin
FKey := AKey;
FTagNodeAttributeValueList := TTagNodeAttribute.StringTokenize(AValueList);
end;
constructor TParser.TFilter.TNotContainsAttributeAllValues.Create(AKey: string;
AValueList: TStringList);
begin
FKey := AKey;
FTagNodeAttributeValueList := AValueList;
end;
destructor TParser.TFilter.TNotContainsAttributeAllValues.Destroy;
begin
FreeAndNil(FTagNodeAttributeValueList);
inherited Destroy;
end;
{ TParser.TFilter.TNotContainsAttributeOnlyValue }
function TParser.TFilter.TNotContainsAttributeOnlyValue.IsEqual(
ANode: pmyhtml_tree_node_t): Boolean;
begin
Result := not FFilter.IsEqual(ANode);
end;
function TParser.TFilter.TNotContainsAttributeOnlyValue.IsEqual(
ANodeAttribute: pmyhtml_tree_attr_t): Boolean;
begin
Result := True; { not filtering by attribute }
end;
constructor TParser.TFilter.TNotContainsAttributeOnlyValue.Create(AKey: string;
AValue: string);
begin
FFilter := TContainsAttributeOnlyValue.Create(AKey, AValue);
end;
destructor TParser.TFilter.TNotContainsAttributeOnlyValue.Destroy;
begin
FreeAndNil(FFilter);
inherited Destroy;
end;
{ TParser.TFilter.TContainsAttributeAllValues }
function TParser.TFilter.TContainsAttributeAllValues.IsEqual(ANode:
pmyhtml_tree_node_t): Boolean;
function FindAttribute : pmyhtml_tree_attr_t; {$IFNDEF DEBUG}inline;{$ENDIF}
begin
Result := nil;
if ANode <> nil then
Result := myhtml_attribute_by_key(ANode, API.CString.Create(FKey)
.ToPAnsiChar, Length(FKey));
end;
function CheckAttributeAllValues (AAttribute : pmyhtml_tree_attr_t) : Boolean;
{$IFNDEF DEBUG}inline;{$ENDIF}
var
ValueList : TStringList;
Value : string;
begin
ValueList := TTagNodeAttribute.StringTokenize(myhtml_attribute_value(
AAttribute, nil));
if ValueList.Length >= FTagNodeAttributeValueList.Length then
begin
Result := True;
for Value in FTagNodeAttributeValueList do
begin
if ValueList.IndexOf(Value) = -1 then
begin
Result := False;
Break;
end;
end;
end else
Result := False;
end;
var
NodeAttr : pmyhtml_tree_attr_t;
begin
if FTagNodeAttributeValueList.Length > 0 then
begin
NodeAttr := FindAttribute;
Result := (NodeAttr <> nil) and CheckAttributeAllValues(NodeAttr);
end else
Result := True;
end;
function TParser.TFilter.TContainsAttributeAllValues.IsEqual(
ANodeAttribute: pmyhtml_tree_attr_t): Boolean;
begin
Result := True; { not filtering by attribute }
end;
constructor TParser.TFilter.TContainsAttributeAllValues.Create(AKey : string;
AValueList: string);
begin
FKey := AKey;
FTagNodeAttributeValueList := TTagNodeAttribute.StringTokenize(AValueList);
end;
constructor TParser.TFilter.TContainsAttributeAllValues.Create(AKey : string;
AValueList: TStringList);
begin
FKey := AKey;
FTagNodeAttributeValueList := AValueList;
end;
destructor TParser.TFilter.TContainsAttributeAllValues.Destroy;
begin
FreeAndNil(FTagNodeAttributeValueList);
inherited Destroy;
end;
{ TParser.TFilter.TContainsAttributeOnlyValue }
function TParser.TFilter.TContainsAttributeOnlyValue.IsEqual(ANode:
pmyhtml_tree_node_t): Boolean;
function FindAttribute : pmyhtml_tree_attr_t; {$IFNDEF DEBUG}inline;{$ENDIF}
begin
Result := nil;
if ANode <> nil then
Result := myhtml_attribute_by_key(ANode, API.CString.Create(FKey)
.ToPAnsiChar, Length(FKey));
end;
var
NodeAttr : pmyhtml_tree_attr_t;
begin
if (FKey <> '') and (FValue <> '') then
begin
NodeAttr := FindAttribute;
Result := (NodeAttr <> nil) and (API.CString.Create(myhtml_attribute_value(
NodeAttr, nil)).ToString = FValue);
end else
Result := True;
end;
function TParser.TFilter.TContainsAttributeOnlyValue.IsEqual(
ANodeAttribute: pmyhtml_tree_attr_t): Boolean;
begin
Result := True; { not filtering by attribute }
end;
constructor TParser.TFilter.TContainsAttributeOnlyValue.Create(AKey : string;
AValue: string);
begin
FKey := AKey;
FValue := AValue;
end;
destructor TParser.TFilter.TContainsAttributeOnlyValue.Destroy;
begin
inherited Destroy;
end;
{ TParser.TFilter.TTagNodeAttributeEqualCallback }
function TParser.TFilter.TTagNodeAttributeEqualCallback.IsEqual(
ANode: pmyhtml_tree_node_t): Boolean;
var
NodeAttr : pmyhtml_tree_attr_t;
begin
if ANode <> nil then
NodeAttr := myhtml_node_attribute_first(ANode)
else
NodeAttr := nil;
while (NodeAttr <> nil) and (not (FTagNodeAttributeCallback(
TTagNodeAttribute.Create(NodeAttr), FTagNodeAttributeData))) do
NodeAttr := myhtml_attribute_next(NodeAttr);
Result := NodeAttr <> nil;
end;
function TParser.TFilter.TTagNodeAttributeEqualCallback.IsEqual(
ANodeAttribute: pmyhtml_tree_attr_t): Boolean;
begin
Result := FTagNodeAttributeCallback(TTagNodeAttribute.Create(ANodeAttribute),
FTagNodeAttributeData);
end;
constructor TParser.TFilter.TTagNodeAttributeEqualCallback.Create(
ACallback: TTagNodeAttributeFilterCallback; AData: Pointer);
begin
FTagNodeAttributeCallback := ACallback;
FTagNodeAttributeData := AData;
end;
destructor TParser.TFilter.TTagNodeAttributeEqualCallback.Destroy;
begin
inherited Destroy;
end;
{ TParser.TFilter.TTagNodeAttributeValueEqual }
function TParser.TFilter.TTagNodeAttributeValueEqual.IsEqual(
ANode: pmyhtml_tree_node_t): Boolean;
begin
Result := True; { not filtering by node }
end;
function TParser.TFilter.TTagNodeAttributeValueEqual.IsEqual(
ANodeAttribute: pmyhtml_tree_attr_t): Boolean;
begin
Result := (ANodeAttribute <> nil) and
(API.CString.Create(myhtml_attribute_value(ANodeAttribute, nil)).ToString =
FTagNodeAttributeValue);
end;
constructor TParser.TFilter.TTagNodeAttributeValueEqual.Create(AValue: string);