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 | package Torello.HTML.NodeSearch.searchLoops.InnerTags; import java.util.Vector; import java.util.function.Predicate; import java.util.stream.IntStream; import Torello.HTML.*; import Torello.Java.LV; public class ITFind { // ******************************************************************************************** // ******************************************************************************************** // MAIN FIND METHODS // ******************************************************************************************** // ******************************************************************************************** public static int NTH( Vector<? extends HTMLNode> html, int nth, LV l, String htmlTag, String innerTag, Predicate<String> compare ) { 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) && (--nth == 0) ) return i; return -1; } public static int NTHFE( Vector<? extends HTMLNode> html, int nth, LV l, String htmlTag, String innerTag, Predicate<String> compare ) { 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) && (--nth == 0) ) return i; return -1; } public static int[] ALL( Vector<? extends HTMLNode> html, LV l, String htmlTag, String innerTag, Predicate<String> compare ) { IntStream.Builder b = IntStream.builder(); 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) ) b.accept(i); return b.build().toArray(); } // ******************************************************************************************** // ******************************************************************************************** // MAIN FIND METHODS, #2 Predicate<TagNode> // ******************************************************************************************** // ******************************************************************************************** public static int NTH (Vector<? extends HTMLNode> html, int nth, LV l, Predicate<TagNode> p, String... htmlTags) { 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) && (--nth == 0) ) return i; return -1; } public static int NTHFE (Vector<? extends HTMLNode> html, int nth, LV l, Predicate<TagNode> p, String... htmlTags) { 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) && (--nth == 0) ) return i; return -1; } public static int[] ALL (Vector<? extends HTMLNode> html, LV l, Predicate<TagNode> p, String... htmlTags) { IntStream.Builder b = IntStream.builder(); 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) ) b.accept(i); return b.build().toArray(); } } |