/
distinct.go
147 lines (122 loc) · 4.25 KB
/
distinct.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
// 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 (
"github.com/dolthub/go-mysql-server/sql"
)
// Distinct is a node that ensures all rows that come from it are unique.
type Distinct struct {
UnaryNode
}
var _ sql.Node = (*Distinct)(nil)
var _ sql.CollationCoercible = (*Distinct)(nil)
// NewDistinct creates a new Distinct node.
func NewDistinct(child sql.Node) *Distinct {
return &Distinct{
UnaryNode: UnaryNode{Child: child},
}
}
// Resolved implements the Resolvable interface.
func (d *Distinct) Resolved() bool {
return d.UnaryNode.Child.Resolved()
}
// WithChildren implements the Node interface.
func (d *Distinct) WithChildren(children ...sql.Node) (sql.Node, error) {
if len(children) != 1 {
return nil, sql.ErrInvalidChildrenNumber.New(d, len(children), 1)
}
return NewDistinct(children[0]), nil
}
// CheckPrivileges implements the interface sql.Node.
func (d *Distinct) CheckPrivileges(ctx *sql.Context, opChecker sql.PrivilegedOperationChecker) bool {
return d.Child.CheckPrivileges(ctx, opChecker)
}
func (d *Distinct) IsReadOnly() bool {
return d.Child.IsReadOnly()
}
// CollationCoercibility implements the interface sql.CollationCoercible.
func (d *Distinct) CollationCoercibility(ctx *sql.Context) (collation sql.CollationID, coercibility byte) {
return sql.GetCoercibility(ctx, d.Child)
}
// Describe implements sql.Describable
func (d Distinct) Describe(options sql.DescribeOptions) string {
p := sql.NewTreePrinter()
_ = p.WriteNode("Distinct")
_ = p.WriteChildren(sql.Describe(d.Child, options))
return p.String()
}
// String implements fmt.Stringer
func (d Distinct) String() string {
p := sql.NewTreePrinter()
_ = p.WriteNode("Distinct")
_ = p.WriteChildren(d.Child.String())
return p.String()
}
// DebugString implements sql.DebugStringer
func (d Distinct) DebugString() string {
p := sql.NewTreePrinter()
_ = p.WriteNode("Distinct")
_ = p.WriteChildren(sql.DebugString(d.Child))
return p.String()
}
// OrderedDistinct is a Distinct node optimized for sorted row sets.
// It's 2 orders of magnitude faster and uses 2 orders of magnitude less memory.
type OrderedDistinct struct {
UnaryNode
}
var _ sql.Node = (*OrderedDistinct)(nil)
var _ sql.CollationCoercible = (*OrderedDistinct)(nil)
// NewOrderedDistinct creates a new OrderedDistinct node.
func NewOrderedDistinct(child sql.Node) *OrderedDistinct {
if d, ok := child.(*OrderedDistinct); ok {
child = d.Child
}
return &OrderedDistinct{
UnaryNode: UnaryNode{Child: child},
}
}
// Resolved implements the Resolvable interface.
func (d *OrderedDistinct) Resolved() bool {
return d.UnaryNode.Child.Resolved()
}
// WithChildren implements the Node interface.
func (d *OrderedDistinct) WithChildren(children ...sql.Node) (sql.Node, error) {
if len(children) != 1 {
return nil, sql.ErrInvalidChildrenNumber.New(d, len(children), 1)
}
return NewOrderedDistinct(children[0]), nil
}
// CheckPrivileges implements the interface sql.Node.
func (d *OrderedDistinct) CheckPrivileges(ctx *sql.Context, opChecker sql.PrivilegedOperationChecker) bool {
return d.Child.CheckPrivileges(ctx, opChecker)
}
func (d *OrderedDistinct) IsReadOnly() bool {
return d.Child.IsReadOnly()
}
// CollationCoercibility implements the interface sql.CollationCoercible.
func (d *OrderedDistinct) CollationCoercibility(ctx *sql.Context) (collation sql.CollationID, coercibility byte) {
return sql.GetCoercibility(ctx, d.Child)
}
func (d OrderedDistinct) String() string {
p := sql.NewTreePrinter()
_ = p.WriteNode("OrderedDistinct")
_ = p.WriteChildren(d.Child.String())
return p.String()
}
func (d OrderedDistinct) DebugString() string {
p := sql.NewTreePrinter()
_ = p.WriteNode("OrderedDistinct")
_ = p.WriteChildren(sql.DebugString(d.Child))
return p.String()
}