forked from src-d/gitbase
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathproject.go
82 lines (68 loc) · 1.58 KB
/
project.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
package plan
import (
"github.com/gitql/gitql/sql"
)
type Project struct {
UnaryNode
Expressions []sql.Expression
}
func NewProject(expressions []sql.Expression, child sql.Node) *Project {
return &Project{
UnaryNode: UnaryNode{child},
Expressions: expressions,
}
}
func (p *Project) Schema() sql.Schema {
var s sql.Schema
for _, e := range p.Expressions {
f := sql.Field{
Name: e.Name(),
Type: e.Type(),
}
s = append(s, f)
}
return s
}
func (p *Project) Resolved() bool {
return p.UnaryNode.Child.Resolved() &&
expressionsResolved(p.Expressions...)
}
func (p *Project) RowIter() (sql.RowIter, error) {
i, err := p.Child.RowIter()
if err != nil {
return nil, err
}
return &iter{p, i}, nil
}
func (p *Project) TransformUp(f func(sql.Node) sql.Node) sql.Node {
c := p.UnaryNode.Child.TransformUp(f)
n := NewProject(p.Expressions, c)
return f(n)
}
func (p *Project) TransformExpressionsUp(f func(sql.Expression) sql.Expression) sql.Node {
c := p.UnaryNode.Child.TransformExpressionsUp(f)
es := transformExpressionsUp(f, p.Expressions)
n := NewProject(es, c)
return n
}
type iter struct {
p *Project
childIter sql.RowIter
}
func (i *iter) Next() (sql.Row, error) {
childRow, err := i.childIter.Next()
if err != nil {
return nil, err
}
return filterRow(i.p.Expressions, childRow), nil
}
func (i *iter) Close() error {
return i.childIter.Close()
}
func filterRow(expressions []sql.Expression, row sql.Row) sql.Row {
fields := []interface{}{}
for _, expr := range expressions {
fields = append(fields, expr.Eval(row))
}
return sql.NewRow(fields...)
}