-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcopyname.go
63 lines (49 loc) · 1.29 KB
/
copyname.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
package main
import (
"fmt"
"path/filepath"
"regexp"
"strings"
)
var copyNamePattern = regexp.MustCompile(`^(?i)\s*(?:Copy (?:\d+ )?of )?(.*?)(?:[-_ ]?[()\d]+?(?:x\d+)?)?\s*(?:copy)?(\.[^\.]*?)?\s*$`)
// Note that isCopyName must be transitive or links can be created and broken in a single traversal
func isCopyName(nameA, nameB string) bool {
names := []string{
nameA,
nameB,
}
for i := range names {
m := copyNamePattern.FindStringSubmatch(names[i])
if m == nil {
return false
}
names[i] = strings.ToLower(fmt.Sprintf("%s%s", m[1], m[2]))
}
return names[0] == names[1]
}
func withoutExt(filename string) string {
ext := filepath.Ext(filename)
return strings.TrimSuffix(filename, ext)
}
func isNamePrefix(nameA, nameB string) bool {
nameA = strings.ToLower(withoutExt(nameA))
nameB = strings.ToLower(withoutExt(nameB))
if len(nameA) == len(nameB) {
return nameA == nameB
}
if len(nameA) < len(nameB) {
return strings.HasPrefix(nameB, nameA)
}
return strings.HasPrefix(nameA, nameB)
}
func isNameSuffix(nameA, nameB string) bool {
nameA = strings.ToLower(nameA)
nameB = strings.ToLower(nameB)
if len(nameA) == len(nameB) {
return nameA == nameB
}
if len(nameA) < len(nameB) {
return strings.HasSuffix(nameB, nameA)
}
return strings.HasSuffix(nameA, nameB)
}