Commitf000f56

committed

Made charsUntil a little bit faster when matching extremely short strings

--HG--extra : convert_revision : svn%3Aacbfec75-9323-0410-a652-858a13e371e0/trunk%401242

1 parentce43212 commitf000f56Copy full SHA for f000f56

File tree

-1

lines changed

-1

lines changed

Lines changed: 3 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -337,11 +337,13 @@ def charsUntil(self, characters, opposite = False):`
`337`	`337`	`regex=u"".join([u"\\x%02x"%ord(c)forcincharacters])`
`338`	`338`	`ifnotopposite:`
`339`	`339`	`regex=u"^%s"%regex`
`340`		`-chars=charsUntilRegEx[(characters,opposite)]=re.compile(u"[%s]*"%regex)`
	`340`	`+chars=charsUntilRegEx[(characters,opposite)]=re.compile(u"[%s]+"%regex)`
`341`	`341`
`342`	`342`	`whileTrue:`
`343`	`343`	`# Find the longest matching prefix`
`344`	`344`	`m=chars.match(self.chunk,self.chunkOffset)`
	`345`	`+ifmisNone:`
	`346`	`+break`
`345`	`347`	`# If not everything matched, return everything up to the part that didn't match`
`346`	`348`	`end=m.end()`
`347`	`349`	`ifend!=self.chunkSize:`

Comments

(0)