/*
 * This file is part of Applied Energistics 2.
 * Copyright (c) 2013 - 2014, AlgorithmX2, All rights reserved.
 *
 * Applied Energistics 2 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.
 *
 * Applied Energistics 2 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 Applied Energistics 2.  If not, see <http://www.gnu.org/licenses/lgpl>.
 */

package appeng.me;


import java.util.Collection;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;


public class NetworkList implements Collection<Grid>
{

	private List<Grid> networks = new LinkedList<Grid>();

	@Override
	public int size()
	{
		return this.networks.size();
	}

	@Override
	public boolean isEmpty()
	{
		return this.networks.isEmpty();
	}

	@Override
	public boolean contains( final Object o )
	{
		return this.networks.contains( o );
	}

	@Override
	public Iterator<Grid> iterator()
	{
		return this.networks.iterator();
	}

	@Override
	public Object[] toArray()
	{
		return this.networks.toArray();
	}

	@Override
	public <T> T[] toArray( final T[] a )
	{
		return this.networks.toArray( a );
	}

	@Override
	public boolean add( final Grid e )
	{
		this.copy();
		return this.networks.add( e );
	}

	@Override
	public boolean remove( final Object o )
	{
		this.copy();
		return this.networks.remove( o );
	}

	@Override
	public boolean containsAll( final Collection<?> c )
	{
		return this.networks.containsAll( c );
	}

	@Override
	public boolean addAll( final Collection<? extends Grid> c )
	{
		this.copy();
		return this.networks.addAll( c );
	}

	@Override
	public boolean removeAll( final Collection<?> c )
	{
		this.copy();
		return this.networks.removeAll( c );
	}

	@Override
	public boolean retainAll( final Collection<?> c )
	{
		this.copy();
		return this.networks.retainAll( c );
	}

	@Override
	public void clear()
	{
		this.networks = new LinkedList<Grid>();
	}

	private void copy()
	{
		final List<Grid> old = this.networks;
		this.networks = new LinkedList<Grid>();
		this.networks.addAll( old );
	}
}