Lines Matching refs:all
5 * Corporation and others. All Rights Reserved.
86 // Reduce all stored offsets by delta, used when the current position
124 // and reduce all other offsets by this minimum.
198 // Construct for all variants of span(), or only for any one variant.
207 all((UBool)(which==ALL)) {
215 // Determine if the strings even need to be taken into account at all for span() etc.
216 // If any string is relevant, then all strings need to be used for
220 // (Only store irrelevant UTF-8 strings for LONGEST_MATCH where they are relevant after all.)
253 // Freeze after checking for the need to use strings at all because freezing
255 if(all) {
265 if(all) {
285 if(all) {
286 // Store span lengths for all span() variants.
321 } else /* not CONTAINED, not all, but NOT_CONTAINED */ {
341 } else /* not CONTAINED, not all, but NOT_CONTAINED */ {
371 if(all) {
376 // All spanXYZLengths pointers contain the same address.
383 if(all) {
388 // Copy constructor. Assumes which==ALL for a frozen set.
395 all(TRUE) {
526 * because all string matches are done from the same start index.
545 * or recursively span for all but the shortest one and
556 * Create and cache a spanSet which contains all of the single code points
574 * the loop, trying to match all set strings from there.
599 * + Continue from the farthest match position and ignore all others.
642 // Use offset list to try all possibilities.
690 // For longest match, we do need to try to match even an all-contained string
736 // Finished trying to match all strings at pos.
764 // string matched beyond it, so that we try all possible positions
803 // Use offset list to try all possibilities.
808 if(all) {
856 // For longest match, we do need to try to match even an all-contained string
901 // Finished trying to match all strings at pos.
929 // string matched beyond it, so that we try all possible positions
964 // Use offset list to try all possibilities.
970 if(all) {
1031 // For longest match, we do need to try to match even an all-contained string
1078 // Finished trying to match all strings at pos.
1106 // string matched beyond it, so that we try all possible positions
1145 // Use offset list to try all possibilities.
1150 if(all) {
1212 // For longest match, we do need to try to match even an all-contained string
1257 // Finished trying to match all strings at pos.
1285 // string matched beyond it, so that we try all possible positions
1320 * Create and cache a spanNotSet which contains all of the single code points
1425 if(all) {
1470 if(all) {
