/* * Copyright 2010 the original author or 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 org.codehaus.groovy.eclipse.quickfix.proposals; import java.util.Arrays; /** * Base implementation of a problem descriptor. * * @author Nieraj Singh * */ public class ProblemDescriptor { private String[] messages; private ProblemType type; public ProblemDescriptor(ProblemType type, String[] messages) { this.type = type; this.messages = messages; } public ProblemType getType() { return type; } public String[] getMarkerMessages() { return messages; } public int hashCode() { final int prime = 31; int result = 1; result = prime * result + Arrays.hashCode(messages); result = prime * result + ((type == null) ? 0 : type.hashCode()); return result; } public boolean equals(Object obj) { if (this == obj) { return true; } if (obj == null) { return false; } if (getClass() != obj.getClass()) { return false; } ProblemDescriptor other = (ProblemDescriptor) obj; if (!Arrays.equals(messages, other.messages)) { return false; } if (type == null) { if (other.type != null) { return false; } } else if (!type.equals(other.type)) { return false; } return true; } }