src/main/java/org/zwobble/couscous/ast/InstanceOfNode.java


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

package org.zwobble.couscous.ast;

import org.zwobble.couscous.ast.visitors.NodeTransformer;
import org.zwobble.couscous.types.ScalarType;
import org.zwobble.couscous.types.Type;
import org.zwobble.couscous.types.Types;
import org.zwobble.couscous.util.ExtraIterables;

public class InstanceOfNode implements ExpressionNode {
    private final ExpressionNode left;
    private final ScalarType right;

    public InstanceOfNode(ExpressionNode left, ScalarType right) {
        this.left = left;
        this.right = right;
    }

    public ExpressionNode getLeft() {
        return left;
    }

    public ScalarType getRight() {
        return right;
    }

    @Override
    public Type getType() {
        return Types.BOOLEAN;
    }

    @Override
    public int type() {
        return NodeTypes.INSTANCE_OF;
    }

    @Override
    public Iterable<? extends Node> childNodes() {
        return ExtraIterables.of(left);
    }

    @Override
    public ExpressionNode transformSubtree(NodeTransformer transformer) {
        return new InstanceOfNode(
            transformer.transformExpression(left),
            transformer.transform(right));
    }

    @Override
    public String toString() {
        return "InstanceOfNode(" +
            "left=" + left +
            ", right=" + right +
            ')';
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;

        InstanceOfNode that = (InstanceOfNode) o;

        if (!left.equals(that.left)) return false;
        return right.equals(that.right);

    }

    @Override
    public int hashCode() {
        int result = left.hashCode();
        result = 31 * result + right.hashCode();
        return result;
    }
}