Lines Matching defs:upper

27     upper: 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")
48         result.upper = result.lower
50             result.upper = int(upper_str, base=16)
69             and result[-1].upper + 1 == x.lower
71             result[-1].upper = x.upper
105 /// - bits [11, 31] The lower bound code point of the range. The upper bound of
122   // The algorithm searches for the upper bound of the range and, when found,
135   // size. Then the upper bound for code point 3 will return the entry after
249         high = range.upper
252             e = Entry(range.lower, range.upper - range.lower, props.index(range.prop))