/
with.go
165 lines (143 loc) · 4.64 KB
/
with.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
// Copyright 2021 Dolthub, 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,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package plan
import (
"fmt"
"strings"
"github.com/dolthub/go-mysql-server/sql"
)
// With is a node to wrap the top-level node in a query plan so that any common table expressions can be applied in
// analysis. It is removed during analysis.
type With struct {
UnaryNode
CTEs []*CommonTableExpression
Recursive bool
}
var _ sql.Node = (*With)(nil)
var _ sql.CollationCoercible = (*With)(nil)
var _ DisjointedChildrenNode = (*With)(nil)
func NewWith(child sql.Node, ctes []*CommonTableExpression, recursive bool) *With {
return &With{
UnaryNode: UnaryNode{child},
CTEs: ctes,
Recursive: recursive,
}
}
func (w *With) IsReadOnly() bool {
return w.Child.IsReadOnly()
}
func (w *With) String() string {
cteStrings := make([]string, len(w.CTEs))
for i, e := range w.CTEs {
cteStrings[i] = e.String()
}
pr := sql.NewTreePrinter()
if w.Recursive {
_ = pr.WriteNode("with recursive (%s)", strings.Join(cteStrings, ", "))
} else {
_ = pr.WriteNode("with(%s)", strings.Join(cteStrings, ", "))
}
_ = pr.WriteChildren(w.Child.String())
return pr.String()
}
func (w *With) DebugString() string {
cteStrings := make([]string, len(w.CTEs))
for i, e := range w.CTEs {
cteStrings[i] = sql.DebugString(e)
}
pr := sql.NewTreePrinter()
_ = pr.WriteNode("With(%s)", strings.Join(cteStrings, ", "))
_ = pr.WriteChildren(sql.DebugString(w.Child))
return pr.String()
}
func (w *With) RowIter(ctx *sql.Context, row sql.Row) (sql.RowIter, error) {
panic("Cannot call RowIter on With node")
}
func (w *With) WithChildren(children ...sql.Node) (sql.Node, error) {
if len(children) != 1 {
return nil, sql.ErrInvalidChildrenNumber.New(w, len(children), 1)
}
return NewWith(children[0], w.CTEs, w.Recursive), nil
}
// CheckPrivileges implements the interface sql.Node.
func (w *With) CheckPrivileges(ctx *sql.Context, opChecker sql.PrivilegedOperationChecker) bool {
return w.Child.CheckPrivileges(ctx, opChecker)
}
// CollationCoercibility implements the interface sql.CollationCoercible.
func (w *With) CollationCoercibility(ctx *sql.Context) (collation sql.CollationID, coercibility byte) {
return sql.GetCoercibility(ctx, w.Child)
}
// DisjointedChildren implements the interface DisjointedChildrenNode.
func (w *With) DisjointedChildren() [][]sql.Node {
cteAliases := make([]sql.Node, len(w.CTEs))
for i := range cteAliases {
cteAliases[i] = w.CTEs[i].Subquery
}
return [][]sql.Node{
{w.UnaryNode.Child},
cteAliases,
}
}
// WithDisjointedChildren implements the interface DisjointedChildrenNode.
func (w *With) WithDisjointedChildren(children [][]sql.Node) (sql.Node, error) {
if len(children) != 2 || len(children[0]) != 1 || len(children[1]) != len(w.CTEs) {
return nil, sql.ErrInvalidChildrenNumber.New(w, len(children), 2)
}
nw := *w
nw.UnaryNode.Child = children[0][0]
newCTEs := make([]*CommonTableExpression, len(w.CTEs))
copy(newCTEs, w.CTEs)
for i, cteAliasChild := range children[1] {
subqueryAlias, ok := cteAliasChild.(*SubqueryAlias)
if !ok {
return nil, fmt.Errorf("%T: expected `%T`, got `%T`", w, nw.CTEs[i].Subquery, cteAliasChild)
}
newCTEs[i] = &CommonTableExpression{
Subquery: subqueryAlias,
Columns: w.CTEs[i].Columns,
}
}
nw.CTEs = newCTEs
return &nw, nil
}
type CommonTableExpression struct {
Subquery *SubqueryAlias
Columns []string
}
func NewCommonTableExpression(subquery *SubqueryAlias, columns []string) *CommonTableExpression {
return &CommonTableExpression{
Subquery: subquery,
Columns: columns,
}
}
func (e *CommonTableExpression) String() string {
pr := sql.NewTreePrinter()
if len(e.Columns) > 0 {
_ = pr.WriteNode("%s (%s)", e.Subquery.name, strings.Join(e.Columns, ","))
} else {
_ = pr.WriteNode("%s", e.Subquery.name)
}
_ = pr.WriteChildren(sql.DebugString(e.Subquery.Child))
return pr.String()
}
func (e *CommonTableExpression) DebugString() string {
pr := sql.NewTreePrinter()
if len(e.Columns) > 0 {
_ = pr.WriteNode("%s (%s)", e.Subquery.name, strings.Join(e.Columns, ","))
} else {
_ = pr.WriteNode("%s", e.Subquery.name)
}
_ = pr.WriteChildren(e.Subquery.Child.String())
return pr.String()
}