(l1, l2, common=[])
| 920 | return split(h,[t]+rest) |
| 921 | |
| 922 | def commonpath(l1, l2, common=[]): |
| 923 | if len(l1) < 1: return (common, l1, l2) |
| 924 | if len(l2) < 1: return (common, l1, l2) |
| 925 | if l1[0] != l2[0]: return (common, l1, l2) |
| 926 | return commonpath(l1[1:], l2[1:], common+[l1[0]]) |
| 927 | |
| 928 | def relpath(p1, p2): |
| 929 | (common,l1,l2) = commonpath(split(p1), split(p2)) |