擅长:python、mysql、java
<p>如果如我所想,树已完全加载到内存中,则可以尝试反转循环。这样,您只需浏览文件<code>filein</code>一次:</p>
<pre><code>def f1():
with open(filein, 'rU') as f:
for line in f:
for span in tree.iterfind('//span'):
if span and span.attrib.has_key('id'):
x = span.get('id')
if "af" not in x and x in line:
print x, line
</code></pre>