mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-08-02 16:13:13 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 6

Verify that lower-higher case delta are 16-bit.

Browse source
This commit is contained in:
Martin v. Löwis 2002-10-18 17:34:18 +00:00
parent d8eeeae4a6
commit 99ac3283e7
1 changed files with 11 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

14
Tools/unicode/makeunicodedata.py
View file

@ -223,15 +223,21 @@ def makeunicodetype(unicode, trace):
flags |= UPPER_MASK flags |= UPPER_MASK
# use delta predictor for upper/lower/title # use delta predictor for upper/lower/title
if record[12]: if record[12]:
upper = (int(record[12], 16) - char) & 0xffff upper = int(record[12], 16) - char
assert -32768 <= upper <= 32767
upper = upper & 0xffff
else: else:
upper = 0 upper = 0
if record[13]: if record[13]:
lower = (int(record[13], 16) - char) & 0xffff lower = int(record[13], 16) - char
assert -32768 <= lower <= 32767
lower = lower & 0xffff
else: else:
lower = 0 lower = 0
if record[14]: if record[14]:
title = (int(record[14], 16) - char) & 0xffff title = int(record[14], 16) - char
assert -32768 <= lower <= 32767
title = title & 0xffff
else: else:
title = 0 title = 0
# decimal digit, integer digit # decimal digit, integer digit
@ -322,6 +328,8 @@ def makeunicodename(unicode, trace):
wordlist = words.items() wordlist = words.items()
# sort on falling frequency # sort on falling frequency
# XXX: different Python versions produce a different order
# for words with equal frequency
wordlist.sort(lambda a, b: len(b[1])-len(a[1])) wordlist.sort(lambda a, b: len(b[1])-len(a[1]))
# figure out how many phrasebook escapes we need # figure out how many phrasebook escapes we need