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*InCB;\s*(?P<prop>\w+)"
45         lower_str, upper_str, result.prop = m.group("lower", "upper", "prop")
46         result.lower = int(lower_str, base=16)
47         result.upper = result.lower
69             and result[-1].upper + 1 == x.lower
98 /// - bits [11, 31] The lower bound code point of the range. The upper bound of
99 ///   the range is lower bound + size.
117   // anywhere in the range. After a lower bound is found the next step is to
123   // and lower bound 3. This results in the entry 0x1810.
125   // and moves to the previous entry. Thus the lower bound value will never
239     for range in sorted(ranges, key=lambda x: x.lower):
241         assert range.lower > high
245             e = Entry(range.lower, range.upper - range.lower, props.index(range.prop))
251             range.lower += 512
272                     cpp_entrytemplate.format(x.lower << 11 | x.offset << 2 | x.prop)