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
package Torello.HTML.NodeSearch.SearchLoops.TagNodesInclusive;

import java.util.Vector;
import java.util.PrimitiveIterator;

import Torello.HTML.*;

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

public class TNPollIncl
{
    public static Vector<HTMLNode> nth
        (Vector<? extends HTMLNode> html, int nth, LV l, String... htmlTags)
    {
        InclusiveException.check(htmlTags);

        DotPair dp;
        HTMLNode n;

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

            if (
                    ((n = html.elementAt(i)).isTagNode())       
                &&  (((TagNode) n).isTag(TC.OpeningTags, htmlTags))
                &&  ((dp = Util.Inclusive.dotPairOPT(html, i, l.end)) != null)
                &&  (--nth == 0)
            )
                return Util.pollRange(html, dp);

        return null;
    }

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

        DotPair dp;
        HTMLNode n;

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

            if (
                    ((n = html.elementAt(i)).isTagNode())       
                &&  (((TagNode) n).isTag(TC.OpeningTags, htmlTags))
                &&  ((dp = Util.Inclusive.dotPairOPT(html, i, l.end)) != null)
                &&  (--nth == 0)
            )
                return Util.pollRange(html, dp);

        return null;
    }

    public static Vector<Vector<HTMLNode>> all
        (Vector<? extends HTMLNode> html, LV l, String... htmlTags)
    {
        InclusiveException.check(htmlTags);

        Vector<DotPair> dpMatches = new Vector<>();
        DotPair         dp;
        HTMLNode        n;

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

            if (
                    ((n = html.elementAt(i)).isTagNode())       
                &&  (((TagNode) n).isTag(TC.OpeningTags, htmlTags))
                &&  ((dp = Util.Inclusive.dotPairOPT(html, i, l.end)) != null)
            )
                dpMatches.addElement(dp);

        // Build the return vector
        Vector<Vector<HTMLNode>> ret = new Vector<>();
        dpMatches.forEach((DotPair dotPair) -> ret.add(Util.cloneRange(html, dotPair)));

        // Remove the nodes out of the original page.
        Util.Remove.nodesOPT(html, DPUtil.toPosArray(dpMatches, true));
        return ret;
    }

    public static Vector<Vector<HTMLNode>> allExcept
        (Vector<? extends HTMLNode> html, LV l, String... htmlTags)
    {
        InclusiveException.check(htmlTags);

        Vector<DotPair> dpMatches = new Vector<>();
        DotPair         dp;
        HTMLNode        n;

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

            if (
                    ((n = html.elementAt(i)).isTagNode())       
                &&  (((TagNode) n).isTagExcept(TC.OpeningTags, htmlTags))
                &&  ((dp = Util.Inclusive.dotPairOPT(html, i, l.end)) != null)
            )
                dpMatches.addElement(dp);

        // Build the Return Vector
        Vector<Vector<HTMLNode>> ret = new Vector<>();
        dpMatches.forEach((DotPair dotPair) -> ret.add(Util.cloneRange(html, dotPair)));

        // Remove the nodes out of the original page.
        Util.Remove.nodesOPT(html, DPUtil.toPosArray(dpMatches, true));
        return ret;
    }
}