package Sequenic.T2ext.Maintenance;

import java.util.HashMap;
import java.util.Set;

import Sequenic.T2.Coverage.BasicPath;
import Sequenic.T2.Seq.Trace;

public class MaxDuplicatesReducer extends Reducer {
	
	private final HashMap<Set<BasicPath>, Integer> map = new HashMap<Set<BasicPath>, Integer>();

	private final Integer max;
	private final Integer[] cachedIntegerObjects;
	
	public MaxDuplicatesReducer(final int max) 
	{
		if(max<1)
			throw new IllegalArgumentException("Max must be postivie, not "+max);
		cachedIntegerObjects = new Integer[max];
		for(int i = 0;i<max;i++)
			cachedIntegerObjects[i] = i+1;
		this.max = cachedIntegerObjects[max-1];
	}
	
	@Override
	public boolean add(Trace o)
	{
		Integer i = map.get(o.coverage());
		if(i==max) 
		{
			super.collect(o, false);
			return false;
		}
		map.put(o.coverage(), cachedIntegerObjects[(i==null?0:i)]);
		super.collect(o, true);
		return true;
	}

	@Override
	public void clear()
	{
		map.clear();
		super.clear();
	}
		
	public int max() {
		return max;
	}

}