forked from cockroachdb/cockroach
-
Notifications
You must be signed in to change notification settings - Fork 0
/
values.go
69 lines (60 loc) · 1.63 KB
/
values.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
// Copyright 2015 The Cockroach Authors.
//
// 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. See the AUTHORS file
// for names of contributors.
//
// Author: Peter Mattis (peter@cockroachlabs.com)
package sql
import (
"fmt"
"github.com/cockroachdb/cockroach/sql/parser"
)
// Values constructs a valuesNode from a VALUES expression.
func (p *planner) Values(n parser.Values) (planNode, error) {
v := &valuesNode{
rows: make([]parser.DTuple, 0, len(n)),
}
for _, tuple := range n {
data, err := parser.EvalExpr(tuple, nil)
if err != nil {
return nil, err
}
vals, ok := data.(parser.DTuple)
if !ok {
return nil, fmt.Errorf("expected a tuple, but found %T", data)
}
v.rows = append(v.rows, vals)
}
return v, nil
}
type valuesNode struct {
columns []string
rows []parser.DTuple
nextRow int // The index of the next row.
}
func (n *valuesNode) Columns() []string {
return n.columns
}
func (n *valuesNode) Values() parser.DTuple {
return n.rows[n.nextRow-1]
}
func (n *valuesNode) Next() bool {
if n.nextRow >= len(n.rows) {
return false
}
n.nextRow++
return true
}
func (*valuesNode) Err() error {
return nil
}