All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.hazelcast.org.apache.calcite.linq4j.tree.NewExpression Maven / Gradle / Ivy

There is a newer version: 5.4.0
Show newest version
/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to you under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in com.hazelcast.com.liance with
 * the License.  You may obtain a copy of the License at
 *
 * http://www.apache.com.hazelcast.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 com.hazelcast.org.apache.calcite.linq4j.tree;

import java.lang.reflect.Type;
import java.util.List;
import java.util.Objects;

/**
 * Represents a constructor call.
 *
 * 

If {@link #memberDeclarations} is not null (even if empty) represents * an anonymous class.

*/ public class NewExpression extends Expression { public final Type type; public final List arguments; public final List memberDeclarations; /** * Cache the hash code for the expression */ private int hash; public NewExpression(Type type, List arguments, List memberDeclarations) { super(ExpressionType.New, type); this.type = type; this.arguments = arguments; this.memberDeclarations = memberDeclarations; } @Override public Expression accept(Shuttle shuttle) { shuttle = shuttle.preVisit(this); final List arguments = Expressions.acceptExpressions( this.arguments, shuttle); final List memberDeclarations = Expressions.acceptMemberDeclarations(this.memberDeclarations, shuttle); return shuttle.visit(this, arguments, memberDeclarations); } public R accept(Visitor visitor) { return visitor.visit(this); } @Override void accept(ExpressionWriter writer, int lprec, int rprec) { writer.append("new ").append(type).list("(\n", ",\n", ")", arguments); if (memberDeclarations != null) { writer.list("{\n", "", "}", memberDeclarations); } } @Override public boolean equals(Object o) { if (this == o) { return true; } if (o == null || getClass() != o.getClass()) { return false; } if (!super.equals(o)) { return false; } NewExpression that = (NewExpression) o; if (arguments != null ? !arguments.equals(that.arguments) : that.arguments != null) { return false; } if (memberDeclarations != null ? !memberDeclarations.equals(that.memberDeclarations) : that.memberDeclarations != null) { return false; } if (!type.equals(that.type)) { return false; } return true; } @Override public int hashCode() { int result = hash; if (result == 0) { result = Objects.hash(nodeType, super.type, type, arguments, memberDeclarations); if (result == 0) { result = 1; } hash = result; } return result; } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy