net.sf.hajdbc.balancer.AbstractBalancer Maven / Gradle / Ivy
/*
* HA-JDBC: High-Availability JDBC
* Copyright (C) 2012 Paul Ferraro
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see .
*/
package net.sf.hajdbc.balancer;
import java.util.Collection;
import java.util.Collections;
import java.util.Iterator;
import java.util.Set;
import java.util.SortedSet;
import java.util.TreeSet;
import net.sf.hajdbc.Database;
/**
* Thread-safe abstract balancer implementation that implements most of the Balancer interface, except {@link Balancer#next()}.
* Uses A copy-on-write algorithm for {@link #add(Object)}, {@link #remove(Object)}, and {@link #clear()}.
* Calls to {@link #iterator()} are non-blocking.
*
* @author Paul Ferraro
* @param
* @param
*/
public abstract class AbstractBalancer> implements Balancer
{
protected abstract Set getDatabases();
/**
* {@inheritDoc}
* @see net.sf.hajdbc.balancer.Balancer#backups()
*/
@Override
public Iterable backups()
{
Iterator databases = this.getDatabases().iterator();
if (!databases.hasNext() || ((databases.next() != null) && !databases.hasNext())){
return Collections.emptySet();
}
SortedSet backups = new TreeSet();
while(databases.hasNext()){
backups.add(databases.next());
}
return backups;
}
/**
* {@inheritDoc}
* @see java.util.Set#iterator()
*/
@Override
public Iterator iterator()
{
return this.getDatabases().iterator();
}
/**
* {@inheritDoc}
* @see java.util.Set#contains(java.lang.Object)
*/
@Override
public boolean contains(Object database)
{
return this.getDatabases().contains(database);
}
/**
* {@inheritDoc}
* @see java.util.Set#containsAll(java.util.Collection)
*/
@Override
public boolean containsAll(Collection> databases)
{
return this.getDatabases().containsAll(databases);
}
/**
* {@inheritDoc}
* @see java.util.Set#isEmpty()
*/
@Override
public boolean isEmpty()
{
return this.getDatabases().isEmpty();
}
/**
* {@inheritDoc}
* @see java.util.Set#size()
*/
@Override
public int size()
{
return this.getDatabases().size();
}
/**
* {@inheritDoc}
* @see java.util.Set#toArray()
*/
@Override
public Object[] toArray()
{
return this.getDatabases().toArray();
}
@Override
public T[] toArray(T[] array)
{
return this.getDatabases().toArray(array);
}
/**
* {@inheritDoc}
* @see java.lang.Object#equals(java.lang.Object)
*/
@Override
public boolean equals(Object object)
{
if ((object == null) || !(object instanceof Collection)) {
return false;
}
@SuppressWarnings("unchecked")
Collection set = (Collection) object;
return this.getDatabases().equals(set);
}
/**
* {@inheritDoc}
* @see java.lang.Object#hashCode()
*/
@Override
public int hashCode()
{
return this.getDatabases().hashCode();
}
@Override
public String toString()
{
return this.getDatabases().toString();
}
}