Lines Matching defs:lower

26     lower: int = -1
33     lower: int = -1
39     r"^(?P<lower>[0-9A-F]{4,5})(?:\.\.(?P<upper>[0-9A-F]{4,5}))?\s*;\s*(?P<prop>\w+)"
46         lower_str, upper_str, result.prop = m.group("lower", "upper", "prop")
47         result.lower = int(lower_str, base=16)
48         result.upper = result.lower
69             and result[-1].upper + 1 == x.lower
105 /// - bits [11, 31] The lower bound code point of the range. The upper bound of
106 ///   the range is lower bound + size.
124   // anywhere in the range. After a lower bound is found the next step is to
130   // and lower bound 3. This results in the entry 0x1810.
132   // and moves to the previous entry. Thus the lower bound value will never
246     for range in sorted(ranges, key=lambda x: x.lower):
248         assert range.lower > high
252             e = Entry(range.lower, range.upper - range.lower, props.index(range.prop))
258             range.lower += 128
279                     cpp_entrytemplate.format(x.lower << 11 | x.offset << 4 | x.prop)