com.splout.db.common.ReplicationEntry Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of splout-commons Show documentation

Splout is a read only, horizontally scalable SQL database that plays well with Hadoop.

There is a newer version: 0.3.0

package com.splout.db.common;

/*
 * #%L
 * Splout SQL commons
 * %%
 * Copyright (C) 2012 Datasalt Systems S.L.
 * %%
 * 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.
 * #L%
 */

import java.io.Serializable;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * An entry in a {@link ReplicationMap}. It consists of a shard id and a list of nodes (addresses in the form host:port).
 * 
 * @see ReplicationMap
 */
@SuppressWarnings("serial")
public class ReplicationEntry extends BaseBean implements Serializable, Comparable {

	public String toString() {
		return "Shard:" + shard + ",nodes:" + nodes;
	}
	
	Integer shard;
	List nodes;

	public ReplicationEntry() {
		
	}
	
	public ReplicationEntry(int shard, String... nodes) {
		this.shard = shard;
		this.nodes = new ArrayList();
		this.nodes.addAll(Arrays.asList(nodes));
	}
	
	// ----------------- //
	public Integer getShard() {
		return shard;
	}

	public void setShard(Integer shard) {
		this.shard = shard;
	}

	public List getNodes() {
		return nodes;
	}

	public void setNodes(List nodes) {
		this.nodes = nodes;
	}
	
	@Override
	public boolean equals(Object obj) {
		ReplicationEntry reEntry = (ReplicationEntry)obj;
		return shard.equals(reEntry.shard);
	}
	
	public int hashCode() {
		return shard.hashCode();
	}

	@Override
  public int compareTo(ReplicationEntry o) {
		return shard.compareTo(o.shard);
	}
}