Lines Matching refs:len
72 this = len(self.pred)
92 while ix >= len(self.pred):
113 if len(b) < len(a): a, b = b, a
114 res = b[:len(b) - len(a)]
115 for i in range(len(a)):
116 res.append(max(a[i], b[i + len(b) - len(a)]))
121 for ix in range(len(pattern)):
203 if len(succ):
233 while ix < len(result):
251 dedup_ix = [0] * len(self.bfs_order)
252 for ix in reversed(range(len(self.bfs_order))):
270 print(len(uniques), 'unique nodes,', len(self.bfs_order), 'total')
290 if len(l) > 2:
298 assert len(l) == 2, 'expected 2 chars in chr'
313 trie_off = alphabet_off + len(alphabet)
314 pattern_off = trie_off + len(trie)
315 file_size = pattern_off + len(pattern)
336 result = [struct.pack('<2I', 1, len(ch_map))]
341 if len(binary) % 4 != 0:
342 binary += b'\x00' * (4 - len(binary) % 4)
392 while shift < len(pat) and pat[len(pat) - shift - 1] == 0:
394 rawpat = pat_str[:len(pat) - shift]
398 raw_pat_size += len(rawpat)
399 data = (len(rawpat) << 26) | (shift << 20) | raw_patmap[rawpat]
400 patmap[pat_str] = len(pat_array)
402 data = [0, len(pat_array), 16 + 4 * len(pat_array), raw_pat_size]
452 assert len(lowercase) == 1, 'expected 1 lowercase character'
453 assert 0 <= len(uppercase) <= 1, 'expected 0 or 1 uppercase character'
477 for i in range(len(s) + 1):
478 pat_off = i - 1 + len(pat) - len(s)
492 if i < len(s):