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
|
// Package jira contains the Jira bridge implementation
package jira
import (
"sort"
"github.com/MichaelMure/git-bug/bridge/core"
)
// Jira Main object for the bridge
type Jira struct{}
// Target returns "jira"
func (*Jira) Target() string {
return target
}
// NewImporter returns the jira importer
func (*Jira) NewImporter() core.Importer {
return &jiraImporter{}
}
// NewExporter returns the jira exporter
func (*Jira) NewExporter() core.Exporter {
return &jiraExporter{}
}
// stringInSlice returns true if needle is found in haystack
func stringInSlice(needle string, haystack []string) bool {
for _, match := range haystack {
if match == needle {
return true
}
}
return false
}
// Given two string slices, return three lists containing:
// 1. elements found only in the first input list
// 2. elements found only in the second input list
// 3. elements found in both input lists
func setSymmetricDifference(
setA, setB []string) ([]string, []string, []string) {
sort.Strings(setA)
sort.Strings(setB)
maxLen := len(setA) + len(setB)
onlyA := make([]string, 0, maxLen)
onlyB := make([]string, 0, maxLen)
both := make([]string, 0, maxLen)
idxA := 0
idxB := 0
for idxA < len(setA) && idxB < len(setB) {
if setA[idxA] < setB[idxB] {
// In the first set, but not the second
onlyA = append(onlyA, setA[idxA])
idxA++
} else if setA[idxA] > setB[idxB] {
// In the second set, but not the first
onlyB = append(onlyB, setB[idxB])
idxB++
} else {
// In both
both = append(both, setA[idxA])
idxA++
idxB++
}
}
for ; idxA < len(setA); idxA++ {
// Leftovers in the first set, not the second
onlyA = append(onlyA, setA[idxA])
}
for ; idxB < len(setB); idxB++ {
// Leftovers in the second set, not the first
onlyB = append(onlyB, setB[idxB])
}
return onlyA, onlyB, both
}
|
