Rockingcool
/
kleingrep
2
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Wrote tests for backreferences

Browse Source
implementBackreferences
Aadhavan Srinivasan 4 weeks ago
parent f466d4a8d5
commit 2934e7a20f
1 changed files with 105 additions and 85 deletions
Show Stats Download Patch File Download Diff File

190
regex/re_test.go
Unescape Escape View File

@ -314,10 +314,6 @@ var reTests = []struct {
{`\0009`, nil, "\x009", []Group{{0, 2}}}, {`\0009`, nil, "\x009", []Group{{0, 2}}},
{`\0141`, nil, "a", []Group{{0, 1}}}, {`\0141`, nil, "a", []Group{{0, 1}}},
// At this point, the python test suite has a bunch
// of backreference tests. Since my engine doesn't
// implement backreferences, I've skipped those tests.
{`*a`, nil, ``, nil}, {`*a`, nil, ``, nil},
{`(*)b`, nil, ``, nil}, {`(*)b`, nil, ``, nil},
{`a**`, nil, ``, nil}, {`a**`, nil, ``, nil},
@ -585,9 +581,29 @@ var groupTests = []struct {
{`(.*)c(.*)`, nil, `abcde`, []Match{[]Group{{0, 5}, {0, 2}, {3, 5}}}}, {`(.*)c(.*)`, nil, `abcde`, []Match{[]Group{{0, 5}, {0, 2}, {3, 5}}}},
{`\((.*), (.*)\)`, nil, `(a, b)`, []Match{[]Group{{0, 6}, {1, 2}, {4, 5}}}}, {`\((.*), (.*)\)`, nil, `(a, b)`, []Match{[]Group{{0, 6}, {1, 2}, {4, 5}}}},
// At this point, the python test suite has a bunch // Backreference tests
// of backreference tests. Since my engine doesn't {`(abc)\1`, nil, `abcabc`, []Match{[]Group{{0, 6}, {0, 3}}}},
// implement backreferences, I've skipped those tests. {`([a-c]+)\1`, nil, `abcabc`, []Match{[]Group{{0, 6}, {0, 3}}}},
{`([a-c]*)\1`, nil, `abcabc`, []Match{[]Group{{0, 6}, {0, 3}}, []Group{{6, 6}, {6, 6}}}},
{`^(.+)?B`, nil, `AB`, []Match{[]Group{{0, 2}, {0, 1}}}},
{`(a+).\1$`, nil, `aaaaa`, []Match{[]Group{{0, 5}, {0, 2}}}},
{`^(a+).\1$`, nil, `aaaa`, []Match{}},
{`(a)\1`, nil, `aa`, []Match{[]Group{{0, 2}, {0, 1}}}},
{`(a+)\1`, nil, `aa`, []Match{[]Group{{0, 2}, {0, 1}}}},
{`(a+)+\1`, nil, `aa`, []Match{[]Group{{0, 2}, {0, 1}}}},
{`(a).+\1`, nil, `aba`, []Match{[]Group{{0, 3}, {0, 1}}}},
{`(a)ba*\1`, nil, `aba`, []Match{[]Group{{0, 3}, {0, 1}}}},
{`(aa|a)a\1$`, nil, `aaa`, []Match{[]Group{{0, 3}, {0, 1}}}},
{`(a|aa)a\1$`, nil, `aaa`, []Match{[]Group{{0, 3}, {0, 1}}}},
{`(a+)a\1$`, nil, `aaa`, []Match{[]Group{{0, 3}, {0, 1}}}},
{`([abc]*)\1`, nil, `abcabc`, []Match{[]Group{{0, 6}, {0, 3}}, []Group{{6, 6}, {6, 6}}}},
{`(a)(?:b)\1`, nil, `aba`, []Match{[]Group{{0, 3}, {0, 1}}}},
{`(a)(?:b)\1`, nil, `abb`, []Match{}},
{`(?:a)(b)\1`, nil, `aba`, []Match{}},
{`(?:a)(b)\1`, nil, `abb`, []Match{[]Group{{0, 3}, {1, 2}}}},
{`(?:(cat)|(dog))\2`, nil, `catdog`, []Match{}},
{`(?:a)\1`, nil, `aa`, nil},
{`((cat)|(dog)|(cow)|(bat))\4`, nil, `cowcow`, []Match{[]Group{{0, 6}, {0, 3}, {-1, -1}, {-1, -1}, {0, 3}, {-1, -1}}}},
{`(a)(b)c|ab`, nil, `ab`, []Match{[]Group{{0, 2}}}}, {`(a)(b)c|ab`, nil, `ab`, []Match{[]Group{{0, 2}}}},
{`(a)+x`, nil, `aaax`, []Match{[]Group{{0, 4}, {2, 3}}}}, {`(a)+x`, nil, `aaax`, []Match{[]Group{{0, 4}, {2, 3}}}},
@ -792,23 +808,24 @@ func TestFindSubmatch(t *testing.T) {
if test.result != nil { if test.result != nil {
panic(err) panic(err)
} }
} } else {
match, err := regComp.FindSubmatch(test.str) match, err := regComp.FindSubmatch(test.str)
if err != nil { if err != nil {
if len(test.result) != 0 { if len(test.result) != 0 {
t.Errorf("Wanted %v got no match\n", test.result[0]) t.Errorf("Wanted %v got no match\n", test.result[0])
}
} else if len(test.result) == 0 {
t.Errorf("Wanted no match got %v\n", match)
}
for i := range match {
if match[i].IsValid() {
if test.result[0][i] != match[i] {
t.Errorf("Wanted %v Got %v\n", test.result[0], match)
} }
} else { } else if len(test.result) == 0 {
if i < len(test.result) && test.result[0][i].IsValid() { t.Errorf("Wanted no match got %v\n", match)
t.Errorf("Wanted %v Got %v\n", test.result[0], match) }
for i := range match {
if match[i].IsValid() {
if test.result[0][i] != match[i] {
t.Errorf("Wanted %v Got %v\n", test.result[0], match)
}
} else {
if i < len(test.result) && test.result[0][i].IsValid() {
t.Errorf("Wanted %v Got %v\n", test.result[0], match)
}
} }
} }
} }
@ -823,10 +840,22 @@ func TestFindStringSubmatch(t *testing.T) {
if test.result != nil { if test.result != nil {
panic(err) panic(err)
} }
} } else {
matchStr := regComp.FindStringSubmatch(test.str) matchStr := regComp.FindStringSubmatch(test.str)
if matchStr == nil { if matchStr == nil {
if len(test.result) != 0 { if len(test.result) != 0 {
expectedStr := funcMap(test.result[0], func(g Group) string {
if g.IsValid() {
return test.str[g.StartIdx:g.EndIdx]
} else {
return ""
}
})
t.Errorf("Wanted %v got no match\n", expectedStr)
}
} else if len(test.result) == 0 {
t.Errorf("Wanted no match got %v\n", matchStr)
} else {
expectedStr := funcMap(test.result[0], func(g Group) string { expectedStr := funcMap(test.result[0], func(g Group) string {
if g.IsValid() { if g.IsValid() {
return test.str[g.StartIdx:g.EndIdx] return test.str[g.StartIdx:g.EndIdx]
@ -834,26 +863,15 @@ func TestFindStringSubmatch(t *testing.T) {
return "" return ""
} }
}) })
t.Errorf("Wanted %v got no match\n", expectedStr) for i, groupStr := range matchStr {
} if groupStr == "" {
} else if len(test.result) == 0 { if i < len(expectedStr) && expectedStr[i] != "" {
t.Errorf("Wanted no match got %v\n", matchStr) t.Errorf("Wanted %v Got %v\n", expectedStr, matchStr)
} else { }
expectedStr := funcMap(test.result[0], func(g Group) string { } else {
if g.IsValid() { if expectedStr[i] != groupStr {
return test.str[g.StartIdx:g.EndIdx] t.Errorf("Wanted %v Got %v\n", expectedStr, matchStr)
} else { }
return ""
}
})
for i, groupStr := range matchStr {
if groupStr == "" {
if i < len(expectedStr) && expectedStr[i] != "" {
t.Errorf("Wanted %v Got %v\n", expectedStr, matchStr)
}
} else {
if expectedStr[i] != groupStr {
t.Errorf("Wanted %v Got %v\n", expectedStr, matchStr)
} }
} }
} }
@ -870,10 +888,24 @@ func TestFindAllStringSubmatch(t *testing.T) {
if test.result != nil { if test.result != nil {
panic(err) panic(err)
} }
} } else {
matchStrs := regComp.FindAllStringSubmatch(test.str) matchStrs := regComp.FindAllStringSubmatch(test.str)
if matchStrs == nil { if matchStrs == nil {
if len(test.result) != 0 { if len(test.result) != 0 {
expectedStrs := funcMap(test.result, func(m Match) []string {
return funcMap(m, func(g Group) string {
if g.IsValid() {
return test.str[g.StartIdx:g.EndIdx]
} else {
return ""
}
})
})
t.Errorf("Wanted %v got no match\n", expectedStrs)
}
} else if len(test.result) == 0 {
t.Errorf("Wanted no match got %v\n", matchStrs)
} else {
expectedStrs := funcMap(test.result, func(m Match) []string { expectedStrs := funcMap(test.result, func(m Match) []string {
return funcMap(m, func(g Group) string { return funcMap(m, func(g Group) string {
if g.IsValid() { if g.IsValid() {
@ -883,29 +915,16 @@ func TestFindAllStringSubmatch(t *testing.T) {
} }
}) })
}) })
t.Errorf("Wanted %v got no match\n", expectedStrs) for i, matchStr := range matchStrs {
} for j, groupStr := range matchStr {
} else if len(test.result) == 0 { if groupStr == "" {
t.Errorf("Wanted no match got %v\n", matchStrs) if j < len(expectedStrs[i]) && expectedStrs[i][j] != "" {
} else { t.Errorf("Wanted %v Got %v\n", expectedStrs, matchStrs)
expectedStrs := funcMap(test.result, func(m Match) []string { }
return funcMap(m, func(g Group) string { } else {
if g.IsValid() { if expectedStrs[i][j] != groupStr {
return test.str[g.StartIdx:g.EndIdx] t.Errorf("Wanted %v Got %v\n", expectedStrs, matchStrs)
} else { }
return ""
}
})
})
for i, matchStr := range matchStrs {
for j, groupStr := range matchStr {
if groupStr == "" {
if j < len(expectedStrs[i]) && expectedStrs[i][j] != "" {
t.Errorf("Wanted %v Got %v\n", expectedStrs, matchStrs)
}
} else {
if expectedStrs[i][j] != groupStr {
t.Errorf("Wanted %v Got %v\n", expectedStrs, matchStrs)
} }
} }
} }
@ -923,17 +942,18 @@ func TestFindAllSubmatch(t *testing.T) {
if test.result != nil { if test.result != nil {
panic(err) panic(err)
} }
} } else {
matchIndices := regComp.FindAllSubmatch(test.str) matchIndices := regComp.FindAllSubmatch(test.str)
for i := range matchIndices { for i := range matchIndices {
for j := range matchIndices[i] { for j := range matchIndices[i] {
if matchIndices[i][j].IsValid() { if matchIndices[i][j].IsValid() {
if test.result[i][j] != matchIndices[i][j] { if test.result[i][j] != matchIndices[i][j] {
t.Errorf("Wanted %v Got %v\n", test.result, matchIndices) t.Errorf("Wanted %v Got %v\n", test.result, matchIndices)
} }
} else { } else {
if i < len(test.result) && j < len(test.result[i]) && test.result[i][j].IsValid() { if i < len(test.result) && j < len(test.result[i]) && test.result[i][j].IsValid() {
t.Errorf("Wanted %v Got %v\n", test.result, matchIndices) t.Errorf("Wanted %v Got %v\n", test.result, matchIndices)
}
} }
} }
} }

Write Preview
Loading…
Cancel
Save