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
|
// Copyright 2021 CUE 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.
package fix
import (
"cuelang.org/go/cue/ast"
"cuelang.org/go/cue/ast/astutil"
"cuelang.org/go/cue/token"
)
func simplify(f *ast.File) *ast.File {
// Rewrite disjunctions with _ to _.
f = astutil.Apply(f, nil, func(c astutil.Cursor) bool {
if x, ok := c.Node().(ast.Expr); ok {
if y := elideTop(x); x != y {
c.Replace(y)
}
}
return true
}).(*ast.File)
return f
}
func elideTop(x ast.Expr) ast.Expr {
switch x := x.(type) {
case *ast.BinaryExpr:
switch x.Op {
case token.OR:
if isTop(x.X) {
return x.X
}
if isTop(x.Y) {
ast.SetRelPos(x.Y, token.NoRelPos)
return x.Y
}
case token.AND:
if isTop(x.X) {
ast.SetRelPos(x.Y, token.NoRelPos)
return x.Y
}
if isTop(x.Y) {
return x.X
}
}
case *ast.ParenExpr:
switch x.X.(type) {
case *ast.BinaryExpr, *ast.UnaryExpr:
default:
return x.X
}
}
return x
}
func isTop(x ast.Expr) bool {
v, ok := x.(*ast.Ident)
return ok && v.Name == "_"
}
|
