-
-
Notifications
You must be signed in to change notification settings - Fork 195
/
sort.go
220 lines (187 loc) · 6.09 KB
/
sort.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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
// Copyright 2020-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"
)
// Sort is the sort node.
type Sort struct {
UnaryNode
SortFields sql.SortFields
}
// NewSort creates a new Sort node.
func NewSort(sortFields []sql.SortField, child sql.Node) *Sort {
return &Sort{
UnaryNode: UnaryNode{child},
SortFields: sortFields,
}
}
var _ sql.Expressioner = (*Sort)(nil)
var _ sql.Node = (*Sort)(nil)
var _ sql.CollationCoercible = (*Sort)(nil)
// Resolved implements the Resolvable interface.
func (s *Sort) Resolved() bool {
for _, f := range s.SortFields {
if !f.Column.Resolved() {
return false
}
}
return s.Child.Resolved()
}
func (s *Sort) IsReadOnly() bool {
return s.Child.IsReadOnly()
}
func (s *Sort) String() string {
pr := sql.NewTreePrinter()
var fields = make([]string, len(s.SortFields))
for i, f := range s.SortFields {
fields[i] = fmt.Sprintf("%s %s", f.Column, f.Order)
}
_ = pr.WriteNode("Sort(%s)", strings.Join(fields, ", "))
_ = pr.WriteChildren(s.Child.String())
return pr.String()
}
func (s *Sort) DebugString() string {
pr := sql.NewTreePrinter()
var fields = make([]string, len(s.SortFields))
for i, f := range s.SortFields {
fields[i] = sql.DebugString(f)
}
_ = pr.WriteNode("Sort(%s)", strings.Join(fields, ", "))
_ = pr.WriteChildren(sql.DebugString(s.Child))
return pr.String()
}
// Expressions implements the Expressioner interface.
func (s *Sort) Expressions() []sql.Expression {
// TODO: use shared method
var exprs = make([]sql.Expression, len(s.SortFields))
for i, f := range s.SortFields {
exprs[i] = f.Column
}
return exprs
}
// WithChildren implements the Node interface.
func (s *Sort) WithChildren(children ...sql.Node) (sql.Node, error) {
if len(children) != 1 {
return nil, sql.ErrInvalidChildrenNumber.New(s, len(children), 1)
}
return NewSort(s.SortFields, children[0]), nil
}
// CheckPrivileges implements the interface sql.Node.
func (s *Sort) CheckPrivileges(ctx *sql.Context, opChecker sql.PrivilegedOperationChecker) bool {
return s.Child.CheckPrivileges(ctx, opChecker)
}
// CollationCoercibility implements the interface sql.CollationCoercible.
func (s *Sort) CollationCoercibility(ctx *sql.Context) (collation sql.CollationID, coercibility byte) {
return sql.GetCoercibility(ctx, s.Child)
}
// WithExpressions implements the Expressioner interface.
func (s *Sort) WithExpressions(exprs ...sql.Expression) (sql.Node, error) {
if len(exprs) != len(s.SortFields) {
return nil, sql.ErrInvalidChildrenNumber.New(s, len(exprs), len(s.SortFields))
}
fields := s.SortFields.FromExpressions(exprs...)
return NewSort(fields, s.Child), nil
}
// TopN was a sort node that has a limit. It doesn't need to buffer everything,
// but can calculate the top n on the fly.
type TopN struct {
UnaryNode
Limit sql.Expression
Fields sql.SortFields
CalcFoundRows bool
}
// NewTopN creates a new TopN node.
func NewTopN(fields sql.SortFields, limit sql.Expression, child sql.Node) *TopN {
return &TopN{
UnaryNode: UnaryNode{child},
Limit: limit,
Fields: fields,
}
}
var _ sql.Node = (*TopN)(nil)
var _ sql.Expressioner = (*TopN)(nil)
var _ sql.CollationCoercible = (*TopN)(nil)
// Resolved implements the Resolvable interface.
func (n *TopN) Resolved() bool {
for _, f := range n.Fields {
if !f.Column.Resolved() {
return false
}
}
return n.Child.Resolved()
}
func (n TopN) WithCalcFoundRows(v bool) *TopN {
n.CalcFoundRows = v
return &n
}
func (n *TopN) IsReadOnly() bool {
return n.Child.IsReadOnly()
}
func (n *TopN) String() string {
pr := sql.NewTreePrinter()
var fields = make([]string, len(n.Fields))
for i, f := range n.Fields {
fields[i] = fmt.Sprintf("%s %s", f.Column, f.Order)
}
_ = pr.WriteNode("TopN(Limit: [%s]; %s)", n.Limit.String(), strings.Join(fields, ", "))
_ = pr.WriteChildren(n.Child.String())
return pr.String()
}
func (n *TopN) DebugString() string {
pr := sql.NewTreePrinter()
var fields = make([]string, len(n.Fields))
for i, f := range n.Fields {
fields[i] = sql.DebugString(f)
}
_ = pr.WriteNode("TopN(Limit: [%s]; %s)", sql.DebugString(n.Limit), strings.Join(fields, ", "))
_ = pr.WriteChildren(sql.DebugString(n.Child))
return pr.String()
}
// Expressions implements the Expressioner interface.
func (n *TopN) Expressions() []sql.Expression {
exprs := []sql.Expression{n.Limit}
exprs = append(exprs, n.Fields.ToExpressions()...)
return exprs
}
// WithChildren implements the Node interface.
func (n *TopN) WithChildren(children ...sql.Node) (sql.Node, error) {
if len(children) != 1 {
return nil, sql.ErrInvalidChildrenNumber.New(n, len(children), 1)
}
topn := NewTopN(n.Fields, n.Limit, children[0])
topn.CalcFoundRows = n.CalcFoundRows
return topn, nil
}
// CheckPrivileges implements the interface sql.Node.
func (n *TopN) CheckPrivileges(ctx *sql.Context, opChecker sql.PrivilegedOperationChecker) bool {
return n.Child.CheckPrivileges(ctx, opChecker)
}
// CollationCoercibility implements the interface sql.CollationCoercible.
func (n *TopN) CollationCoercibility(ctx *sql.Context) (collation sql.CollationID, coercibility byte) {
return sql.GetCoercibility(ctx, n.Child)
}
// WithExpressions implements the Expressioner interface.
func (n *TopN) WithExpressions(exprs ...sql.Expression) (sql.Node, error) {
if len(exprs) != len(n.Fields)+1 {
return nil, sql.ErrInvalidChildrenNumber.New(n, len(exprs), len(n.Fields)+1)
}
var limit = exprs[0]
var fields = n.Fields.FromExpressions(exprs[1:]...)
topn := NewTopN(fields, limit, n.Child)
topn.CalcFoundRows = n.CalcFoundRows
return topn, nil
}