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

package Torello.HTML.NodeSearch.searchLoops;

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

import Torello.HTML.*;
import Torello.Java.LV;

public class ITCount
{
    // ********************************************************************************************
    // ********************************************************************************************
    // MAIN COUNT METHODS
    // ********************************************************************************************
    // ********************************************************************************************


    public static int ALL(
            Vector<? extends HTMLNode> html, LV l, String htmlTag, String innerTag,
            Predicate<String> compare
        )
    {
        int     count=0;
        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)
            )
                count++;

        return count;
    }

    public static int ALL
        (Vector<? extends HTMLNode> html, LV l, Predicate<TagNode> p, String... htmlTags)
    {
        int     count=0;
        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)
            )
                count++;

        return count;
    }
}