package Torello.HTML.NodeSearch.searchLoops.InnerTagsInclusive;

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

import Torello.HTML.*;

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

public class ITPollIncl
{
    // ********************************************************************************************
    // ********************************************************************************************
    // MAIN POLL METHODS
    // ********************************************************************************************
    // ********************************************************************************************


    public static Vector<HTMLNode> 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)
            )
                return Util.pollRange(html, dp);

        return null;
    }

    public static Vector<HTMLNode> 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)
            )
                return Util.pollRange(html, dp);

        return null;
    }

    public static Vector<Vector<HTMLNode>> 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);

        // 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;
    }


    // ********************************************************************************************
    // ********************************************************************************************
    // MAIN POLL METHODS #2, Predicate<TagNode>
    // ********************************************************************************************
    // ********************************************************************************************


    public static Vector<HTMLNode> 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)
            )
                return Util.pollRange(html, dp);

        return null;
    }

    public static Vector<HTMLNode> 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)
            )
                return Util.pollRange(html, dp);

        return null;
    }

    public static Vector<Vector<HTMLNode>> 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);

        // 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;
    }
}