/
delete.go
60 lines (55 loc) · 1.5 KB
/
delete.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
// Copyright 2023 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 ast
import (
"fmt"
vitess "github.com/dolthub/vitess/go/vt/sqlparser"
"github.com/dolthub/doltgresql/postgres/parser/sem/tree"
)
// nodeDelete handles *tree.Delete nodes.
func nodeDelete(node *tree.Delete) (*vitess.Delete, error) {
if node == nil {
return nil, nil
}
if _, ok := node.Returning.(*tree.NoReturningClause); !ok {
return nil, fmt.Errorf("RETURNING is not yet supported")
}
with, err := nodeWith(node.With)
if err != nil {
return nil, err
}
table, err := nodeTableExpr(node.Table)
if err != nil {
return nil, err
}
where, err := nodeWhere(node.Where)
if err != nil {
return nil, err
}
orderBy, err := nodeOrderBy(node.OrderBy)
if err != nil {
return nil, err
}
limit, err := nodeLimit(node.Limit)
if err != nil {
return nil, err
}
return &vitess.Delete{
TableExprs: vitess.TableExprs{table},
With: with,
Where: where,
OrderBy: orderBy,
Limit: limit,
}, nil
}