import os
import stat
import string
-import re
def normcase(s):
return split(p)[0]
-# Return the longest prefix of all list elements.
-
def commonprefix(m):
- "Given a list of pathnames, returns the longest common leading component"
+ """Return the longest prefix of all list elements."""
+
if not m: return ''
- n = map(string.lower, m)
- for i in range(len(n)):
- n[i] = re.split(r"[/\\]", n[i])
-
- prefix = n[0]
- for item in n:
+ prefix = m[0]
+ for item in m:
for i in range(len(prefix)):
if prefix[:i+1] <> item[:i+1]:
prefix = prefix[:i]
if i == 0: return ''
break
- return "\\".join(prefix)
+ return prefix
# Get size, mtime, atime of files.
import os
import stat
import string
-import re
# Normalize the case of a pathname and map slashes to backslashes.
def commonprefix(m):
"Given a list of pathnames, returns the longest common leading component"
if not m: return ''
- n = map(string.lower, m)
- for i in range(len(n)):
- n[i] = re.split(r"[/\\]", n[i])
-
- prefix = n[0]
- for item in n:
+ prefix = m[0]
+ for item in m:
for i in range(len(prefix)):
if prefix[:i+1] <> item[:i+1]:
prefix = prefix[:i]
if i == 0: return ''
break
- return "\\".join(prefix)
+ return prefix
# Get size, mtime, atime of files.
def commonprefix(m):
"Given a list of pathnames, returns the longest common leading component"
if not m: return ''
- n = m[:]
- for i in range(len(n)):
- n[i] = n[i].split("/")
-
- prefix = n[0]
- for item in n:
+ prefix = m[0]
+ for item in m:
for i in range(len(prefix)):
if prefix[:i+1] <> item[:i+1]:
prefix = prefix[:i]
if i == 0: return ''
break
- return "/".join(prefix)
+ return prefix
# Get size, mtime, atime of files.