gcc/libgo/go/regexp/onepass_test.go
Ian Lance Taylor bc998d034f libgo: update to go1.9
Reviewed-on: https://go-review.googlesource.com/63753

From-SVN: r252767
2017-09-14 17:11:35 +00:00

248 lines
5.1 KiB
Go

// Copyright 2014 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package regexp
import (
"reflect"
"regexp/syntax"
"strings"
"testing"
)
var runeMergeTests = []struct {
left, right, merged []rune
next []uint32
leftPC, rightPC uint32
}{
{
// empty rhs
[]rune{69, 69},
[]rune{},
[]rune{69, 69},
[]uint32{1},
1, 2,
},
{
// identical runes, identical targets
[]rune{69, 69},
[]rune{69, 69},
[]rune{},
[]uint32{mergeFailed},
1, 1,
},
{
// identical runes, different targets
[]rune{69, 69},
[]rune{69, 69},
[]rune{},
[]uint32{mergeFailed},
1, 2,
},
{
// append right-first
[]rune{69, 69},
[]rune{71, 71},
[]rune{69, 69, 71, 71},
[]uint32{1, 2},
1, 2,
},
{
// append, left-first
[]rune{71, 71},
[]rune{69, 69},
[]rune{69, 69, 71, 71},
[]uint32{2, 1},
1, 2,
},
{
// successful interleave
[]rune{60, 60, 71, 71, 101, 101},
[]rune{69, 69, 88, 88},
[]rune{60, 60, 69, 69, 71, 71, 88, 88, 101, 101},
[]uint32{1, 2, 1, 2, 1},
1, 2,
},
{
// left surrounds right
[]rune{69, 74},
[]rune{71, 71},
[]rune{},
[]uint32{mergeFailed},
1, 2,
},
{
// right surrounds left
[]rune{69, 74},
[]rune{68, 75},
[]rune{},
[]uint32{mergeFailed},
1, 2,
},
{
// overlap at interval begin
[]rune{69, 74},
[]rune{74, 75},
[]rune{},
[]uint32{mergeFailed},
1, 2,
},
{
// overlap ar interval end
[]rune{69, 74},
[]rune{65, 69},
[]rune{},
[]uint32{mergeFailed},
1, 2,
},
{
// overlap from above
[]rune{69, 74},
[]rune{71, 74},
[]rune{},
[]uint32{mergeFailed},
1, 2,
},
{
// overlap from below
[]rune{69, 74},
[]rune{65, 71},
[]rune{},
[]uint32{mergeFailed},
1, 2,
},
{
// out of order []rune
[]rune{69, 74, 60, 65},
[]rune{66, 67},
[]rune{},
[]uint32{mergeFailed},
1, 2,
},
}
func TestMergeRuneSet(t *testing.T) {
for ix, test := range runeMergeTests {
merged, next := mergeRuneSets(&test.left, &test.right, test.leftPC, test.rightPC)
if !reflect.DeepEqual(merged, test.merged) {
t.Errorf("mergeRuneSet :%d (%v, %v) merged\n have\n%v\nwant\n%v", ix, test.left, test.right, merged, test.merged)
}
if !reflect.DeepEqual(next, test.next) {
t.Errorf("mergeRuneSet :%d(%v, %v) next\n have\n%v\nwant\n%v", ix, test.left, test.right, next, test.next)
}
}
}
var onePass = &onePassProg{}
var onePassTests = []struct {
re string
onePass *onePassProg
}{
{`^(?:a|(?:a*))$`, notOnePass},
{`^(?:(a)|(?:a*))$`, notOnePass},
{`^(?:(?:(?:.(?:$))?))$`, onePass},
{`^abcd$`, onePass},
{`^(?:(?:a{0,})*?)$`, onePass},
{`^(?:(?:a+)*)$`, onePass},
{`^(?:(?:a|(?:aa)))$`, onePass},
{`^(?:[^\s\S])$`, onePass},
{`^(?:(?:a{3,4}){0,})$`, notOnePass},
{`^(?:(?:(?:a*)+))$`, onePass},
{`^[a-c]+$`, onePass},
{`^[a-c]*$`, onePass},
{`^(?:a*)$`, onePass},
{`^(?:(?:aa)|a)$`, onePass},
{`^[a-c]*`, notOnePass},
{`^...$`, onePass},
{`^(?:a|(?:aa))$`, onePass},
{`^a((b))c$`, onePass},
{`^a.[l-nA-Cg-j]?e$`, onePass},
{`^a((b))$`, onePass},
{`^a(?:(b)|(c))c$`, onePass},
{`^a(?:(b*)|(c))c$`, notOnePass},
{`^a(?:b|c)$`, onePass},
{`^a(?:b?|c)$`, onePass},
{`^a(?:b?|c?)$`, notOnePass},
{`^a(?:b?|c+)$`, onePass},
{`^a(?:b+|(bc))d$`, notOnePass},
{`^a(?:bc)+$`, onePass},
{`^a(?:[bcd])+$`, onePass},
{`^a((?:[bcd])+)$`, onePass},
{`^a(:?b|c)*d$`, onePass},
{`^.bc(d|e)*$`, onePass},
{`^(?:(?:aa)|.)$`, notOnePass},
{`^(?:(?:a{1,2}){1,2})$`, notOnePass},
{`^l` + strings.Repeat("o", 2<<8) + `ng$`, onePass},
}
func TestCompileOnePass(t *testing.T) {
var (
p *syntax.Prog
re *syntax.Regexp
err error
)
for _, test := range onePassTests {
if re, err = syntax.Parse(test.re, syntax.Perl); err != nil {
t.Errorf("Parse(%q) got err:%s, want success", test.re, err)
continue
}
// needs to be done before compile...
re = re.Simplify()
if p, err = syntax.Compile(re); err != nil {
t.Errorf("Compile(%q) got err:%s, want success", test.re, err)
continue
}
onePass = compileOnePass(p)
if (onePass == notOnePass) != (test.onePass == notOnePass) {
t.Errorf("CompileOnePass(%q) got %v, expected %v", test.re, onePass, test.onePass)
}
}
}
// TODO(cespare): Unify with onePassTests and rationalize one-pass test cases.
var onePassTests1 = []struct {
re string
match string
}{
{`^a(/b+(#c+)*)*$`, "a/b#c"}, // golang.org/issue/11905
}
func TestRunOnePass(t *testing.T) {
for _, test := range onePassTests1 {
re, err := Compile(test.re)
if err != nil {
t.Errorf("Compile(%q): got err: %s", test.re, err)
continue
}
if re.onepass == notOnePass {
t.Errorf("Compile(%q): got notOnePass, want one-pass", test.re)
continue
}
if !re.MatchString(test.match) {
t.Errorf("onepass %q did not match %q", test.re, test.match)
}
}
}
func BenchmarkCompileOnepass(b *testing.B) {
for _, test := range onePassTests {
if test.onePass == notOnePass {
continue
}
name := test.re
if len(name) > 20 {
name = name[:20] + "..."
}
b.Run(name, func(b *testing.B) {
b.ReportAllocs()
for i := 0; i < b.N; i++ {
if _, err := Compile(test.re); err != nil {
b.Fatal(err)
}
}
})
}
}