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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
package discovery
import (
"reflect"
"testing"
"github.com/mimecast/dtail/internal/io/dlog"
)
func TestMain(m *testing.M) {
dlog.Common = &dlog.DLog{}
m.Run()
}
// TestShuffleListDoesNotMutateInput verifies that shuffleList never writes
// back into the caller's backing array, and that repeated calls within the
// same sub-second window produce different orderings (the chance of a false
// failure with 20 elements is 1/20! ≈ 4×10⁻¹⁹).
func TestShuffleListDoesNotMutateInput(t *testing.T) {
t.Parallel()
d := &Discovery{}
// Build a stable reference slice.
original := make([]string, 20)
for i := range original {
original[i] = string(rune('a' + i))
}
snapshot := append([]string(nil), original...)
// First shuffle — must not touch original.
first := d.shuffleList(original)
if !reflect.DeepEqual(original, snapshot) {
t.Fatalf("shuffleList mutated caller's slice: got %v, want %v", original, snapshot)
}
if len(first) != len(original) {
t.Fatalf("shuffleList returned wrong length: got %d, want %d", len(first), len(original))
}
// Second shuffle — different seed path; overwhelmingly likely to differ.
second := d.shuffleList(original)
if reflect.DeepEqual(first, second) {
t.Fatal("shuffleList returned identical order on two consecutive calls; seed resolution may be too coarse")
}
// Both results must contain exactly the same elements as the input.
countFirst := make(map[string]int, len(original))
countSecond := make(map[string]int, len(original))
for i := range original {
countFirst[first[i]]++
countSecond[second[i]]++
}
for _, s := range original {
if countFirst[s] != 1 {
t.Errorf("element %q appears %d times in first shuffle, want 1", s, countFirst[s])
}
if countSecond[s] != 1 {
t.Errorf("element %q appears %d times in second shuffle, want 1", s, countSecond[s])
}
}
}
func TestNewParsesModuleOptionsWithAdditionalColons(t *testing.T) {
t.Parallel()
tests := []struct {
name string
method string
wantMod string
wantOpt string
wantErr bool
}{
{
name: "plain module",
method: "file",
wantMod: "FILE",
},
{
name: "options with additional colons",
method: "method:host:port:extra",
wantMod: "METHOD",
wantOpt: "host:port:extra",
},
{
name: "empty options rejected",
method: "method:",
wantErr: true,
},
{
name: "missing module rejected",
method: ":host:port",
wantErr: true,
},
}
for _, tt := range tests {
tt := tt
t.Run(tt.name, func(t *testing.T) {
t.Parallel()
got, err := New(tt.method, "server", Shuffle)
if tt.wantErr {
if err == nil {
t.Fatalf("New(%q) error = nil, want error", tt.method)
}
return
}
if err != nil {
t.Fatalf("New(%q) error = %v, want nil", tt.method, err)
}
if got.module != tt.wantMod {
t.Fatalf("module = %q, want %q", got.module, tt.wantMod)
}
if got.options != tt.wantOpt {
t.Fatalf("options = %q, want %q", got.options, tt.wantOpt)
}
})
}
}
func TestServerListIgnoresEmptyServerEntries(t *testing.T) {
t.Parallel()
tests := []struct {
name string
method string
server string
want []string
wantErr bool
}{
{
name: "regex without module yields no phantom host",
server: "/.*/",
want: []string{},
},
{
name: "comma list filters empty entries",
server: "alpha,,beta,",
want: []string{"alpha", "beta"},
},
{
name: "empty server input preserves serverless sentinel",
server: "",
want: []string{""},
},
}
for _, tt := range tests {
tt := tt
t.Run(tt.name, func(t *testing.T) {
t.Parallel()
got, err := New(tt.method, tt.server, ServerOrder(99))
if tt.wantErr {
if err == nil {
t.Fatalf("New(%q, %q) error = nil, want error", tt.method, tt.server)
}
return
}
if err != nil {
t.Fatalf("New(%q, %q) error = %v, want nil", tt.method, tt.server, err)
}
servers := got.ServerList()
if len(servers) != len(tt.want) {
t.Fatalf("ServerList() len = %d, want %d (%v)", len(servers), len(tt.want), servers)
}
for i := range tt.want {
if servers[i] != tt.want[i] {
t.Fatalf("ServerList()[%d] = %q, want %q (full=%v)", i, servers[i], tt.want[i], servers)
}
}
})
}
}
|
