# # (re)generate unicode property and type databases # # This script converts Unicode database files to Modules/unicodedata_db.h, # Modules/unicodename_db.h, and Objects/unicodetype_db.h # # history: # 2000-09-24 fl created (based on bits and pieces from unidb) # 2000-09-25 fl merged tim's splitbin fixes, separate decomposition table # 2000-09-25 fl added character type table # 2000-09-26 fl added LINEBREAK, DECIMAL, and DIGIT flags/fields (2.0) # 2000-11-03 fl expand first/last ranges # 2001-01-19 fl added character name tables (2.1) # 2001-01-21 fl added decomp compression; dynamic phrasebook threshold # 2002-09-11 wd use string methods # 2002-10-18 mvl update to Unicode 3.2 # 2002-10-22 mvl generate NFC tables # 2002-11-24 mvl expand all ranges, sort names version-independently # 2002-11-25 mvl add UNIDATA_VERSION # 2004-05-29 perky add east asian width information # 2006-03-10 mvl update to Unicode 4.1; add UCD 3.2 delta # 2008-06-11 gb add PRINTABLE_MASK for Atsuo Ishimoto's ascii() patch # 2011-10-21 ezio add support for name aliases and named sequences # 2012-01 benjamin add full case mappings # # written by Fredrik Lundh (fredrik@pythonware.com) # import dataclasses import os import sys import zipfile from functools import partial from textwrap import dedent from typing import Iterator, List, Optional, Set, Tuple SCRIPT = sys.argv[0] VERSION = "3.3" # The Unicode Database # -------------------- # When changing UCD version please update # * Doc/library/stdtypes.rst, and # * Doc/library/unicodedata.rst # * Doc/reference/lexical_analysis.rst (two occurrences) UNIDATA_VERSION = "15.1.0" UNICODE_DATA = "UnicodeData%s.txt" COMPOSITION_EXCLUSIONS = "CompositionExclusions%s.txt" EASTASIAN_WIDTH = "EastAsianWidth%s.txt" UNIHAN = "Unihan%s.zip" DERIVED_CORE_PROPERTIES = "DerivedCoreProperties%s.txt" DERIVEDNORMALIZATION_PROPS = "DerivedNormalizationProps%s.txt" LINE_BREAK = "LineBreak%s.txt" NAME_ALIASES = "NameAliases%s.txt" NAMED_SEQUENCES = "NamedSequences%s.txt" SPECIAL_CASING = "SpecialCasing%s.txt" CASE_FOLDING = "CaseFolding%s.txt" # Private Use Areas -- in planes 1, 15, 16 PUA_1 = range(0xE000, 0xF900) PUA_15 = range(0xF0000, 0xFFFFE) PUA_16 = range(0x100000, 0x10FFFE) # we use this ranges of PUA_15 to store name aliases and named sequences NAME_ALIASES_START = 0xF0000 NAMED_SEQUENCES_START = 0xF0200 old_versions = ["3.2.0"] CATEGORY_NAMES = [ "Cn", "Lu", "Ll", "Lt", "Mn", "Mc", "Me", "Nd", "Nl", "No", "Zs", "Zl", "Zp", "Cc", "Cf", "Cs", "Co", "Cn", "Lm", "Lo", "Pc", "Pd", "Ps", "Pe", "Pi", "Pf", "Po", "Sm", "Sc", "Sk", "So" ] BIDIRECTIONAL_NAMES = [ "", "L", "LRE", "LRO", "R", "AL", "RLE", "RLO", "PDF", "EN", "ES", "ET", "AN", "CS", "NSM", "BN", "B", "S", "WS", "ON", "LRI", "RLI", "FSI", "PDI" ] # "N" needs to be the first entry, see the comment in makeunicodedata EASTASIANWIDTH_NAMES = [ "N", "H", "W", "Na", "A", "F" ] MANDATORY_LINE_BREAKS = [ "BK", "CR", "LF", "NL" ] # note: should match definitions in Objects/unicodectype.c ALPHA_MASK = 0x01 DECIMAL_MASK = 0x02 DIGIT_MASK = 0x04 LOWER_MASK = 0x08 LINEBREAK_MASK = 0x10 SPACE_MASK = 0x20 TITLE_MASK = 0x40 UPPER_MASK = 0x80 XID_START_MASK = 0x100 XID_CONTINUE_MASK = 0x200 PRINTABLE_MASK = 0x400 NUMERIC_MASK = 0x800 CASE_IGNORABLE_MASK = 0x1000 CASED_MASK = 0x2000 EXTENDED_CASE_MASK = 0x4000 # these ranges need to match unicodedata.c:is_unified_ideograph cjk_ranges = [ ('3400', '4DBF'), # CJK Ideograph Extension A CJK ('4E00', '9FFF'), # CJK Ideograph ('20000', '2A6DF'), # CJK Ideograph Extension B ('2A700', '2B739'), # CJK Ideograph Extension C ('2B740', '2B81D'), # CJK Ideograph Extension D ('2B820', '2CEA1'), # CJK Ideograph Extension E ('2CEB0', '2EBE0'), # CJK Ideograph Extension F ('2EBF0', '2EE5D'), # CJK Ideograph Extension I ('30000', '3134A'), # CJK Ideograph Extension G ('31350', '323AF'), # CJK Ideograph Extension H ] def maketables(trace=0): print("--- Reading", UNICODE_DATA % "", "...") unicode = UnicodeData(UNIDATA_VERSION) print(len(list(filter(None, unicode.table))), "characters") for version in old_versions: print("--- Reading", UNICODE_DATA % ("-"+version), "...") old_unicode = UnicodeData(version, cjk_check=False) print(len(list(filter(None, old_unicode.table))), "characters") merge_old_version(version, unicode, old_unicode) makeunicodename(unicode, trace) makeunicodedata(unicode, trace) makeunicodetype(unicode, trace) # -------------------------------------------------------------------- # unicode character properties def makeunicodedata(unicode, trace): # the default value of east_asian_width is "N", for unassigned code points # not mentioned in EastAsianWidth.txt # in addition there are some reserved but unassigned code points in CJK # ranges that are classified as "W". code points in private use areas # have a width of "A". both of these have entries in # EastAsianWidth.txt # see https://unicode.org/reports/tr11/#Unassigned assert EASTASIANWIDTH_NAMES[0] == "N" dummy = (0, 0, 0, 0, 0, 0) table = [dummy] cache = {0: dummy} index = [0] * len(unicode.chars) FILE = "Modules/unicodedata_db.h" print("--- Preparing", FILE, "...") # 1) database properties for char in unicode.chars: record = unicode.table[char] if record: # extract database properties category = CATEGORY_NAMES.index(record.general_category) combining = int(record.canonical_combining_class) bidirectional = BIDIRECTIONAL_NAMES.index(record.bidi_class) mirrored = record.bidi_mirrored == "Y" eastasianwidth = EASTASIANWIDTH_NAMES.index(record.east_asian_width) normalizationquickcheck = record.quick_check item = ( category, combining, bidirectional, mirrored, eastasianwidth, normalizationquickcheck ) elif unicode.widths[char] is not None: # an unassigned but reserved character, with a known # east_asian_width eastasianwidth = EASTASIANWIDTH_NAMES.index(unicode.widths[char]) item = (0, 0, 0, 0, eastasianwidth, 0) else: continue # add entry to index and item tables i = cache.get(item) if i is None: cache[item] = i = len(table) table.append(item) index[char] = i # 2) decomposition data decomp_data_cache = {} decomp_data = [0] decomp_prefix = [""] decomp_index = [0] * len(unicode.chars) decomp_size = 0 comp_pairs = [] comp_first = [None] * len(unicode.chars) comp_last = [None] * len(unicode.chars) for char in unicode.chars: record = unicode.table[char] if record: if record.decomposition_type: decomp = record.decomposition_type.split() if len(decomp) > 19: raise Exception("character %x has a decomposition too large for nfd_nfkd" % char) # prefix if decomp[0][0] == "<": prefix = decomp.pop(0) else: prefix = "" try: i = decomp_prefix.index(prefix) except ValueError: i = len(decomp_prefix) decomp_prefix.append(prefix) prefix = i assert prefix < 256 # content decomp = [prefix + (len(decomp)<<8)] + [int(s, 16) for s in decomp] # Collect NFC pairs if not prefix and len(decomp) == 3 and \ char not in unicode.exclusions and \ unicode.table[decomp[1]].canonical_combining_class == "0": p, l, r = decomp comp_first[l] = 1 comp_last[r] = 1 comp_pairs.append((l,r,char)) key = tuple(decomp) i = decomp_data_cache.get(key, -1) if i == -1: i = len(decomp_data) decomp_data.extend(decomp) decomp_size = decomp_size + len(decomp) * 2 decomp_data_cache[key] = i else: assert decomp_data[i:i+len(decomp)] == decomp else: i = 0 decomp_index[char] = i f = l = 0 comp_first_ranges = [] comp_last_ranges = [] prev_f = prev_l = None for i in unicode.chars: if comp_first[i] is not None: comp_first[i] = f f += 1 if prev_f is None: prev_f = (i,i) elif prev_f[1]+1 == i: prev_f = prev_f[0],i else: comp_first_ranges.append(prev_f) prev_f = (i,i) if comp_last[i] is not None: comp_last[i] = l l += 1 if prev_l is None: prev_l = (i,i) elif prev_l[1]+1 == i: prev_l = prev_l[0],i else: comp_last_ranges.append(prev_l) prev_l = (i,i) comp_first_ranges.append(prev_f) comp_last_ranges.append(prev_l) total_first = f total_last = l comp_data = [0]*(total_first*total_last) for f,l,char in comp_pairs: f = comp_first[f] l = comp_last[l] comp_data[f*total_last+l] = char print(len(table), "unique properties") print(len(decomp_prefix), "unique decomposition prefixes") print(len(decomp_data), "unique decomposition entries:", end=' ') print(decomp_size, "bytes") print(total_first, "first characters in NFC") print(total_last, "last characters in NFC") print(len(comp_pairs), "NFC pairs") print("--- Writing", FILE, "...") with open(FILE, "w") as fp: fprint = partial(print, file=fp) fprint("/* this file was generated by %s %s */" % (SCRIPT, VERSION)) fprint() fprint('#define UNIDATA_VERSION "%s"' % UNIDATA_VERSION) fprint("/* a list of unique database records */") fprint("const _PyUnicode_DatabaseRecord _PyUnicode_Database_Records[] = {") for item in table: fprint(" {%d, %d, %d, %d, %d, %d}," % item) fprint("};") fprint() fprint("/* Reindexing of NFC first characters. */") fprint("#define TOTAL_FIRST",total_first) fprint("#define TOTAL_LAST",total_last) fprint("struct reindex{int start;short count,index;};") fprint("static struct reindex nfc_first[] = {") for start,end in comp_first_ranges: fprint(" { %d, %d, %d}," % (start,end-start,comp_first[start])) fprint(" {0,0,0}") fprint("};\n") fprint("static struct reindex nfc_last[] = {") for start,end in comp_last_ranges: fprint(" { %d, %d, %d}," % (start,end-start,comp_last[start])) fprint(" {0,0,0}") fprint("};\n") # FIXME: the following tables could be made static, and # the support code moved into unicodedatabase.c fprint("/* string literals */") fprint("const char *_PyUnicode_CategoryNames[] = {") for name in CATEGORY_NAMES: fprint(" \"%s\"," % name) fprint(" NULL") fprint("};") fprint("const char *_PyUnicode_BidirectionalNames[] = {") for name in BIDIRECTIONAL_NAMES: fprint(" \"%s\"," % name) fprint(" NULL") fprint("};") fprint("const char *_PyUnicode_EastAsianWidthNames[] = {") for name in EASTASIANWIDTH_NAMES: fprint(" \"%s\"," % name) fprint(" NULL") fprint("};") fprint("static const char *decomp_prefix[] = {") for name in decomp_prefix: fprint(" \"%s\"," % name) fprint(" NULL") fprint("};") # split record index table index1, index2, shift = splitbins(index, trace) fprint("/* index tables for the database records */") fprint("#define SHIFT", shift) Array("index1", index1).dump(fp, trace) Array("index2", index2).dump(fp, trace) # split decomposition index table index1, index2, shift = splitbins(decomp_index, trace) fprint("/* decomposition data */") Array("decomp_data", decomp_data).dump(fp, trace) fprint("/* index tables for the decomposition data */") fprint("#define DECOMP_SHIFT", shift) Array("decomp_index1", index1).dump(fp, trace) Array("decomp_index2", index2).dump(fp, trace) index, index2, shift = splitbins(comp_data, trace) fprint("/* NFC pairs */") fprint("#define COMP_SHIFT", shift) Array("comp_index", index).dump(fp, trace) Array("comp_data", index2).dump(fp, trace) # Generate delta tables for old versions for version, table, normalization in unicode.changed: cversion = version.replace(".","_") records = [table[0]] cache = {table[0]:0} index = [0] * len(table) for i, record in enumerate(table): try: index[i] = cache[record] except KeyError: index[i] = cache[record] = len(records) records.append(record) index1, index2, shift = splitbins(index, trace) fprint("static const change_record change_records_%s[] = {" % cversion) for record in records: fprint(" { %s }," % ", ".join(map(str,record))) fprint("};") Array("changes_%s_index" % cversion, index1).dump(fp, trace) Array("changes_%s_data" % cversion, index2).dump(fp, trace) fprint("static const change_record* get_change_%s(Py_UCS4 n)" % cversion) fprint("{") fprint(" int index;") fprint(" if (n >= 0x110000) index = 0;") fprint(" else {") fprint(" index = changes_%s_index[n>>%d];" % (cversion, shift)) fprint(" index = changes_%s_data[(index<<%d)+(n & %d)];" % \ (cversion, shift, ((1<code dictionary */") packed_dawg, pos_to_codepoint = build_compression_dawg(data) notfound = len(pos_to_codepoint) inverse_list = [notfound] * len(unicode.chars) for pos, codepoint in enumerate(pos_to_codepoint): inverse_list[codepoint] = pos Array("packed_name_dawg", list(packed_dawg)).dump(fp, trace) Array("dawg_pos_to_codepoint", pos_to_codepoint).dump(fp, trace) index1, index2, shift = splitbins(inverse_list, trace) fprint("#define DAWG_CODEPOINT_TO_POS_SHIFT", shift) fprint("#define DAWG_CODEPOINT_TO_POS_NOTFOUND", notfound) Array("dawg_codepoint_to_pos_index1", index1).dump(fp, trace) Array("dawg_codepoint_to_pos_index2", index2).dump(fp, trace) fprint() fprint('static const unsigned int aliases_start = %#x;' % NAME_ALIASES_START) fprint('static const unsigned int aliases_end = %#x;' % (NAME_ALIASES_START + len(unicode.aliases))) fprint('static const unsigned int name_aliases[] = {') for name, codepoint in unicode.aliases: fprint(' 0x%04X,' % codepoint) fprint('};') # In Unicode 6.0.0, the sequences contain at most 4 BMP chars, # so we are using Py_UCS2 seq[4]. This needs to be updated if longer # sequences or sequences with non-BMP chars are added. # unicodedata_lookup should be adapted too. fprint(dedent(""" typedef struct NamedSequence { int seqlen; Py_UCS2 seq[4]; } named_sequence; """)) fprint('static const unsigned int named_sequences_start = %#x;' % NAMED_SEQUENCES_START) fprint('static const unsigned int named_sequences_end = %#x;' % (NAMED_SEQUENCES_START + len(unicode.named_sequences))) fprint('static const named_sequence named_sequences[] = {') for name, sequence in unicode.named_sequences: seq_str = ', '.join('0x%04X' % cp for cp in sequence) fprint(' {%d, {%s}},' % (len(sequence), seq_str)) fprint('};') def merge_old_version(version, new, old): # Changes to exclusion file not implemented yet if old.exclusions != new.exclusions: raise NotImplementedError("exclusions differ") # In these change records, 0xFF means "no change" bidir_changes = [0xFF]*0x110000 category_changes = [0xFF]*0x110000 decimal_changes = [0xFF]*0x110000 mirrored_changes = [0xFF]*0x110000 east_asian_width_changes = [0xFF]*0x110000 # In numeric data, 0 means "no change", # -1 means "did not have a numeric value numeric_changes = [0] * 0x110000 # normalization_changes is a list of key-value pairs normalization_changes = [] for i in range(0x110000): if new.table[i] is None: # Characters unassigned in the new version ought to # be unassigned in the old one assert old.table[i] is None continue # check characters unassigned in the old version if old.table[i] is None: # category 0 is "unassigned" category_changes[i] = 0 continue # check characters that differ if old.table[i] != new.table[i]: for k, field in enumerate(dataclasses.fields(UcdRecord)): value = getattr(old.table[i], field.name) new_value = getattr(new.table[i], field.name) if value != new_value: if k == 1 and i in PUA_15: # the name is not set in the old.table, but in the # new.table we are using it for aliases and named seq assert value == '' elif k == 2: category_changes[i] = CATEGORY_NAMES.index(value) elif k == 4: bidir_changes[i] = BIDIRECTIONAL_NAMES.index(value) elif k == 5: # We assume that all normalization changes are in 1:1 mappings assert " " not in value normalization_changes.append((i, value)) elif k == 6: # we only support changes where the old value is a single digit assert value in "0123456789" decimal_changes[i] = int(value) elif k == 8: # Since 0 encodes "no change", the old value is better not 0 if not value: numeric_changes[i] = -1 else: numeric_changes[i] = float(value) assert numeric_changes[i] not in (0, -1) elif k == 9: if value == 'Y': mirrored_changes[i] = '1' else: mirrored_changes[i] = '0' elif k == 11: # change to ISO comment, ignore pass elif k == 12: # change to simple uppercase mapping; ignore pass elif k == 13: # change to simple lowercase mapping; ignore pass elif k == 14: # change to simple titlecase mapping; ignore pass elif k == 15: # change to east asian width east_asian_width_changes[i] = EASTASIANWIDTH_NAMES.index(value) elif k == 16: # derived property changes; not yet pass elif k == 17: # normalization quickchecks are not performed # for older versions pass else: class Difference(Exception):pass raise Difference(hex(i), k, old.table[i], new.table[i]) new.changed.append((version, list(zip(bidir_changes, category_changes, decimal_changes, mirrored_changes, east_asian_width_changes, numeric_changes)), normalization_changes)) DATA_DIR = os.path.join('Tools', 'unicode', 'data') def open_data(template, version): local = os.path.join(DATA_DIR, template % ('-'+version,)) if not os.path.exists(local): import urllib.request if version == '3.2.0': # irregular url structure url = ('https://www.unicode.org/Public/3.2-Update/'+template) % ('-'+version,) else: url = ('https://www.unicode.org/Public/%s/ucd/'+template) % (version, '') os.makedirs(DATA_DIR, exist_ok=True) urllib.request.urlretrieve(url, filename=local) if local.endswith('.txt'): return open(local, encoding='utf-8') else: # Unihan.zip return open(local, 'rb') def expand_range(char_range: str) -> Iterator[int]: ''' Parses ranges of code points, as described in UAX #44: https://www.unicode.org/reports/tr44/#Code_Point_Ranges ''' if '..' in char_range: first, last = [int(c, 16) for c in char_range.split('..')] else: first = last = int(char_range, 16) for char in range(first, last+1): yield char class UcdFile: ''' A file in the standard format of the UCD. See: https://www.unicode.org/reports/tr44/#Format_Conventions Note that, as described there, the Unihan data files have their own separate format. ''' def __init__(self, template: str, version: str) -> None: self.template = template self.version = version def records(self) -> Iterator[List[str]]: with open_data(self.template, self.version) as file: for line in file: line = line.split('#', 1)[0].strip() if not line: continue yield [field.strip() for field in line.split(';')] def __iter__(self) -> Iterator[List[str]]: return self.records() def expanded(self) -> Iterator[Tuple[int, List[str]]]: for record in self.records(): char_range, rest = record[0], record[1:] for char in expand_range(char_range): yield char, rest @dataclasses.dataclass class UcdRecord: # 15 fields from UnicodeData.txt . See: # https://www.unicode.org/reports/tr44/#UnicodeData.txt codepoint: str name: str general_category: str canonical_combining_class: str bidi_class: str decomposition_type: str decomposition_mapping: str numeric_type: str numeric_value: str bidi_mirrored: str unicode_1_name: str # obsolete iso_comment: str # obsolete simple_uppercase_mapping: str simple_lowercase_mapping: str simple_titlecase_mapping: str # https://www.unicode.org/reports/tr44/#EastAsianWidth.txt east_asian_width: Optional[str] # Binary properties, as a set of those that are true. # Taken from multiple files: # https://www.unicode.org/reports/tr44/#DerivedCoreProperties.txt # https://www.unicode.org/reports/tr44/#LineBreak.txt binary_properties: Set[str] # The Quick_Check properties related to normalization: # https://www.unicode.org/reports/tr44/#Decompositions_and_Normalization # We store them as a bitmask. quick_check: int def from_row(row: List[str]) -> UcdRecord: return UcdRecord(*row, None, set(), 0) # -------------------------------------------------------------------- # the following support code is taken from the unidb utilities # Copyright (c) 1999-2000 by Secret Labs AB # load a unicode-data file from disk class UnicodeData: # table: List[Optional[UcdRecord]] # index is codepoint; None means unassigned def __init__(self, version, cjk_check=True): self.changed = [] table = [None] * 0x110000 for s in UcdFile(UNICODE_DATA, version): char = int(s[0], 16) table[char] = from_row(s) cjk_ranges_found = [] # expand first-last ranges field = None for i in range(0, 0x110000): # The file UnicodeData.txt has its own distinct way of # expressing ranges. See: # https://www.unicode.org/reports/tr44/#Code_Point_Ranges s = table[i] if s: if s.name[-6:] == "First>": s.name = "" field = dataclasses.astuple(s)[:15] elif s.name[-5:] == "Last>": if s.name.startswith(">quickcheck_shift)&3 quickchecks[char] |= quickcheck for i in range(0, 0x110000): if table[i] is not None: table[i].quick_check = quickchecks[i] with open_data(UNIHAN, version) as file: zip = zipfile.ZipFile(file) if version == '3.2.0': data = zip.open('Unihan-3.2.0.txt').read() else: data = zip.open('Unihan_NumericValues.txt').read() for line in data.decode("utf-8").splitlines(): if not line.startswith('U+'): continue code, tag, value = line.split(None, 3)[:3] if tag not in ('kAccountingNumeric', 'kPrimaryNumeric', 'kOtherNumeric'): continue value = value.strip().replace(',', '') i = int(code[2:], 16) # Patch the numeric field if table[i] is not None: table[i].numeric_value = value sc = self.special_casing = {} for data in UcdFile(SPECIAL_CASING, version): if data[4]: # We ignore all conditionals (since they depend on # languages) except for one, which is hardcoded. See # handle_capital_sigma in unicodeobject.c. continue c = int(data[0], 16) lower = [int(char, 16) for char in data[1].split()] title = [int(char, 16) for char in data[2].split()] upper = [int(char, 16) for char in data[3].split()] sc[c] = (lower, title, upper) cf = self.case_folding = {} if version != '3.2.0': for data in UcdFile(CASE_FOLDING, version): if data[1] in "CF": c = int(data[0], 16) cf[c] = [int(char, 16) for char in data[2].split()] def uselatin1(self): # restrict character range to ISO Latin 1 self.chars = list(range(256)) # stuff to deal with arrays of unsigned integers class Array: def __init__(self, name, data): self.name = name self.data = data def dump(self, file, trace=0): # write data to file, as a C array size = getsize(self.data) if trace: print(self.name+":", size*len(self.data), "bytes", file=sys.stderr) file.write("static const ") if size == 1: file.write("unsigned char") elif size == 2: file.write("unsigned short") else: file.write("unsigned int") file.write(" " + self.name + "[] = {\n") if self.data: s = " " for item in self.data: i = str(item) + ", " if len(s) + len(i) > 78: file.write(s.rstrip() + "\n") s = " " + i else: s = s + i if s.strip(): file.write(s.rstrip() + "\n") file.write("};\n\n") def getsize(data): # return smallest possible integer size for the given array maxdata = max(data) if maxdata < 256: return 1 elif maxdata < 65536: return 2 else: return 4 def splitbins(t, trace=0): """t, trace=0 -> (t1, t2, shift). Split a table to save space. t is a sequence of ints. This function can be useful to save space if many of the ints are the same. t1 and t2 are lists of ints, and shift is an int, chosen to minimize the combined size of t1 and t2 (in C code), and where for each i in range(len(t)), t[i] == t2[(t1[i >> shift] << shift) + (i & mask)] where mask is a bitmask isolating the last "shift" bits. If optional arg trace is non-zero (default zero), progress info is printed to sys.stderr. The higher the value, the more info you'll get. """ if trace: def dump(t1, t2, shift, bytes): print("%d+%d bins at shift %d; %d bytes" % ( len(t1), len(t2), shift, bytes), file=sys.stderr) print("Size of original table:", len(t)*getsize(t), "bytes", file=sys.stderr) n = len(t)-1 # last valid index maxshift = 0 # the most we can shift n and still have something left if n > 0: while n >> 1: n >>= 1 maxshift += 1 del n bytes = sys.maxsize # smallest total size so far t = tuple(t) # so slices can be dict keys for shift in range(maxshift + 1): t1 = [] t2 = [] size = 2**shift bincache = {} for i in range(0, len(t), size): bin = t[i:i+size] index = bincache.get(bin) if index is None: index = len(t2) bincache[bin] = index t2.extend(bin) t1.append(index >> shift) # determine memory size b = len(t1)*getsize(t1) + len(t2)*getsize(t2) if trace > 1: dump(t1, t2, shift, b) if b < bytes: best = t1, t2, shift bytes = b t1, t2, shift = best if trace: print("Best:", end=' ', file=sys.stderr) dump(t1, t2, shift, bytes) if __debug__: # exhaustively verify that the decomposition is correct mask = ~((~0) << shift) # i.e., low-bit mask of shift bits for i in range(len(t)): assert t[i] == t2[(t1[i >> shift] << shift) + (i & mask)] return best if __name__ == "__main__": maketables(1)