coregex/fix5b_validation_test.go at main · coregx/coregex · GitHub

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
package coregex

import (
	"fmt"
	"regexp"
	"testing"
)

// === (1) CompilePOSIX: ^ is multiline, [^a] doesn't match \n ===

func TestCompilePOSIX_Semantics(t *testing.T) {
	tests := []struct {
		name    string
		pattern string
		input   string
	}{
		{"^ is multiline", `^b`, "a\nb"},
		{"$ is multiline", `a$`, "a\nb"},
		{"[^a] vs newline", `[^a]`, "\n"},
		{"dot vs newline", `.`, "\n"},
		{"POSIX longest a|ab", `a|ab`, "ab"},
	}

	for _, tt := range tests {
		t.Run(tt.name, func(t *testing.T) {
			re, err := CompilePOSIX(tt.pattern)
			if err != nil {
				t.Skipf("CompilePOSIX(%q) failed: %v", tt.pattern, err)
				return
			}
			reStd, _ := regexp.CompilePOSIX(tt.pattern)

			cgx := re.FindString(tt.input)
			std := reStd.FindString(tt.input)

			if cgx != std {
				t.Errorf("CompilePOSIX(%q).FindString(%q): coregex=%q, stdlib=%q",
					tt.pattern, tt.input, cgx, std)
			}
		})
	}
}

// === (2) Empty capture at end of input — FindALL last match ===

func TestEmptyCaptureAtEnd_FindAll(t *testing.T) {
	tests := []struct {
		pattern string
		input   string
	}{
		{`()`, "abc"},
		{`(|a)*`, "aa"},
		{`()`, "日"},
		{`(x?)`, "ab"},
		{`(a*)`, "b"},
		{`(a?)`, "b"},
	}

	for _, tt := range tests {
		t.Run(fmt.Sprintf("%s/%s", tt.pattern, tt.input), func(t *testing.T) {
			re := MustCompile(tt.pattern)
			reStd := regexp.MustCompile(tt.pattern)

			cgxAll := re.FindAllStringSubmatchIndex(tt.input, -1)
			stdAll := reStd.FindAllStringSubmatchIndex(tt.input, -1)

			if len(cgxAll) != len(stdAll) {
				t.Errorf("FindAllStringSubmatchIndex(%q, %q): coregex %d matches, stdlib %d matches",
					tt.pattern, tt.input, len(cgxAll), len(stdAll))
				return
			}

			for i := range stdAll {
				if fmt.Sprintf("%v", cgxAll[i]) != fmt.Sprintf("%v", stdAll[i]) {
					t.Errorf("FindAllStringSubmatchIndex(%q, %q) match[%d]:\n  coregex=%v\n  stdlib =%v",
						tt.pattern, tt.input, i, cgxAll[i], stdAll[i])
				}
			}
		})
	}
}

// === (3) AllStringIndex/AllIndex iterator duplicates zero-width ===

func TestAllStringIndex_NoDuplicates(t *testing.T) {
	tests := []struct {
		pattern string
		input   string
	}{
		{`\b`, "ab cd"},
		{`\B`, "ab cd"},
		{`$`, "a\n"},
		{`(?m)^`, "日\n本"},
	}

	for _, tt := range tests {
		t.Run(fmt.Sprintf("%s/%q", tt.pattern, tt.input), func(t *testing.T) {
			re := MustCompile(tt.pattern)
			reStd := regexp.MustCompile(tt.pattern)

			// Collect via iterator
			var cgxResults [][]int
			for m := range re.AllStringIndex(tt.input) {
				cgxResults = append(cgxResults, []int{m[0], m[1]})
			}

			stdResults := reStd.FindAllStringIndex(tt.input, -1)

			if fmt.Sprintf("%v", cgxResults) != fmt.Sprintf("%v", stdResults) {
				t.Errorf("AllStringIndex(%q, %q):\n  coregex=%v\n  stdlib =%v",
					tt.pattern, tt.input, cgxResults, stdResults)
			}
		})
	}
}

// === (4a) Split("","",n): nil vs []string{} ===

func TestSplitEmptyEmpty(t *testing.T) {
	re := MustCompile("")
	reStd := regexp.MustCompile("")

	for _, n := range []int{-1, 0, 1, 2} {
		t.Run(fmt.Sprintf("n=%d", n), func(t *testing.T) {
			cgx := re.Split("", n)
			std := reStd.Split("", n)

			cgxNil := cgx == nil
			stdNil := std == nil

			if cgxNil != stdNil {
				t.Errorf("Split(\"\", \"\", %d): coregex nil=%v (len=%d), stdlib nil=%v (len=%d)",
					n, cgxNil, len(cgx), stdNil, len(std))
			}
			if len(cgx) != len(std) {
				t.Errorf("Split(\"\", \"\", %d): coregex len=%d, stdlib len=%d",
					n, len(cgx), len(std))
			}
		})
	}
}

// === (4b) All(b) iterator: cap == len ===

func TestAllIterator_ThreeIndexSlice(t *testing.T) {
	re := MustCompile(`\w+`)
	input := []byte("hello world")

	for m := range re.All(input) {
		if cap(m) != len(m) {
			t.Errorf("All() match %q: cap=%d > len=%d — append would corrupt buffer",
				m, cap(m), len(m))
		}
	}
}