Added a break that I meant to include originally, for efficiency. Basically

it keeps it from trying to add the same node to the node set
over and over if it matches multiple given patterns.  Also in cases where there
are a lot of patterns to be matched, and it matches an early one, this
will make the script run slightly faster.  It's more there because it logically
should be, than anything else, I mean, Python is never going to be fast ;-)

llvm-svn: 24876
This commit is contained in:
Patrick Meredith 2005-12-20 02:03:23 +00:00
parent 2af3ee4bdd
commit 2dd7e06d8e
1 changed files with 1 additions and 0 deletions

View File

@ -66,6 +66,7 @@ while buffer != '':
#for the node (it will be Node(hex number)) to our set of nodes
if regexp.search(buffer):
node_set |= set([re.split('\s+',buffer,2)[1]])
break
buffer = input.readline()