-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsim.go
46 lines (36 loc) · 1.12 KB
/
sim.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
package main
import (
"sort"
"github.com/hbollon/go-edlib"
)
func SortCommits(commits []Commit, query string, alg edlib.Algorithm) []Commit {
sort.Slice(commits, func(i, j int) bool {
x, err := edlib.StringsSimilarity(commits[i].Message, query, alg)
if err != nil {
panic(err)
}
y, err := edlib.StringsSimilarity(commits[j].Message, query, alg)
if err != nil {
panic(err)
}
return x > y
})
// select where similarity is greater than 0.5
last := sort.Search(len(commits), func(i int) bool {
x, _ := edlib.StringsSimilarity(commits[i].Message, query, edlib.Levenshtein)
return x < 0.5
})
return commits[:last]
}
func SortCommitsByLevenshteinSim(commits []Commit, query string) []Commit {
return SortCommits(commits, query, edlib.Levenshtein)
}
func SortCommitsByCosineSim(commits []Commit, query string) []Commit {
return SortCommits(commits, query, edlib.Cosine)
}
func SortCommitsByJaccardSim(commits []Commit, query string) []Commit {
return SortCommits(commits, query, edlib.Jaccard)
}
func SortCommitsByLCSSim(commits []Commit, query string) []Commit {
return SortCommits(commits, query, edlib.Lcs)
}