-
Notifications
You must be signed in to change notification settings - Fork 1
/
group.go
84 lines (68 loc) · 1.78 KB
/
group.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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
package main
import (
"path"
"sort"
)
var groupFn = map[string]func(pr *PullRequest, file string) string{
"dir": ByDir,
"file": ByFile,
}
func ByDir(pr *PullRequest, file string) string { return path.Dir(file) }
func ByFile(pr *PullRequest, file string) string { return file }
func GroupByDir(prs []*PullRequest) Group {
return GroupBy(prs, func(pr *PullRequest, file string) string {
return path.Dir(file)
})
}
func GroupByPath(prs []*PullRequest) Group {
return GroupBy(prs, func(pr *PullRequest, file string) string {
return file
})
}
func GroupBy(prs []*PullRequest, key func(pr *PullRequest, file string) string) Group {
group := Group{}
for _, pr := range prs {
for _, file := range pr.Files {
name := key(pr, file)
if !containsPR(group[name], pr) {
group[name] = append(group[name], pr)
}
}
}
return group
}
func ConflictsWith(reference *PullRequest, prs []*PullRequest, key func(pr *PullRequest, file string) string) ([]*PRConflict, Group) {
details := Group{}
for _, file := range reference.Files {
name := key(reference, file)
details[name] = nil
}
conflicts := []*PRConflict{}
for _, pr := range prs {
if pr.Number == reference.Number {
continue
}
files := map[string]struct{}{}
for _, file := range pr.Files {
name := key(pr, file)
// ignore that don't exist in the original
if _, exists := details[name]; !exists {
continue
}
files[name] = struct{}{}
if !containsPR(details[name], pr) {
details[name] = append(details[name], pr)
}
}
if len(files) > 0 {
conflict := &PRConflict{With: pr}
for file := range files {
conflict.Keys = append(conflict.Keys, file)
}
sort.Strings(conflict.Keys)
conflicts = append(conflicts, conflict)
}
}
deleteZero(details)
return conflicts, details
}