Lines Matching refs:table
10 # 2000-09-25 fl merged tim's splitbin fixes, separate decomposition table
11 # 2000-09-25 fl added character type table
116 print(len(list(filter(None, unicode.table))), "characters")
121 print(len(list(filter(None, old_unicode.table))), "characters")
134 table = [dummy]
145 record = unicode.table[char]
161 cache[item] = i = len(table)
162 table.append(item)
177 record = unicode.table[char]
200 unicode.table[decomp[1]][3] == "0":
251 print(len(table), "unique properties")
267 for item in table:
315 # split record index table
323 # split decomposition index table
341 for version, table, normalization in unicode.changed:
343 records = [table[0]]
344 cache = {table[0]:0}
345 index = [0] * len(table)
346 for i, record in enumerate(table):
391 table = [dummy]
400 record = unicode.table[char]
496 cache[item] = i = len(table)
497 table.append(item)
500 print(len(table), "unique character type entries")
513 for item in table:
526 # split decomposition index table
606 record = unicode.table[char]
711 # unicode name hash table
716 record = unicode.table[char]
739 # split decomposition index table
806 if new.table[i] is None:
809 assert old.table[i] is None
812 if old.table[i] is None:
817 if old.table[i] != new.table[i]:
818 for k in range(len(old.table[i])):
819 if old.table[i][k] != new.table[i][k]:
820 value = old.table[i][k]
822 # the name is not set in the old.table, but in the
823 # new.table we are using it for aliases and named seq
826 #print "CATEGORY",hex(i), old.table[i][k], new.table[i][k]
829 #print "BIDIR",hex(i), old.table[i][k], new.table[i][k]
832 #print "DECOMP",hex(i), old.table[i][k], new.table[i][k]
837 #print "DECIMAL",hex(i), old.table[i][k], new.table[i][k]
842 # print "NUMERIC",hex(i), `old.table[i][k]`, new.table[i][k]
878 raise Difference(hex(i), k, old.table[i], new.table[i])
919 table = [None] * 0x110000
927 table[char] = s
935 s = table[i]
949 table[i] = f2
955 self.table = table
975 self.table[pua_index][1] = name
999 self.table[pua_index][1] = name
1032 if table[i] is not None:
1033 table[i].append(widths[i])
1036 if table[i] is not None:
1037 table[i].append(set())
1054 if table[char]:
1057 table[char][-1].add(p)
1070 table[char][-1].add('Line_Break')
1099 if table[i] is not None:
1100 table[i].append(quickchecks[i])
1118 if table[i] is not None:
1119 table[i][8] = value
1153 # hash table tools
1177 # turn a (key, value) list into a static hash table structure
1179 # determine table size
1187 print(size, "slots in hash table")
1189 table = [None] * size
1197 # initialize hash table
1201 v = table[i]
1203 table[i] = value
1211 v = table[i]
1213 table[i] = value
1222 for i in range(len(table)):
1223 if table[i] is None:
1224 table[i] = 0
1226 self.data = Array(name + "_hash", table)
1284 """t, trace=0 -> (t1, t2, shift). Split a table to save space.
1302 print("Size of original table:", len(t)*getsize(t), \
