Lines Matching refs:b2j
184 # b2j
185 # for x in b, b2j[x] is a list of the indices (into b)
289 # For each element x in b, set b2j[x] to a list of the indices in
291 # the number of times x appears in b is len(b2j[x]) ...
296 # b2j also does not contain entries for "popular" elements, meaning
313 # The first trick is to build b2j ignoring the possibility
315 # out the junk later is much cheaper than building b2j "right"
318 self.b2j = b2j = {}
321 indices = b2j.setdefault(elt, [])
328 for elt in list(b2j.keys()): # using list() since b2j is modified
331 del b2j[elt]
338 for elt, idxs in list(b2j.items()):
341 del b2j[elt]
346 # the size of b2j.
406 a, b, b2j, isbjunk = self.a, self.b, self.b2j, self.isbjunk
415 # b2j has no junk keys, the loop is skipped if a[i] is junk
418 for j in b2j.get(a[i], nothing):
430 # "popular" non-junk elements aren't in b2j, which greatly speeds
