/
transformed_named_node.go
executable file
·58 lines (48 loc) · 1.68 KB
/
transformed_named_node.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
// 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/Rock-liyi/p2pdb-store/sql"
)
type TransformedNamedNode struct {
UnaryNode
name string
}
// TransformedNamedNode is a wrapper for arbitrary logic to represent a table
// factor assembled from other nodes at some point in by the analyzer. See
// e.g., Concat.
func NewTransformedNamedNode(child sql.Node, name string) *TransformedNamedNode {
return &TransformedNamedNode{UnaryNode{child}, name}
}
func (n *TransformedNamedNode) Name() string {
return n.name
}
func (n *TransformedNamedNode) Schema() sql.Schema {
return n.Child.Schema()
}
func (n *TransformedNamedNode) RowIter(ctx *sql.Context, row sql.Row) (sql.RowIter, error) {
return n.Child.RowIter(ctx, row)
}
func (n *TransformedNamedNode) WithChildren(children ...sql.Node) (sql.Node, error) {
if len(children) != 1 {
return nil, sql.ErrInvalidChildrenNumber.New(n, len(children), 1)
}
return NewTransformedNamedNode(children[0], n.name), nil
}
func (n *TransformedNamedNode) String() string {
return n.Child.String()
}
func (n *TransformedNamedNode) DebugString() string {
return sql.DebugString(n.Child)
}