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

package Torello.HTML.NodeSearch.searchLoops.InnerTagsInclusive;

import java.util.Vector;
import java.util.function.Predicate;
import java.util.stream.IntStream;

import Torello.HTML.*;

import Torello.HTML.NodeSearch.InclusiveException;
import Torello.Java.LV;

public class ITRemoveIncl
{
    // ********************************************************************************************
    // ********************************************************************************************
    // MAIN REMOVE METHODS
    // ********************************************************************************************
    // ********************************************************************************************


    public static int NTH(
            Vector<? extends HTMLNode> html, int nth, LV l, String htmlTag, String innerTag,
            Predicate<String> compare
        )
    {
        InclusiveException.check(htmlTag);

        DotPair dp;
        TagNode tn;
        String  itv;

        for (int i=l.start; i < l.end; i++)

            if (
                    ((tn = html.elementAt(i).openTagPWA()) != null)
                &&  ((htmlTag == null) || htmlTag.equals(tn.tok))
                &&  ((itv = tn.AVOPT(innerTag)) != null)
                &&  compare.test(itv)
            	&&  ((dp = Util.Inclusive.dotPairOPT(html, i, l.end)) != null)
                &&  (--nth == 0)
            )
                // { Util.Remove.range(html, dp.start, dp.end + 1); return dp.size(); }
                { html.subList(dp.start, dp.end + 1).clear();  return dp.size(); }                

        return 0;
    }

    public static int NTHFE(
            Vector<? extends HTMLNode> html, int nth, LV l, String htmlTag, String innerTag,
            Predicate<String> compare
        )
    {
        InclusiveException.check(htmlTag);

        DotPair dp;
        TagNode tn;
        String  itv;

        for (int i=l.end-1; i >= l.start; i--)

            if (
                    ((tn = html.elementAt(i).openTagPWA()) != null)
                &&  ((htmlTag == null) || htmlTag.equals(tn.tok))
                &&  ((itv = tn.AVOPT(innerTag)) != null)
                &&  compare.test(itv)
                &&  ((dp = Util.Inclusive.dotPairOPT(html, i, l.end)) != null)
                &&  (--nth == 0)
            )
                // { Util.Remove.range(html, dp.start, dp.end + 1); return dp.size(); }
                { html.subList(dp.start, dp.end + 1).clear();  return dp.size(); }

        return 0;
    }

    public static int ALL(
            Vector<? extends HTMLNode> html, LV l, String htmlTag, String innerTag,
            Predicate<String> compare
        )
    {
        InclusiveException.check(htmlTag);

        Vector<DotPair> dpMatches = new Vector<>();
        DotPair         dp;
        TagNode         tn;
        String          itv;

        for (int i=l.start; i < l.end; i++)

            if (
                    ((tn = html.elementAt(i).openTagPWA()) != null)
                &&  ((htmlTag == null) || htmlTag.equals(tn.tok))
                &&  ((itv = tn.AVOPT(innerTag)) != null)
                &&  compare.test(itv)
                &&  ((dp = Util.Inclusive.dotPairOPT(html, i, l.end)) != null)
            )
                dpMatches.addElement(dp);

        // Remove the nodes out of the original page.
        int[] removeArr = DPUtil.toPosArray(dpMatches, true);
        Util.Remove.nodesOPT(html, removeArr);

        return removeArr.length;
    }


    // ********************************************************************************************
    // ********************************************************************************************
    // MAIN REMOVE METHODS #2 - Predicate<TagNode>
    // ********************************************************************************************
    // ********************************************************************************************


    public static int NTH
        (Vector<? extends HTMLNode> html, int nth, LV l, Predicate<TagNode> p, String... htmlTags)
    {
        InclusiveException.check(htmlTags);

        DotPair dp;
        TagNode tn;

        for (int i=l.start; i < l.end; i++)

            if (
                    ((tn = html.elementAt(i).openTag()) != null)
                &&  ((htmlTags.length == 0) || tn.isTag(htmlTags))
                &&  p.test(tn)
                &&  ((dp = Util.Inclusive.dotPairOPT(html, i, l.end)) != null)
                &&  (--nth == 0)
            )
                // { Util.Remove.range(html, dp.start, dp.end + 1); return dp.size(); }
                { html.subList(dp.start, dp.end + 1).clear();  return dp.size(); }

        return 0;
    }

    public static int NTHFE
        (Vector<? extends HTMLNode> html, int nth, LV l, Predicate<TagNode> p, String... htmlTags)
    {
        InclusiveException.check(htmlTags);

        DotPair dp;
        TagNode tn;

        for (int i=l.end-1; i >= l.start; i--)

            if (
                    ((tn = html.elementAt(i).openTag()) != null)
                &&  ((htmlTags.length == 0) || tn.isTag(htmlTags))
                &&  p.test(tn)
                &&  ((dp = Util.Inclusive.dotPairOPT(html, i, l.end)) != null)
                &&  (--nth == 0)
            )
                // { Util.Remove.range(html, dp.start, dp.end + 1); return dp.size(); }
                { html.subList(dp.start, dp.end + 1).clear();  return dp.size(); }

        return 0;
    }

    public static int ALL
        (Vector<? extends HTMLNode> html, LV l, Predicate<TagNode> p, String... htmlTags)
    {
        InclusiveException.check(htmlTags);

        Vector<DotPair> dpMatches = new Vector<>();
        DotPair         dp;
        TagNode         tn;

        for (int i=l.start; i < l.end; i++)

            if (
                    ((tn = html.elementAt(i).openTag()) != null)
                &&  ((htmlTags.length == 0) || tn.isTag(htmlTags))
                &&  p.test(tn)
                &&  ((dp = Util.Inclusive.dotPairOPT(html, i, l.end)) != null)
            )
                dpMatches.addElement(dp);

        // Remove the nodes out of the original page.
        int[] removeArr = DPUtil.toPosArray(dpMatches, true);
        Util.Remove.nodesOPT(html, removeArr);

        return removeArr.length;
    }
}