Lines Matching defs:lowest

5478  - regatom - the lowest level
8566      * The ']' ending the construct is treated as the lowest operator of all,
11529              * class matches more than one code point, and the lowest code
11588                  * of the lowest one is in the always-match list.  This test
11608                  * To do the general case, we first find the fold of the lowest
11609                  * code point (which may be higher than that lowest unfolded
11641                  * containing the lowest code point, we turn that into an
11680                     }   /* Below, the lowest code point < 256 */
11830                 /* Find the bit positions that differ from the lowest code
11845              * bits in lowest code point, call the count 'd'.  If the set we
11851              * points that don't differ from the lowest code point in any
11855              * lowest code point in that position, which possibility we've
11867                 /* The argument is the lowest code point */
12042         /* Place the lowest UTF-8 start byte in the flags field, so as to allow
12048          * ANYOFRb.  Otherwise store the lowest UTF-8 start byte which can
12065      * of the lowest code points, optimize to indicate that */
12082         /* We store the lowest possible first byte of the UTF-8 representation,
12098             /* If the lowest and highest are the same, we can get an exact
13113     const U8 lowest = (U8) ARG1u(n);
13120     /* Starting with the lowest code point, any code point that ANDed with the
13121      * mask yields the lowest code point is in the set */
13122     for (i = lowest; i <= 0xFF; i++) {
15733                 /* If already in lowest possible terms, we have already tried