/**
 * Mutinack mutation detection program.
 * Copyright (C) 2014-2016 Olivier Cinquin
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as
 * published by the Free Software Foundation, version 3.
 * 
 * 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 Affero General Public License for more details.
 * 
 * You should have received a copy of the GNU Affero General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */

package uk.org.cinquin.mutinack.misc_util.collections;

import java.util.Set;
import java.util.stream.Collector;

import gnu.trove.set.hash.THashSet;

public class TroveSetCollector {
	public static<T> Collector<T, Set<T>, Set<T>> uniqueValueCollector() {
	    return Collector.of(
	            THashSet::new,
	            (set, e) -> set.add(e),
	            (set1, set2) -> { 
	            	set1.addAll(set2);
	            	return set1;
	            	},
	            set -> set
	    );
	}
}

@@ -82,18 +82,17 @@
 nquin%0A *
- 
 %0A
+
  * This 
@@ -276,25 +276,24 @@
 ersion 3.%0A *
- 
 %0A * This pro
@@ -535,17 +535,16 @@
 ails.%0A *
- 
 %0A * You 
@@ -992,16 +992,19 @@
 THashSet
+%3CT%3E
 ::new,%0A%09
@@ -1039,16 +1039,16 @@
 add(e),%0A
+
 %09       
@@ -1069,17 +1069,16 @@
 t2) -%3E %7B
- 
 %0A%09      

Add missing type.