/
BitwiseNotOperator.ts
83 lines (70 loc) · 2.39 KB
/
BitwiseNotOperator.ts
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
// Copyright 2015-2019 SWIM.AI 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.
import {Murmur3, Objects} from "@swim/util";
import {Output} from "@swim/codec";
import {Item} from "../Item";
import {UnaryOperator} from "./UnaryOperator";
import {AnyInterpreter, Interpreter} from "../Interpreter";
export class BitwiseNotOperator extends UnaryOperator {
constructor(operand: Item) {
super(operand);
}
operator(): string {
return "~";
}
precedence(): number {
return 10;
}
evaluate(interpreter: AnyInterpreter): Item {
interpreter = Interpreter.fromAny(interpreter);
const argument = this._operand.evaluate(interpreter);
return argument.bitwiseNot();
}
substitute(interpreter: AnyInterpreter): Item {
interpreter = Interpreter.fromAny(interpreter);
const argument = this._operand.substitute(interpreter);
return argument.bitwiseNot();
}
typeOrder(): number {
return 38;
}
compareTo(that: Item): 0 | 1 | -1 {
if (that instanceof BitwiseNotOperator) {
return this._operand.compareTo(that._operand);
}
return Objects.compare(this.typeOrder(), that.typeOrder());
}
equals(that: unknown): boolean {
if (this === that) {
return true;
} else if (that instanceof BitwiseNotOperator) {
return this._operand.equals(that._operand);
}
return false;
}
hashCode(): number {
if (BitwiseNotOperator._hashSeed === void 0) {
BitwiseNotOperator._hashSeed = Murmur3.seed(BitwiseNotOperator);
}
return Murmur3.mash(Murmur3.mix(BitwiseNotOperator._hashSeed, this._operand.hashCode()));
}
debug(output: Output): void {
output.debug(this._operand).write(46/*'.'*/).write("bitwiseNot").write(40/*'('*/).write(41/*')'*/);
}
clone(): BitwiseNotOperator {
return new BitwiseNotOperator(this._operand.clone());
}
private static _hashSeed?: number;
}
Item.BitwiseNotOperator = BitwiseNotOperator;