forked from cue-lang/cue
-
Notifications
You must be signed in to change notification settings - Fork 0
/
op.go
182 lines (145 loc) · 3.45 KB
/
op.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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
// Copyright 2018 The 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 cue
import (
"github.com/wylswz/cue-se/cue/token"
"github.com/wylswz/cue-se/internal/core/adt"
)
// Op indicates the operation at the top of an expression tree of the expression
// use to evaluate a value.
type Op = adt.Op
// Values of Op.
const (
NoOp Op = adt.NoOp
AndOp Op = adt.AndOp
OrOp Op = adt.OrOp
SelectorOp Op = adt.SelectorOp
IndexOp Op = adt.IndexOp
SliceOp Op = adt.SliceOp
CallOp Op = adt.CallOp
BooleanAndOp Op = adt.BoolAndOp
BooleanOrOp Op = adt.BoolOrOp
EqualOp Op = adt.EqualOp
NotOp Op = adt.NotOp
NotEqualOp Op = adt.NotEqualOp
LessThanOp Op = adt.LessThanOp
LessThanEqualOp Op = adt.LessEqualOp
GreaterThanOp Op = adt.GreaterThanOp
GreaterThanEqualOp Op = adt.GreaterEqualOp
RegexMatchOp Op = adt.MatchOp
NotRegexMatchOp Op = adt.NotMatchOp
AddOp Op = adt.AddOp
SubtractOp Op = adt.SubtractOp
MultiplyOp Op = adt.MultiplyOp
FloatQuotientOp Op = adt.FloatQuotientOp
IntQuotientOp Op = adt.IntQuotientOp
IntRemainderOp Op = adt.IntRemainderOp
IntDivideOp Op = adt.IntDivideOp
IntModuloOp Op = adt.IntModuloOp
InterpolationOp Op = adt.InterpolationOp
)
// isCmp reports whether an op is a comparator.
func (op op) isCmp() bool {
return opEql <= op && op <= opGeq
}
func (op op) unifyType() (unchecked, ok bool) {
if op == opUnifyUnchecked {
return true, true
}
return false, op == opUnify
}
type op uint16
const (
opUnknown op = iota
opUnify
opUnifyUnchecked
opDisjunction
opLand
opLor
opNot
opEql
opNeq
opMat
opNMat
opLss
opGtr
opLeq
opGeq
opAdd
opSub
opMul
opQuo
opRem
opIDiv
opIMod
opIQuo
opIRem
)
var opStrings = []string{
opUnknown: "??",
opUnify: "&",
// opUnifyUnchecked is internal only. Syntactically this is
// represented as embedding.
opUnifyUnchecked: "&!",
opDisjunction: "|",
opLand: "&&",
opLor: "||",
opNot: "!",
opEql: "==",
opNeq: "!=",
opMat: "=~",
opNMat: "!~",
opLss: "<",
opGtr: ">",
opLeq: "<=",
opGeq: ">=",
opAdd: "+",
opSub: "-",
opMul: "*",
opQuo: "/",
opIDiv: "div",
opIMod: "mod",
opIQuo: "quo",
opIRem: "rem",
}
func (op op) String() string { return opStrings[op] }
var tokenMap = map[token.Token]op{
token.OR: opDisjunction, // |
token.AND: opUnify, // &
token.ADD: opAdd, // +
token.SUB: opSub, // -
token.MUL: opMul, // *
token.QUO: opQuo, // /
token.IDIV: opIDiv, // div
token.IMOD: opIMod, // mod
token.IQUO: opIQuo, // quo
token.IREM: opIRem, // rem
token.LAND: opLand, // &&
token.LOR: opLor, // ||
token.EQL: opEql, // ==
token.LSS: opLss, // <
token.GTR: opGtr, // >
token.NOT: opNot, // !
token.NEQ: opNeq, // !=
token.LEQ: opLeq, // <=
token.GEQ: opGeq, // >=
token.MAT: opMat, // =~
token.NMAT: opNMat, // !~
}
var opMap = map[op]token.Token{}
func init() {
for t, o := range tokenMap {
opMap[o] = t
}
}