text/normalizer/UnicodeSetStringSpan.java

50      * or built for all and may be used many times.
96     /** Set up for all variants of span()? */
97     private boolean all;
103      * Constructs for all variants of span(), or only for any one variant.
114         all = (which == ALL);
123         // Determine if the strings even need to be taken into account at all for span() etc.
124         // If any string is relevant, then all strings need to be used for
128         // (Only store irrelevant UTF-8 strings for LONGEST_MATCH where they are relevant after all.)
149         // Freeze after checking for the need to use strings at all because freezing
151         if (all) {
159         if (all) {
167         if (all) {
168             // Store span lengths for all span() variants.
192                     } else /* not CONTAINED, not all, but NOT_CONTAINED */{
211                 if (all) {
221         if (all) {
259      * string matching could use a binary search because all string matches are done
277      *     for all but the shortest one and iteratively continue the span with the shortest local match.
288      * Create and cache a spanSet which contains all of the single code points of the original set
306      *     trying to match all set strings from there.
329      *   + Continue from the farthest match position and ignore all others.
388             // Use offset list to try all possibilities.
440                     // For longest match, we do need to try to match even an all-contained string
485             // Finished trying to match all strings at pos.
514                     // string matched beyond it, so that we try all possible positions
574             // Try to match all of the strings.
598         // Use offset list to try all possibilities.
611             // Try to match all of the strings.
657             // Use offset list to try all possibilities.
663         if (all) {
711                     // For longest match, we do need to try to match even an all-contained string
755             // Finished trying to match all strings at pos.
783                     // string matched beyond it, so that we try all possible positions
819      * all of the single code points of the original set but none of its strings.
1055          * Reduces all stored offsets by delta, used when the current position moves by delta.
1131          * and reduces all other offsets by this minimum.