Repository navigation
Expand file tree
/
Copy pathintersection_test.go
More file actions
135 lines (114 loc) · 2.66 KB
/
Copy pathintersection_test.go
File metadata and controls
135 lines (114 loc) · 2.66 KB
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
package genutilsgo
import (
"fmt"
"log"
"os"
"path/filepath"
"testing"
)
func TestIntersectionInt(t *testing.T) {
a := []int{1, 2, 3, 4, 5}
b := []int{10, 3, 7, 5, 6, 5, 8, 4}
fmt.Println(a)
fmt.Println(b)
ao, bo, ab := IntersectionI(a, b)
fmt.Println(ao)
fmt.Println(bo)
fmt.Println(ab)
}
func TestIntersectionIntHash(t *testing.T) {
a := []int{1, 2, 3, 4, 5}
b := []int{10, 3, 7, 5, 6, 5, 8, 4}
fmt.Println(a)
fmt.Println(b)
ab := IntersectionHash(a, b)
fmt.Println(ab)
}
func TestIntersectionIntSorted(t *testing.T) {
a := []int{1, 2, 3, 4, 5}
b := []int{10, 3, 7, 5, 6, 5, 8, 4}
fmt.Println(a)
fmt.Println(b)
ab := IntersectionSorted(a, b)
fmt.Println(ab)
}
func TestIntersectionIntSorted2(t *testing.T) {
a := []int{1, 2, 3, 4, 5}
b := []int{10, 3, 7, 5, 6, 20, 8, 4}
fmt.Println(a)
fmt.Println(b)
ab := IntersectionSorted(a, b)
fmt.Println(ab)
}
func TestIntersectionIntHash2(t *testing.T) {
a := []int{1, 2, 3, 4, 5}
b := []int{10, 3, 7, 5, 6, 20, 8, 4}
fmt.Println(a)
fmt.Println(b)
ab := IntersectionHash(a, b)
fmt.Println(ab)
}
func TestIntersectionStringHash(t *testing.T) {
a := []string{"a", "b", "c", "d", "e"}
b := []string{"z", "a", "x", "y", "q", "b", "r", "c"}
fmt.Println(a)
fmt.Println(b)
ab := IntersectionHash(a, b)
fmt.Println(ab)
}
func TestIntersectionStringHash2(t *testing.T) {
a := []string{"a", "b", "c", "d", "e"}
b := []string{"z", "a", "x", "y", "q", "b", "r", "c", "z"}
fmt.Println(a)
fmt.Println(b)
ab := IntersectionHash(a, b)
fmt.Println(ab)
}
func TestIntersectionStringHash3(t *testing.T) {
a := []string{"a", "b", "c", "d", "e"}
b := []string{"z", "a", "x", "y", "q", "b", "r", "c", "a"}
fmt.Println(a)
fmt.Println(b)
ab := IntersectionHash(a, b)
fmt.Println(ab)
}
func TestFilePaths(t *testing.T) {
var fp FilePaths
fp.Fn = make(map[string][]MyFileInfo, 1)
fp.FilenameDuplicates("a", "/b", 23)
fp.FilenameDuplicates("a", "/c", 44)
fp.FilenameDuplicates("a", "/d", 33)
fp.FilenameDuplicates("z", "/d/e/f", 23)
fp.FilenameDuplicates("a", "/c/z/q", 33)
for k, v := range fp.Fn {
fmt.Println(k, ":")
for _, vv := range v {
fmt.Println(vv)
}
}
}
func TestFilePaths2(t *testing.T) {
var fp FilePaths
fp.Fn = make(map[string][]MyFileInfo, 1)
err := filepath.Walk("/home/rh/proj/goutils",
func(path string, info os.FileInfo, err error) error {
if err != nil {
return err
}
//fmt.Println(info.Name(), path)
fp.FilenameDuplicates(info.Name(), path, info.Size())
return nil
})
if err != nil {
log.Println(err)
} else {
for k, v := range fp.Fn {
if len(v) > 1 {
fmt.Println(k, ":")
for _, vv := range v {
fmt.Println(vv.Path, vv.Size)
}
}
}
}
}