Commit 1134b4cc authored by Tim Peters's avatar Tim Peters

_del_wordinfo: compute the length only once; BTree len can be arbitrarily

expensive.
parent 87c672c6
...@@ -262,10 +262,11 @@ class BaseIndex(Persistent): ...@@ -262,10 +262,11 @@ class BaseIndex(Persistent):
def _del_wordinfo(self, wid, docid): def _del_wordinfo(self, wid, docid):
doc2score = self._wordinfo[wid] doc2score = self._wordinfo[wid]
del doc2score[docid] del doc2score[docid]
if len(doc2score) == 0: numdocs = len(doc2score)
if numdocs == 0:
del self._wordinfo[wid] del self._wordinfo[wid]
return return
if len(doc2score) == self.DICT_CUTOFF: if numdocs == self.DICT_CUTOFF:
new = {} new = {}
for k, v in doc2score.items(): for k, v in doc2score.items():
new[k] = v new[k] = v
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment