Sha256: bf7caacccf0b3c3fb3120fe579a729e0327d32119e6cc5db37f6b88eeaf76178
Contents?: true
Size: 1.23 KB
Versions: 90
Compression:
Stored size: 1.23 KB
Contents
package brackets
import (
"testing"
)
const targetTestVersion = 4
var testCases = []struct {
input string
expected bool
}{
{
input: "",
expected: true,
},
{
input: "{}",
expected: true,
},
{
input: "{{",
expected: false,
},
{
input: "}{",
expected: false,
},
{
input: "{}[]",
expected: true,
},
{
input: "{[]}",
expected: true,
},
{
input: "{[}]",
expected: false,
},
{
input: "{[)][]}",
expected: false,
},
{
input: "{[]([()])}",
expected: true,
},
}
func TestBracket(t *testing.T) {
if testVersion != targetTestVersion {
t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
}
for _, tt := range testCases {
actual, err := Bracket(tt.input)
// We don't expect errors for any of the test cases
if err != nil {
var _ error = err
t.Fatalf("Bracket(%q) returned error %q. Error not expected.", tt.input, err)
}
if actual != tt.expected {
t.Fatalf("Bracket(%q) was expected to return %v but returned %v.",
tt.input, tt.expected, actual)
}
}
}
func BenchmarkBracket(b *testing.B) {
b.StopTimer()
for _, tt := range testCases {
b.StartTimer()
for i := 0; i < b.N; i++ {
Bracket(tt.input)
}
b.StopTimer()
}
}
Version data entries
90 entries across 90 versions & 1 rubygems