com.prezi.pride.projectmodel.DefaultPrideProjectModel Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of gradle-pride-projectmodel-plugin Show documentation

Pride manages multiple Gradle modules as a single Gradle project

There is a newer version: 0.12.3

Show newest version

package com.prezi.pride.projectmodel;

import java.io.Serializable;
import java.util.Set;

public class DefaultPrideProjectModel implements Serializable, PrideProjectModel {
	private final String path;
	private final String group;
	private final String name;
	private final String version;
	private final Set children;
	private final String projectDir;

	public DefaultPrideProjectModel(String path, String group, String name, String version, Set children, String projectDir) {
		this.path = path;
		this.group = group;
		this.name = name;
		this.version = version;
		this.children = children;
		this.projectDir = projectDir;
	}

	@Override
	public String toString() {
		return "PrideProject{path='" + path + "\'}";
	}

	@Override
	public String getPath() {
		return path;
	}

	@Override
	public String getGroup() {
		return group;
	}

	@Override
	public String getName() {
		return name;
	}

	@Override
	public String getVersion() {
		return version;
	}

	@Override
	public Set getChildren() {
		return children;
	}

	@Override
	public String getProjectDir() {
		return projectDir;
	}

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

		DefaultPrideProjectModel that = (DefaultPrideProjectModel) o;

		if (!children.equals(that.children)) return false;
		if (group != null ? !group.equals(that.group) : that.group != null) return false;
		if (!name.equals(that.name)) return false;
		if (!path.equals(that.path)) return false;

		return true;
	}

	@Override
	public int hashCode() {
		int result = path.hashCode();
		result = 31 * result + (group != null ? group.hashCode() : 0);
		result = 31 * result + name.hashCode();
		result = 31 * result + children.hashCode();
		return result;
	}
}