forked from pingcap/tidb
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathexpr_iterator_test.go
171 lines (142 loc) · 6.86 KB
/
expr_iterator_test.go
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
// Copyright 2018 PingCAP, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// See the License for the specific language governing permissions and
// limitations under the License.
package memo
import (
. "github.com/pingcap/check"
plannercore "github.com/pingcap/tidb/planner/core"
)
func (s *testMemoSuite) TestNewExprIterFromGroupElem(c *C) {
g0 := NewGroup(NewGroupExpr(plannercore.LogicalSelection{}.Init(s.sctx)))
g0.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g0.Insert(NewGroupExpr(plannercore.LogicalProjection{}.Init(s.sctx)))
g0.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g1 := NewGroup(NewGroupExpr(plannercore.LogicalSelection{}.Init(s.sctx)))
g1.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g1.Insert(NewGroupExpr(plannercore.LogicalProjection{}.Init(s.sctx)))
g1.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
expr := NewGroupExpr(plannercore.LogicalJoin{}.Init(s.sctx))
expr.Children = append(expr.Children, g0)
expr.Children = append(expr.Children, g1)
g2 := NewGroup(expr)
pattern := BuildPattern(OperandJoin, BuildPattern(OperandProjection), BuildPattern(OperandSelection))
iter := NewExprIterFromGroupElem(g2.Equivalents.Front(), pattern)
c.Assert(iter, NotNil)
c.Assert(iter.Group, IsNil)
c.Assert(iter.Element, Equals, g2.Equivalents.Front())
c.Assert(iter.matched, Equals, true)
c.Assert(iter.Operand, Equals, OperandJoin)
c.Assert(len(iter.Children), Equals, 2)
c.Assert(iter.Children[0].Group, Equals, g0)
c.Assert(iter.Children[0].Element, Equals, g0.GetFirstElem(OperandProjection))
c.Assert(iter.Children[0].matched, Equals, true)
c.Assert(iter.Children[0].Operand, Equals, OperandProjection)
c.Assert(len(iter.Children[0].Children), Equals, 0)
c.Assert(iter.Children[1].Group, Equals, g1)
c.Assert(iter.Children[1].Element, Equals, g1.GetFirstElem(OperandSelection))
c.Assert(iter.Children[1].matched, Equals, true)
c.Assert(iter.Children[1].Operand, Equals, OperandSelection)
c.Assert(len(iter.Children[0].Children), Equals, 0)
}
func (s *testMemoSuite) TestExprIterNext(c *C) {
g0 := NewGroup(NewGroupExpr(plannercore.LogicalProjection{}.Init(s.sctx)))
g0.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g0.Insert(NewGroupExpr(plannercore.LogicalProjection{}.Init(s.sctx)))
g0.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g0.Insert(NewGroupExpr(plannercore.LogicalProjection{}.Init(s.sctx)))
g1 := NewGroup(NewGroupExpr(plannercore.LogicalSelection{}.Init(s.sctx)))
g1.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g1.Insert(NewGroupExpr(plannercore.LogicalSelection{}.Init(s.sctx)))
g1.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g1.Insert(NewGroupExpr(plannercore.LogicalSelection{}.Init(s.sctx)))
expr := NewGroupExpr(plannercore.LogicalJoin{}.Init(s.sctx))
expr.Children = append(expr.Children, g0)
expr.Children = append(expr.Children, g1)
g2 := NewGroup(expr)
pattern := BuildPattern(OperandJoin, BuildPattern(OperandProjection), BuildPattern(OperandSelection))
iter := NewExprIterFromGroupElem(g2.Equivalents.Front(), pattern)
c.Assert(iter, NotNil)
count := 0
for ; iter.Matched(); iter.Next() {
count++
c.Assert(iter.Group, IsNil)
c.Assert(iter.matched, Equals, true)
c.Assert(iter.Operand, Equals, OperandJoin)
c.Assert(len(iter.Children), Equals, 2)
c.Assert(iter.Children[0].Group, Equals, g0)
c.Assert(iter.Children[0].matched, Equals, true)
c.Assert(iter.Children[0].Operand, Equals, OperandProjection)
c.Assert(len(iter.Children[0].Children), Equals, 0)
c.Assert(iter.Children[1].Group, Equals, g1)
c.Assert(iter.Children[1].matched, Equals, true)
c.Assert(iter.Children[1].Operand, Equals, OperandSelection)
c.Assert(len(iter.Children[1].Children), Equals, 0)
}
c.Assert(count, Equals, 9)
}
func (s *testMemoSuite) TestExprIterReset(c *C) {
g0 := NewGroup(NewGroupExpr(plannercore.LogicalProjection{}.Init(s.sctx)))
g0.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g0.Insert(NewGroupExpr(plannercore.LogicalProjection{}.Init(s.sctx)))
g0.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g0.Insert(NewGroupExpr(plannercore.LogicalProjection{}.Init(s.sctx)))
sel1 := NewGroupExpr(plannercore.LogicalSelection{}.Init(s.sctx))
sel2 := NewGroupExpr(plannercore.LogicalSelection{}.Init(s.sctx))
sel3 := NewGroupExpr(plannercore.LogicalSelection{}.Init(s.sctx))
g1 := NewGroup(sel1)
g1.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g1.Insert(sel2)
g1.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g1.Insert(sel3)
g2 := NewGroup(NewGroupExpr(plannercore.LogicalSelection{}.Init(s.sctx)))
g2.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g2.Insert(NewGroupExpr(plannercore.LogicalSelection{}.Init(s.sctx)))
g2.Insert(NewGroupExpr(plannercore.LogicalLimit{}.Init(s.sctx)))
g2.Insert(NewGroupExpr(plannercore.LogicalSelection{}.Init(s.sctx)))
// link join with Group 0 and 1
expr := NewGroupExpr(plannercore.LogicalJoin{}.Init(s.sctx))
expr.Children = append(expr.Children, g0)
expr.Children = append(expr.Children, g1)
g3 := NewGroup(expr)
// link sel 1~3 with Group 2
sel1.Children = append(sel1.Children, g2)
sel2.Children = append(sel2.Children, g2)
sel3.Children = append(sel3.Children, g2)
// create a pattern: join(proj, sel(limit))
lhsPattern := BuildPattern(OperandProjection)
rhsPattern := BuildPattern(OperandSelection, BuildPattern(OperandLimit))
pattern := BuildPattern(OperandJoin, lhsPattern, rhsPattern)
// create expression iterator for the pattern on join
iter := NewExprIterFromGroupElem(g3.Equivalents.Front(), pattern)
c.Assert(iter, NotNil)
count := 0
for ; iter.Matched(); iter.Next() {
count++
c.Assert(iter.Group, IsNil)
c.Assert(iter.matched, Equals, true)
c.Assert(iter.Operand, Equals, OperandJoin)
c.Assert(len(iter.Children), Equals, 2)
c.Assert(iter.Children[0].Group, Equals, g0)
c.Assert(iter.Children[0].matched, Equals, true)
c.Assert(iter.Children[0].Operand, Equals, OperandProjection)
c.Assert(len(iter.Children[0].Children), Equals, 0)
c.Assert(iter.Children[1].Group, Equals, g1)
c.Assert(iter.Children[1].matched, Equals, true)
c.Assert(iter.Children[1].Operand, Equals, OperandSelection)
c.Assert(len(iter.Children[1].Children), Equals, 1)
c.Assert(iter.Children[1].Children[0].Group, Equals, g2)
c.Assert(iter.Children[1].Children[0].matched, Equals, true)
c.Assert(iter.Children[1].Children[0].Operand, Equals, OperandLimit)
c.Assert(len(iter.Children[1].Children[0].Children), Equals, 0)
}
c.Assert(count, Equals, 18)
}