summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: daae669)
raw | patch | inline | side by side (parent: daae669)
author | Junio C Hamano <junkio@cox.net> | |
Wed, 14 Sep 2005 04:09:03 +0000 (21:09 -0700) | ||
committer | Junio C Hamano <junkio@cox.net> | |
Wed, 14 Sep 2005 04:09:03 +0000 (21:09 -0700) |
Signed-off-by: Junio C Hamano <junkio@cox.net>
git-merge-recursive.py | patch | blob | history |
diff --git a/git-merge-recursive.py b/git-merge-recursive.py
index 66165b01ce8fab01835bb00dbe2893ef2987ee33..60e8b21b3b640868b027ba909a4221a5d1bdbf90 100755 (executable)
--- a/git-merge-recursive.py
+++ b/git-merge-recursive.py
return [res, clean]
-getFilesRE = re.compile('([0-9]+) ([a-z0-9]+) ([0-9a-f]{40})\t(.*)')
+getFilesRE = re.compile(r'^([0-7]+) (\S+) ([0-9a-f]{40})\t(.*)$', re.S)
def getFilesAndDirs(tree):
files = Set()
dirs = Set()
self.stages = [Stage(), Stage(), Stage()]
self.path = path
-unmergedRE = re.compile('^([0-9]+) ([0-9a-f]{40}) ([1-3])\t(.*)$')
+unmergedRE = re.compile(r'^([0-7]+) ([0-9a-f]{40}) ([1-3])\t(.*)$', re.S)
def unmergedCacheEntries():
'''Create a dictionary mapping file names to CacheEntry
objects. The dictionary contains one entry for every path with a